" interpolate>string ;
: can-be-null? ( -- ? )
- "sql-spec" get modifiers>> [ +not-null+ = ] any? not ;
+ "sql-spec" get modifiers>> [ +not-null+ = ] none? ;
: delete-cascade? ( -- ? )
"sql-spec" get modifiers>> { +on-delete+ +cascade+ } swap subseq? ;
CONSTANT: wheel-2-3-5-7 $[
11 dup 210 + [a,b] [
- { 2 3 5 7 } [ divisor? ] with any? not
+ { 2 3 5 7 } [ divisor? ] with none?
] B{ } filter-as differences
]
] [
r <iota> [
2^ s * a swap n ^mod n-1 =
- ] any? not
+ ] none?
] if
- ] any? not ;
+ ] none? ;
PRIVATE>
elements>> filter-hidden dup length 1 = [
first build-locals
] [
- dup [ ebnf-var? ] any? not [
+ dup [ ebnf-var? ] none? [
drop
] [
[
: before-main? ( -- ? )
xml-stack get {
[ length 1 = ]
- [ first second [ tag? ] any? not ]
+ [ first second [ tag? ] none? ]
} 1&& ;
M: directive process
ERROR: topological-sort-failed ;
: largest-class ( seq -- n elt )
- dup [ [ class< ] with any? not ] curry find-last
+ dup [ [ class< ] with none? ] curry find-last
[ topological-sort-failed ] unless* ;
: sort-classes ( seq -- newseq )
{ [ dup empty? ] [ 2drop ] }
{ [ dup [ length 4 <= ] [ [ word? ] any? ] bi or ] [ drop linear-case-quot ] }
{ [ dup contiguous-range? ] [ drop dispatch-case-quot ] }
- { [ dup [ wrapper? ] any? not ] [ drop hash-case-quot ] }
+ { [ dup [ wrapper? ] none? ] [ drop hash-case-quot ] }
{ [ dup [ wrapper? ] all? ] [ drop [ [ wrapped>> ] dip ] assoc-map hash-case-quot ] }
[ drop linear-case-quot ]
} cond ;
: forward-reference? ( word -- ? )
dup old-definitions get [ in? ] with any? [
- new-definitions get [ in? ] with any? not
+ new-definitions get [ in? ] with none?
] [ drop f ] if ;
SYMBOL: compiler-impl
parser prettyprint.custom sequences sequences.deep ;
IN: arrays.shaped
-: flat? ( array -- ? ) [ sequence? ] any? not ; inline
+: flat? ( array -- ? ) [ sequence? ] none? ; inline
GENERIC: array-replace ( object -- shape )
: include-file-name? ( name -- ? )
{
- [ path-components [ "." head? ] any? not ]
+ [ path-components [ "." head? ] none? ]
[ link-info regular-file? ]
} 1&& ;
a n jacobi n mod'
a n 1 - 2 /i n ^mod = not
] if
- ] any? not ;
+ ] none? ;
PRIVATE>
{ [ lost? ] [ won? ] } 1|| ;
: new-game? ( cells -- ? )
- [ [ state>> +clicked+ = ] any? ] any? not ;
+ [ [ state>> +clicked+ = ] any? ] none? ;
DEFER: click-cell-at
! Part II: Topologically sorting specializers
: maximal-element ( seq quot -- n elt )
dupd [
- swapd [ call +lt+ = ] 2curry any? not
+ swapd [ call +lt+ = ] 2curry none?
] 2curry find [ "Topological sort failed" throw ] unless* ;
inline
: possible? ( seq -- ? )
dup length 1 > [
- [ even? ] any? not
+ [ even? ] none?
] [
drop t
] if ;