com.fpinjava.common.List.zipWithPositionResult()方法的使用及代码示例

x33g5p2x  于2022-01-24 转载在 其他  
字(3.0k)|赞(0)|评价(0)|浏览(86)

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

List.zipWithPositionResult介绍

暂无

代码示例

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

public List<Tuple<A, Integer>> zipWithPosition() {
 return zipWithPositionResult().getOrElse(List.list());
}

代码示例来源: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<Tuple<Integer, Integer>> testList = list.zipWithPosition();
  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 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));
 }
}

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

System.out.println(toString(heap3));
List.list(1, 2, 2, 2, 6, 7, 5, 0, 5, 1).zipWithPositionResult().forEachOrThrow(points -> {
 Heap<Point> heap = points.foldLeft(Heap.empty(), h -> t -> h.insert(new Point(t._1, t._2)));
 List<Point> lp = List.unfold(heap, hp -> hp.head().flatMap(h -> hp.tail().map(t -> new Tuple<>(h, t))));

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

System.out.println(toString(heap3));
List.list(1, 2, 2, 2, 6, 7, 5, 0, 5, 1).zipWithPositionResult().forEachOrThrow(points -> {
 Heap<Point> heap = points.foldLeft(Heap.empty(), h -> t -> h.insert(new Point(t._1, t._2)));
 List<Point> lp = List.unfold(heap, hp -> hp.head().flatMap(h -> hp.tail().map(t -> new Tuple<>(h, t))));

相关文章