Chromium Code Reviews| OLD | NEW |
|---|---|
| 1 <!-- | 1 <!-- |
| 2 Copyright 2014 The Chromium Authors. All rights reserved. | 2 Copyright 2014 The Chromium Authors. All rights reserved. |
| 3 Use of this source code is governed by a BSD-style license that can be | 3 Use of this source code is governed by a BSD-style license that can be |
| 4 found in the LICENSE file. | 4 found in the LICENSE file. |
| 5 --> | 5 --> |
| 6 <link href="../model/ct-builder-revisions.html" rel="import"> | 6 <link href="../model/ct-builder-revisions.html" rel="import"> |
| 7 | 7 |
| 8 <link rel="import" href="../lib/net.html"> | 8 <link rel="import" href="../lib/net.html"> |
| 9 <link rel="import" href="../model/ct-failure.html"> | 9 <link rel="import" href="../model/ct-failure.html"> |
| 10 <link rel="import" href="../model/ct-failure-group.html"> | 10 <link rel="import" href="../model/ct-failure-group.html"> |
| (...skipping 49 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 60 var keys = Object.keys(rev_a).sort(); | 60 var keys = Object.keys(rev_a).sort(); |
| 61 for (var i = 0; i < keys.length; i++) { | 61 for (var i = 0; i < keys.length; i++) { |
| 62 if (rev_a[keys[i]] != rev_b[keys[i]]) | 62 if (rev_a[keys[i]] != rev_b[keys[i]]) |
| 63 return rev_b[keys[i]] - rev_a[keys[i]]; | 63 return rev_b[keys[i]] - rev_a[keys[i]]; |
| 64 } | 64 } |
| 65 return 0; | 65 return 0; |
| 66 }, | 66 }, |
| 67 | 67 |
| 68 update: function() { | 68 update: function() { |
| 69 var annotationPromise = CTFailureGroup.fetchAnnotations(); | 69 var annotationPromise = CTFailureGroup.fetchAnnotations(); |
| 70 # FIXME: Change this to http://sheriff-o-matic.appspot.com/alerts | 70 // FIXME: Change this to http://sheriff-o-matic.appspot.com/alerts |
|
ojan
2014/08/14 01:26:48
This was already fixed.
| |
| 71 # when Sheriff-o-matic is redeployed to serve /alerts. | 71 // when Sheriff-o-matic is redeployed to serve /alerts. |
| 72 net.json('http://auto-sheriff.appspot.com/data').then(function(data) { | 72 net.json('http://auto-sheriff.appspot.com/data').then(function(data) { |
| 73 annotationPromise.then(function(annotations) { | 73 annotationPromise.then(function(annotations) { |
| 74 // FIXME: Don't special-case the blink master. | 74 // FIXME: Don't special-case the blink master. |
| 75 this.builderLatestRevisions = new CTBuilderRevisions(data.latest_rev isions['chromium.webkit']); | 75 this.builderLatestRevisions = new CTBuilderRevisions(data.latest_rev isions['chromium.webkit']); |
| 76 this.failures = {}; | 76 this.failures = {}; |
| 77 this.lastUpdateDate = new Date(data.date * 1000); | 77 this.lastUpdateDate = new Date(data.date * 1000); |
| 78 data.range_groups.forEach(function(group) { | 78 data.range_groups.forEach(function(group) { |
| 79 this._processFailuresForGroup(group, data.alerts, annotations); | 79 this._processFailuresForGroup(group, data.alerts, annotations); |
| 80 }.bind(this)); | 80 }.bind(this)); |
| 81 Object.keys(this.failures, function (tree, failuresByTree) { | 81 Object.keys(this.failures, function (tree, failuresByTree) { |
| (...skipping 78 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 160 if (!this.failures[tree]) | 160 if (!this.failures[tree]) |
| 161 this.failures[tree] = []; | 161 this.failures[tree] = []; |
| 162 // FIXME: Need a better identifier for a failure group; | 162 // FIXME: Need a better identifier for a failure group; |
| 163 var key = group.sort_key; | 163 var key = group.sort_key; |
| 164 this.failures[tree].push(new CTFailureGroup(key, failures, annotations [key])); | 164 this.failures[tree].push(new CTFailureGroup(key, failures, annotations [key])); |
| 165 }.bind(this)); | 165 }.bind(this)); |
| 166 }, | 166 }, |
| 167 }); | 167 }); |
| 168 </script> | 168 </script> |
| 169 </polymer-element> | 169 </polymer-element> |
| OLD | NEW |