Mercurial > repos > public > sbplib_julia
comparison Notes.md @ 1347:08f06bfacd5c refactor/grids
Fix typos and formatting of documentation
| author | Vidar Stiernström <vidar.stiernstrom@it.uu.se> |
|---|---|
| date | Thu, 18 May 2023 22:53:31 +0200 |
| parents | c2012db881cb |
| children | 4684c7f1c4cb |
comparison
equal
deleted
inserted
replaced
| 1345:c2012db881cb | 1347:08f06bfacd5c |
|---|---|
| 205 | 205 |
| 206 A question is how and if we should implement `map`/`lmap` for functions like `(x,y)->x*y` or stick to just using vector inputs. There are a few options. | 206 A question is how and if we should implement `map`/`lmap` for functions like `(x,y)->x*y` or stick to just using vector inputs. There are a few options. |
| 207 | 207 |
| 208 * use `Base.splat((x,y)->x*y)` with the single argument `map`/`lmap`. | 208 * use `Base.splat((x,y)->x*y)` with the single argument `map`/`lmap`. |
| 209 * implement a kind of `unzip` function to get iterators for each component, which can then be used with the multiple-iterators-version of `map`/`lmap`. | 209 * implement a kind of `unzip` function to get iterators for each component, which can then be used with the multiple-iterators-version of `map`/`lmap`. |
| 210 * Inspect the function in the `map`/`lmap` function to determine which mathches. | 210 * Inspect the function in the `map`/`lmap` function to determine which matches. |
| 211 | 211 |
| 212 Below is a partial implementation of `lmap` with some ideas | 212 Below is a partial implementation of `lmap` with some ideas |
| 213 ```julia | 213 ```julia |
| 214 struct LazyMapping{T,IT,F} | 214 struct LazyMapping{T,IT,F} |
| 215 f::F | 215 f::F |