LibTest/collection/LinkedList/take_A01_t01.dart

/*
 * Copyright (c) 2011, 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.
 */
/**
 * @assertion Iterable<E> take(int n)
 * Returns an Iterable with at most n elements.
 * The returned Iterable may contain fewer than n elements, if this contains fewer than n elements.
 * It is an error if n is negative.
 * @description checks that an Iterable that contains the first n elements is returned.
 * @author kaigorodov
 */
import "dart:math" as Math;
import "dart:collection";
import "../../../Utils/expect.dart";
import "LinkedList.lib.dart";

check(List a0, int n) {
  LinkedList<MyLinkedListEntry<int>> a=toLinkedList(a0);
  Iterable<MyLinkedListEntry<int>> it=a.take(n);
  Expect.equals(Math.min(a.length, n), it.length);
  int k=0;
  for (MyLinkedListEntry<int> entry in it) {
    Expect.equals(a0[k], entry.value);
    k++;
  }      
}

main() {
  check([1,2,-3,4], 4);
  check([1,2,-3,4], 0);
  check([11,2,-3,4], 2);
  check([1,22,-3,4], 4);
  check(const[1,2,-5,-6, 100], 0);
  check(const[1, -1, 2,-5,-6], 1);
  check(const[0,0,1,2,-5,-6], 2);
  check(const[0,0,1,2,-5,-6], 6);
}