Home
last modified time | relevance | path

Searched full:containers (Results 1 – 25 of 544) sorted by relevance

12345678910>>...22

/third_party/skia/third_party/externals/swiftshader/third_party/marl/src/
Dcontainers_test.cpp15 #include "marl/containers.h"
27 marl::containers::vector<std::string, 4> vector(allocator); in TEST_F()
32 marl::containers::vector<std::string, 4> vector(allocator); in TEST_F()
46 marl::containers::vector<std::string, 1> vector(allocator); in TEST_F()
60 marl::containers::vector<std::string, 4> vector(allocator); in TEST_F()
94 marl::containers::vector<std::string, 2> vector(allocator); in TEST_F()
128 marl::containers::vector<std::string, 4> vectorA(allocator); in TEST_F()
135 marl::containers::vector<std::string, 4> vectorB(vectorA, allocator); in TEST_F()
143 marl::containers::vector<std::string, 4> vectorA(allocator); in TEST_F()
150 marl::containers::vector<std::string, 2> vectorB(vectorA, allocator); in TEST_F()
[all …]
Devent_bench.cpp17 #include "marl/containers.h"
25 marl::containers::vector<marl::Event, 1> events; in BENCHMARK_DEFINE_F()
/third_party/typescript/src/services/
DnavigateTo.ts70 …function tryAddSingleDeclarationName(declaration: Declaration, containers: Push<string>): boolean {
72 …ushLiteral(name, containers) || name.kind === SyntaxKind.ComputedPropertyName && tryAddComputedPro…
78 function tryAddComputedPropertyName(expression: Expression, containers: Push<string>): boolean {
79 return pushLiteral(expression, containers)
80 …ssion(expression) && (containers.push(expression.name.text), true) && tryAddComputedPropertyName(e…
83 function pushLiteral(node: Node, containers: Push<string>): boolean {
84 … return isPropertyNameLiteral(node) && (containers.push(getTextOfIdentifierOrLiteral(node)), true);
88 const containers: string[] = []; constant
93 … === SyntaxKind.ComputedPropertyName && !tryAddComputedPropertyName(name.expression, containers)) {
97 containers.shift();
[all …]
/third_party/mesa3d/src/intel/genxml/
Dgen_bits_header.py106 % for _, container in sorted(containers.items(), key=itemgetter(0)):
242 def __init__(self, containers): argument
248 self.containers = containers
284 if name not in self.containers:
285 self.containers[name] = Container(name)
286 self.container_stack.append(self.containers[name])
334 containers = {}
337 p = XmlParser(containers)
344 container = containers[name_field[0]]
352 f.write(TEMPLATE.render(containers=containers, guard=pargs.cpp_guard))
/third_party/mesa3d/docs/ci/
Ddocker.rst11 The Docker containers are rebuilt using the shell scripts under
55 space as we rev those containers (perhaps `this script
58 Note that Docker doesn't allow containers to be stored on NFS, and
66 anyone on the internet run code on your device. Docker containers may
70 * DUTs must expose the dri device nodes to the containers.
/third_party/gn/src/gn/
Dstring_atom.h20 // standard containers using StringAtom key types is the same as if
23 // In addition, _ordered_ containers support heterogeneous lookups (i.e.
28 // containers by using the StringAtom::Fast{Hash,Equal,Compare} structs,
29 // which will force containers to hash/compare pointer values instead,
97 // in order to use them in standard containers without surprises by
122 // Use the following method and structs to implement containers that
/third_party/skia/third_party/externals/abseil-cpp/absl/container/internal/
Dhash_function_defaults.h15 // Define the default Hash and Eq functions for SwissTable containers.
18 // functions for SwissTable containers. There are two reasons for this.
20 // SwissTable containers are power of 2 sized containers:
28 // SwissTable containers support heterogeneous lookup:
37 // For SwissTable containers this requirement is relaxed to allow a and b of
/third_party/gn/src/base/
Dstl_util.h88 // Returns a new ResultType containing the difference of two sorted containers.
99 // Returns a new ResultType containing the union of two sorted containers.
111 // containers.
134 // The functions here implement these for the standard containers until those
136 // For Chromium containers overloads should be defined in their own headers
137 // (like standard containers).
138 // Note: there is no std::erase for standard associative containers so we don't
/third_party/skia/third_party/externals/dawn/src/common/
DStackContainer.h5 // This file is a modified copy of Chromium's /src/base/containers/stack_container.h
15 // This allocator can be used with STL containers to provide a stack buffer
29 // This makes it appropriate for array-like containers, but the caller should
40 // maintaining this for as long as any containers using this allocator are
67 // Used by containers when they want to refer to an allocator of type U.
126 // A wrapper around STL containers that maintains a stack-sized buffer that the
232 // We need to put this in STL containers sometimes, which requires a copy
/third_party/mesa3d/docs/
Dandroid.rst103 cd /opt/google/containers/android/
115 "source": "/opt/google/containers/android/vendor-rw",
139 scp msm_dri.so $HOST:/opt/google/containers/android/vendor-rw/lib64/dri/
152 scp $HOST:/opt/google/containers/android/vendor-rw/lib64/libdrm.so \
169 kill $(cat /run/containers/android-run_oci/container.pid )
/third_party/libabigail/
DREADME-DOCKER.md8 These containers are built and deployed on merges to the main branch and releases.
12 Here is how to build the containers. Note that we build so it belongs to the same
50 We will also use the "production" containers to grab libraries in:
/third_party/typescript/tests/baselines/reference/
DnumericStringLiteralTypes.types67 declare function f<T extends Container<unknown>[]>(containers: [...T], callback: (...values: Unwrap…
68 >f : <T extends Container<unknown>[]>(containers: [...T], callback: (...values: UnwrapContainers<T>…
69 >containers : [...T]
87 >f : <T extends Container<unknown>[]>(containers: [...T], callback: (...values: UnwrapContainers<T>…
/third_party/protobuf/python/google/protobuf/pyext/
Dmessage.h66 // as if the data was effectively managed by these containers.
68 // ExtensionDicts and UnknownFields containers do NOT follow this rule. They
80 // For all other types: repeated containers, maps, it always point to a
92 // The Three methods below are only used by Repeated containers, and Maps.
94 // This implementation works for all containers which have a parent.
120 // through containers: repeated messages, and values of message maps.
121 // This avoid the creation of similar maps in each of those containers.
/third_party/node/deps/v8/src/zone/
Dcompressed-zone-ptr.h23 // However, using CompressedZonePtr<T> in containers is not allowed yet.
84 // This requirement is necessary for being able to use memcopy in containers
86 // TODO(ishell): Re-enable once compressed pointers are supported in containers.
Dzone-type-traits.h58 // This requirement is necessary for being able to use memcopy in containers
60 // TODO(ishell): Re-enable once compressed pointers are supported in containers.
/third_party/alsa-utils/axfer/
Dmapper-multiple.c3 // mapper-multiple.c - a muxer/demuxer for multiple containers.
32 // src: first channel in each of interleaved buffers in containers => in align_to_i()
82 // Additionally, format of samples in the containers should be the same in multiple_pre_process()
131 // period for each of containers. in multiple_pre_process()
/third_party/protobuf/python/docs/google/protobuf/internal/
Dcontainers.rst15 google.protobuf.internal.containers
18 .. automodule:: google.protobuf.internal.containers
/third_party/ltp/testcases/kernel/
DMakefile21 containers \
54 FILTER_OUT_DIRS += containers controllers device-drivers fs io ipc mem \
/third_party/skia/include/sksl/
DDSLWrapper.h20 * C++ containers which expect standard behavior for operator=.
23 * standard behavior for operator=, permitting it to be used in standard containers.
/third_party/skia/third_party/externals/swiftshader/third_party/marl/include/marl/
Dscheduler.h18 #include "containers.h"
314 containers::set<Timeout, std::less<Timeout>> timeouts;
315 containers::unordered_map<Fiber*, TimePoint> fibers;
320 using TaskQueue = containers::deque<Task>;
321 using FiberQueue = containers::deque<Fiber*>;
322 using FiberSet = containers::unordered_set<Fiber*>;
475 containers::vector<Allocator::unique_ptr<Fiber>, 16>
506 containers::unordered_map<std::thread::id,
/third_party/python/Doc/c-api/
Dgcsupport.rst9 references requires support from object types which are "containers" for other
10 objects which may also be containers. Types which do not store references to
33 #. Once all the fields which may contain references to other containers are
39 #. Before fields which refer to other containers are invalidated,
/third_party/node/deps/v8/src/strings/
Dstring-hasher.h45 // Useful for std containers that require something ()'able.
53 // Useful for std containers that require something ()'able.
/third_party/weex-loader/test/spec/
Dexample-list.we35 // file:///var/mobile/Containers/Bundle/Application/{id}/WeexDemo.app/
36 …// file:///Users/{user}/Library/Developer/CoreSimulator/Devices/{id}/data/Containers/Bundle/Applic…
/third_party/ltp/testcases/kernel/containers/pidns/
Dpidns05.c11 * containers. Then kill container init process from parent and check if all
12 * containers have been killed.
/third_party/node/deps/v8/src/heap/cppgc/
Dmarking-state.h125 // Weak containers are special in that they may require re-tracing if
127 // ProcessWeakContainer records which weak containers were already marked so
297 // Weak containers might not require tracing. In such cases the callback in in ProcessWeakContainer()
304 // For weak containers, there's no trace callback and no processing loop to in ProcessWeakContainer()
384 // Weak containers are strongly retraced during conservative stack scanning.

12345678910>>...22