| /dports/lang/racket-minimal/racket-8.3/src/expander/common/ |
| H A D | set.rkt | 30 (define the-empty-hash #hash())
31 (define the-empty-hasheq #hasheq())
32 (define the-empty-hasheqv #hasheqv())
36 [() the-empty-hash]
37 [l (for/fold ([s the-empty-hash]) ([e (in-list l)])
41 [() the-empty-hasheq]
42 [l (for/fold ([s the-empty-hasheq]) ([e (in-list l)])
44 (define (seteqv) the-empty-hasheqv)
84 (define (set-partition s pred empty-y-set empty-n-set)
109 (for/hasheq bindings (values
[all …]
|
| /dports/lang/racket/racket-8.3/src/expander/common/ |
| H A D | set.rkt | 30 (define the-empty-hash #hash())
31 (define the-empty-hasheq #hasheq())
32 (define the-empty-hasheqv #hasheqv())
36 [() the-empty-hash]
37 [l (for/fold ([s the-empty-hash]) ([e (in-list l)])
41 [() the-empty-hasheq]
42 [l (for/fold ([s the-empty-hasheq]) ([e (in-list l)])
44 (define (seteqv) the-empty-hasheqv)
84 (define (set-partition s pred empty-y-set empty-n-set)
109 (for/hasheq bindings (values
[all …]
|
| /dports/lang/racket-minimal/racket-8.3/src/expander/compile/ |
| H A D | serialize-state.rkt | 17 ;; A `serialize-state` record is threaded through the construction of
20 (struct serialize-state (reachable-scopes ; the set of all reachable scopes
27 context-triples ; combinations of the previous three
48 (make-hasheq) ; props
54 ;; Seed intern tables for sets and hashes to use the canonical
55 ;; empty version for consistent sharing:
56 (define empty-seteq (seteq))
57 (hash-set! (serialize-state-scopes state) empty-seteq empty-seteq)
58 (hash-set! (serialize-state-shifted-multi-scopes state) empty-seteq empty-seteq)
59 (hash-set! (serialize-state-interned-props state) empty-seteq empty-seteq)
[all …]
|
| H A D | module.rkt | 37 #:modules-being-compiled [modules-being-compiled (make-hasheq)]
64 ;; Update the name in the compiled form and add in submodules.
107 (define empty-result-for-module->namespace? #f)
134 ;; the expand-time module path.
186 (for/hasheq ([(phase linklet) (in-hash body-linklets)])
213 ;; objects in the module.
254 `'empty]
260 ;; instantiations of the module, like the data linklet. It's
261 ;; separate from the data linklet so that the data linklet can be
353 … (for/fold ([ht (hasheq #f bundle)]) ([sm (in-list (append pre-submodules post-submodules))])
[all …]
|
| H A D | header.rkt | 16 syntax-literals-empty?
27 header-empty-syntax-literals?
66 (make-hasheq) ; binding-sym-to-define-sym
69 (make-hasheq) ; import-sym-to-extra-inspectors
71 (make-hasheq) ; define-and-import-syms
87 ;; start; for convenience, pair that position with the size of the
95 (define (syntax-literals-empty? sl)
140 [(syntax-literals-empty? sl)
174 [(syntax-literals-empty? sl)
207 (define (header-empty-syntax-literals? h)
[all …]
|
| /dports/lang/racket/racket-8.3/src/expander/compile/ |
| H A D | serialize-state.rkt | 17 ;; A `serialize-state` record is threaded through the construction of
20 (struct serialize-state (reachable-scopes ; the set of all reachable scopes
27 context-triples ; combinations of the previous three
48 (make-hasheq) ; props
54 ;; Seed intern tables for sets and hashes to use the canonical
55 ;; empty version for consistent sharing:
56 (define empty-seteq (seteq))
57 (hash-set! (serialize-state-scopes state) empty-seteq empty-seteq)
58 (hash-set! (serialize-state-shifted-multi-scopes state) empty-seteq empty-seteq)
59 (hash-set! (serialize-state-interned-props state) empty-seteq empty-seteq)
[all …]
|
| H A D | module.rkt | 37 #:modules-being-compiled [modules-being-compiled (make-hasheq)]
64 ;; Update the name in the compiled form and add in submodules.
107 (define empty-result-for-module->namespace? #f)
134 ;; the expand-time module path.
186 (for/hasheq ([(phase linklet) (in-hash body-linklets)])
213 ;; objects in the module.
254 `'empty]
260 ;; instantiations of the module, like the data linklet. It's
261 ;; separate from the data linklet so that the data linklet can be
353 … (for/fold ([ht (hasheq #f bundle)]) ([sm (in-list (append pre-submodules post-submodules))])
[all …]
|
| H A D | header.rkt | 16 syntax-literals-empty?
27 header-empty-syntax-literals?
66 (make-hasheq) ; binding-sym-to-define-sym
69 (make-hasheq) ; import-sym-to-extra-inspectors
71 (make-hasheq) ; define-and-import-syms
87 ;; start; for convenience, pair that position with the size of the
95 (define (syntax-literals-empty? sl)
140 [(syntax-literals-empty? sl)
174 [(syntax-literals-empty? sl)
207 (define (header-empty-syntax-literals? h)
[all …]
|
| /dports/lang/racket/racket-8.3/share/pkgs/typed-racket-lib/typed-racket/rep/ |
| H A D | free-variance.rkt | 19 empty-free-vars
34 ;; this file contains support for calculating the free variables/indexes of types
47 ;; not really a variance, but is disjoint with the others
81 (combined-frees (hasheq name variance) null))
83 (define empty-free-vars
84 (combined-frees (hasheq) null))
96 (for/hasheq (((k v) hash))
107 (for/hasheq ([name (free-vars-names frees)])
113 (for/hasheq ([name (free-vars-names frees)])
120 (for/fold ([hash (hasheq)]
[all …]
|
| /dports/lang/racket-minimal/racket-8.3/src/schemify/ |
| H A D | lift.rkt | 20 ;; variables of the function and the closure
33 ;; mapped to '#:empty, meaning that the closure is empty relative to the
52 (define empty-frees+binds (cons #hasheq() #hasheq()))
191 (find-seq-loops body lifts #hasheq() #hasheq())
307 (record-empty-closure! lifts v))
622 ;; Copy over empty-closure records:
624 (when (eq? info '#:empty)
649 (lift-if-empty
653 (lift-if-empty
897 (define (record-empty-closure! lifts v)
[all …]
|
| H A D | interp-stack.rkt | 6 (provide empty-stack
25 (define empty-stack empty-intmap)
33 ;; the accessed binding, so the binding should be
80 #:closure-map [closure-map #hasheq()]
85 (and track-use? #hasheq())
90 ;; index. If this this access is the last one --- which is the first
91 ;; lookup of `i`, since the compiler works from the end toward earlier
93 ;; removal of the binding after the lookup at run time.
112 ;; Record the use of this position. If it's the last use (i.e.,
138 #hasheq()
[all …]
|
| /dports/lang/racket/racket-8.3/src/schemify/ |
| H A D | lift.rkt | 20 ;; variables of the function and the closure
33 ;; mapped to '#:empty, meaning that the closure is empty relative to the
52 (define empty-frees+binds (cons #hasheq() #hasheq()))
191 (find-seq-loops body lifts #hasheq() #hasheq())
307 (record-empty-closure! lifts v))
622 ;; Copy over empty-closure records:
624 (when (eq? info '#:empty)
649 (lift-if-empty
653 (lift-if-empty
897 (define (record-empty-closure! lifts v)
[all …]
|
| H A D | interp-stack.rkt | 6 (provide empty-stack
25 (define empty-stack empty-intmap)
33 ;; the accessed binding, so the binding should be
80 #:closure-map [closure-map #hasheq()]
85 (and track-use? #hasheq())
90 ;; index. If this this access is the last one --- which is the first
91 ;; lookup of `i`, since the compiler works from the end toward earlier
93 ;; removal of the binding after the lookup at run time.
112 ;; Record the use of this position. If it's the last use (i.e.,
138 #hasheq()
[all …]
|
| /dports/lang/racket-minimal/racket-8.3/src/expander/syntax/ |
| H A D | syntax.rkt | 19 empty-syntax
31 empty-props
94 (for/hasheq ([(k v) (in-hash (syntax-props s))]
222 (define empty-props #hasheq())
224 (define empty-syntax
230 empty-props
242 (define-place-local known-syntax-pairs (make-weak-hasheq))
329 (hasheq 'cycle-fail
336 (set! known-syntax-pairs (make-weak-hasheq)))
362 ;; Called by the deserializer
[all …]
|
| /dports/lang/racket/racket-8.3/src/expander/syntax/ |
| H A D | syntax.rkt | 19 empty-syntax
31 empty-props
94 (for/hasheq ([(k v) (in-hash (syntax-props s))]
222 (define empty-props #hasheq())
224 (define empty-syntax
230 empty-props
242 (define-place-local known-syntax-pairs (make-weak-hasheq))
329 (hasheq 'cycle-fail
336 (set! known-syntax-pairs (make-weak-hasheq)))
362 ;; Called by the deserializer
[all …]
|
| /dports/lang/racket/racket-8.3/share/pkgs/htdp-lib/lang/private/ |
| H A D | advanced-funs.rkt | 43 (define heq (make-hasheq list-for-hash))
46 (define ieq (make-immutable-hasheq list-for-hash))
124 Formats the rest of the arguments according to the first argument and print it. }
263 @defproc[((advanced-make-hasheq make-hasheq)) (hash X Y)]{
267 (make-hasheq)
268 (make-hasheq '((b 69) (e 61) (i 999)))
287 @defproc[((advanced-make-immutable-hasheq make-immutable-hasheq)) (hash X Y)]{
291 (make-immutable-hasheq)
292 (make-immutable-hasheq '((b 69) (e 61) (i 999)))
319 the key does not have an mapping, the third argument is used as the
[all …]
|
| /dports/lang/racket/racket-8.3/src/expander/expand/ |
| H A D | binding-for-transformer.rkt | 11 ;; Determine whether `b`, which is the binding of `id` at `at-phase`,
18 ;; consulting the exporting module
21 …efine b/p (hash-ref (hash-ref (module-provides m) (module-binding-nominal-phase+space b) #hasheq())
26 ;; Use `binding-lookup` to both check for taints and determine whether the
30 (binding-lookup b empty-env null ns at-phase id))
|
| /dports/lang/racket-minimal/racket-8.3/src/expander/expand/ |
| H A D | binding-for-transformer.rkt | 11 ;; Determine whether `b`, which is the binding of `id` at `at-phase`,
18 ;; consulting the exporting module
21 …efine b/p (hash-ref (hash-ref (module-provides m) (module-binding-nominal-phase+space b) #hasheq())
26 ;; Use `binding-lookup` to both check for taints and determine whether the
30 (binding-lookup b empty-env null ns at-phase id))
|
| /dports/lang/racket-minimal/racket-8.3/src/cify/ |
| H A D | simple.rkt | 20 ;; reference is the final reference to a variable (which may imply
39 ;; the reference to avoid relying on an order within the simple
43 (let loop ([e e] [saw #hasheq()] [shared #hasheq()])
57 (unless (hash-empty? shared)
64 (unless (hash-empty? shared)
|
| /dports/lang/racket/racket-8.3/src/cify/ |
| H A D | simple.rkt | 20 ;; reference is the final reference to a variable (which may imply
39 ;; the reference to avoid relying on an order within the simple
43 (let loop ([e e] [saw #hasheq()] [shared #hasheq()])
57 (unless (hash-empty? shared)
64 (unless (hash-empty? shared)
|
| /dports/lang/racket/racket-8.3/src/cs/rumble/ |
| H A D | hash.ss | 43 (define/who make-hasheq
87 [(_ vararg-ctor list-ctor empty-hash)
91 [() empty-hash]
93 (let loop ([kvs kvs] [h empty-hash])
105 [() empty-hash]
119 (define-hash-constructors hasheq make-immutable-hasheq empty-hasheq)
247 [(hash-eq? ht) empty-hasheq]
248 [(hash-eqv? ht) empty-hasheqv]
249 [else empty-hash])]
469 ;; Inline iteration over the internal vector to avoid the overhead
[all …]
|
| H A D | place.ss | 2 ;; The vector of place locals is similar to the set of virtual
3 ;; registers, but the array can be shared by multiple Scheme threads
4 ;; that are all in the same place.
6 ;; The first slot in the vector holds a hash table for allocated
7 ;; place-local values, the last is used by "async-callback.ss", and
8 ;; the rest are used by the thread, io, etc., layers for directly
21 (#%vector-set! (place-registers) LOCAL_TABLE-INDEX (make-weak-hasheq)))
70 (let ([ht (make-hasheq)])
88 (root-thread-cell-values (make-empty-thread-cell-values))
|
| /dports/lang/racket-minimal/racket-8.3/src/cs/rumble/ |
| H A D | hash.ss | 43 (define/who make-hasheq
87 [(_ vararg-ctor list-ctor empty-hash)
91 [() empty-hash]
93 (let loop ([kvs kvs] [h empty-hash])
105 [() empty-hash]
119 (define-hash-constructors hasheq make-immutable-hasheq empty-hasheq)
247 [(hash-eq? ht) empty-hasheq]
248 [(hash-eqv? ht) empty-hasheqv]
249 [else empty-hash])]
469 ;; Inline iteration over the internal vector to avoid the overhead
[all …]
|
| H A D | place.ss | 2 ;; The vector of place locals is similar to the set of virtual
3 ;; registers, but the array can be shared by multiple Scheme threads
4 ;; that are all in the same place.
6 ;; The first slot in the vector holds a hash table for allocated
7 ;; place-local values, the last is used by "async-callback.ss", and
8 ;; the rest are used by the thread, io, etc., layers for directly
21 (#%vector-set! (place-registers) LOCAL_TABLE-INDEX (make-weak-hasheq)))
70 (let ([ht (make-hasheq)])
88 (root-thread-cell-values (make-empty-thread-cell-values))
|
| /dports/lang/racket/racket-8.3/share/pkgs/mzscheme-doc/mzscheme/ |
| H A D | mzscheme.scrbl | 13 make-base-empty-namespace
14 make-hash make-hasheq make-weak-hash make-weak-hasheq
16 make-immutable-hasheq
244 the field for an instance causes the instance to accept keyword
334 @defproc[(make-namespace [mode (one-of/c 'initial 'empty) 'initial]) namespace?]{
337 @racket[mode] is empty, the namespace's top-level environment is left
338 empty. If @racket[mode] is @racket['initial], then the namespace's
341 @racket[make-base-empty-namespace].}
388 @racket[make-weak-hasheq], or @racket[make-weak-hasheqv].}
401 created with @racket[make-hasheq]). If @racket[flag2] is
[all …]
|