| /dports/lang/racket-minimal/racket-8.3/src/expander/expand/ |
| H A D | free-id-set.rkt | 6 (provide free-id-set
7 empty-free-id-set
8 free-id-set-empty?
9 free-id-set-member?
12 ;; A free-id-set is a hash: sym -> list of id
14 (define (free-id-set phase ids)
19 (define empty-free-id-set (free-id-set 0 null))
21 (define (free-id-set-empty? fs)
22 (eq? fs empty-free-id-set))
24 (define (free-id-set-member? fs phase given-id)
[all …]
|
| /dports/lang/racket/racket-8.3/src/expander/expand/ |
| H A D | free-id-set.rkt | 6 (provide free-id-set
7 empty-free-id-set
8 free-id-set-empty?
9 free-id-set-member?
12 ;; A free-id-set is a hash: sym -> list of id
14 (define (free-id-set phase ids)
19 (define empty-free-id-set (free-id-set 0 null))
21 (define (free-id-set-empty? fs)
22 (eq? fs empty-free-id-set))
24 (define (free-id-set-member? fs phase given-id)
[all …]
|
| /dports/lang/racket/racket-8.3/share/pkgs/typed-racket-lib/typed-racket/rep/ |
| H A D | free-ids.rkt | 13 racket/set
32 [(Path: flds (? identifier? id))
34 (unless (member id ids free-identifier=?)
35 (set! ids (cons id ids)))]
53 (unless (member x visited free-identifier=?)
54 (set! visited (cons x visited))
58 (set! order (cons idx order))))
70 [(member x seen free-identifier=?) (cons x seen)]
75 (and (not (member neighbor visited free-identifier=?))
77 (set! visited (cons x visited)))]))
[all …]
|
| /dports/www/davical/davical-9da21ad116a2913bf788bd4b0b8c58c0de83d9da/testing/tests/regression-suite/ |
| H A D | 0548-iCal-PROPFIND.result | 55 <resource-id>
57 </resource-id>
102 <C1:calendar-free-busy-set/>
245 <C1:calendar-free-busy-set/>
372 <C1:calendar-free-busy-set/>
512 <C1:calendar-free-busy-set/>
646 <C1:calendar-free-busy-set/>
780 <C1:calendar-free-busy-set/>
920 <C1:calendar-free-busy-set/>
1062 <C1:calendar-free-busy-set/>
[all …]
|
| /dports/lang/racket/racket-8.3/share/pkgs/racket-doc/syntax/scribblings/ |
| H A D | id-set.scrbl | 91 @defproc[(free-id-set-member? [s free-id-set?] [v identifier?]) boolean?]{
92 Like @racket[set-member?].}
94 @defproc[(free-id-set=? [s1 free-id-set?] [s2 free-id-set?]) boolean?]{
114 @defproc[(free-id-set-rest [s immutable-free-id-set?]) immutable-free-id-set?]{
126 @defproc[(free-id-set-copy [s free-id-set?]) free-id-set?]{
129 @defproc[(free-id-set-copy-clear [s free-id-set?]) free-id-set?]{
132 @defproc[(free-id-set-clear [s immutable-free-id-set?]) immutable-free-id-set?]{
138 @defproc[(free-id-set-union [s0 immutable-free-id-set?] [s free-id-set?] ...)
142 @defproc[(free-id-set-union! [s0 mutable-free-id-set?] [s free-id-set?] ...)
155 @defproc[(free-id-set-subtract [s0 immutable-free-id-set?] [s free-id-set?] ...)
[all …]
|
| /dports/lang/racket-minimal/racket-8.3/collects/syntax/private/ |
| H A D | id-set.rkt | 10 ;; (fmt-set-id-fn-name #'free "empty?") => #'free-id-set-empty?
14 ;; (fmt-table-id-fn-name #'free "ref") => #'free-id-table-ref
24 ;; where type = free or bound
42 #:with id-set-member? (fmt-set-id-fn-name #'type "member?")
65 ;; these fns don't have the conventional (eg "free-id-set-") prefix
96 id-set-member?
127 (define (id-set-member? s x)
322 (equal-hash-code "hash code for free id sets"))
341 (define set-member? id-set-member?)
368 (define set-member? id-set-member?)
[all …]
|
| /dports/lang/racket/racket-8.3/collects/syntax/private/ |
| H A D | id-set.rkt | 10 ;; (fmt-set-id-fn-name #'free "empty?") => #'free-id-set-empty?
14 ;; (fmt-table-id-fn-name #'free "ref") => #'free-id-table-ref
24 ;; where type = free or bound
42 #:with id-set-member? (fmt-set-id-fn-name #'type "member?")
65 ;; these fns don't have the conventional (eg "free-id-set-") prefix
96 id-set-member?
127 (define (id-set-member? s x)
322 (equal-hash-code "hash code for free id sets"))
341 (define set-member? id-set-member?)
368 (define set-member? id-set-member?)
[all …]
|
| /dports/lang/racket/racket-8.3/share/pkgs/drracket-tool-lib/drracket/private/syncheck/ |
| H A D | contract-traversal.rkt | 20 (define already-jumped-ids (make-free-id-table))
124 (define binders (free-id-table-ref low-binders #'id (λ () #f)))
130 (define visited? (free-id-table-ref already-jumped-ids binder #f))
132 (free-id-table-set! already-jumped-ids binder #t)
133 (for ([rhs (in-list (free-id-table-ref binding-inits binder '()))])
178 [(set! a b)
248 (hash-set! coloring-plans
274 (define low-binders (make-free-id-table))
275 (define binding-inits (make-free-id-table))
282 (free-id-table-set! binding-inits #'x (list #'e)))
[all …]
|
| /dports/lang/racket-minimal/racket-8.3/collects/syntax/ |
| H A D | id-set.rkt | 7 (provide id-set/c free-id-set/c bound-id-set/c)
10 (or (free-id-set? s)
13 (or (mutable-free-id-set? s)
16 (or (immutable-free-id-set? s)
32 [(free) free-id-set?]
74 [(free) free-id-set?]
89 (unless (free-id-set? s)
131 [(immutable-free-id-set? s)
134 [(mutable-free-id-set? s)
170 #:with id-set-member? (fmt-set-id-fn-name #'type "member?")
[all …]
|
| /dports/lang/racket/racket-8.3/collects/syntax/ |
| H A D | id-set.rkt | 7 (provide id-set/c free-id-set/c bound-id-set/c)
10 (or (free-id-set? s)
13 (or (mutable-free-id-set? s)
16 (or (immutable-free-id-set? s)
32 [(free) free-id-set?]
74 [(free) free-id-set?]
89 (unless (free-id-set? s)
131 [(immutable-free-id-set? s)
134 [(mutable-free-id-set? s)
170 #:with id-set-member? (fmt-set-id-fn-name #'type "member?")
[all …]
|
| /dports/lang/racket/racket-8.3/share/pkgs/typed-racket-lib/typed-racket/static-contracts/ |
| H A D | constraints.rkt | 70 (define free-id-set? free-id-table?)
145 (define (free-id-set . elems)
148 (free-id-table-set table e #t)))
150 (define (free-id-set-union tables)
154 (free-id-table-set table k #t)))
160 (free-id-table-set table k v)))
163 (contract-restrict (kind-max (free-id-set) kind) (make-immutable-free-id-table) (set)))
165 (contract-restrict (kind-max (free-id-set var) 'flat) (make-immutable-free-id-table) (set)))
217 (free-id-table-set t name
230 (if (member id names)
[all …]
|
| H A D | optimize.rkt | 298 (define main-table (make-free-id-table))
300 (define table (make-free-id-table))
304 (free-id-table-set! table id #t)]
309 (free-id-table-set! main-table name ((search) value)))]
316 (define seen (make-free-id-table reachable))
319 (define new-table (make-free-id-table))
320 (for ([(id _) (in-free-id-table to-look-at)])
321 (for ([(id _) (in-free-id-table (free-id-table-ref main-table id))])
322 (unless (free-id-table-ref seen id #f)
323 (free-id-table-set! seen id #t)
[all …]
|
| /dports/lang/spidermonkey60/firefox-60.9.0/js/xpconnect/src/ |
| H A D | XPCJSID.cpp | 33 if (mNumber && mNumber != gNoString) free(mNumber); in ~nsJSID()
34 if (mName && mName != gNoString) free(mName); in ~nsJSID()
40 if (mNumber && mNumber != gNoString) free(mNumber); in Reset()
41 if (mName && mName != gNoString) free(mName); in Reset()
327 XPCNativeMember* member = iface->FindMember(id); in Resolve() local
328 if (member && member->IsConstant()) { in Resolve()
357 if (member && member->IsConstant() && in Enumerate()
392 target.set(o); in FindObjectForHasInstance()
400 target.set(nullptr); in FindObjectForHasInstance()
503 free(cid); in Initialize()
[all …]
|
| /dports/print/lilypond-devel/lilypond-2.23.5/ly/ |
| H A D | base-tkit.ly | 6 %%%% LilyPond is free software: you can redistribute it and/or modify
27 #(define (get-id str)
31 #(define (make-id a b)
34 (get-id (string-append a b)))
53 (lambda (id)
93 (member x '("Above" "Below")))
96 (member x '("Down" "Up" "")))
99 (member x voice-prefixes))
102 (or (member x lyrics-postfixes)
103 (member x lyrics-names)))
[all …]
|
| /dports/print/lilypond/lilypond-2.22.1/ly/ |
| H A D | base-tkit.ly | 6 %%%% LilyPond is free software: you can redistribute it and/or modify
27 #(define (get-id str)
31 #(define (make-id a b)
34 (get-id (string-append a b)))
53 (lambda (id)
93 (member x '("Above" "Below")))
96 (member x '("Down" "Up" "")))
99 (member x voice-prefixes))
102 (or (member x lyrics-postfixes)
103 (member x lyrics-names)))
[all …]
|
| /dports/lang/racket/racket-8.3/src/ChezScheme/nanopass/nanopass/ |
| H A D | helpers.ss | 14 bound-id-member? bound-id-union partition-syn datum
50 eq-hashtable-set! eq-hashtable-ref
196 (if (memp (lambda (var) (free-identifier=? var #'id)) vars)
214 (and (not (memp (lambda (x) (free-identifier=? x id)) ls))
308 (set! count (+ count 1))
377 #'(let-values ([(set ...)
380 (let ([set '()] ...) (values set ...))
384 (let ([set (cons (car ls) set)])
396 (define bound-id-member?
400 (bound-id-member? id (cdr id*))))))
[all …]
|
| /dports/lang/racket-minimal/racket-8.3/src/ChezScheme/nanopass/nanopass/ |
| H A D | helpers.ss | 14 bound-id-member? bound-id-union partition-syn datum
50 eq-hashtable-set! eq-hashtable-ref
196 (if (memp (lambda (var) (free-identifier=? var #'id)) vars)
214 (and (not (memp (lambda (x) (free-identifier=? x id)) ls))
308 (set! count (+ count 1))
377 #'(let-values ([(set ...)
380 (let ([set '()] ...) (values set ...))
384 (let ([set (cons (car ls) set)])
396 (define bound-id-member?
400 (bound-id-member? id (cdr id*))))))
[all …]
|
| /dports/lang/gnustep-base/libs-base-base-1_27_0/Source/ |
| H A D | NSHashTable.m | 8 * This library is free software; you can redistribute it and/or
89 id o;
135 return [self member: anObject] ? YES : NO;
186 if ([other member: object] == nil)
207 if ([other member: object] != nil)
234 if ([other member: object] == nil)
242 - (id) member: (id)object
292 NSMutableSet *set;
295 set = [NSMutableSet setWithCapacity: [self count]];
299 [set addObject: object];
[all …]
|
| /dports/lang/racket/racket-8.3/share/pkgs/plai-lib/gc2/ |
| H A D | mutator.rkt | 209 (with-syntax ([(free-id ...) (map syntax-local-introduce
226 #,(length (syntax->list #'(free-id ...)))
228 (lambda (free-id ... id ...)
241 (list (λ () free-id) ...)
242 (list (λ (v) (set! free-id v)) ...)))
248 (list (λ () free-id) ...)
249 (list (λ (v) (set! free-id v)) ...)))))))))]
306 (define is-set-fst? (free-identifier=? #'collector:set-first! #'fe))
307 (when (or is-set-fst? (free-identifier=? #'collector:set-rest! #'fe))
545 (define (member? v l)
[all …]
|
| /dports/devel/tcllib/tcllib-1.20/modules/stooop/ |
| H A D | README | 17 set ($this,diameter) $diameter
18 set ($this,canvas) $canvas
19 set ($this,id) [$canvas create oval 0 0 $diameter $diameter]
22 $($this,canvas) delete $($this,id)
25 $($this,canvas) move $($this,id) $x $y
30 set c [new circle .canvas 50]
38 (all member data is public), dynamic binding, nested classes, object
54 couple of Tcl lines are added to a member procedure definition.
56 member procedures preprocessing, but runtime overhead is kept to a
72 (at http://jfontain.free.fr/).
[all …]
|
| /dports/devel/tcllibc/tcllib-1.20/modules/stooop/ |
| H A D | README | 17 set ($this,diameter) $diameter
18 set ($this,canvas) $canvas
19 set ($this,id) [$canvas create oval 0 0 $diameter $diameter]
22 $($this,canvas) delete $($this,id)
25 $($this,canvas) move $($this,id) $x $y
30 set c [new circle .canvas 50]
38 (all member data is public), dynamic binding, nested classes, object
54 couple of Tcl lines are added to a member procedure definition.
56 member procedures preprocessing, but runtime overhead is kept to a
72 (at http://jfontain.free.fr/).
[all …]
|
| /dports/lang/chez-scheme/ChezScheme-9.5.4/nanopass/nanopass/ |
| H A D | helpers.ss | 14 bound-id-member? bound-id-union partition-syn datum
50 eq-hashtable-set! eq-hashtable-ref
212 (if (memp (lambda (var) (free-identifier=? var #'id)) vars)
230 (and (not (memp (lambda (x) (free-identifier=? x id)) ls))
333 (set! count (+ count 1))
402 #'(let-values ([(set ...)
405 (let ([set '()] ...) (values set ...))
409 (let ([set (cons (car ls) set)])
421 (define bound-id-member?
425 (bound-id-member? id (cdr id*))))))
[all …]
|
| /dports/www/firefox-legacy/firefox-52.8.0esr/js/xpconnect/src/ |
| H A D | XPCJSID.cpp | 37 free(mNumber); in ~nsJSID()
39 free(mName); in ~nsJSID()
47 free(mNumber); in Reset()
49 free(mName); in Reset()
148 mID = id; in InitWithName()
396 XPCNativeMember* member = iface->FindMember(id); in Resolve() local
397 if (member && member->IsConstant()) { in Resolve()
429 if (member && member->IsConstant() && in Enumerate()
478 target.set(obj); in FindObjectForHasInstance()
609 free(cid); in NewID()
[all …]
|
| /dports/lang/racket/racket-8.3/collects/racket/private/ |
| H A D | class-internal.rkt | 272 (do-localize orig-id #'validate-local-member))
1944 (define member-name (check-member-key 'id expr))
1947 (define (generate-local-member-name id)
1952 (define-values (struct:member-key make-member-key member-name-key? member-key-ref member-key-set!)
1959 (fprintf p "#<member-key:~a>" (member-key-id v)))))))
1961 (define member-key-id (make-struct-field-accessor member-key-ref 0))
1963 (define (check-member-key id v)
1969 (member-key-id v))
1991 (eq? (member-key-id a) (member-key-id b))
2000 (eq-hash-code (member-key-id a)))
[all …]
|
| /dports/lang/racket-minimal/racket-8.3/collects/racket/private/ |
| H A D | class-internal.rkt | 272 (do-localize orig-id #'validate-local-member))
1944 (define member-name (check-member-key 'id expr))
1947 (define (generate-local-member-name id)
1952 (define-values (struct:member-key make-member-key member-name-key? member-key-ref member-key-set!)
1959 (fprintf p "#<member-key:~a>" (member-key-id v)))))))
1961 (define member-key-id (make-struct-field-accessor member-key-ref 0))
1963 (define (check-member-key id v)
1969 (member-key-id v))
1991 (eq? (member-key-id a) (member-key-id b))
2000 (eq-hash-code (member-key-id a)))
[all …]
|