Version 1.8.3

dart/runtime/vm/flow_graph_range_analysis_test.cc

 // Copyright (c) 2014, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 #include "vm/flow_graph_range_analysis.h"
 #include "vm/unit_test.h"
 
 namespace dart {
 
 
@@ skipping 513 matching lines @@
                  static_cast<int64_t>(0xffffffff),
                  static_cast<int64_t>(0xffffffff),
                  RangeBoundary(0),
                  RangeBoundary(static_cast<int64_t>(0xffffffff)));
 
   // Test that [-20, 20] & [-20, 20] = [Unknown, Unknown].
   TEST_RANGE_AND(static_cast<int64_t>(-20),
                  static_cast<int64_t>(20),
                  static_cast<int64_t>(-20),
                  static_cast<int64_t>(20),
-                 RangeBoundary(),
-                 RangeBoundary());
+                 RangeBoundary::MinConstant(RangeBoundary::kRangeBoundaryInt64),
+                 RangeBoundary::MaxConstant(
+                    RangeBoundary::kRangeBoundaryInt64));
 
 #undef TEST_RANGE_AND
 }
 
 
 TEST_CASE(RangeIntersectionMinMax) {
   // Test IntersectionMin and IntersectionMax methods which for constants are
   // simply defined as Max/Min respectively.
 
   // Constants.
@@ skipping 150 matching lines @@
       p_infinity,
       size).IsMaximumOrAbove(size));
 
   EXPECT(RangeBoundary::JoinMax(
       p_infinity,
       RangeBoundary::FromConstant(1),
       size).IsMaximumOrAbove(size));
 }
 
 }  // namespace dart