/dports/lang/racket-minimal/racket-8.3/src/expander/syntax/ |
H A D | syntax.rkt | 53 scopes ; scopes that apply at all phases 105 (define stx-state (get-syntax-context state)) 116 (when stx-state (set-syntax-state-all-sharing?! stx-state #f))] 119 (define sharing-mode (hash-ref (serialize-state-sharing-syntaxes state) s 'unknown)) 132 ;; Check whether we're sharing for all nested syntax objects 136 (syntax-state-all-sharing? this-state)) 139 (hash-set! (serialize-state-sharing-syntaxes state) 146 (when (and stx-state (eq? new-sharing-mode 'none)) 147 (set-syntax-state-all-sharing?! stx-state #f))] 159 (set-syntax-state-all-sharing?! stx-state #f)))])) [all …]
|
H A D | bulk-binding.rkt | 3 "../compile/serialize-state.rkt" 24 ;; fast step, and we'd like to share the information in syntax objects 25 ;; from many different modules that all import `racket/base`. A 26 ;; "bulk binding" implements that fast binding and sharing. 28 ;; The difficult part is restoring sharing when a syntax object is 33 ;; module is loaded before a syntax object with a bulk binding is used. 136 (lambda (b ser-push! state) 138 [(and (serialize-state-keep-provides? state) 139 ((serialize-state-keep-provides? state) b)) 170 (apply-syntax-shifts [all …]
|
H A D | scope.rkt | 94 (lambda (s ser-push! state) 95 (unless (set-member? (serialize-state-reachable-scopes state) s) 149 (unless (set-member? (serialize-state-reachable-scopes state) s) 178 (define multi-scope-tables (serialize-state-multi-scope-tables state)) 318 ;; A shared "outside-edge" scope for all top-level contexts 645 ;; Improve sharing if the result matches the parent: 665 ;; Improve sharing if the result clearly matches the parent: 789 (define-memo-lite (shift-all smss) 803 (shift-all (syntax-shifted-multi-scopes s))])) 921 ;; As we look through all scopes, if we find two where neither [all …]
|
/dports/lang/racket/racket-8.3/src/expander/syntax/ |
H A D | syntax.rkt | 53 scopes ; scopes that apply at all phases 105 (define stx-state (get-syntax-context state)) 116 (when stx-state (set-syntax-state-all-sharing?! stx-state #f))] 119 (define sharing-mode (hash-ref (serialize-state-sharing-syntaxes state) s 'unknown)) 132 ;; Check whether we're sharing for all nested syntax objects 136 (syntax-state-all-sharing? this-state)) 139 (hash-set! (serialize-state-sharing-syntaxes state) 146 (when (and stx-state (eq? new-sharing-mode 'none)) 147 (set-syntax-state-all-sharing?! stx-state #f))] 159 (set-syntax-state-all-sharing?! stx-state #f)))])) [all …]
|
H A D | bulk-binding.rkt | 3 "../compile/serialize-state.rkt" 24 ;; fast step, and we'd like to share the information in syntax objects 25 ;; from many different modules that all import `racket/base`. A 26 ;; "bulk binding" implements that fast binding and sharing. 28 ;; The difficult part is restoring sharing when a syntax object is 33 ;; module is loaded before a syntax object with a bulk binding is used. 136 (lambda (b ser-push! state) 138 [(and (serialize-state-keep-provides? state) 139 ((serialize-state-keep-provides? state) b)) 170 (apply-syntax-shifts [all …]
|
H A D | scope.rkt | 94 (lambda (s ser-push! state) 95 (unless (set-member? (serialize-state-reachable-scopes state) s) 149 (unless (set-member? (serialize-state-reachable-scopes state) s) 178 (define multi-scope-tables (serialize-state-multi-scope-tables state)) 318 ;; A shared "outside-edge" scope for all top-level contexts 645 ;; Improve sharing if the result matches the parent: 665 ;; Improve sharing if the result clearly matches the parent: 789 (define-memo-lite (shift-all smss) 803 (shift-all (syntax-shifted-multi-scopes s))])) 921 ;; As we look through all scopes, if we find two where neither [all …]
|
/dports/lang/racket-minimal/racket-8.3/src/expander/compile/ |
H A D | serialize-state.rkt | 20 (struct serialize-state (reachable-scopes ; the set of all reachable scopes 31 … sharing-syntaxes ; record which syntax objects are `datum->syntax` form 51 (make-hasheq) ; sharing-syntaxes 55 ;; empty version for consistent sharing: 102 (define (intern-properties all-props get-preserved-props state) 103 (define v (hash-ref (serialize-state-props state) all-props 'no)) 115 (hash-set! (serialize-state-props state) all-props p) 120 (define b (serialize-state-syntax-context state)) 123 (define (get-syntax-context state) 124 (define b (serialize-state-syntax-context state)) [all …]
|
H A D | serialize.rkt | 5 "serialize-state.rkt" 36 ;; To support sharing and cycles, serialized data is represented by: 53 ;; quoted data (that's non-cyclic and with no internal sharing). A few 68 ;; In addition to all the complexities of detecting sharing and cycles 288 (define state (make-serialize-state reachable-scopes 301 ;; Build table of sharing and mutable values 312 ;; no need to find sharing 320 ;; Assume no sharing in non-mutable part 322 ((serialize-fill!-ref v) v add-frontier! state)] 328 state)] [all …]
|
/dports/lang/racket/racket-8.3/src/expander/compile/ |
H A D | serialize-state.rkt | 20 (struct serialize-state (reachable-scopes ; the set of all reachable scopes 31 … sharing-syntaxes ; record which syntax objects are `datum->syntax` form 51 (make-hasheq) ; sharing-syntaxes 55 ;; empty version for consistent sharing: 102 (define (intern-properties all-props get-preserved-props state) 103 (define v (hash-ref (serialize-state-props state) all-props 'no)) 115 (hash-set! (serialize-state-props state) all-props p) 120 (define b (serialize-state-syntax-context state)) 123 (define (get-syntax-context state) 124 (define b (serialize-state-syntax-context state)) [all …]
|
H A D | serialize.rkt | 5 "serialize-state.rkt" 36 ;; To support sharing and cycles, serialized data is represented by: 53 ;; quoted data (that's non-cyclic and with no internal sharing). A few 68 ;; In addition to all the complexities of detecting sharing and cycles 288 (define state (make-serialize-state reachable-scopes 301 ;; Build table of sharing and mutable values 312 ;; no need to find sharing 320 ;; Assume no sharing in non-mutable part 322 ((serialize-fill!-ref v) v add-frontier! state)] 328 state)] [all …]
|
/dports/science/gromacs/gromacs-2021.4/docs/release-notes/2020/ |
H A D | 2020.1.rst | 6 previous 2020 version, to fix known issues. It also incorporates all 13 Also, please use the syntax :issue:`number` to reference issues on GitLab, without the 83 Add fatal error for mdrun -multidir when simulations sharing state start at different step 86 When (re)starting mdrun -multidir for simulations sharing state data 87 (e.g., replica exchange, AWH with bias sharing or NMR ensemble averaging) 131 Fix checkpoint files getting out of sync with simulations sharing data 134 When simulations share data, e.g., replica exchange, AWH with bias sharing 138 have temporary names, but all content will be in sync.
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/nearby/src/proto/ |
H A D | sharing_enums.proto | 15 syntax = "proto2"; 17 package location.nearby.proto.sharing; 28 NearbyClearcutLogger for all events (may exclude settings), and session_id for a 39 // User enables/disables nearby sharing from setting or tile service. 111 // Local devices all Fast Share server. 167 // Status of nearby sharing. 294 // The Fast Share server response state.
|
/dports/editors/joe/joe-4.6/syntax/ |
H A D | sml.jsf | 1 # JOE syntax highlight file for SML 4 # (This is the "assembly language" of syntax highlighting. A separate 5 # program could be used to convert a regular expression NFA syntax into this 8 # Each state begins with ':<name> <color-name>' 12 # The first state defined is the initial state. 15 # jump has the form: <character-list> <target-state> [<option>s] 32 # target-state. For example once /* is recognized as the 55 # "string" <target-state> [<options>s] 56 # "string" <target-state> [<options>s] 59 # (all of the options above are allowed except "strings", "istrings" and "noeat". noeat is [all …]
|
/dports/devel/py-hg-evolve/hg-evolve-10.4.1/docs/ |
H A D | user-guide.rst | 41 which we'll see when we get to `sharing mutable history`_.) 43 .. _`sharing mutable history`: sharing.html 63 not too serious if all you did was fix a syntax error, but for deeper 173 known good state if one step goes badly. :: 202 all with a single *successor*. 235 that you can do this using the exact same command-line syntax as core 358 .. _`sharing mutable history`: sharing.html 391 descendants of 11—are in a funny state: they are *orphan*. 415 The end state, after ``evolve`` finishes, is that the original 559 not solve all the world's problems. [all …]
|
/dports/science/dynare/dynare-4.6.4/preprocessor/doc/preprocessor/ |
H A D | preprocessor.tex | 197 \item \texttt{(1+3)*2; 4+5;} will pass the syntax analysis without error 378 \item sub-expression sharing 428 \frametitle{Sub-expression sharing (1/2)} 434 \includegraphics[width=7cm]{expr-sharing.png} 440 \frametitle{Sub-expression sharing (2/2)} 507 \item syntax errors 579 \item Finally, calls \texttt{Statement::computingPass()} on all statements 602 \item Static model used to characterize the steady state 656 \item caching is useful because of sub-expression sharing 741 \item one for the steady state file (if relevant) [all …]
|
/dports/devel/tcllib/tcllib-1.20/modules/grammar_me/ |
H A D | ChangeLog | 66 * me_cpu.testsuite: Replaced deprecated {expand} syntax in 71 * me_ast.man: Fixed all warnings due to use of now deprecated 104 * grammar_me/me_cpu.man: Lifted all changes to the cpucore into 108 template, and sharing the instruction descriptions with it. 126 * me_cpucore.tcl: Bug fixes, additional state accessor commands, 128 used by disassembler and state creation. 196 the full state of the ME vm when running the testsuite.
|
/dports/devel/tcllibc/tcllib-1.20/modules/grammar_me/ |
H A D | ChangeLog | 66 * me_cpu.testsuite: Replaced deprecated {expand} syntax in 71 * me_ast.man: Fixed all warnings due to use of now deprecated 104 * grammar_me/me_cpu.man: Lifted all changes to the cpucore into 108 template, and sharing the instruction descriptions with it. 126 * me_cpucore.tcl: Bug fixes, additional state accessor commands, 128 used by disassembler and state creation. 196 the full state of the ME vm when running the testsuite.
|
/dports/lang/yap/yap-6.2.2/packages/RDF/ |
H A D | ChangeLog | 3 * MODIFIED: Dropped support for old RDF Bag/Alt/Seq syntax. 20 * FIXED: handle rdf:datatype earlier (compliant to the revised RDF syntax 36 …* CLEANUP: Removed all trailing whitespace from all source-files. This avoids many GIT (merge) wa… 63 * INSTALL: Remove all configure files from the git repository 179 * FIXED: sharing code for blank nodes. Broken in recent cleanup. 190 keeping track of the state for process_rdf/3.
|
/dports/lang/racket/racket-8.3/collects/racket/private/ |
H A D | promise.rkt | 6 (for-syntax '#%kernel 35 (define-syntax pref (syntax-rules () [(_ p ) (unsafe-struct-ref p 0 )])) 36 (define-syntax pset! (syntax-rules () [(_ p x) (unsafe-struct-set! p 0 x)])) 53 ;; practical uses of these things could be ones that use state to avoid 82 ;; follow all sharings (and shortcut directly to the right force) 145 [(promise? v) (loop (pref v))] ; hide sharing 176 ;; First, a generic struct, which is used for all promise-like values 190 (define-for-syntax stepper-syntax-property 206 ;; template for all delay-like constructs 208 (begin-for-syntax [all …]
|
/dports/lang/racket-minimal/racket-8.3/collects/racket/private/ |
H A D | promise.rkt | 6 (for-syntax '#%kernel 35 (define-syntax pref (syntax-rules () [(_ p ) (unsafe-struct-ref p 0 )])) 36 (define-syntax pset! (syntax-rules () [(_ p x) (unsafe-struct-set! p 0 x)])) 53 ;; practical uses of these things could be ones that use state to avoid 82 ;; follow all sharings (and shortcut directly to the right force) 145 [(promise? v) (loop (pref v))] ; hide sharing 176 ;; First, a generic struct, which is used for all promise-like values 190 (define-for-syntax stepper-syntax-property 206 ;; template for all delay-like constructs 208 (begin-for-syntax [all …]
|
/dports/math/rumur/rumur-2021.09.29/doc/ |
H A D | intro-to-murphi.rst | 3 The input syntax accepted by Rumur is a variant of a language called “Murphi” 12 1. Definitions of constants, types and state variables; 89 constants, all the basic types, and how to define state variables. The keywords 142 -- all philosophers start dinner hungry and empty handed 149 -- so all forks are unheld 276 invariant "no fork sharing" 322 -- all philosophers start dinner hungry and empty handed 329 -- so all forks are unheld 401 invariant "no fork sharing" 718 -- so all forks are unheld [all …]
|
/dports/lang/racket/racket-8.3/doc/mzlib/ |
H A D | blueboxes.rktd | 3 syntax 7 ((state-variable init-expr) ...) 57 syntax 130 syntax 147 syntax 158 syntax 339 | #:all-keys id 498 cycles-only? : any/c = (show-sharing) 511 (show-sharing) -> boolean? 512 (show-sharing show?) -> void? [all …]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/chromeos/services/device_sync/proto/ |
H A D | cryptauth_devicesync.proto | 30 // * Request: The client queries CryptAuth for the state of features on the 36 // * Request: The client requests CryptAuth to set the state of various features 38 // meaning enabled on one device and disabled on all others. 43 // * Response: The state of activity for the user's devices. This includes if 45 syntax = "proto3"; 99 // If not set, all metadata will be sent. 129 // Public key associated with the group, used to encrypt all metadata. 174 // The server's response to sharing the group's private key. 210 // Leave unset if all group devices should be queried. 245 // The status of all queried group devices. [all …]
|
/dports/devel/sccache/sccache-0.2.15/cargo-crates/async-std-1.8.0/docs/src/concepts/ |
H A D | futures.md | 9 Luckily, concurrent Rust already has two well-known and effective concepts abstracting over sharing… 15 - `Sync` is about *sharing data* between two concurrent parts of a program. This is another common … 17 …s. At the point of implementation, you only need to know which method of sharing is appropriate fo… 23 …ly abstract over important properties of concurrent programs, their data sharing. It does so in a … 41 Remember the talk about "deferred computation" in the intro? That's all it is. Instead of telling t… 61 Note that this return value talks about the past. The past has a drawback: all decisions have been … 63 …amentally incompatible with looking at the results of previous computation all the time. So, let's… 94 - It provides a function called `poll`, which allows us to check on the state of the current comput… 107 …nconvenient to build and describe them. For this, Rust now has a special syntax: `async`. The exam… 127 … code will wait until the requested action (e.g. opening a file or reading all data in it) is fini… [all …]
|
/dports/games/genact/genact-0.10.0/cargo-crates/async-std-1.6.3/docs/src/concepts/ |
H A D | futures.md | 9 Luckily, concurrent Rust already has two well-known and effective concepts abstracting over sharing… 15 - `Sync` is about *sharing data* between two concurrent parts of a program. This is another common … 17 …s. At the point of implementation, you only need to know which method of sharing is appropriate fo… 23 …ly abstract over important properties of concurrent programs, their data sharing. It does so in a … 41 Remember the talk about "deferred computation" in the intro? That's all it is. Instead of telling t… 61 Note that this return value talks about the past. The past has a drawback: all decisions have been … 63 …amentally incompatible with looking at the results of previous computation all the time. So, let's… 94 - It provides a function called `poll`, which allows us to check on the state of the current comput… 107 …nconvenient to build and describe them. For this, Rust now has a special syntax: `async`. The exam… 127 … code will wait until the requested action (e.g. opening a file or reading all data in it) is fini… [all …]
|