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

List.forAll介绍

暂无

代码示例

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

@Test
public void testMerge7() {
 Tree<Integer> mergedTree = orderedTree2.merge(randomTree1);
 assertTrue(List.concat(randomTestList1, orderedTestList2).forAll(mergedTree::member));
}

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

@Test
 public void testMerge8() {
  Tree<Integer> mergedTree = randomTree2.merge(orderedTree1);
  assertTrue(List.concat(randomTestList2, orderedTestList1).forAll(mergedTree::member));
 }
}

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

@Test
 public void testMerge8() {
  Tree<Integer> mergedTree = randomTree2.merge(orderedTree1);
  assertTrue(List.concat(randomTestList2, orderedTestList1).forAll(mergedTree::member));
 }
}

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

private static boolean arePathsOk(Tree<?> tree) {
 List<List<Tree.Color>> keepBlacks = tree.pathColors().map(list -> list.filter(Tree.Color::isB));
 int blackLength = keepBlacks.headOption().map(List::length).getOrElse(0);
 return tree.pathColors().forAll(TreeTest::isPathOk) && keepBlacks.forAll(lst -> lst.length() == blackLength);
}

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

@Test
public void testMerge3() {
 Tree<Integer> mergedTree = randomTree1.merge(randomTree2);
 assertTrue(List.concat(randomTestList1, randomTestList2).forAll(mergedTree::member));
}

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

@Test
public void testMerge5() {
 Tree<Integer> mergedTree = orderedTree1.merge(orderedTree2);
 assertTrue(List.concat(orderedTestList1, orderedTestList2).forAll(mergedTree::member));
}

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

@Test
public void testMerge6() {
 Tree<Integer> mergedTree = orderedTree2.merge(orderedTree1);
 assertTrue(List.concat(orderedTestList1, orderedTestList2).forAll(mergedTree::member));
}

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

@Test
 public void testFlatMap() {
  RNG rng = JavaRNG.rng(0);
  Tuple<List<Integer>, RNG> result = makeListOfNonMultipleOfFive(300).apply(rng);
  assertTrue(result._1.forAll(RandomTest::notMultipleOfFive));
 }
}

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

/**
 * No single value should be present in the map after removal;
 */
@Test
public void testRemoveOneOrdered() {
 assertTrue(orderedTestList.map(i -> orderedTree.delete(i).member(i)).forAll(x -> !x));
}

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

@Test
 public void testFlatMap() {
  RNG rng = JavaRNG.rng(0);
  Tuple<List<Integer>, RNG> result = makeListOfNonMultipleOfFive(300).apply(rng);
  assertTrue(result._1.forAll(RandomTest::notMultipleOfFive));
 }
}

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

/**
 * No single value should be present in the map after removal;
 */
@Test
public void testRemoveOneOrdered() {
 assertTrue(orderedTestList.map(i -> orderedTree.delete(i).member(i)).forAll(x -> !x));
}

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

@Test
public void testInsertRandom7() {
 List<Integer> list = List.list(2, 5, 7, 3, 6, 1, 4);
 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

/**
 * The longest path (to an empty node) should be no more than twice the shortest one (to an empty node too).
 * Note that compared to a "user path", which means not taking empty terminal node in account, it means that
 * maxPath + 1 <= (minPath + 1) * 2
 */
@Test
public void testPathLengthOrdered() {
 List<Integer> lengths = orderedTree.pathLengths();
 Result<List<Boolean>> rlb = List.minOption(lengths).map(min -> lengths.map(v -> v + 1 <= (min + 1) * 2));
 List<Boolean> lb = rlb.getOrElse(List.list());
 assertTrue(lb.forAll(x -> x));
}

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

@Test
public void testInsertOrderedAscending7() {
 int limit = 7;
 List<Integer> list = List.range(1, limit + 1);
 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

/**
 * The longest path (to an empty node) should be no more than twice the shortest one (to an empty node too).
 * Note that compared to a "user path", which means not taking empty terminal node in account, it means that
 * maxPath + 1 <= (minPath + 1) * 2
 */
@Test
public void testPathLengthRandom() {
 List<Integer> lengths = randomTree.pathLengths();
 Result<List<Boolean>> rlb = List.minOption(lengths).map(min -> lengths.map(v -> v + 1 <= (min + 1) * 2));
 List<Boolean> lb = rlb.getOrElse(List.list());
 assertTrue(lb.forAll(x -> x));
}

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

@Test
public void testInsertRandom7() {
 List<Integer> list = List.list(2, 5, 7, 3, 6, 1, 4);
 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));
}

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

@Test
public void testAdd() throws Exception {
 List<Integer> list = List.list(1, 2, 3, 4, 5, 6, 7);
 Heap<Integer> queue = list.foldLeft(Heap.<Integer>empty(), h -> h::add);
 list.zipWithPositionResult().forEachOrThrow(testList -> List.sequence(testList.map(t -> queue.get(t._2).map(v -> v.equals(t._1)))).map(lst -> lst.forAll(x -> x)).forEachOrThrow(Assert::assertTrue));
}

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

@Test
 public void testAdd2() throws Exception {
  List<Integer> list = List.list(7, 3, 1, 6, 4, 6, 2);
  Heap<Integer> queue = list.foldLeft(Heap.<Integer>empty(), h -> h::add);
  List.list(1, 2, 3, 4, 6, 6, 7).zipWithPositionResult().forEachOrThrow(testList -> List.sequence(testList.map(t -> queue.get(t._2).map(v -> v.equals(t._1)))).map(lst -> lst.forAll(x -> x)).forEachOrThrow(Assert::assertTrue));
 }
}

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

@Test
 public void testAdd2() throws Exception {
  List<Integer> list = List.list(7, 3, 1, 6, 4, 6, 2);
  Heap<Integer> queue = list.foldLeft(Heap.<Integer>empty(), h -> h::add);
//    List<Tuple<Integer, Integer>> testList = List.list(1, 2, 3, 4, 6, 6, 7).zipWithPosition();
  List.list(1, 2, 3, 4, 6, 6, 7).zipWithPositionResult().forEachOrThrow(testList -> List.sequence(testList.map(t -> queue.get(t._2).map(v -> v.equals(t._1)))).map(lst -> lst.forAll(x -> x)).forEachOrThrow(Assert::assertTrue));
 }
}