本文整理了Java中com.fpinjava.common.List.iterate()方法的一些代码示例，展示了List.iterate()的具体用法。这些代码示例主要来源于Github/Stackoverflow/Maven等平台，是从一些精选项目中提取出来的代码，具有较强的参考意义，能在一定程度帮忙到你。List.iterate()方法的具体详情如下：
包路径：com.fpinjava.common.List
类名称：List
方法名：iterate

List.iterate介绍

暂无

代码示例

代码示例来源：origin: fpinjava/fpinjava

public Result<List<Tuple<A, Integer>>> zipWithPositionResult() {
 return zip(iterate(0, x -> x + 1, length()));
}

代码示例来源：origin: fpinjava/fpinjava

@Test
public void testInsertOrderedDescending7() {
 int limit = 7;
 List<Integer> list = List.iterate(limit, x -> x - 1, limit);
 Heap<Integer> heap = list.foldLeft(Heap.<Integer>empty(), h -> h::add);
 assertEquals(limit, heap.length());
 assertTrue(isBalanced(heap));
 assertTrue(isValueOrdered(heap));
}

代码示例来源：origin: fpinjava/fpinjava

@Test
public void testInsertOrderedDescending7() {
 int limit = 7;
 List<Integer> list = List.iterate(limit, x -> x - 1, limit);
 Tree<Integer> tree = list.foldLeft(Tree.<Integer>empty(), t -> t::insert);
 assertEquals(limit, tree.size());
 assertTrue(tree.height() <= 2 * log2nlz(tree.size() + 1));
}

代码示例来源：origin: fpinjava/fpinjava

@Test
public void testInsertOrderedDescending7() {
 int limit = 7;
 List<Integer> list = List.iterate(limit, x -> x - 1, limit);
 Tree<Integer> tree = list.foldLeft(Tree.<Integer>empty(), t -> t::insert);
 assertEquals(limit, tree.size());
 assertTrue(tree.height() <= 2 * Tree.log2nlz(tree.size() + 1));
}

代码示例来源：origin: fpinjava/fpinjava

@Test
public void testInsertOrderedDescending7() {
 int limit = 7;
 List<Integer> list = List.iterate(limit, x -> x - 1, limit);
 Tree<Integer> tree = list.foldLeft(Tree.<Integer>empty(), t -> t::insert);
 assertEquals(limit, tree.size());
 assertTrue(tree.height() <= 2 * log2nlz(tree.size() + 1));
}

代码示例来源：origin: fpinjava/fpinjava

@Test
public void testInsertOrderedDescending7() {
 int limit = 7;
 List<Integer> list = List.iterate(limit, x -> x - 1, limit);
 Heap<Integer> heap = list.foldLeft(Heap.<Integer>empty(), h -> h::add);
 assertEquals(limit, heap.length());
 assertTrue(isBalanced(heap));
 assertTrue(isValueOrdered(heap));
}

代码示例来源：origin: fpinjava/fpinjava

@Test
public void testInsertOrderedDescending7() {
 int limit = 7;
 List<Integer> list = List.iterate(limit, x -> x - 1, limit);
 Tree<Integer> tree = list.foldLeft(Tree.<Integer>empty(), t -> t::insert);
 assertEquals(limit, tree.size());
 assertTrue(tree.height() <= 2 * Tree.log2nlz(tree.size() + 1));
}

代码示例来源：origin: fpinjava/fpinjava

@Test
public void testInsertOrderedDescending7() {
 int limit = 7;
 List<Integer> list = List.iterate(limit, x -> x - 1, limit);
 Heap<Integer> heap = list.foldLeft(Heap.<Integer>empty(), h -> h::insert);
 assertEquals(list.length(), heap.length());
 assertTrue(isBalanced(heap));
 assertTrue(isValueOrdered(heap));
}

代码示例来源：origin: fpinjava/fpinjava

@Test
public void testInsertOrderedDescending7() {
 int limit = 7;
 List<Integer> list = List.iterate(limit, x -> x - 1, limit);
 Heap<Integer> heap = list.foldLeft(Heap.<Integer>empty(), h -> h::insert);
 assertEquals(list.length(), heap.length());
 assertTrue(isBalanced(heap));
 assertTrue(isValueOrdered(heap));
}

代码示例来源：origin: fpinjava/fpinjava

@Test
public void testInsertOrderedDescending7() {
 int limit = 7;
 List<Integer> list = List.iterate(limit, x -> x - 1, limit);
 Heap<Number> heap = list.foldLeft(Heap.empty(comparator), h -> i -> h.add(number(i)));
 assertEquals(limit, heap.length());
 assertTrue(isBalanced(heap));
 assertTrue(isValueOrdered(heap, comparator));
}

代码示例来源：origin: fpinjava/fpinjava

@Test
public void testInsertOrderedDescending7() {
 int limit = 7;
 List<Integer> list = List.iterate(limit, x -> x - 1, limit);
 Map<Integer, String> map = list.foldLeft(Map.<Integer, String>empty(), m -> i -> m.add(i, NumbersToEnglish.convertUS.apply(i)));
 assertTrue(list.forAll(map::contains));
 assertTrue(List.sequence(list.map(i -> map.get(i).flatMap(x -> x.value).map(y -> y.equals(NumbersToEnglish.convertUS.apply(i))))).map(z -> z.forAll(w -> w)).getOrElse(false));
}

代码示例来源：origin: fpinjava/fpinjava

@Test
public void testInsertOrderedDescending7() {
 int limit = 7;
 List<Integer> list = List.iterate(limit, x -> x - 1, limit);
 Map<Number, String> map = list.foldLeft(Map.<Number, String>empty(), m -> i -> m.add(number(i), NumbersToEnglish.convertUS.apply(i)));
 assertTrue(list.forAll(i -> map.contains(number(i))));
 assertTrue(List.sequence(list.map(i -> map.get(number(i)).map(x -> x._2).map(y -> y.equals(NumbersToEnglish.convertUS.apply(i))))).map(z -> z.forAll(w -> w)).getOrElse(false));
}

代码示例来源：origin: fpinjava/fpinjava

@Test
public void testInsertOrderedDescending7() {
 int limit = 7;
 List<Integer> list = List.iterate(limit, x -> x - 1, limit);
 Map<Number, String> map = list.foldLeft(Map.<Number, String>empty(), m -> i -> m.add(number(i), NumbersToEnglish.convertUS.apply(i)));
 assertTrue(list.forAll(i -> map.contains(number(i))));
 assertTrue(List.sequence(list.map(i -> map.get(number(i)).map(x -> x._2).map(y -> y.equals(NumbersToEnglish.convertUS.apply(i))))).map(z -> z.forAll(w -> w)).getOrElse(false));
}