Exemplos de LanguageExt CollT.AllCombinationsOf em C# (CSharp)

Exemplo n.º 1

Arquivo: HashSet.cs Projeto: 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));

Exemplo n.º 2

Arquivo: HashSet.cs Projeto: 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));

Exemplo n.º 3

Arquivo: StckT.cs Projeto: 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)));

Exemplo 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));

Exemplo 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();

Exemplo 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();

Exemplo 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);

Exemplo 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();

Exemplo 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);

Exemplo 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);

Exemplo n.º 11

Arquivo: IEnumerableT.cs Projeto: 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));

Exemplo 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();

Exemplo 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();

Exemplo n.º 14

Arquivo: HashSet.cs Projeto: 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()));

Exemplo n.º 15

Arquivo: SeqT.cs Projeto: 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();

Exemplo n.º 16

Arquivo: HashSet.cs Projeto: 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));

Exemplo n.º 17

Arquivo: StckT.cs Projeto: 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));

Exemplo 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();

Exemplo n.º 19

Arquivo: StckT.cs Projeto: 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));

Exemplo 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();

Exemplo n.º 21

Arquivo: SetT.cs Projeto: 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));