Esempi in C# (CSharp) per LanguageExt CollT.AllCombinationsOf

Esempio n. 1

File: HashSet.cs Progetto: Protiguous/language-ext

 public static HashSet <Lst <B> > Traverse <A, B>(this Lst <HashSet <A> > ma, Func <A, B> f) =>
 toHashSet(CollT.AllCombinationsOf(ma.Map(xs => xs.ToList()).ToSystemArray(), f)
           .Map(toList));

Esempio n. 2

File: HashSet.cs Progetto: Protiguous/language-ext

 public static HashSet <Que <B> > Traverse <A, B>(this Que <HashSet <A> > ma, Func <A, B> f) =>
 toHashSet(CollT.AllCombinationsOf(ma.Map(xs => xs.ToList()).ToArray(), f)
           .Map(toQueue));

Esempio n. 3

File: StckT.cs Progetto: wdolek/language-ext

 public static Stck <Seq <B> > Traverse <A, B>(this Seq <Stck <A> > ma, Func <A, B> f) =>
 toStack(CollT.AllCombinationsOf(ma.Map(xs => xs.ToList()).ToArray(), f)
         .Map(xs => Seq(xs)));

Esempio n. 4

 public static Que <Set <B> > Traverse <A, B>(this Set <Que <A> > ma, Func <A, B> f) =>
 toQueue(CollT.AllCombinationsOf(ma.ToArray().Map(xs => xs.ToList()).ToArray(), f)
         .Map(toSet));

Esempio n. 5

 public static Lst <IEnumerable <B> > Traverse <A, B>(this IEnumerable <Lst <A> > ma, Func <A, B> f) =>
 CollT.AllCombinationsOf(ma.Map(xs => xs.ToList()).ToArray(), f)
 .Map(xs => xs.AsEnumerable())
 .Freeze();

Esempio n. 6

 public static Arr <IEnumerable <B> > Traverse <A, B>(this IEnumerable <Arr <A> > xxs, Func <A, B> f) =>
 CollT.AllCombinationsOf(xxs.Map(xs => xs.ToList()).ToArray(), f)
 .Map(xs => xs.AsEnumerable())
 .ToArr();

Esempio n. 7

 public static IEnumerable <Stck <B> > Traverse <A, B>(this Stck <IEnumerable <A> > ma, Func <A, B> f) =>
 CollT.AllCombinationsOf(ma.Reverse().Map(xs => xs.ToList()).ToArray(), f)
 .Map(toStack);

Esempio n. 8

 public static Lst <Lst <B> > Traverse <A, B>(this Lst <Lst <A> > ma, Func <A, B> f) =>
 CollT.AllCombinationsOf(ma.Map(xs => xs.ToList()).ToSystemArray(), f)
 .Map(toList)
 .Freeze();

Esempio n. 9

 public static IEnumerable <HashSet <B> > Traverse <A, B>(this HashSet <IEnumerable <A> > ma, Func <A, B> f) =>
 CollT.AllCombinationsOf(ma.ToArray().Map(xs => xs.ToList()).ToArray(), f)
 .Map(toHashSet);

Esempio n. 10

 public static IEnumerable <Que <B> > Traverse <A, B>(this Que <IEnumerable <A> > ma, Func <A, B> f) =>
 CollT.AllCombinationsOf(ma.Map(xs => xs.ToList()).ToArray(), f)
 .Map(toQueue);

Esempio n. 11

File: IEnumerableT.cs Progetto: wdolek/language-ext

 public static IEnumerable <Seq <B> > Traverse <A, B>(this Seq <IEnumerable <A> > ma, Func <A, B> f) =>
 CollT.AllCombinationsOf(ma.Map(xs => xs.ToList()).ToArray(), f)
 .Map(xs => Seq(xs));

Esempio n. 12

 public static Arr <Stck <B> > Traverse <A, B>(this Stck <Arr <A> > xxs, Func <A, B> f) =>
 CollT.AllCombinationsOf(xxs.Reverse().Map(xs => xs.ToList()).ToArray(), f)
 .Map(toStack)
 .ToArr();

Esempio n. 13

 public static Arr <Set <B> > Traverse <A, B>(this Set <Arr <A> > xxs, Func <A, B> f) =>
 CollT.AllCombinationsOf(xxs.Map(xs => xs.ToList()).ToArray(), f)
 .Map(toSet)
 .ToArr();

Esempio n. 14

File: HashSet.cs Progetto: Protiguous/language-ext

 public static HashSet <IEnumerable <B> > Traverse <A, B>(this IEnumerable <HashSet <A> > ma, Func <A, B> f) =>
 toHashSet(CollT.AllCombinationsOf(ma.Map(xs => xs.ToList()).ToArray(), f)
           .Map(xs => xs.AsEnumerable()));

Esempio n. 15

File: SeqT.cs Progetto: Protiguous/language-ext

 public static Seq <Set <B> > Traverse <A, B>(this Set <Seq <A> > ma, Func <A, B> f) =>
 CollT.AllCombinationsOf(ma.ToArray().Map(xs => xs.ToList()).ToArray(), f)
 .Map(toSet)
 .ToSeq();

Esempio n. 16

File: HashSet.cs Progetto: Protiguous/language-ext

 public static HashSet <Stck <B> > Traverse <A, B>(this Stck <HashSet <A> > ma, Func <A, B> f) =>
 toHashSet(CollT.AllCombinationsOf(ma.Reverse().Map(xs => xs.ToList()).ToArray(), f)
           .Map(toStack));

Esempio n. 17

File: StckT.cs Progetto: wdolek/language-ext

 public static Stck <Lst <B> > Traverse <A, B>(this Lst <Stck <A> > ma, Func <A, B> f) =>
 toStack(CollT.AllCombinationsOf(ma.Map(xs => xs.ToList()).ToSystemArray(), f)
         .Map(toList));

Esempio n. 18

 public static Lst <Que <B> > Traverse <A, B>(this Que <Lst <A> > ma, Func <A, B> f) =>
 CollT.AllCombinationsOf(ma.Map(xs => xs.ToList()).ToArray(), f)
 .Map(toQueue)
 .Freeze();

Esempio n. 19

File: StckT.cs Progetto: wdolek/language-ext

 public static Stck <Que <B> > Traverse <A, B>(this Que <Stck <A> > ma, Func <A, B> f) =>
 toStack(CollT.AllCombinationsOf(ma.Map(xs => xs.ToList()).ToArray(), f)
         .Map(toQueue));

Esempio n. 20

 public static Lst <Stck <B> > Traverse <A, B>(this Stck <Lst <A> > ma, Func <A, B> f) =>
 CollT.AllCombinationsOf(ma.Reverse().Map(xs => xs.ToList()).ToArray(), f)
 .Map(toStack)
 .Freeze();

Esempio n. 21

File: SetT.cs Progetto: IDisposable/language-ext

 public static Set <HashSet <B> > Traverse <A, B>(this HashSet <Set <A> > ma, Func <A, B> f) =>
 toSet(CollT.AllCombinationsOf(ma.ToArray().Map(xs => xs.ToList()).ToArray(), f)
       .Map(toHashSet));