| /dports/graphics/nip2/nip2-8.7.1/share/nip2/compat/7.8/ |
| H A D | _list.def | 253 sort l = sortc less_equal l;
255 /* sortc comp l: sort list l into order using a comparision function
258 * sortc :: (* -> * -> bool) -> [*] -> [*]
260 sortc comp l
262 = merge (sortc comp (take n2 l)) (sortc comp (drop n2 l))
288 = sortc (test pl) l
307 sortr l = sortc more l;
|
| H A D | Mosaic.def | 42 l' = map (sortc above) l;
46 l'' = sortc right l';
57 l' = map (sortc left) l;
61 l'' = sortc below l';
|
| /dports/graphics/nip2/nip2-8.7.1/share/nip2/compat/7.9/ |
| H A D | _list.def | 253 sort l = sortc less_equal l;
255 /* sortc comp l: sort list l into order using a comparision function
258 * sortc :: (* -> * -> bool) -> [*] -> [*]
260 sortc comp l
262 = merge (sortc comp (take n2 l)) (sortc comp (drop n2 l))
288 = sortc (test pl) l
307 sortr l = sortc more l;
|
| H A D | Mosaic.def | 42 l' = map (sortc above) l;
46 l'' = sortc right l';
57 l' = map (sortc left) l;
61 l'' = sortc below l';
|
| /dports/graphics/nip2/nip2-8.7.1/share/nip2/compat/7.10/ |
| H A D | _list.def | 253 sort l = sortc less_equal l;
255 /* sortc comp l: sort list l into order using a comparision function
258 * sortc :: (* -> * -> bool) -> [*] -> [*]
260 sortc comp l
262 = merge (sortc comp (take n2 l)) (sortc comp (drop n2 l))
288 = sortc (test pl) l
307 sortr l = sortc more l;
|
| H A D | Tasks.def | 112 args = sortc larger [a, b];
235 args = sortc (const (is_instanceof calib_name)) [a, b];
287 l' = map (sortc above) l;
291 l'' = sortc right l';
302 l' = map (sortc left) l;
306 l'' = sortc below l';
|
| /dports/graphics/nip2/nip2-8.7.1/share/nip2/compat/7.14/ |
| H A D | _list.def | 275 sort l = sortc less_equal l;
277 /* sortc comp l: sort list l into order using a comparision function
280 * sortc :: (* -> * -> bool) -> [*] -> [*]
282 sortc comp l
284 = merge (sortc comp (take n2 l)) (sortc comp (drop n2 l))
308 = sortc (test pl) l
327 sortr l = sortc more l;
|
| /dports/graphics/nip2/nip2-8.7.1/share/nip2/compat/7.12/ |
| H A D | _list.def | 269 sort l = sortc less_equal l;
271 /* sortc comp l: sort list l into order using a comparision function
274 * sortc :: (* -> * -> bool) -> [*] -> [*]
276 sortc comp l
278 = merge (sortc comp (take n2 l)) (sortc comp (drop n2 l))
304 = sortc (test pl) l
323 sortr l = sortc more l;
|
| H A D | Tasks.def | 111 args = sortc larger [a, b];
240 args = sortc (const (is_instanceof calib_name)) [a, b];
329 l' = map (sortc above) l;
333 l'' = sortc right l';
344 l' = map (sortc left) l;
348 l'' = sortc below l';
|
| /dports/graphics/nip2/nip2-8.7.1/share/nip2/compat/7.24/ |
| H A D | _list.def | 305 sort l = sortc less_equal l;
307 /* sortc comp l: sort list l into order using a comparision function
310 * sortc :: (* -> * -> bool) -> [*] -> [*]
312 sortc comp l
314 = merge (sortc comp (take n2 l)) (sortc comp (drop n2 l))
338 = sortc (test pl) l
357 sortr l = sortc more l;
|
| H A D | Histogram.def | 84 [im, index] = sortc (const is_index) [a, b];
107 [im, hist] = sortc (const is_hist) [a, b];
|
| /dports/graphics/nip2/nip2-8.7.1/share/nip2/compat/8.2/ |
| H A D | _list.def | 337 sort l = sortc less_equal l;
339 /* sortc comp l: sort list l into order using a comparision function
342 * sortc :: (* -> * -> bool) -> [*] -> [*]
344 sortc comp l
346 = merge (sortc comp (take n2 l)) (sortc comp (drop n2 l))
370 = sortc (test pl) l
389 sortr l = sortc more l;
|
| /dports/graphics/nip2/nip2-8.7.1/share/nip2/compat/8.4/ |
| H A D | _list.def | 337 sort l = sortc less_equal l;
339 /* sortc comp l: sort list l into order using a comparision function
342 * sortc :: (* -> * -> bool) -> [*] -> [*]
344 sortc comp l
346 = merge (sortc comp (take n2 l)) (sortc comp (drop n2 l))
370 = sortc (test pl) l
389 sortr l = sortc more l;
|
| /dports/graphics/nip2/nip2-8.7.1/share/nip2/compat/8.5/ |
| H A D | _list.def | 337 sort l = sortc less_equal l;
339 /* sortc comp l: sort list l into order using a comparision function
342 * sortc :: (* -> * -> bool) -> [*] -> [*]
344 sortc comp l
346 = merge (sortc comp (take n2 l)) (sortc comp (drop n2 l))
370 = sortc (test pl) l
389 sortr l = sortc more l;
|
| /dports/graphics/nip2/nip2-8.7.1/share/nip2/compat/8.6/ |
| H A D | _list.def | 337 sort l = sortc less_equal l;
339 /* sortc comp l: sort list l into order using a comparision function
342 * sortc :: (* -> * -> bool) -> [*] -> [*]
344 sortc comp l
346 = merge (sortc comp (take n2 l)) (sortc comp (drop n2 l))
370 = sortc (test pl) l
389 sortr l = sortc more l;
|
| /dports/graphics/nip2/nip2-8.7.1/share/nip2/start/ |
| H A D | _list.def | 337 sort l = sortc less_equal l;
339 /* sortc comp l: sort list l into order using a comparision function
342 * sortc :: (* -> * -> bool) -> [*] -> [*]
344 sortc comp l
346 = merge (sortc comp (take n2 l)) (sortc comp (drop n2 l))
370 = sortc (test pl) l
389 sortr l = sortc more l;
|
| /dports/graphics/nip2/nip2-8.7.1/share/nip2/compat/7.28/ |
| H A D | _list.def | 305 sort l = sortc less_equal l;
307 /* sortc comp l: sort list l into order using a comparision function
310 * sortc :: (* -> * -> bool) -> [*] -> [*]
312 sortc comp l
314 = merge (sortc comp (take n2 l)) (sortc comp (drop n2 l))
338 = sortc (test pl) l
357 sortr l = sortc more l;
|
| /dports/graphics/nip2/nip2-8.7.1/share/nip2/compat/7.38/ |
| H A D | _list.def | 337 sort l = sortc less_equal l;
339 /* sortc comp l: sort list l into order using a comparision function
342 * sortc :: (* -> * -> bool) -> [*] -> [*]
344 sortc comp l
346 = merge (sortc comp (take n2 l)) (sortc comp (drop n2 l))
370 = sortc (test pl) l
389 sortr l = sortc more l;
|
| /dports/graphics/nip2/nip2-8.7.1/share/nip2/compat/7.40/ |
| H A D | _list.def | 337 sort l = sortc less_equal l;
339 /* sortc comp l: sort list l into order using a comparision function
342 * sortc :: (* -> * -> bool) -> [*] -> [*]
344 sortc comp l
346 = merge (sortc comp (take n2 l)) (sortc comp (drop n2 l))
370 = sortc (test pl) l
389 sortr l = sortc more l;
|
| /dports/graphics/nip2/nip2-8.7.1/share/nip2/compat/8.3/ |
| H A D | _list.def | 337 sort l = sortc less_equal l;
339 /* sortc comp l: sort list l into order using a comparision function
342 * sortc :: (* -> * -> bool) -> [*] -> [*]
344 sortc comp l
346 = merge (sortc comp (take n2 l)) (sortc comp (drop n2 l))
370 = sortc (test pl) l
389 sortr l = sortc more l;
|
| /dports/graphics/nip2/nip2-8.7.1/share/nip2/compat/7.16/ |
| H A D | _list.def | 286 sort l = sortc less_equal l;
288 /* sortc comp l: sort list l into order using a comparision function
291 * sortc :: (* -> * -> bool) -> [*] -> [*]
293 sortc comp l
295 = merge (sortc comp (take n2 l)) (sortc comp (drop n2 l))
319 = sortc (test pl) l
338 sortr l = sortc more l;
|
| /dports/graphics/nip2/nip2-8.7.1/share/nip2/compat/7.26/ |
| H A D | _list.def | 305 sort l = sortc less_equal l;
307 /* sortc comp l: sort list l into order using a comparision function
310 * sortc :: (* -> * -> bool) -> [*] -> [*]
312 sortc comp l
314 = merge (sortc comp (take n2 l)) (sortc comp (drop n2 l))
338 = sortc (test pl) l
357 sortr l = sortc more l;
|
| /dports/graphics/dataplot/dataplot-2c1b27601a3b7523449de612613eadeead9a8f70/lib/macros/ |
| H A D | DEX9PLOT.DP | 43 if k = 1; let y2 = sortc y z1; end if
44 if k = 2; let y2 = sortc y z1 z2; end if
45 if k = 3; let y2 = sortc y z1 z2 z3; end if
46 if k = 4; let y2 = sortc y z1 z2 z3 z4; end if
47 if k = 5; let y2 = sortc y z1 z2 z3 z4 z5; end if
48 if k = 6; let y2 = sortc y z1 z2 z3 z4 z5 z6; end if
49 if k = 7; let y2 = sortc y z1 z2 z3 z4 z5 z6 z7; end if
|
| /dports/net/frr7-pythontools/frr-frr-7.5.1/tests/lib/ |
| H A D | test_atomlist.c | 49 struct asort_item sortc; member
55 DECLARE_ATOMSORT_UNIQ(asort, struct item, sortc, icmp) in DECLARE_ATOMSORT_UNIQ() argument
|
| /dports/net/frr7/frr-frr-7.5.1/tests/lib/ |
| H A D | test_atomlist.c | 49 struct asort_item sortc; member
55 DECLARE_ATOMSORT_UNIQ(asort, struct item, sortc, icmp) in DECLARE_ATOMSORT_UNIQ() argument
|