@@ -261,7 +261,7 @@ public static <A, B> F<Promise<A>, Promise<B>> mapPromise(final F<A, B> f) {
261261 */
262262 @ SuppressWarnings ("unchecked" )
263263 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 );
265265 }
266266
267267 /**
@@ -272,7 +272,7 @@ public static <A, B, C> F<A, Either<B, C>> eitherLeftK(final F<A, B> f) {
272272 */
273273 @ SuppressWarnings ("unchecked" )
274274 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 );
276276 }
277277
278278 /**
@@ -330,7 +330,7 @@ public static <A, B> F<A, IterableW<B>> iterableK(final F<A, B> f) {
330330 */
331331 @ SuppressWarnings ("unchecked" )
332332 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 ());
334334 }
335335
336336 /**
@@ -340,7 +340,7 @@ public static <A, B> F<Iterable<A>, IterableW<B>> mapIterable(final F<A, B> f) {
340340 */
341341 @ SuppressWarnings ("unchecked" )
342342 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 );
344344 }
345345
346346 /**
@@ -408,7 +408,7 @@ public static <A, B> F<Tree<A>, B> foldMapTree(final F<A, B> f, final Monoid<B>
408408 * @return This function promoted to return its value in a TreeZipper.
409409 */
410410 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 ());
412412 }
413413
414414 /**
@@ -560,7 +560,7 @@ public static <A, B> F<P2<A, A>, P2<B, B>> mapBoth(final F<A, B> f) {
560560 * @return A new SynchronousQueue with this function applied to each element.
561561 */
562562 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 <>();
564564 bs .addAll (iterableStream (as ).map (f ).toCollection ());
565565 return bs ;
566566 }
@@ -573,7 +573,7 @@ public static <A, B> SynchronousQueue<B> mapJ(final F<A, B> f, final Synchronous
573573 * @return A new PriorityBlockingQueue with this function applied to each element.
574574 */
575575 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 ());
577577 }
578578
579579 /**
@@ -583,7 +583,7 @@ public static <A, B> PriorityBlockingQueue<B> mapJ(final F<A, B> f, final Priori
583583 * @return A new LinkedBlockingQueue with this function applied to each element.
584584 */
585585 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 ());
587587 }
588588
589589 /**
@@ -593,7 +593,7 @@ public static <A, B> LinkedBlockingQueue<B> mapJ(final F<A, B> f, final LinkedBl
593593 * @return A new CopyOnWriteArraySet with this function applied to each element.
594594 */
595595 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 ());
597597 }
598598
599599 /**
@@ -603,7 +603,7 @@ public static <A, B> CopyOnWriteArraySet<B> mapJ(final F<A, B> f, final CopyOnWr
603603 * @return A new CopyOnWriteArrayList with this function applied to each element.
604604 */
605605 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 ());
607607 }
608608
609609 /**
@@ -613,7 +613,7 @@ public static <A, B> CopyOnWriteArrayList<B> mapJ(final F<A, B> f, final CopyOnW
613613 * @return A new ConcurrentLinkedQueue with this function applied to each element.
614614 */
615615 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 ());
617617 }
618618
619619 /**
@@ -623,7 +623,7 @@ public static <A, B> ConcurrentLinkedQueue<B> mapJ(final F<A, B> f, final Concur
623623 * @return A new ArrayBlockingQueue with this function applied to each element.
624624 */
625625 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 ());
627627 bs .addAll (iterableStream (as ).map (f ).toCollection ());
628628 return bs ;
629629 }
@@ -636,7 +636,7 @@ public static <A, B> ArrayBlockingQueue<B> mapJ(final F<A, B> f, final ArrayBloc
636636 * @return A new TreeSet with this function applied to each element.
637637 */
638638 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 ());
640640 }
641641
642642 /**
@@ -646,7 +646,7 @@ public static <A, B> TreeSet<B> mapJ(final F<A, B> f, final TreeSet<A> as) {
646646 * @return A new PriorityQueue with this function applied to each element.
647647 */
648648 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 ());
650650 }
651651
652652 /**
@@ -656,7 +656,7 @@ public static <A, B> PriorityQueue<B> mapJ(final F<A, B> f, final PriorityQueue<
656656 * @return A new LinkedList with this function applied to each element.
657657 */
658658 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 ());
660660 }
661661
662662 /**
@@ -666,7 +666,7 @@ public static <A, B> LinkedList<B> mapJ(final F<A, B> f, final LinkedList<A> as)
666666 * @return A new ArrayList with this function applied to each element.
667667 */
668668 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 ());
670670 }
671671
672672 public static <A , B , C > F <A , C > map (F <A , B > target , F <B , C > f ) {
0 commit comments