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

List.length介绍

暂无

代码示例

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

private Cons(A head, List<A> tail) {
 this.head = head;
 this.tail = tail;
 this.length = tail.length() + 1;
}

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

private List<List<A>> divide(List<List<A>> list, int depth) {
 return list.head().length() < depth || depth < 2
   ? list
   : divide(list.flatMap(x -> x.splitListAt(x.length() / 2)), depth / 2);
}

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

public Result<A> getAt(int index) {
 Tuple<Result<A>, Integer> identity = new Tuple<>(Result.failure("Index out of bound"), index);
 Tuple<Result<A>, Integer> rt = index < 0 || index >= length()
   ? identity
   : foldLeft(identity, ta -> a -> ta._2 < 0 ? ta : new Tuple<>(Result.success(a), ta._2 - 1));
 return rt._1;
}

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

public Tuple<List<A>, List<A>> splitAt_(int index) {
 int ii = index < 0 ? 0 : index >= length() ? length() : index;
 Tuple3<List<A>, List<A>, Integer> identity = new Tuple3<>(List.list(), List.list(), ii);
 Tuple3<List<A>, List<A>, Integer> rt = foldLeft(identity, ta -> a -> ta._3 == 0 ? new Tuple3<>(ta._1, ta._2.cons(a), ta._3) : new Tuple3<>(ta._1.cons(a), ta._2, ta._3 - 1));
 return new Tuple<>(rt._1.reverse(), rt._2.reverse());
}

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

@Test
public void testIntegersNegativeLength() {
 RNG rng = JavaRNG.rng(0);
 Tuple<List<Integer>, RNG> result = Generator.integers(rng, -3);
 assertEquals(0, result._1.length());
 Tuple<Integer, RNG> t = Generator.integer(result._2);
 assertEquals(Integer.valueOf(384748), t._1);
}

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

@Test
public void testIntegers3Length0() {
 RNG rng = JavaRNG.rng(0);
 Tuple<List<Integer>, RNG> result = Generator.integers3(rng, 0);
 assertEquals(0, result._1.length());
 Tuple<Integer, RNG> t = Generator.integer(result._2);
 assertEquals(Integer.valueOf(384748), t._1);
}

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

@Test
 public void testIntegersNegativeLength() {
  RNG rng = JavaRNG.rng(0);
  Tuple<List<Integer>, RNG> result = Generator.integers(rng, -3);
  assertEquals(0, result._1.length());
  Tuple<Integer, RNG> t = Generator.integer(result._2);
  assertEquals(Integer.valueOf(384748), t._1);
 }
}

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

@Test
public void testIntegersLength0() {
 RNG rng = JavaRNG.rng(0);
 Tuple<List<Integer>, RNG> result = Generator.integers(rng, 0);
 assertEquals(0, result._1.length());
 Tuple<Integer, RNG> t = Generator.integer(result._2);
 assertEquals(Integer.valueOf(384748), t._1);
}

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

@Test
public void testIntegers3NegativeLength() {
 RNG rng = JavaRNG.rng(0);
 Tuple<List<Integer>, RNG> result = Generator.integers3(rng, -3);
 assertEquals(0, result._1.length());
 Tuple<Integer, RNG> t = Generator.integer(result._2);
 assertEquals(Integer.valueOf(384748), t._1);
}

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

/**
 * Test whether the test data is correct
 */
@Test
public void testAddOrdered() {
 assertEquals(orderedTestList.length(), orderedTree.size());
 assertTrue(arePathsOk(orderedTree));
}

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

private static List<Expr> exprs(List<Integer> list) {
 return list.isEmpty()
   ? List.list()
   : list.length() == 1
     ? List.list(new Expr.Simple(list.headOption().getOrElse(-1))) // default value will never be used
     : split(list).flatMap(t -> exprs(t._1).flatMap(l -> exprs(t._2).flatMap(r -> combine(l, r))));
}

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

private static List<Expr> exprs(List<Integer> list) {
 return list.isEmpty()
   ? List.list()
   : list.length() == 1
     ? List.list(new Expr.Simple(list.headOption().getOrElse(-1))) // default value will never be used
     : split(list).flatMap(t -> exprs(t._1).flatMap(l -> exprs(t._2).flatMap(r -> combine(l, r))));
}

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

private static List<Solution> results(List<Integer> ns) {
 return ns.isEmpty()
   ? List.list()
   : ns.length() == 1
     ? ns.flatMap(n -> n > 0 ? List.list(new Solution(Expr.expr(n), n)) : List.list())
     : split(ns).flatMap(t1 -> results(t1._1).flatMap(lx -> results(t1._2).flatMap(ry -> combine(lx, ry))));
}

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

private static List<Solution> results_(List<Integer> ns) {
 return ns.isEmpty()
   ? List.list()
   : ns.length() == 1
     ? ns.flatMap(n -> n > 0 ? List.list(new Solution(Expr.expr(n), n)) : List.list())
     : split(ns).flatMap(t1 -> results_(t1._1).flatMap(lx -> results(t1._2).flatMap(ry -> combine_(lx, ry))));
}

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

private static List<Solution> results(List<Integer> ns) {
 return ns.isEmpty()
   ? List.list()
   : ns.length() == 1
     ? ns.flatMap(n -> n > 0 ? List.list(new Solution(Expr.expr(n), n)) : List.list())
     : split(ns).flatMap(t1 -> results(t1._1).flatMap(lx -> results(t1._2).flatMap(ry -> combine(lx, ry))));
}

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

/**
 * Test whether the test data is correct
 */
@Test
public void testAddOrdered() {
 assertEquals(orderedTestList.length(), orderedHeap.length());
 assertTrue(isBalanced(orderedHeap));
 assertTrue(isValueOrdered(orderedHeap));
}

代码示例来源：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

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 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 testInsertRandom10() {
 List<Integer> list = List.list(2, 5, 2, 7, 3, 1, 6, 1, 4, 1);
 Heap<Integer> heap = list.foldLeft(Heap.<Integer>empty(), h -> h::insert);
 assertEquals(list.length(), heap.length());
 assertTrue(isBalanced(heap));
 assertTrue(isValueOrdered(heap));
}