TidierIteration.jl is a 100% Julia implementation of the purrr R package. It aims to ease the different ways to map functions to Julia objects: Arrays, Dicts, and so on. It also provides some tools of functional programming: adverbs, composition, safe-functions and more.
For the stable version:
] add https://github.com/TidierOrg/TidierIteration.jl
The ] character starts the Julia package manager. Press the backspace key to return to the Julia prompt.
or
using Pkg Pkg.add(url="https://github.com/TidierOrg/TidierIteration.jl")
In R purrr package, there are many ways to apply a function to each element of a set: the many map_ variants (map_lgl returns a vector of logicals, map_chr returns a vector of strings/characters, etc) and so on exist because the map function returns a list in R, which is a wild beast (R lists allow any kind of elements, and few functions are optimized (i.e. vectorized) on them as opposed to vectors). In comparison, R vectors are always of just one type (integers, booleans, etc.)
In Julia, arrays are already the most general structure in the sense that they can contain any kind of element. Arrays of just one type (say, integers) are still arrays. We don't need the _lgl and _chr variants.
Besides that, the name map is already taken in Julia and its arguments are fatally in the opposite order of the purrr map! Because of that, we decided to implement the map_tidy function, which takes an iterable object x as the first argument and a function f as the second. map_tidy(x, f) means that for each element of x, we want to apply the function f and return an array.
So, instead of defining a function like map_int in Julia, you can just type:
or, even better, let f return an integer.
In Julia we already have 3 ways to apply a function to each element of an array x, and they are very elegant ones:
or
or the one we prefer:
Why useTidierIteration then?
The object x is always the first element of the map_* family, so it's easy to pipe them;
We extend the map_* family to Julia objects which are not mapped by default, like dictionaries, for which we have map_values() and map_keys();
We also provide the map2, imap and pmap methods to map over 2 or n elements at the same time;
We provide the flatten_* functions to tidy wild dictionaries (like JSON responses from APIs) and many adverbs.
See the documentation for examples.
map_tidy, map_values, map_keys, map_dfr, map_dfc, map2, imap, pmap
walk, walk2, iwalk, pwalk;
modify, modify!, modify_values!, modify_if, modify_if!
keep, keep!, keep_keys, discard, discard!, compact, compact!;
is_empty, is_non_empty, every, some, none, detect_index, detect, has_element, has_key, get_value;
compose, compose_n, negate, possibly;
flatten, flatten_n, flatten_dfr, flatten_json, flatten_dfr_json, json_string, to_json;
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4