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

List.range介绍

暂无

代码示例

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

public static <A> List<A> fill(int n, Supplier<A> s) {
 return range(0, n).map(ignore -> s.get());
}

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

public static Tuple<List<Integer>, RNG> integers(RNG rng, int length) {
 Tuple<List<Tuple<Integer, RNG>>, RNG> result = List.range(0, length).foldLeft(new Tuple<>(List.list(), rng), tuple -> i -> {
  Tuple<Integer, RNG> t = integer(tuple._2);
  return new Tuple<>(tuple._1.cons(t), t._2);
 });
 List<Integer> list = result._1.map(x -> x._1);
 return new Tuple<>(list, result._2);
}

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

@Test
public void testInsertOrderedAscending7() {
 int limit = 7;
 List<Integer> list = List.range(1, limit + 1);
 Heap<Integer> heap = list.foldLeft(Heap.<Integer>empty(), h -> h::add);
 assertEquals(limit, heap.length());
}

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

@Test
public void testInsertOrderedAscending7() {
 int limit = 7;
 List<Integer> list = List.range(1, limit + 1);
 Heap<Integer> heap = list.foldLeft(Heap.<Integer>empty(), h -> h::add);
 assertEquals(limit, heap.length());
}

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

@Test
 public void testFold() {
  int limit = 50;
  List<Integer> list = List.range(1, limit + 1);
  List<String> expected = list.map(NumbersToEnglish.convertUS);
  Map<Integer, String> map = list.foldRight(Map.<Integer, String>empty(), i -> m -> m.add(i, NumbersToEnglish.convertUS.apply(i)));
  List<String> list2 = map.values();
  assertTrue(expected.equals(list2));
 }
}

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

public static Tuple<List<Integer>, RNG> integers2(RNG rng, int length) {
 List<Tuple<Integer, RNG>> result = List.range(0, length).foldLeft(List.list(), lst -> i -> lst.cons(integer(rng)));
 List<Integer> list = result.map(x -> x._1).reverse();
 Result<Tuple<List<Integer>, RNG>> result2 = result.headOption().map(tr -> new Tuple<>(list, tr._2));
 return result2.getOrElse(new Tuple<>(List.list(), rng));
}

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

@Test
 public void testFold2() {
  int limit = 50;
  List<Integer> list = List.range(1, limit + 1);
  List<String> expected = list.map(NumbersToEnglish.convertUS);
  Map<Integer, String> map = list.foldRight(Map.<Integer, String>empty(), i -> m -> m.add(i, NumbersToEnglish.convertUS.apply(i)));
  List<String> list2 = map.values();
  assertTrue(expected.equals(list2));
 }
}

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

@Test
public void testInsertOrderedAscending7() {
 int limit = 7;
 List<Integer> list = List.range(1, limit + 1);
 Heap<Number> heap = list.foldLeft(Heap.empty(comparator), h -> i -> h.add(number(i)));
 assertEquals(limit, heap.length());
}

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

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

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

@Test
public void testInsertOrderedAscending7() {
 int limit = 7;
 List<Integer> list = List.range(1, limit + 1);
 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 testInsertOrderedAscending7() {
 int limit = 7;
 List<Integer> list = List.range(1, limit + 1);
 Heap<Integer> heap = list.foldLeft(Heap.<Integer>empty(), h -> h::insert);
 assertEquals(limit, heap.length());
 assertTrue(isBalanced(heap));
 assertTrue(isValueOrdered(heap));
}

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

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

@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

@Test
public void testFold() {
 int limit = 50;
 List<Integer> list = List.range(1, limit + 1);
 List<String> expected = list.reverse().map(NumbersToEnglish.convertUS);
 Map<Integer, String> map = list.foldLeft(Map.<Integer, String>empty(), m -> i -> m.add(i, NumbersToEnglish.convertUS.apply(i)));
 Result<List<String>> rl = List.sequence(map.foldLeft(List.<Result<String>>list(), lst -> me -> lst.cons(me.value), l1 -> l2 -> List.concat(l1, l2)));
 assertTrue(rl.map(expected::equals).getOrElse(false));
}