Data.NimList
Data.NimList is a Nim implementation of Haskell's Data.List library
Pure Nim
score 15/100 · last commit 2022-05-29 · 0 stars
· tests present
· no docs generated
Summary
| Latest Version |
Unknown |
| License |
Unknown |
| CI Status |
Failing
|
| Stars |
0 |
| Forks |
0 |
| Open Issues |
2 |
| Last Commit |
2022-05-29 |
| Downloads |
0 |
| Last Indexed |
2026-09-06 06:05 |
Installation
nimble install Data.NimList
choosenim install Data.NimList
git clone https://github.com/sanao1006/Data.NimList
OS Compatibility
| Platform |
Linux |
macOS |
Windows |
FreeBSD |
OpenBSD |
NetBSD |
Android |
iOS |
WASM |
Embedded |
| Data.NimList |
✓
|
✓
|
✓
|
-
|
-
|
-
|
-
|
-
|
-
|
-
|
README
Data.NimList
Whats' this?
This is a Nim implementation of Haskell's Data.List library ※Not completed(In progress)
Document
- I avoid using recursion too often, and I actively use a standard library. Therefore, some functions have unique implementations.
- Functions that exist in a standard library are omitted.
Please point out any mistakes!
Supported functions
- Basic Functions
- ++
- head
- last
- tail
- init
- uncons
- singleton
- null
- List transformers
- intersperse
- intercalate
- transepose
- subsequences
- permutations
- Building list
- scanl
- scanl1
- scanr
- scanr1
- (In)finite list
- iterate
- repeat
- replicate
- cycle
- Sublists
- take
- drop
- splitAt
- takeWhile
- dropWhile
- span
- breakList
- stripPrefix
- inits
- tails
- Predicates
- isPrefixOf
- isSuffixOf
- isInfixOf
- Searching lists
- elem
- notElem
- lookup
- Searching with a predicate
- find
- partition
- Index lists
- (!!)
- elemIndices