branch: externals/dash
commit 73a28ae359540d63188fe24c8aaed323cba75d8b
Author: Matus Goljer <gol...@logio.cz>
Commit: Matus Goljer <gol...@logio.cz>
Fix function application in documentation
---
README.md | 2 +-
dash.el | 2 +-
dash.info | 128 +++++++++++++++++++++++++++++++-------------------------------
dash.texi | 2 +-
4 files changed, 67 insertions(+), 67 deletions(-)
diff --git a/README.md b/README.md
index 860be80..2b69225 100644
--- a/README.md
+++ b/README.md
@@ -1612,7 +1612,7 @@ combinations created by taking one element from each list
in
order. The results are flattened, ignoring the tensor structure
of the result. This is equivalent to calling:
- (-flatten-n (1- (length lists)) (-table fn lists))
+ (-flatten-n (1- (length lists)) (apply '-table fn lists))
but the implementation here is much more efficient.
diff --git a/dash.el b/dash.el
index 53849ee..6b6f873 100644
--- a/dash.el
+++ b/dash.el
@@ -1203,7 +1203,7 @@ combinations created by taking one element from each list
in
order. The results are flattened, ignoring the tensor structure
of the result. This is equivalent to calling:
- (-flatten-n (1- (length lists)) (-table fn lists))
+ (-flatten-n (1- (length lists)) (apply '-table fn lists))
but the implementation here is much more efficient.
diff --git a/dash.info b/dash.info
index f2b088a..f94cd19 100644
--- a/dash.info
+++ b/dash.info
@@ -1534,7 +1534,7 @@ Other list functions not fit to be classified elsewhere.
The results are flattened, ignoring the tensor structure of the
result. This is equivalent to calling:
- (-flatten-n (1- (length lists)) (-table fn lists))
+ (-flatten-n (1- (length lists)) (apply ’-table fn lists))
but the implementation here is much more efficient.
@@ -2908,69 +2908,69 @@ Ref: -cycle48368
Ref: -pad48741
Ref: -table49064
Ref: -table-flat49853
-Ref: -first50852
-Ref: -some51226
-Ref: -last51596
-Ref: -first-item51930
-Ref: -last-item52145
-Ref: -butlast52340
-Ref: -sort52587
-Ref: -list53076
-Ref: -fix53407
-Node: Tree operations53947
-Ref: -tree-seq54143
-Ref: -tree-map55001
-Ref: -tree-map-nodes55444
-Ref: -tree-reduce56294
-Ref: -tree-reduce-from57176
-Ref: -tree-mapreduce57777
-Ref: -tree-mapreduce-from58637
-Ref: -clone59923
-Node: Threading macros60251
-Ref: ->60396
-Ref: ->>60887
-Ref: -->61392
-Ref: -some->61918
-Ref: -some->>62292
-Ref: -some-->62728
-Node: Binding63199
-Ref: -when-let63411
-Ref: -when-let*63905
-Ref: -if-let64428
-Ref: -if-let*64823
-Ref: -let65440
-Ref: -let*70235
-Ref: -lambda71175
-Node: Side-effects71972
-Ref: -each72166
-Ref: -each-while72573
-Ref: -each-indexed72933
-Ref: -dotimes73444
-Ref: -doto73747
-Node: Destructive operations74175
-Ref: !cons74348
-Ref: !cdr74554
-Node: Function combinators74749
-Ref: -partial75023
-Ref: -rpartial75419
-Ref: -juxt75822
-Ref: -compose76254
-Ref: -applify76807
-Ref: -on77254
-Ref: -flip77777
-Ref: -const78089
-Ref: -cut78428
-Ref: -not78914
-Ref: -orfn79224
-Ref: -andfn79658
-Ref: -iteratefn80153
-Ref: -fixfn80856
-Ref: -prodfn82419
-Node: Development83481
-Node: Contribute83830
-Node: Changes84578
-Node: Contributors87576
-Node: Index89195
+Ref: -first50861
+Ref: -some51235
+Ref: -last51605
+Ref: -first-item51939
+Ref: -last-item52154
+Ref: -butlast52349
+Ref: -sort52596
+Ref: -list53085
+Ref: -fix53416
+Node: Tree operations53956
+Ref: -tree-seq54152
+Ref: -tree-map55010
+Ref: -tree-map-nodes55453
+Ref: -tree-reduce56303
+Ref: -tree-reduce-from57185
+Ref: -tree-mapreduce57786
+Ref: -tree-mapreduce-from58646
+Ref: -clone59932
+Node: Threading macros60260
+Ref: ->60405
+Ref: ->>60896
+Ref: -->61401
+Ref: -some->61927
+Ref: -some->>62301
+Ref: -some-->62737
+Node: Binding63208
+Ref: -when-let63420
+Ref: -when-let*63914
+Ref: -if-let64437
+Ref: -if-let*64832
+Ref: -let65449
+Ref: -let*70244
+Ref: -lambda71184
+Node: Side-effects71981
+Ref: -each72175
+Ref: -each-while72582
+Ref: -each-indexed72942
+Ref: -dotimes73453
+Ref: -doto73756
+Node: Destructive operations74184
+Ref: !cons74357
+Ref: !cdr74563
+Node: Function combinators74758
+Ref: -partial75032
+Ref: -rpartial75428
+Ref: -juxt75831
+Ref: -compose76263
+Ref: -applify76816
+Ref: -on77263
+Ref: -flip77786
+Ref: -const78098
+Ref: -cut78437
+Ref: -not78923
+Ref: -orfn79233
+Ref: -andfn79667
+Ref: -iteratefn80162
+Ref: -fixfn80865
+Ref: -prodfn82428
+Node: Development83490
+Node: Contribute83839
+Node: Changes84587
+Node: Contributors87585
+Node: Index89204
End Tag Table
diff --git a/dash.texi b/dash.texi
index e75621c..94d8ec9 100644
--- a/dash.texi
+++ b/dash.texi
@@ -2421,7 +2421,7 @@ combinations created by taking one element from each list
in
order. The results are flattened, ignoring the tensor structure
of the result. This is equivalent to calling:
- (-flatten-n (1- (length lists)) (-table fn lists))
+ (-flatten-n (1- (length lists)) (apply '-table fn lists))
but the implementation here is much more efficient.
