| /aosp_15_r20/external/python/cpython2/PC/VS7.1/ |
| D | python20.wse | 10 End Gradient=0 128 0
23 EXE Filename=Python-2.4a1.exe
27 Version Copyright=�2001-2007 Python Software Foundation
46 Variable Description4=System directory (where to find MSVCRT.DLL)
63 Variable Description7=When 0, we never try to write under HKLM,
76 end
80 end
82 end
85 end
88 end
[all …]
|
| /aosp_15_r20/external/antlr/runtime/Ruby/lib/antlr3/ |
| H A D | recognizers.rb | 2 # encoding: utf-8
7 Copyright (c) 2009-2010 Kyle Yetter
19 3. The name of the author may not be used to endorse or promote products
23 IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
27 NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
33 =end
56 A big Struct-based class containing most of the data that makes up a
73 set to a hash mapping previously parsed rules to cached indices
91 =end
95 super( [], false, -1, 0, nil, 0, nil, -1 )
[all …]
|
| H A D | main.rb | 2 # encoding: utf-8
6 Copyright (c) 2009-2010 Kyle Yetter
18 3. The name of the author may not be used to endorse or promote products
22 IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
26 NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
32 =end
43 =end
50 Defines command-line options and attribute mappings shared by all types of
53 =end
56 # the input encoding type; defaults to +nil+ (currently, not used)
[all …]
|
| H A D | tree.rb | 2 # encoding: utf-8
7 Copyright (c) 2009-2010 Kyle Yetter
19 3. The name of the author may not be used to endorse or promote products
23 IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
27 NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
33 =end
41 Name space containing all of the entities pertaining to tree construction and
44 =end
59 TreeParser is the default base class of ANTLR-generated tree parsers. The class
60 tailors the functionality provided by Recognizer to the task of tree-pattern
[all …]
|
| /aosp_15_r20/external/bcc/src/lua/bpf/ |
| H A D | bpf.lua | 1 --[[
8 http://www.apache.org/licenses/LICENSE-2.0
10 Unless required by applicable law or agreed to in writing, software
16 -- LuaJIT to BPF bytecode compiler.
17 --
18 -- The code generation phase is currently one-pass and produces:
19 -- * Compiled code in BPF bytecode format (https://www.kernel.org/doc/Documentation/networking/filt…
20 -- * Variables with liveness analysis and other meta (spill information, compile-time value)
21 --
22 -- The code generator optimises as much as possible in single pass:
[all …]
|
| /aosp_15_r20/external/antlr/runtime/Delphi/Sources/Antlr3.Runtime/ |
| H A D | Antlr.Runtime.pas | 5 Copyright (c) 2005-2007 Kunle Odutola
17 3. The name of the author may not be used to endorse or promote products
20 submitted for inclusion in this work to the copyright owner or licensor
25 IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
29 NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
39 {$MESSAGE ERROR 'You need Delphi 2009 or higher to use the Antlr runtime'}
51 TCharStreamConstants = (cscEOF = -1);
62 ['{6B851BDB-DD9C-422B-AD1E-567E52D2654F}']
74 /// Negative indexes are allowed. LA(-1) is previous token (token just matched).
75 /// LA(-i) where i is before first token should yield -1, invalid char or EOF.
[all …]
|
| H A D | Antlr.Runtime.Tree.pas | 5 Copyright (c) 2005-2007 Kunle Odutola
17 3. The name of the author may not be used to endorse or promote products
20 submitted for inclusion in this work to the copyright owner or licensor
25 IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
29 NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
39 {$MESSAGE ERROR 'You need Delphi 2009 or higher to use the Antlr runtime'}
51 /// How to create and navigate trees. Rather than have a separate factory
52 /// and adaptor, I've merged them. Makes sense to encapsulate.
57 /// I do not need to know the type of a tree at all so they are all
61 ['{F9DEB286-F555-4CC8-A51A-93F3F649B248}']
[all …]
|
| /aosp_15_r20/external/rust/android-crates-io/crates/grpcio-sys/grpc/third_party/upb/third_party/lunit/ |
| D | lunit.lua | 1 --[[--------------------------------------------------------------------------
9 Copyright (c) 2004, 2006-2010 Michael Roth <[email protected]>
11 Permission is hereby granted, free of charge, to any person
13 files (the "Software"), to deal in the Software without restriction,
14 including without limitation the rights to use, copy, modify, merge,
16 and to permit persons to whom the Software is furnished to do so,
17 subject to the following conditions:
23 EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
30 --]]--------------------------------------------------------------------------
71 end
[all …]
|
| /aosp_15_r20/frameworks/rs/script_api/ |
| H A D | rs_math.spec | 8 # http://www.apache.org/licenses/LICENSE-2.0
10 # Unless required by applicable law or agreed to in writing, software
20 The mathematical functions below can be applied to scalars and vectors. When applied
21 to vectors, the returned value is a vector of the function applied to each entry of the input.
26 // a.x to sin(b.x),<br/>
27 // a.y to sin(b.y), and<br/>
28 // a.z to sin(b.z).<br/>
33 instead the input as a single vector in n-dimensional space.
36 rs_fp_relaxed and rs_fp_full. Under rs_fp_relaxed, subnormal values may be flushed to zero and
38 subnormal values, i.e. smaller than 1.17549435e-38f. rs_fp_rull also requires round to nearest
[all …]
|
| /aosp_15_r20/external/bcc/tests/lua/ |
| H A D | luaunit.lua | 1 --[[
10 ]]--
15 -- private exported functions (for testing)
20 --[[ Some people like assertEquals( actual, expected ) and some people prefer
22 ]]--
28 -- set this to false to debug luaunit
36 -- set EXPORT_ASSERT_TO_GLOBALS to have all asserts visible as global values
37 -- EXPORT_ASSERT_TO_GLOBALS = true
39 -- we need to keep a copy of the script args before it is overridden
42 M.FAILURE_PREFIX = 'LuaUnit test FAILURE: ' -- prefix string for failed tests
[all …]
|
| /aosp_15_r20/external/rust/android-crates-io/crates/memchr/src/arch/wasm32/simd128/ |
| D | memchr.rs | 2 This module defines 128-bit vector implementations of `memchr` and friends.
14 `Iterator::count` implementation to use this routine.)
18 probably (but not necessarily) better to just use a simple `[bool; 256]` array
19 or similar. However, it depends mightily on the specific work-load and the
34 /// This particular searcher is specialized to use simd128 vector
40 pub fn new(needle: u8) -> Option<One> { in new()
49 /// Create a new finder specific to simd128 vectors and routines without
54 /// Callers must guarantee that it is safe to execute `simd128`
58 pub unsafe fn new_unchecked(needle: u8) -> One { in new_unchecked()
72 pub fn is_available() -> bool { in is_available()
[all …]
|
| /aosp_15_r20/external/cronet/third_party/rust/chromium_crates_io/vendor/memchr-2.7.2/src/arch/wasm32/simd128/ |
| H A D | memchr.rs | 2 This module defines 128-bit vector implementations of `memchr` and friends.
14 `Iterator::count` implementation to use this routine.)
18 probably (but not necessarily) better to just use a simple `[bool; 256]` array
19 or similar. However, it depends mightily on the specific work-load and the
34 /// This particular searcher is specialized to use simd128 vector
40 pub fn new(needle: u8) -> Option<One> { in new()
49 /// Create a new finder specific to simd128 vectors and routines without
54 /// Callers must guarantee that it is safe to execute `simd128`
58 pub unsafe fn new_unchecked(needle: u8) -> One { in new_unchecked()
72 pub fn is_available() -> bool { in is_available()
[all …]
|
| /aosp_15_r20/external/rust/android-crates-io/crates/memchr/src/arch/aarch64/neon/ |
| D | memchr.rs | 2 This module defines 128-bit vector implementations of `memchr` and friends.
14 `Iterator::count` implementation to use this routine.)
18 probably (but not necessarily) better to just use a simple `[bool; 256]` array
19 or similar. However, it depends mightily on the specific work-load and the
34 /// This particular searcher is specialized to use neon vector instructions
40 pub fn new(needle: u8) -> Option<One> { in new()
49 /// Create a new finder specific to neon vectors and routines without
54 /// Callers must guarantee that it is safe to execute `neon` instructions
58 /// `x86_64` target, then they therefore automatically have access to neon
63 pub unsafe fn new_unchecked(needle: u8) -> One { in new_unchecked()
[all …]
|
| /aosp_15_r20/external/cronet/third_party/rust/chromium_crates_io/vendor/memchr-2.7.2/src/arch/aarch64/neon/ |
| H A D | memchr.rs | 2 This module defines 128-bit vector implementations of `memchr` and friends.
14 `Iterator::count` implementation to use this routine.)
18 probably (but not necessarily) better to just use a simple `[bool; 256]` array
19 or similar. However, it depends mightily on the specific work-load and the
34 /// This particular searcher is specialized to use neon vector instructions
40 pub fn new(needle: u8) -> Option<One> { in new()
49 /// Create a new finder specific to neon vectors and routines without
54 /// Callers must guarantee that it is safe to execute `neon` instructions
58 /// `x86_64` target, then they therefore automatically have access to neon
63 pub unsafe fn new_unchecked(needle: u8) -> One { in new_unchecked()
[all …]
|
| /aosp_15_r20/external/rust/android-crates-io/crates/memchr/src/arch/x86_64/avx2/ |
| D | memchr.rs | 2 This module defines 256-bit vector implementations of `memchr` and friends.
14 `Iterator::count` implementation to use this routine.)
18 probably (but not necessarily) better to just use a simple `[bool; 256]` array
19 or similar. However, it depends mightily on the specific work-load and the
39 /// This particular searcher is specialized to use AVX2 vector instructions
41 /// are too short to accommodate an AVX2 vector.)
46 pub fn new(needle: u8) -> Option<One> { in new()
55 /// Create a new finder specific to AVX2 vectors and routines without
60 /// Callers must guarantee that it is safe to execute both `sse2` and
64 /// `x86_64` target, then they therefore automatically have access to SSE2
[all …]
|
| /aosp_15_r20/external/cronet/third_party/rust/chromium_crates_io/vendor/memchr-2.7.2/src/arch/x86_64/avx2/ |
| H A D | memchr.rs | 2 This module defines 256-bit vector implementations of `memchr` and friends.
14 `Iterator::count` implementation to use this routine.)
18 probably (but not necessarily) better to just use a simple `[bool; 256]` array
19 or similar. However, it depends mightily on the specific work-load and the
39 /// This particular searcher is specialized to use AVX2 vector instructions
41 /// are too short to accommodate an AVX2 vector.)
46 pub fn new(needle: u8) -> Option<One> { in new()
55 /// Create a new finder specific to AVX2 vectors and routines without
60 /// Callers must guarantee that it is safe to execute both `sse2` and
64 /// `x86_64` target, then they therefore automatically have access to SSE2
[all …]
|
| /aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r530567b/python3/lib/python3.11/json/ |
| D | decoder.py | 17 NegInf = float('-inf')
26 lineno: The line corresponding to pos
27 colno: The column corresponding to pos
33 colno = pos - doc.rfind('\n', 0, pos)
47 '-Infinity': NegInf,
53 STRINGCHUNK = re.compile(r'(.*?)(["\\\x00-\x1f])', FLAGS)
69 def py_scanstring(s, end, strict=True, argument
71 """Scan the string s for a JSON string. End is the index of the
74 on attempt to decode an invalid string. If strict is False then literal
78 after the end quote."""
[all …]
|
| /aosp_15_r20/prebuilts/build-tools/common/py3-stdlib/json/ |
| H A D | decoder.py | 17 NegInf = float('-inf')
26 lineno: The line corresponding to pos
27 colno: The column corresponding to pos
33 colno = pos - doc.rfind('\n', 0, pos)
47 '-Infinity': NegInf,
53 STRINGCHUNK = re.compile(r'(.*?)(["\\\x00-\x1f])', FLAGS)
69 def py_scanstring(s, end, strict=True, argument
71 """Scan the string s for a JSON string. End is the index of the
74 on attempt to decode an invalid string. If strict is False then literal
78 after the end quote."""
[all …]
|
| /aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r522817/python3/lib/python3.11/json/ |
| D | decoder.py | 17 NegInf = float('-inf')
26 lineno: The line corresponding to pos
27 colno: The column corresponding to pos
33 colno = pos - doc.rfind('\n', 0, pos)
47 '-Infinity': NegInf,
53 STRINGCHUNK = re.compile(r'(.*?)(["\\\x00-\x1f])', FLAGS)
69 def py_scanstring(s, end, strict=True, argument
71 """Scan the string s for a JSON string. End is the index of the
74 on attempt to decode an invalid string. If strict is False then literal
78 after the end quote."""
[all …]
|
| /aosp_15_r20/external/python/cpython3/Lib/json/ |
| D | decoder.py | 17 NegInf = float('-inf')
26 lineno: The line corresponding to pos
27 colno: The column corresponding to pos
33 colno = pos - doc.rfind('\n', 0, pos)
47 '-Infinity': NegInf,
53 STRINGCHUNK = re.compile(r'(.*?)(["\\\x00-\x1f])', FLAGS)
69 def py_scanstring(s, end, strict=True, argument
71 """Scan the string s for a JSON string. End is the index of the
74 on attempt to decode an invalid string. If strict is False then literal
78 after the end quote."""
[all …]
|
| /aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r530567/python3/lib/python3.11/json/ |
| D | decoder.py | 17 NegInf = float('-inf')
26 lineno: The line corresponding to pos
27 colno: The column corresponding to pos
33 colno = pos - doc.rfind('\n', 0, pos)
47 '-Infinity': NegInf,
53 STRINGCHUNK = re.compile(r'(.*?)(["\\\x00-\x1f])', FLAGS)
69 def py_scanstring(s, end, strict=True, argument
71 """Scan the string s for a JSON string. End is the index of the
74 on attempt to decode an invalid string. If strict is False then literal
78 after the end quote."""
[all …]
|
| /aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r536225/python3/lib/python3.11/json/ |
| D | decoder.py | 17 NegInf = float('-inf')
26 lineno: The line corresponding to pos
27 colno: The column corresponding to pos
33 colno = pos - doc.rfind('\n', 0, pos)
47 '-Infinity': NegInf,
53 STRINGCHUNK = re.compile(r'(.*?)(["\\\x00-\x1f])', FLAGS)
69 def py_scanstring(s, end, strict=True, argument
71 """Scan the string s for a JSON string. End is the index of the
74 on attempt to decode an invalid string. If strict is False then literal
78 after the end quote."""
[all …]
|
| /aosp_15_r20/external/python/cpython2/Lib/json/ |
| D | decoder.py | 20 return nan, inf, -inf
30 colno = pos - doc.rindex('\n', 0, pos)
34 def errmsg(msg, doc, pos, end=None): argument
37 if end is None:
42 endlineno, endcolno = linecol(doc, end)
43 fmt = '{0}: line {1} column {2} - line {3} column {4} (char {5} - {6})'
44 return fmt.format(msg, lineno, colno, endlineno, endcolno, pos, end)
45 #fmt = '%s: line %d column %d - line %d column %d (char %d - %d)'
46 #return fmt % (msg, lineno, colno, endlineno, endcolno, pos, end)
50 '-Infinity': NegInf,
[all …]
|
| /aosp_15_r20/external/cronet/third_party/rust/chromium_crates_io/vendor/memchr-2.7.2/src/arch/all/ |
| H A D | memchr.rs | 7 are typically slower than hand-coded vector routines accomplishing the same
9 effectively work by treating a `usize` as a vector of 8-bit lanes, and thus
17 `Iterator::count` implementation to use this routine.)
21 probably (but not necessarily) better to just use a simple `[bool; 256]` array
22 or similar. However, it depends mightily on the specific work-load and the
30 /// The bits that must be zero for a `*const usize` to be properly aligned.
31 const USIZE_ALIGN: usize = USIZE_BYTES - 1;
46 pub fn new(needle: u8) -> One { in new()
50 /// A test-only routine so that we can bundle a bunch of quickcheck
52 /// that makes it identical to most other memchr implementations, which
[all …]
|
| /aosp_15_r20/external/rust/android-crates-io/crates/memchr/src/arch/all/ |
| D | memchr.rs | 7 are typically slower than hand-coded vector routines accomplishing the same
9 effectively work by treating a `usize` as a vector of 8-bit lanes, and thus
17 `Iterator::count` implementation to use this routine.)
21 probably (but not necessarily) better to just use a simple `[bool; 256]` array
22 or similar. However, it depends mightily on the specific work-load and the
30 /// The bits that must be zero for a `*const usize` to be properly aligned.
31 const USIZE_ALIGN: usize = USIZE_BYTES - 1;
46 pub fn new(needle: u8) -> One { in new()
50 /// A test-only routine so that we can bundle a bunch of quickcheck
52 /// that makes it identical to most other memchr implementations, which
[all …]
|