| /dports/lang/chibi-scheme/chibi-scheme-0.10/lib/srfi/ |
| H A D | 134.scm | 102 (r. (append r (reverse (drop f i)))))
108 (f. (append f (reverse (drop r j)))))
311 (for-each proc (reverse (dq-r dq))))
317 (for-each proc (reverse (dq-f dq))))
364 (let ((r (seek pred (reverse seq2))))
386 (receive (hd. tl.) (span pred (reverse (dq-r dq)))
400 (receive (hd. tl.) (span pred (reverse (dq-r dq)))
413 (receive (head. tail.) (op pred (reverse (dq-r dq)))
428 (or (any pred (dq-f dq)) (any pred (reverse (dq-r dq))))))
435 (and (every pred (dq-f dq)) (every pred (reverse (dq-r dq))))))
[all …]
|
| H A D | 1.sld | 8 last last-pair length+ concatenate append! concatenate! reverse!
9 append-reverse append-reverse!
27 (define reverse! reverse)
29 (and (pair? ls) (if (pred (car ls)) ls (find-tail pred (cdr ls)))))
30 (define (find pred ls)
33 (define (any1 pred ls)
35 ((lambda (x) (if x x (any1 pred (cdr ls)))) (pred (car ls)))
36 (pred (car ls))))
37 (define (anyn pred lol)
48 (pred (car ls))
[all …]
|
| H A D | 158.scm | 3 (define (any pred ls)
5 (pred (car ls))
6 ((lambda (x) (if x x (any pred (cdr ls)))) (pred (car ls)))))
209 (if (null? result) item (reverse result))
211 (reverse (cons item result))
247 (cond ((null? gens) (reverse gs))
423 (reverse (generator->reverse-list gen)))))
482 (reverse result)
503 (if (pred v)
513 (if (pred v)
[all …]
|
| /dports/lang/gauche/Gauche-0.9.10/lib/data/ |
| H A D | ideque.scm | 117 [r. (lappend r (reverse (drop f i)))])
123 [f. (lappend f (reverse (drop r j)))])
204 (list= elt= t2 (reverse r1))
365 (let1 r (seek pred (reverse seq2))
382 (receive (hd. tl.) (span pred (reverse (dq-r dq)))
383 (check (dq-lenf dq) (dq-f dq) (length hd.) (reverse hd.)))
394 (receive (hd. tl.) (span pred (reverse (dq-r dq)))
405 (receive (head. tail.) (op pred (reverse (dq-r dq)))
420 (or (any pred (dq-f dq)) (any pred (reverse (dq-r dq)))))]
428 (and (every pred (dq-f dq)) (every pred (reverse (dq-r dq)))))]
[all …]
|
| /dports/lang/sagittarius-scheme/sagittarius-0.9.8/sitelib/srfi/%3a134/ |
| H A D | ideque.scm | 170 (r. (append r (reverse (drop f i)))))
176 (f. (append f (reverse (drop r j)))))
379 (for-each proc (reverse (dq-r dq))))
385 (for-each proc (reverse (dq-f dq))))
432 (let ((r (seek pred (reverse seq2))))
454 (receive (hd. tl.) (span pred (reverse (dq-r dq)))
468 (receive (hd. tl.) (span pred (reverse (dq-r dq)))
481 (receive (head. tail.) (op pred (reverse (dq-r dq)))
496 (or (any pred (dq-f dq)) (any pred (reverse (dq-r dq))))))
503 (and (every pred (dq-f dq)) (every pred (reverse (dq-r dq))))))
[all …]
|
| /dports/lang/ypsilon/ypsilon-0.9.6-update3/heap/boot/ |
| H A D | common.scm | 19 (lambda (pred lst)
22 (and (pred head)
27 (lambda (pred lst1 lst2)
37 (lambda (pred lst)
39 (or (pred (car lst)) (any1 pred (cdr lst))))))
42 (lambda (pred lst1 lst2)
49 (lambda (pred lst)
56 (lambda (pred lst)
58 (cond ((null? lst) (values (reverse acc1) (reverse acc2)))
103 (reverse lst)
[all …]
|
| /dports/lang/owl-lisp/owl-079f58f45039805517b9b880feec050e151c52b3/owl/ |
| H A D | list.scm | 12 reverse
191 (define reverse (C rev-loop #n))
194 (reverse '(1 2 3)) = '(3 2 1))
226 ((null? lst) (values (reverse taken) #n))
228 (else (values (reverse taken) lst)))))
264 (or (null? lst) (and (pred (car lst)) (every pred (cdr lst)))))
266 (define (any pred lst)
267 (and (pair? lst) (or (pred (car lst)) (any pred (cdr lst)))))
277 (values s (reverse r))
335 (values (reverse out) t)
[all …]
|
| /dports/lang/racket/racket-8.3/share/pkgs/lazy/ |
| H A D | list.rkt | 95 (define (takef lst pred)
96 (let ([pred (! pred)])
105 (define (dropf lst pred)
106 (let ([pred (! pred)])
115 (define (splitf-at lst pred)
116 (let ([pred (! pred)])
136 (improper-reverse (takef (improper-reverse l) pred)))
139 (improper-reverse (dropf (improper-reverse l) pred)))
142 (improper-reverse (splitf-at (improper-reverse l) pred)))
206 (if (pred (car lst))
[all …]
|
| /dports/lang/chicken5/chicken-5.3.0/ |
| H A D | mini-srfi-1.scm | 43 (cond ((null? lst) (values (reverse yes) (reverse no)))
47 (define (span pred lst)
49 (cond ((null? lst) (values (reverse head) lst))
51 (else (values (reverse head) lst)))))
67 (values (reverse prev) node)
79 (define (every pred lst)
85 (define (any pred lst)
88 ((pred (car lst)))
154 ((pred (car lst)) i)
213 (define (find pred lst)
[all …]
|
| /dports/devel/stxxl/stxxl-1.4.1/lib/io/ |
| H A D | wbtl_file.cpp | 112 place_map::iterator reverse = reverse_mapping.find(physical_offset); in discard() local
113 if (reverse == reverse_mapping.end()) { in discard()
116 assert(offset == (reverse->second).first); in discard()
117 reverse_mapping.erase(reverse); in discard()
133 sortseq::iterator pred = succ; in _add_free_region() local
134 pred--; in _add_free_region()
143 if ((*pred).first + (*pred).second == region_pos) in _add_free_region()
169 if ((*pred).first + (*pred).second == region_pos) in _add_free_region()
326 if (pred != free_space.end()) in check_corruption()
328 if (pred->first <= region_pos && pred->first + pred->second > region_pos) in check_corruption()
[all …]
|
| /dports/lang/sagittarius-scheme/sagittarius-0.9.8/script/ |
| H A D | srfi-160-at.scm.in | 35 @at@vector-copy @at@vector-reverse-copy
57 @at@vector-copy! @at@vector-reverse-copy!
61 reverse-@at@vector->list reverse-list->@at@vector
132 (define @at@vector-reverse-copy
138 (define (@at@vector-reverse-copy* vec start end)
140 (@at@vector-reverse-copy! v 0 vec start end)
246 (reverse r)
456 ((pred (@at@vector-ref vec i))) ;returns result of pred
534 (define @at@vector-reverse!
561 (define reverse-@at@vector->list
[all …]
|
| /dports/biology/p5-transdecoder/TransDecoder-TransDecoder-v5.4.0/util/misc/ |
| H A D | select_TD_orfs.py | 146 prediction_list.reverse()
198 prediction_list.sort(key=lambda x: x['orf_length'], reverse=True)
221 prediction_list.sort(key=lambda x: x['orf_length'], reverse=True)
223 prediction_list.sort(key=lambda x: x['frame_scores'][0], reverse=True)
234 for pred in selected_preds:
235 if prediction['orf_struct']['lend'] < pred['orf_struct']['rend'] and \
236 prediction['orf_struct']['rend'] > pred['orf_struct']['lend']:
243 selected_preds.sort(key=lambda x: x['orf_length'], reverse=True)
259 for pred in pred_list:
260 orf_struct = pred['orf_struct']
[all …]
|
| /dports/lang/slib/slib-3b6/ |
| H A D | comlist.scm | 54 ((< (length lst2) (length lst1)) (onion (reverse lst2) lst1))
55 (else (onion (reverse lst1) lst2))))))
62 (cond ((null? lst1) (reverse result))
73 (cond ((null? lst1) (reverse result))
101 (define (some pred lst . rest)
121 (define (notany pred . ls) (not (apply comlist:some pred ls)))
123 (define (notevery pred . ls) (not (apply comlist:every pred ls)))
182 (cond ((null? lst) (reverse result))
189 (cond ((null? lst) (reverse result))
272 (cond ((null? lst) (reverse nlst))
[all …]
|
| /dports/lang/scheme48/scheme48-1.9.2/scheme/big/ |
| H A D | big-util.scm | 64 (define (first pred list)
68 ((pred (car list))
84 (define (every? pred list)
88 ((pred (car list))
93 (define (filter! pred list)
97 ((pred (car list))
105 (reverse r))
123 (values (reverse yes) (reverse no)))
124 ((pred (car l))
133 ((pred (car l))
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/boost/hana/detail/ |
| H A D | algorithm.hpp | 32 constexpr void reverse(BidirIter first, BidirIter last) { in reverse() function
43 BinaryPred pred) in next_permutation() argument
50 if (pred(*--i, *ip1)) { in next_permutation()
52 while (!pred(*i, *--j)) in next_permutation()
55 detail::reverse(ip1, last); in next_permutation()
59 detail::reverse(first, last); in next_permutation()
76 if (first1 == last1 || pred(*first1, *first2)) in lexicographical_compare()
78 else if (pred(*first2, *first1)) in lexicographical_compare()
93 BinaryPred pred) in equal() argument
96 if (!pred(*first1, *first2)) in equal()
[all …]
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/hana/detail/ |
| H A D | algorithm.hpp | 32 constexpr void reverse(BidirIter first, BidirIter last) { in reverse() function
43 BinaryPred pred) in next_permutation() argument
50 if (pred(*--i, *ip1)) { in next_permutation()
52 while (!pred(*i, *--j)) in next_permutation()
55 detail::reverse(ip1, last); in next_permutation()
59 detail::reverse(first, last); in next_permutation()
76 if (first1 == last1 || pred(*first1, *first2)) in lexicographical_compare()
78 else if (pred(*first2, *first1)) in lexicographical_compare()
93 BinaryPred pred) in equal() argument
96 if (!pred(*first1, *first2)) in equal()
[all …]
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/hana/detail/ |
| H A D | algorithm.hpp | 32 constexpr void reverse(BidirIter first, BidirIter last) { in reverse() function
43 BinaryPred pred) in next_permutation() argument
50 if (pred(*--i, *ip1)) { in next_permutation()
52 while (!pred(*i, *--j)) in next_permutation()
55 detail::reverse(ip1, last); in next_permutation()
59 detail::reverse(first, last); in next_permutation()
76 if (first1 == last1 || pred(*first1, *first2)) in lexicographical_compare()
78 else if (pred(*first2, *first1)) in lexicographical_compare()
93 BinaryPred pred) in equal() argument
96 if (!pred(*first1, *first2)) in equal()
[all …]
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/hana/detail/ |
| H A D | algorithm.hpp | 32 constexpr void reverse(BidirIter first, BidirIter last) { in reverse() function
43 BinaryPred pred) in next_permutation() argument
50 if (pred(*--i, *ip1)) { in next_permutation()
52 while (!pred(*i, *--j)) in next_permutation()
55 detail::reverse(ip1, last); in next_permutation()
59 detail::reverse(first, last); in next_permutation()
76 if (first1 == last1 || pred(*first1, *first2)) in lexicographical_compare()
78 else if (pred(*first2, *first1)) in lexicographical_compare()
93 BinaryPred pred) in equal() argument
96 if (!pred(*first1, *first2)) in equal()
[all …]
|
| /dports/devel/boost-libs/boost_1_72_0/boost/hana/detail/ |
| H A D | algorithm.hpp | 32 constexpr void reverse(BidirIter first, BidirIter last) { in reverse() function
43 BinaryPred pred) in next_permutation() argument
50 if (pred(*--i, *ip1)) { in next_permutation()
52 while (!pred(*i, *--j)) in next_permutation()
55 detail::reverse(ip1, last); in next_permutation()
59 detail::reverse(first, last); in next_permutation()
76 if (first1 == last1 || pred(*first1, *first2)) in lexicographical_compare()
78 else if (pred(*first2, *first1)) in lexicographical_compare()
93 BinaryPred pred) in equal() argument
96 if (!pred(*first1, *first2)) in equal()
[all …]
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/hana/detail/ |
| H A D | algorithm.hpp | 32 constexpr void reverse(BidirIter first, BidirIter last) { in reverse() function
43 BinaryPred pred) in next_permutation() argument
50 if (pred(*--i, *ip1)) { in next_permutation()
52 while (!pred(*i, *--j)) in next_permutation()
55 detail::reverse(ip1, last); in next_permutation()
59 detail::reverse(first, last); in next_permutation()
76 if (first1 == last1 || pred(*first1, *first2)) in lexicographical_compare()
78 else if (pred(*first2, *first1)) in lexicographical_compare()
93 BinaryPred pred) in equal() argument
96 if (!pred(*first1, *first2)) in equal()
[all …]
|
| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/hana/detail/ |
| H A D | algorithm.hpp | 32 constexpr void reverse(BidirIter first, BidirIter last) { in reverse() function
43 BinaryPred pred) in next_permutation() argument
50 if (pred(*--i, *ip1)) { in next_permutation()
52 while (!pred(*i, *--j)) in next_permutation()
55 detail::reverse(ip1, last); in next_permutation()
59 detail::reverse(first, last); in next_permutation()
76 if (first1 == last1 || pred(*first1, *first2)) in lexicographical_compare()
78 else if (pred(*first2, *first1)) in lexicographical_compare()
93 BinaryPred pred) in equal() argument
96 if (!pred(*first1, *first2)) in equal()
[all …]
|
| /dports/devel/hyperscan/boost_1_75_0/boost/hana/detail/ |
| H A D | algorithm.hpp | 32 constexpr void reverse(BidirIter first, BidirIter last) { in reverse() function
43 BinaryPred pred) in next_permutation() argument
50 if (pred(*--i, *ip1)) { in next_permutation()
52 while (!pred(*i, *--j)) in next_permutation()
55 detail::reverse(ip1, last); in next_permutation()
59 detail::reverse(first, last); in next_permutation()
76 if (first1 == last1 || pred(*first1, *first2)) in lexicographical_compare()
78 else if (pred(*first2, *first1)) in lexicographical_compare()
93 BinaryPred pred) in equal() argument
96 if (!pred(*first1, *first2)) in equal()
[all …]
|
| /dports/devel/range-v3/range-v3-0.11.0/include/range/v3/algorithm/ |
| H A D | permutation.hpp | 117 C pred = C{},
177 C pred = C{},
190 std::move(pred),
199 std::move(pred),
218 C pred = C{},
227 std::move(pred),
261 std::move(pred),
291 ranges::reverse(ip1, last);
296 ranges::reverse(first, last);
336 ranges::reverse(ip1, last);
[all …]
|
| /dports/net-im/telegram-desktop/tdesktop-3.2.5-full/Telegram/ThirdParty/range-v3/include/range/v3/algorithm/ |
| H A D | permutation.hpp | 117 C pred = C{},
177 C pred = C{},
190 std::move(pred),
199 std::move(pred),
218 C pred = C{},
227 std::move(pred),
261 std::move(pred),
291 ranges::reverse(ip1, last);
296 ranges::reverse(first, last);
336 ranges::reverse(ip1, last);
[all …]
|
| /dports/devel/functionalplus/FunctionalPlus-0.2.18-p0/include/fplus/ |
| H A D | filter.hpp | 50 ContainerOut keep_if(Pred pred, Container&& xs) in keep_if() argument
53 pred, std::forward<Container>(xs)); in keep_if()
63 ContainerOut drop_if(Pred pred, Container&& xs) in drop_if() argument
110 if (internal::invoke(pred, idx++, x)) in keep_if_with_idx()
137 UnaryPredicate pred, Container&& xs) in keep_by_idx() argument
143 if (internal::invoke(pred, i++)) in keep_by_idx()
152 UnaryPredicate pred, const Container& xs) in keep_by_idx() argument
156 pred, std::move(ys)); in keep_by_idx()
171 pred, std::forward<Container>(xs)); in keep_by_idx()
351 return reverse(drop_while(p, reverse(xs)));
[all …]
|