fangxing80 / jenumerable Goto Github PK

This is an implementation of deferred lazy collections using Java. Inspired by F#, C#, and Haskell. The goal is to make working with iterable items easier. Most list processing is a series of transformations and iterations. By leveraging simple and composable functions you can reduce edge cases, off by 1 errors, extraneous processing and unintentional performance bottlenecks. Also, you can easily create (and end) infinite lazy streams.

Currently JEnumerable provides

• Map
• Zip
• Zip3
• Filter
• FlatMap
• Order
• OrderBy
• OrderDesc
• OrderByDesc
• Take
• TakeWhile
• Skip
• SkipWhile
• Iter
• Iteri
• DistinctUnion
• Distinct
• DistinctBy
• Intersect
• Except
• First
• Last
• Nth
• Fold
• FoldWithDefaultSeed
• Any
• All
• Windowed
• Tails
• Pairwise
• GroupRuns
• Intersperse
• Intercalate
• ToDictionary
• ToGroupedDictionary
• Range
• Min
• Max
• MinBy
• MaxBy

And infinite sequence generation with

• Yield
• Yield break
• Yield bang

Some functionality exists in Java 8 streams, but more is here. Initial benchmarks show that JEnumerable is comporable in speed to JDK8 streams. JDK8 streams, however, does parallelized optimizations which this does not, so can be bettter performant sometimes.

Check here for examples.

Initial benchmarks are as follows. The first element is the native streams function. The second element is JEnumerable's performance in milliseconds. As you can see JEnumerable is reasonably comporable, sometimes slower, sometimes faster, but for reasonably sized lists the performance is equal. This is just an example, since many functions in JEnumerable are not duplicated in Java 8 streams and so can't be comporably benchmarked.

Check here for the benchmark code