GeezerVison is showing github.com — Make use of type inference · functionaljava/functionaljava@4b053ca
File treeExpand file treeCollapse file tree Open diff view settings demo/src/main/java/fj/demo quickcheck/src/main/java/fj/test
Some content is hiddenLarge Commits have some content hidden by default. Use the searchbox below for content that may be hidden. Expand file treeCollapse file tree Open diff view settings Collapse file Copy file name to clipboardExpand all lines: core/src/main/java/fj/Class.java +2-2Lines changed: 2 additions & 2 deletions | Original file line number | Diff line number | Diff line change |
|---|
@@ -101,7 +101,7 @@ public static Tree<Type> typeParameterTree(final Type t) { | 101 | 101 | } | 102 | 102 | types = Tree.node(pt.getRawType(), typeArgs); | 103 | 103 | } else { | 104 | | - types = Tree.node(t, List.<Tree<Type>>nil()); | | 104 | + types = Tree.node(t, List.nil()); | 105 | 105 | } | 106 | 106 | return types; | 107 | 107 | } | @@ -122,6 +122,6 @@ public java.lang.Class<T> clas() { | 122 | 122 | * @return A class from the given argument. | 123 | 123 | */ | 124 | 124 | public static <T> Class<T> clas(final java.lang.Class<T> c) { | 125 | | - return new Class<T>(c); | | 125 | + return new Class<>(c); | 126 | 126 | } | 127 | 127 | } |
Collapse file Copy file name to clipboardExpand all lines: core/src/main/java/fj/Equal.java +12-12Lines changed: 12 additions & 12 deletions | Original file line number | Diff line number | Diff line change |
|---|
@@ -75,7 +75,7 @@ public F<A, Boolean> eq(final A a) { | 75 | 75 | * @return A new equal. | 76 | 76 | */ | 77 | 77 | public <B> Equal<B> contramap(final F<B, A> f) { | 78 | | - return equal(F1Functions.o(F1Functions.o(F1Functions.<B, A, Boolean>andThen(f), this.f), f)); | | 78 | + return equal(F1Functions.o(F1Functions.o(F1Functions.andThen(f), this.f), f)); | 79 | 79 | } | 80 | 80 |
| 81 | 81 | /** | @@ -85,7 +85,7 @@ public <B> Equal<B> contramap(final F<B, A> f) { | 85 | 85 | * @return An equal instance from the given function. | 86 | 86 | */ | 87 | 87 | public static <A> Equal<A> equal(final F<A, F<A, Boolean>> f) { | 88 | | - return new Equal<A>(f); | | 88 | + return new Equal<>(f); | 89 | 89 | } | 90 | 90 |
| 91 | 91 | /** | @@ -202,7 +202,7 @@ public static <A, B> Equal<Either<A, B>> eitherEqual(final Equal<A> ea, final Eq | 202 | 202 | * @return An equal instance for the {@link Validation} type. | 203 | 203 | */ | 204 | 204 | public static <A, B> Equal<Validation<A, B>> validationEqual(final Equal<A> ea, final Equal<B> eb) { | 205 | | - return eitherEqual(ea, eb).contramap(Validation.<A, B>either()); | | 205 | + return eitherEqual(ea, eb).contramap(Validation.either()); | 206 | 206 | } | 207 | 207 |
| 208 | 208 | /** | @@ -235,7 +235,7 @@ public static <A> Equal<List<A>> listEqual(final Equal<A> ea) { | 235 | 235 | * @return An equal instance for the {@link NonEmptyList} type. | 236 | 236 | */ | 237 | 237 | public static <A> Equal<NonEmptyList<A>> nonEmptyListEqual(final Equal<A> ea) { | 238 | | - return listEqual(ea).contramap(NonEmptyList.<A>toList_()); | | 238 | + return listEqual(ea).contramap(NonEmptyList.toList_()); | 239 | 239 | } | 240 | 240 |
| 241 | 241 | /** | @@ -302,7 +302,7 @@ public static <A> Equal<Array<A>> arrayEqual(final Equal<A> ea) { | 302 | 302 | * @return An equal instance for the {@link Tree} type. | 303 | 303 | */ | 304 | 304 | public static <A> Equal<Tree<A>> treeEqual(final Equal<A> ea) { | 305 | | - return Equal.<Tree<A>>equal(curry((t1, t2) -> ea.eq(t1.root(), t2.root()) && p1Equal(streamEqual(Equal.<A>treeEqual(ea))).eq(t2.subForest(), t1.subForest()))); | | 305 | + return Equal.equal(curry((t1, t2) -> ea.eq(t1.root(), t2.root()) && p1Equal(streamEqual(Equal.treeEqual(ea))).eq(t2.subForest(), t1.subForest()))); | 306 | 306 | } | 307 | 307 |
| 308 | 308 | /** | @@ -443,7 +443,7 @@ public static <A, B, C, D, E> Equal<P5<A, B, C, D, E>> p5Equal(final Equal<A> ea | 443 | 443 | * @return An equal instance for a vector-2. | 444 | 444 | */ | 445 | 445 | public static <A> Equal<V2<A>> v2Equal(final Equal<A> ea) { | 446 | | - return streamEqual(ea).contramap(V2.<A>toStream_()); | | 446 | + return streamEqual(ea).contramap(V2.toStream_()); | 447 | 447 | } | 448 | 448 |
| 449 | 449 | /** | @@ -453,7 +453,7 @@ public static <A> Equal<V2<A>> v2Equal(final Equal<A> ea) { | 453 | 453 | * @return An equal instance for a vector-3. | 454 | 454 | */ | 455 | 455 | public static <A> Equal<V3<A>> v3Equal(final Equal<A> ea) { | 456 | | - return streamEqual(ea).contramap(V3.<A>toStream_()); | | 456 | + return streamEqual(ea).contramap(V3.toStream_()); | 457 | 457 | } | 458 | 458 |
| 459 | 459 | /** | @@ -463,7 +463,7 @@ public static <A> Equal<V3<A>> v3Equal(final Equal<A> ea) { | 463 | 463 | * @return An equal instance for a vector-4. | 464 | 464 | */ | 465 | 465 | public static <A> Equal<V4<A>> v4Equal(final Equal<A> ea) { | 466 | | - return streamEqual(ea).contramap(V4.<A>toStream_()); | | 466 | + return streamEqual(ea).contramap(V4.toStream_()); | 467 | 467 | } | 468 | 468 |
| 469 | 469 | /** | @@ -473,7 +473,7 @@ public static <A> Equal<V4<A>> v4Equal(final Equal<A> ea) { | 473 | 473 | * @return An equal instance for a vector-5. | 474 | 474 | */ | 475 | 475 | public static <A> Equal<V5<A>> v5Equal(final Equal<A> ea) { | 476 | | - return streamEqual(ea).contramap(V5.<A>toStream_()); | | 476 | + return streamEqual(ea).contramap(V5.toStream_()); | 477 | 477 | } | 478 | 478 |
| 479 | 479 | /** | @@ -483,7 +483,7 @@ public static <A> Equal<V5<A>> v5Equal(final Equal<A> ea) { | 483 | 483 | * @return An equal instance for a vector-6. | 484 | 484 | */ | 485 | 485 | public static <A> Equal<V6<A>> v6Equal(final Equal<A> ea) { | 486 | | - return streamEqual(ea).contramap(V6.<A>toStream_()); | | 486 | + return streamEqual(ea).contramap(V6.toStream_()); | 487 | 487 | } | 488 | 488 |
| 489 | 489 | /** | @@ -493,7 +493,7 @@ public static <A> Equal<V6<A>> v6Equal(final Equal<A> ea) { | 493 | 493 | * @return An equal instance for a vector-7. | 494 | 494 | */ | 495 | 495 | public static <A> Equal<V7<A>> v7Equal(final Equal<A> ea) { | 496 | | - return streamEqual(ea).contramap(V7.<A>toStream_()); | | 496 | + return streamEqual(ea).contramap(V7.toStream_()); | 497 | 497 | } | 498 | 498 |
| 499 | 499 | /** | @@ -503,7 +503,7 @@ public static <A> Equal<V7<A>> v7Equal(final Equal<A> ea) { | 503 | 503 | * @return An equal instance for a vector-8. | 504 | 504 | */ | 505 | 505 | public static <A> Equal<V8<A>> v8Equal(final Equal<A> ea) { | 506 | | - return streamEqual(ea).contramap(V8.<A>toStream_()); | | 506 | + return streamEqual(ea).contramap(V8.toStream_()); | 507 | 507 | } | 508 | 508 |
| 509 | 509 | /** | |
Collapse file Copy file name to clipboardExpand all lines: core/src/main/java/fj/F1Functions.java +16-16Lines changed: 16 additions & 16 deletions | Original file line number | Diff line number | Diff line change |
|---|
@@ -261,7 +261,7 @@ public static <A, B> F<Promise<A>, Promise<B>> mapPromise(final F<A, B> f) { | 261 | 261 | */ | 262 | 262 | @SuppressWarnings("unchecked") | 263 | 263 | public static <A, B, C> F<A, Either<B, C>> eitherLeftK(final F<A, B> f) { | 264 | | - return o(Either.<B, C>left_(), f); | | 264 | + return o(Either.left_(), f); | 265 | 265 | } | 266 | 266 |
| 267 | 267 | /** | @@ -272,7 +272,7 @@ public static <A, B, C> F<A, Either<B, C>> eitherLeftK(final F<A, B> f) { | 272 | 272 | */ | 273 | 273 | @SuppressWarnings("unchecked") | 274 | 274 | public static <A, B, C> F<A, Either<C, B>> eitherRightK(final F<A, B> f) { | 275 | | - return o(Either.<C, B>right_(), f); | | 275 | + return o(Either.right_(), f); | 276 | 276 | } | 277 | 277 |
| 278 | 278 | /** | @@ -330,7 +330,7 @@ public static <A, B> F<A, IterableW<B>> iterableK(final F<A, B> f) { | 330 | 330 | */ | 331 | 331 | @SuppressWarnings("unchecked") | 332 | 332 | public static <A, B> F<Iterable<A>, IterableW<B>> mapIterable(final F<A, B> f) { | 333 | | - return o(IterableW.<A, B>map().f(f), IterableW.<A, Iterable<A>>wrap()); | | 333 | + return o(IterableW.<A, B>map().f(f), IterableW.wrap()); | 334 | 334 | } | 335 | 335 |
| 336 | 336 | /** | @@ -340,7 +340,7 @@ public static <A, B> F<Iterable<A>, IterableW<B>> mapIterable(final F<A, B> f) { | 340 | 340 | */ | 341 | 341 | @SuppressWarnings("unchecked") | 342 | 342 | public static <A, B> F<A, NonEmptyList<B>> nelK(final F<A, B> f) { | 343 | | - return o(NonEmptyList.<B>nel(), f); | | 343 | + return o(NonEmptyList.nel(), f); | 344 | 344 | } | 345 | 345 |
| 346 | 346 | /** | @@ -408,7 +408,7 @@ public static <A, B> F<Tree<A>, B> foldMapTree(final F<A, B> f, final Monoid<B> | 408 | 408 | * @return This function promoted to return its value in a TreeZipper. | 409 | 409 | */ | 410 | 410 | public static <A, B> F<A, TreeZipper<B>> treeZipperK(final F<A, B> f) { | 411 | | - return andThen(treeK(f), TreeZipper.<B>fromTree()); | | 411 | + return andThen(treeK(f), TreeZipper.fromTree()); | 412 | 412 | } | 413 | 413 |
| 414 | 414 | /** | @@ -560,7 +560,7 @@ public static <A, B> F<P2<A, A>, P2<B, B>> mapBoth(final F<A, B> f) { | 560 | 560 | * @return A new SynchronousQueue with this function applied to each element. | 561 | 561 | */ | 562 | 562 | public static <A, B> SynchronousQueue<B> mapJ(final F<A, B> f, final SynchronousQueue<A> as) { | 563 | | - final SynchronousQueue<B> bs = new SynchronousQueue<B>(); | | 563 | + final SynchronousQueue<B> bs = new SynchronousQueue<>(); | 564 | 564 | bs.addAll(iterableStream(as).map(f).toCollection()); | 565 | 565 | return bs; | 566 | 566 | } | @@ -573,7 +573,7 @@ public static <A, B> SynchronousQueue<B> mapJ(final F<A, B> f, final Synchronous | 573 | 573 | * @return A new PriorityBlockingQueue with this function applied to each element. | 574 | 574 | */ | 575 | 575 | public static <A, B> PriorityBlockingQueue<B> mapJ(final F<A, B> f, final PriorityBlockingQueue<A> as) { | 576 | | - return new PriorityBlockingQueue<B>(iterableStream(as).map(f).toCollection()); | | 576 | + return new PriorityBlockingQueue<>(iterableStream(as).map(f).toCollection()); | 577 | 577 | } | 578 | 578 |
| 579 | 579 | /** | @@ -583,7 +583,7 @@ public static <A, B> PriorityBlockingQueue<B> mapJ(final F<A, B> f, final Priori | 583 | 583 | * @return A new LinkedBlockingQueue with this function applied to each element. | 584 | 584 | */ | 585 | 585 | public static <A, B> LinkedBlockingQueue<B> mapJ(final F<A, B> f, final LinkedBlockingQueue<A> as) { | 586 | | - return new LinkedBlockingQueue<B>(iterableStream(as).map(f).toCollection()); | | 586 | + return new LinkedBlockingQueue<>(iterableStream(as).map(f).toCollection()); | 587 | 587 | } | 588 | 588 |
| 589 | 589 | /** | @@ -593,7 +593,7 @@ public static <A, B> LinkedBlockingQueue<B> mapJ(final F<A, B> f, final LinkedBl | 593 | 593 | * @return A new CopyOnWriteArraySet with this function applied to each element. | 594 | 594 | */ | 595 | 595 | public static <A, B> CopyOnWriteArraySet<B> mapJ(final F<A, B> f, final CopyOnWriteArraySet<A> as) { | 596 | | - return new CopyOnWriteArraySet<B>(iterableStream(as).map(f).toCollection()); | | 596 | + return new CopyOnWriteArraySet<>(iterableStream(as).map(f).toCollection()); | 597 | 597 | } | 598 | 598 |
| 599 | 599 | /** | @@ -603,7 +603,7 @@ public static <A, B> CopyOnWriteArraySet<B> mapJ(final F<A, B> f, final CopyOnWr | 603 | 603 | * @return A new CopyOnWriteArrayList with this function applied to each element. | 604 | 604 | */ | 605 | 605 | public static <A, B> CopyOnWriteArrayList<B> mapJ(final F<A, B> f, final CopyOnWriteArrayList<A> as) { | 606 | | - return new CopyOnWriteArrayList<B>(iterableStream(as).map(f).toCollection()); | | 606 | + return new CopyOnWriteArrayList<>(iterableStream(as).map(f).toCollection()); | 607 | 607 | } | 608 | 608 |
| 609 | 609 | /** | @@ -613,7 +613,7 @@ public static <A, B> CopyOnWriteArrayList<B> mapJ(final F<A, B> f, final CopyOnW | 613 | 613 | * @return A new ConcurrentLinkedQueue with this function applied to each element. | 614 | 614 | */ | 615 | 615 | public static <A, B> ConcurrentLinkedQueue<B> mapJ(final F<A, B> f, final ConcurrentLinkedQueue<A> as) { | 616 | | - return new ConcurrentLinkedQueue<B>(iterableStream(as).map(f).toCollection()); | | 616 | + return new ConcurrentLinkedQueue<>(iterableStream(as).map(f).toCollection()); | 617 | 617 | } | 618 | 618 |
| 619 | 619 | /** | @@ -623,7 +623,7 @@ public static <A, B> ConcurrentLinkedQueue<B> mapJ(final F<A, B> f, final Concur | 623 | 623 | * @return A new ArrayBlockingQueue with this function applied to each element. | 624 | 624 | */ | 625 | 625 | public static <A, B> ArrayBlockingQueue<B> mapJ(final F<A, B> f, final ArrayBlockingQueue<A> as) { | 626 | | - final ArrayBlockingQueue<B> bs = new ArrayBlockingQueue<B>(as.size()); | | 626 | + final ArrayBlockingQueue<B> bs = new ArrayBlockingQueue<>(as.size()); | 627 | 627 | bs.addAll(iterableStream(as).map(f).toCollection()); | 628 | 628 | return bs; | 629 | 629 | } | @@ -636,7 +636,7 @@ public static <A, B> ArrayBlockingQueue<B> mapJ(final F<A, B> f, final ArrayBloc | 636 | 636 | * @return A new TreeSet with this function applied to each element. | 637 | 637 | */ | 638 | 638 | public static <A, B> TreeSet<B> mapJ(final F<A, B> f, final TreeSet<A> as) { | 639 | | - return new TreeSet<B>(iterableStream(as).map(f).toCollection()); | | 639 | + return new TreeSet<>(iterableStream(as).map(f).toCollection()); | 640 | 640 | } | 641 | 641 |
| 642 | 642 | /** | @@ -646,7 +646,7 @@ public static <A, B> TreeSet<B> mapJ(final F<A, B> f, final TreeSet<A> as) { | 646 | 646 | * @return A new PriorityQueue with this function applied to each element. | 647 | 647 | */ | 648 | 648 | public static <A, B> PriorityQueue<B> mapJ(final F<A, B> f, final PriorityQueue<A> as) { | 649 | | - return new PriorityQueue<B>(iterableStream(as).map(f).toCollection()); | | 649 | + return new PriorityQueue<>(iterableStream(as).map(f).toCollection()); | 650 | 650 | } | 651 | 651 |
| 652 | 652 | /** | @@ -656,7 +656,7 @@ public static <A, B> PriorityQueue<B> mapJ(final F<A, B> f, final PriorityQueue< | 656 | 656 | * @return A new LinkedList with this function applied to each element. | 657 | 657 | */ | 658 | 658 | public static <A, B> LinkedList<B> mapJ(final F<A, B> f, final LinkedList<A> as) { | 659 | | - return new LinkedList<B>(iterableStream(as).map(f).toCollection()); | | 659 | + return new LinkedList<>(iterableStream(as).map(f).toCollection()); | 660 | 660 | } | 661 | 661 |
| 662 | 662 | /** | @@ -666,7 +666,7 @@ public static <A, B> LinkedList<B> mapJ(final F<A, B> f, final LinkedList<A> as) | 666 | 666 | * @return A new ArrayList with this function applied to each element. | 667 | 667 | */ | 668 | 668 | public static <A, B> ArrayList<B> mapJ(final F<A, B> f, final ArrayList<A> as) { | 669 | | - return new ArrayList<B>(iterableStream(as).map(f).toCollection()); | | 669 | + return new ArrayList<>(iterableStream(as).map(f).toCollection()); | 670 | 670 | } | 671 | 671 |
| 672 | 672 | public static <A, B, C> F<A, C> map(F<A, B> target, F<B, C> f) { | |
Collapse file Copy file name to clipboardExpand all lines: core/src/main/java/fj/F1W.java +1-1Lines changed: 1 addition & 1 deletion | Original file line number | Diff line number | Diff line change |
|---|
@@ -682,6 +682,6 @@ public B f(A a) { | 682 | 682 | * Lifts the function into the fully featured function wrapper | 683 | 683 | */ | 684 | 684 | public static <A, B> F1W<A, B> lift(final F<A, B> f) { | 685 | | - return new F1WFunc<A, B>(f); | | 685 | + return new F1WFunc<>(f); | 686 | 686 | } | 687 | 687 | } |
Collapse file Copy file name to clipboardExpand all lines: core/src/main/java/fj/Function.java +2-2Lines changed: 2 additions & 2 deletions | Original file line number | Diff line number | Diff line change |
|---|
@@ -168,7 +168,7 @@ public static <A, B, C> F<F2<A, B, C>, F2<B, A, C>> flip2() { | 168 | 168 | * not apply the value, instead returning an empty optional value. | 169 | 169 | */ | 170 | 170 | public static <A, B> F<A, Option<B>> nullable(final F<A, B> f) { | 171 | | - return a -> a == null ? Option.<B>none() : Option.some(f.f(a)); | | 171 | + return a -> a == null ? Option.none() : Option.some(f.f(a)); | 172 | 172 | } | 173 | 173 |
| 174 | 174 | /** | @@ -761,7 +761,7 @@ public static <A, B, C, D> F<F<D, A>, F<F<D, B>, F<D, C>>> lift(final F<A, F<B, | 761 | 761 | * @return A function of arity-1 whose argument is substituted for both parameters of <em>f</em>. | 762 | 762 | */ | 763 | 763 | public static <A, B> F<B, A> join(final F<B, F<B, A>> f) { | 764 | | - return bind(f, Function.<F<B, A>>identity()); | | 764 | + return bind(f, Function.identity()); | 765 | 765 | } | 766 | 766 |
| 767 | 767 |
| |
Collapse file Copy file name to clipboardExpand all lines: core/src/main/java/fj/Hash.java +11-11Lines changed: 11 additions & 11 deletions | Original file line number | Diff line number | Diff line change |
|---|
@@ -165,7 +165,7 @@ public static <A, B> Hash<Either<A, B>> eitherHash(final Hash<A> ha, final Hash< | 165 | 165 | * @return A hash instance for the {@link Validation} type. | 166 | 166 | */ | 167 | 167 | public static <A, B> Hash<Validation<A, B>> validationHash(final Hash<A> ha, final Hash<B> hb) { | 168 | | - return eitherHash(ha, hb).contramap(Validation.<A, B>either()); | | 168 | + return eitherHash(ha, hb).contramap(Validation.either()); | 169 | 169 | } | 170 | 170 |
| 171 | 171 | /** | @@ -196,7 +196,7 @@ public static <A> Hash<List<A>> listHash(final Hash<A> ha) { | 196 | 196 | * @return A hash instance for the {@link NonEmptyList} type. | 197 | 197 | */ | 198 | 198 | public static <A> Hash<NonEmptyList<A>> nonEmptyListHash(final Hash<A> ha) { | 199 | | - return listHash(ha).contramap(NonEmptyList.<A>toList_()); | | 199 | + return listHash(ha).contramap(NonEmptyList.toList_()); | 200 | 200 | } | 201 | 201 |
| 202 | 202 | /** | @@ -264,7 +264,7 @@ public static <A> Hash<Array<A>> arrayHash(final Hash<A> ha) { | 264 | 264 | * @return A hash instance for the {@link Tree} type. | 265 | 265 | */ | 266 | 266 | public static <A> Hash<Tree<A>> treeHash(final Hash<A> ha) { | 267 | | - return streamHash(ha).contramap(Tree.<A>flatten_()); | | 267 | + return streamHash(ha).contramap(Tree.flatten_()); | 268 | 268 | } | 269 | 269 |
| 270 | 270 | public static <K, V> Hash<TreeMap<K, V>> treeMapHash(final Hash<K> h, final Hash<V> v) { | @@ -278,7 +278,7 @@ public static <K, V> Hash<TreeMap<K, V>> treeMapHash(final Hash<K> h, final Hash | 278 | 278 | * @return A hash instance for a product-1. | 279 | 279 | */ | 280 | 280 | public static <A> Hash<P1<A>> p1Hash(final Hash<A> ha) { | 281 | | - return ha.contramap(P1.<A>__1()); | | 281 | + return ha.contramap(P1.__1()); | 282 | 282 | } | 283 | 283 |
| 284 | 284 | /** | @@ -473,7 +473,7 @@ public static <A, B, C, D, E> Hash<P5<A, B, C, D, E>> p5Hash(final Hash<A> ha, f | 473 | 473 | * @return A hash instance for a vector-2. | 474 | 474 | */ | 475 | 475 | public static <A> Hash<V2<A>> v2Hash(final Hash<A> ea) { | 476 | | - return streamHash(ea).contramap(V2.<A>toStream_()); | | 476 | + return streamHash(ea).contramap(V2.toStream_()); | 477 | 477 | } | 478 | 478 |
| 479 | 479 | /** | @@ -483,7 +483,7 @@ public static <A> Hash<V2<A>> v2Hash(final Hash<A> ea) { | 483 | 483 | * @return A hash instance for a vector-3. | 484 | 484 | */ | 485 | 485 | public static <A> Hash<V3<A>> v3Hash(final Hash<A> ea) { | 486 | | - return streamHash(ea).contramap(V3.<A>toStream_()); | | 486 | + return streamHash(ea).contramap(V3.toStream_()); | 487 | 487 | } | 488 | 488 |
| 489 | 489 | /** | @@ -493,7 +493,7 @@ public static <A> Hash<V3<A>> v3Hash(final Hash<A> ea) { | 493 | 493 | * @return A hash instance for a vector-4. | 494 | 494 | */ | 495 | 495 | public static <A> Hash<V4<A>> v4Hash(final Hash<A> ea) { | 496 | | - return streamHash(ea).contramap(V4.<A>toStream_()); | | 496 | + return streamHash(ea).contramap(V4.toStream_()); | 497 | 497 | } | 498 | 498 |
| 499 | 499 | /** | @@ -503,7 +503,7 @@ public static <A> Hash<V4<A>> v4Hash(final Hash<A> ea) { | 503 | 503 | * @return A hash instance for a vector-5. | 504 | 504 | */ | 505 | 505 | public static <A> Hash<V5<A>> v5Hash(final Hash<A> ea) { | 506 | | - return streamHash(ea).contramap(V5.<A>toStream_()); | | 506 | + return streamHash(ea).contramap(V5.toStream_()); | 507 | 507 | } | 508 | 508 |
| 509 | 509 | /** | @@ -513,7 +513,7 @@ public static <A> Hash<V5<A>> v5Hash(final Hash<A> ea) { | 513 | 513 | * @return A hash instance for a vector-6. | 514 | 514 | */ | 515 | 515 | public static <A> Hash<V6<A>> v6Hash(final Hash<A> ea) { | 516 | | - return streamHash(ea).contramap(V6.<A>toStream_()); | | 516 | + return streamHash(ea).contramap(V6.toStream_()); | 517 | 517 | } | 518 | 518 |
| 519 | 519 | /** | @@ -523,7 +523,7 @@ public static <A> Hash<V6<A>> v6Hash(final Hash<A> ea) { | 523 | 523 | * @return A hash instance for a vector-7. | 524 | 524 | */ | 525 | 525 | public static <A> Hash<V7<A>> v7Hash(final Hash<A> ea) { | 526 | | - return streamHash(ea).contramap(V7.<A>toStream_()); | | 526 | + return streamHash(ea).contramap(V7.toStream_()); | 527 | 527 | } | 528 | 528 |
| 529 | 529 | /** | @@ -533,6 +533,6 @@ public static <A> Hash<V7<A>> v7Hash(final Hash<A> ea) { | 533 | 533 | * @return A hash instance for a vector-8. | 534 | 534 | */ | 535 | 535 | public static <A> Hash<V8<A>> v8Hash(final Hash<A> ea) { | 536 | | - return streamHash(ea).contramap(V8.<A>toStream_()); | | 536 | + return streamHash(ea).contramap(V8.toStream_()); | 537 | 537 | } | 538 | 538 | } |
|