INNER CODE UNIT · Dart

result

hackware1993/Flutter_ConstraintLayout · lib/src/core.dart:2485

          result = left.index - right.index;
        }
        return result;
      });

      // Most of the time, it is basically ordered, and the complexity is O(n)
      eventOrderList = nodesMap.values.toList();
      insertionSort<ConstrainedNode>(eventOrderList, (left, right) {
        int result = left.eIndex - right.eIndex;
        if (result == 0) {
          result = left.index - right.index;
        }
        return result;
      });

      assert(() {
        /// Print constraints
        if (_debugPrintConstraints) {

View source record →