Search results
- apply("+",1/%); (print (apply + (map / list)))</syntaxhighlight> ...57 KB (5,294 words) - 09:03, 14 February 2024
- ...</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">apply</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">f ...42 KB (4,224 words) - 17:15, 12 May 2024
- parameters and apply arguments to some of the parameters to create a new * Partially apply f1 to fs to form function fsf1( s ) ...79 KB (10,497 words) - 18:02, 10 April 2024
- N,mx := 12, [1..N].apply(fcn(n){ [1..n].apply(stirling2.fp(n)) }).flatten() : (0).max(_); S2100:=[BI(2)..N].apply(stirling2.fp(BI(N))).reduce(fcn(m,n){ m.max(n) }); ...88 KB (7,360 words) - 14:35, 25 March 2024
- ...nction or method that is used to take the values in an array or a list and apply a function to successive members of the list to produce (or reduce them to) ; Apply a function to each element first ...98 KB (13,132 words) - 14:31, 1 March 2024
- <pre>$ terraform apply --auto-approve Apply complete! Resources: 0 added, 0 changed, 0 destroyed. ...69 KB (8,712 words) - 16:53, 14 March 2024
- N,mx := 12, [1..N].apply(fcn(n){ [1..n].apply(stirling1.fp(n)) : (0).max(_) }) : (0).max(_); [1..N].apply(stirling1.fp(BI(N))) ...101 KB (8,429 words) - 09:57, 25 March 2024
- (let [lows (map #(apply min %) rs) highs (map #(apply max %) rs)] ...96 KB (10,790 words) - 14:09, 4 February 2024
- ...</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">apply</span><span style="color: #0000FF;">(</span><span style="color: #000000;">s <syntaxhighlight lang="zkl">fcn lexN(n){ n.pump(List,'+(1),"toString").sort().apply("toInt") }</syntaxhighlight> ...52 KB (6,089 words) - 10:57, 8 February 2024
- (apply tab (range 0 12) (need 13 -11)) N,mx := 12, [1..N].apply(fcn(n){ [1..n].apply(lah.fp(n)) }).flatten() : (0).max(_); ...129 KB (9,785 words) - 09:19, 23 March 2024
- do j=deg-1 by -1 for deg; a=a*x+c.j /*apply Horner's rule to the equations.*/ Do p=pdeg To 1 By -1 /* apply Horner's rule. */ ...69 KB (9,064 words) - 18:30, 17 March 2024
- In the following 'apply' is the foreign conjunction: <syntaxhighlight lang="j"> apply ...170 KB (20,215 words) - 23:06, 16 March 2024
- (define (· a b) (apply + (map * a b))) //w.zipWith('+,line.ray.apply('*,si)).zipWith('+,plane.pt); // or ...65 KB (9,451 words) - 11:55, 5 December 2023
- ...span> <span style="color: #0000FF;">=</span> <span style="color: #7060A8;">apply</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">f ...59 KB (6,529 words) - 20:24, 26 March 2024
- n = lst.length ? takewhile(same, zip.apply(null, lst)).length : 0; l = LengthWhile[s, Apply[SameQ]]; ...119 KB (13,750 words) - 15:00, 28 April 2024
- ...span> <span style="color: #0000FF;">=</span> <span style="color: #7060A8;">apply</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">s ...</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">apply</span><span style="color: #0000FF;">(</span><span style="color: #000000;">s ...89 KB (8,982 words) - 10:44, 8 February 2024
- Here's an example that can apply a function to the nodes in an <i>n</i>-tree regardless of ## Apply function "f" to each element of a tree, building ...70 KB (9,581 words) - 17:54, 29 March 2024
- <syntaxhighlight lang="clojure">> (apply str (take-while #(not (#{\# \;} %)) "apples # comment")) const flip = f => (a, b) => f.apply(null, [b, a]); ...78 KB (9,873 words) - 16:24, 10 February 2024
- ) : [].concat.apply([], Array.from({ CValues[!t(apply(CValues, MARGIN = 1, function(x) x %in% 1:13))] <- NA ...94 KB (11,005 words) - 09:52, 17 December 2023
- (λ () (apply + (divisors z))))))) ...66 KB (7,781 words) - 10:57, 24 January 2024