| OLD | NEW |
| 1 // Copyright (c) 2015, the Dart project authors. Please see the AUTHORS file | 1 // Copyright (c) 2015, the Dart project authors. Please see the AUTHORS file |
| 2 // for details. All rights reserved. Use of this source code is governed by a | 2 // for details. All rights reserved. Use of this source code is governed by a |
| 3 // BSD-style license that can be found in the LICENSE file. | 3 // BSD-style license that can be found in the LICENSE file. |
| 4 // | 4 // |
| 5 // This file has been automatically generated. Please do not edit it manually. | 5 // This file has been automatically generated. Please do not edit it manually. |
| 6 // To regenerate the file, use the script "pkg/analyzer/tool/generate_files". | 6 // To regenerate the file, use the script "pkg/analyzer/tool/generate_files". |
| 7 | 7 |
| 8 library analyzer.src.summary.format; | 8 library analyzer.src.summary.format; |
| 9 | 9 |
| 10 import 'base.dart' as base; | 10 import 'base.dart' as base; |
| (...skipping 205 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 216 | 216 |
| 217 /** | 217 /** |
| 218 * Pop the top 2 values from the stack, pass them to the predefined Dart | 218 * Pop the top 2 values from the stack, pass them to the predefined Dart |
| 219 * function `identical`, and push the result back onto the stack. | 219 * function `identical`, and push the result back onto the stack. |
| 220 */ | 220 */ |
| 221 identical, | 221 identical, |
| 222 | 222 |
| 223 /** | 223 /** |
| 224 * Pop the top 2 values from the stack, evaluate `v1 == v2`, and push the | 224 * Pop the top 2 values from the stack, evaluate `v1 == v2`, and push the |
| 225 * result back onto the stack. | 225 * result back onto the stack. |
| 226 * | |
| 227 * This is also used to represent `v1 != v2`, by composition with [not]. | |
| 228 */ | 226 */ |
| 229 equal, | 227 equal, |
| 230 | 228 |
| 231 /** | 229 /** |
| 230 * Pop the top 2 values from the stack, evaluate `v1 != v2`, and push the |
| 231 * result back onto the stack. |
| 232 */ |
| 233 notEqual, |
| 234 |
| 235 /** |
| 232 * Pop the top value from the stack, compute its boolean negation, and push | 236 * Pop the top value from the stack, compute its boolean negation, and push |
| 233 * the result back onto the stack. | 237 * the result back onto the stack. |
| 234 */ | 238 */ |
| 235 not, | 239 not, |
| 236 | 240 |
| 237 /** | 241 /** |
| 238 * Pop the top 2 values from the stack, compute `v1 && v2`, and push the | 242 * Pop the top 2 values from the stack, compute `v1 && v2`, and push the |
| 239 * result back onto the stack. | 243 * result back onto the stack. |
| 240 */ | 244 */ |
| 241 and, | 245 and, |
| (...skipping 5857 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 6099 "type": type, | 6103 "type": type, |
| 6100 "constExpr": constExpr, | 6104 "constExpr": constExpr, |
| 6101 "isStatic": isStatic, | 6105 "isStatic": isStatic, |
| 6102 "isFinal": isFinal, | 6106 "isFinal": isFinal, |
| 6103 "isConst": isConst, | 6107 "isConst": isConst, |
| 6104 "propagatedTypeSlot": propagatedTypeSlot, | 6108 "propagatedTypeSlot": propagatedTypeSlot, |
| 6105 "inferredTypeSlot": inferredTypeSlot, | 6109 "inferredTypeSlot": inferredTypeSlot, |
| 6106 }; | 6110 }; |
| 6107 } | 6111 } |
| 6108 | 6112 |
| OLD | NEW |