| /external/perfetto/test/trace_processor/diff_tests/metrics/android/ |
| D | android_monitor_contention.out | 2 node {
4 ts: 1740012196981
40 node {
42 ts: 1737223735202
71 node {
73 ts: 1737221139743
102 node {
104 ts: 1739982673132
123 node {
125 ts: 1739942269308
[all …]
|
| /external/python/cpython3/Lib/test/ |
| D | test_graphlib.py | 9 def static_order_with_groups(ts): argument
10 ts.prepare()
11 while ts.is_active():
12 nodes = ts.get_ready()
13 for node in nodes:
14 ts.done(node)
17 ts = graphlib.TopologicalSorter(graph)
18 self.assertEqual(list(static_order_with_groups(ts)), list(expected))
20 ts = graphlib.TopologicalSorter(graph)
21 # need to be a bit careful comparing the result of ts.static_order and
[all …]
|
| /external/swiftshader/third_party/llvm-16.0/llvm/include/llvm/ADT/ |
| D | AllocatorList.h | 1 //===- llvm/ADT/AllocatorList.h - Custom allocator list ---------*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
24 /// A linked-list with a custom, local allocator.
26 /// Expose a std::list-like interface that owns and uses a custom LLVM-style
34 struct Node : ilist_node<Node> { struct
35 Node(Node &&) = delete;
36 Node(const Node &) = delete;
37 Node &operator=(Node &&) = delete; argument
38 Node &operator=(const Node &) = delete; argument
[all …]
|
| /external/tensorflow/tensorflow/core/profiler/internal/ |
| D | tfprof_timeline.cc | 7 http://www.apache.org/licenses/LICENSE-2.0
45 int64_t tid, int64_t ts) { in CreateEvent() argument
52 event["ts"] = Json::Int64(ts); in CreateEvent()
67 void ChromeTraceFormatter::EmitRegion(int64_t ts, int64_t duration, int64_t pid, in EmitRegion() argument
70 Json::Value event = CreateEvent("X", category, name, pid, tid, ts); in EmitRegion()
76 void ChromeTraceFormatter::EmitFlowStart(const string& name, int64_t ts, in EmitFlowStart() argument
79 Json::Value event = CreateEvent("s", "DataFlow", name, pid, tid, ts); in EmitFlowStart()
84 void ChromeTraceFormatter::EmitFlowEnd(const string& name, int64_t ts, in EmitFlowEnd() argument
87 Json::Value event = CreateEvent("t", "DataFlow", name, pid, tid, ts); in EmitFlowEnd()
93 const string& category, const string& name, int64_t pid, int64_t ts, in EmitCounter() argument
[all …]
|
| D | tfprof_timeline.h | 7 http://www.apache.org/licenses/LICENSE-2.0
36 int64_t ts);
40 void EmitRegion(int64_t ts, int64_t duration, int64_t pid, int64_t tid,
43 void EmitFlowStart(const string& name, int64_t ts, int64_t pid, int64_t tid,
46 void EmitFlowEnd(const string& name, int64_t ts, int64_t pid, int64_t tid,
50 int64_t ts, const string& device, int64_t bytes,
76 TimeNode(Process* process, GraphNode* node, int64_t start_micros, in TimeNode() argument
79 node(node), in TimeNode()
82 tid(-1) {} in TimeNode()
85 const string& name() { return node->name(); } in name()
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/ |
| D | AllocatorList.h | 1 //===- llvm/ADT/AllocatorList.h - Custom allocator list ---------*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
25 /// A linked-list with a custom, local allocator.
27 /// Expose a std::list-like interface that owns and uses a custom LLVM-style
35 struct Node : ilist_node<Node> { struct
36 Node(Node &&) = delete;
37 Node(const Node &) = delete;
38 Node &operator=(Node &&) = delete; argument
39 Node &operator=(const Node &) = delete; argument
[all …]
|
| /external/pigweed/ |
| D | package.json | 4 "description": "An open source collection of embedded-targeted libraries",
6 "license": "Apache-2.0",
7 "types": "./dist/types/ts/index.d.ts",
18 … "log-viewer-setup": "cd pw_web/log-viewer && npm install --quiet --no-progress --loglevel=error",
19 "prebuild": "rimraf dist && npm run build-protos",
20 "build-protos": "ts-node -P tsconfig.json ts/buildprotos.ts",
22 "dev": "rollup -c -w",
23 "rollup": "rollup -c && npm run postbuild",
25 "start": "tsc-watch --onSuccess \"rollup -c\"",
28 "test": "npm run build && jest --silent",
[all …]
|
| /external/cronet/build/config/siso/ |
| D | typescript_unix.star | 1 # -*- bazel-starlark -*-
13 # TODO: crbug.com/1478909 - Specify typescript inputs in GN config.
16 "third_party/node/linux/node-linux-x64/bin/node",
17 "third_party/node/node_modules:node_modules",
20 "third_party/node/linux/node-linux-x64/bin/node",
21 "third_party/node/node.py",
22 "third_party/node/node_modules:node_modules",
35 "*.ts",
54 "*.ts", # *.d.ts, *.css.ts, *.html.ts, etc
|
| /external/angle/build/config/siso/ |
| D | typescript_unix.star | 1 # -*- bazel-starlark -*-
20 # TODO: crbug.com/1478909 - Specify typescript inputs in GN config.
23 "third_party/node/linux/node-linux-x64/bin/node",
24 "third_party/node/node_modules:node_modules",
27 "third_party/node/linux/node-linux-x64/bin/node",
28 "third_party/node/node.py",
29 "third_party/node/node_modules:node_modules",
42 "*.ts",
63 "*.ts", # *.d.ts, *.css.ts, *.html.ts, etc
|
| /external/rust/crates/uuid/src/ |
| D | v1.rs | 3 //! This module is soft-deprecated. Instead of using the `Context` type re-exported here,
12 /// Create a new version 1 UUID using the current system time and node ID.
22 pub fn now_v1(node_id: &[u8; 6]) -> Self { in now_v1()
23 let ts = Timestamp::now(crate::timestamp::context::shared_context()); localVariable
25 Self::new_v1(ts, node_id)
28 /// Create a new version 1 UUID using the given timestamp and node ID.
37 /// 1. The *node ID* is unique for this process,
57 /// # fn random_seed() -> u16 { 42 }
59 /// let ts = Timestamp::from_unix(&context, 1497624119, 1234);
61 /// let uuid = Uuid::new_v1(ts, &[1, 2, 3, 4, 5, 6]);
[all …]
|
| D | v6.rs | 9 /// Create a new version 6 UUID using the current system time and node ID.
19 pub fn now_v6(node_id: &[u8; 6]) -> Self { in now_v6()
20 let ts = Timestamp::now(crate::timestamp::context::shared_context()); localVariable
22 Self::new_v6(ts, node_id)
25 /// Create a new version 6 UUID using the given timestamp and a node ID.
36 /// 1. The *node ID* is unique for this process,
57 /// # fn random_seed() -> u16 { 42 }
59 /// let ts = Timestamp::from_unix(context, 1497624119, 1234);
61 /// let uuid = Uuid::new_v6(ts, &[1, 2, 3, 4, 5, 6]);
65 /// "1e752a1f-3b49-658c-802a-010203040506"
[all …]
|
| /external/python/cpython3/Doc/library/ |
| D | graphlib.rst | 1 :mod:`graphlib` --- Functionality to operate with graph-like structures
5 :synopsis: Functionality to operate with graph-like structures
15 --------------
23 for every directed edge u -> v from vertex u to vertex v, vertex u comes
33 are iterables of all predecessors of that node in the graph (the nodes that
46 process them. Call :meth:`~TopologicalSorter.done` on each node as it
56 >>> ts = TopologicalSorter(graph)
57 >>> tuple(ts.static_order())
69 for node in topological_sorter.get_ready():
72 task_queue.put(node)
[all …]
|
| /external/libxaac/decoder/ |
| D | ixheaacd_mps_dec.c | 9 * http://www.apache.org/licenses/LICENSE-2.0
96 self->num_parameter_sets = 1; in ixheaacd_mps_create()
97 self->qmf_band_count = 64; in ixheaacd_mps_create()
99 self->res_ch_count = 0; in ixheaacd_mps_create()
102 self->config = mps212_config; in ixheaacd_mps_create()
103 self->frame_length = bs_frame_len; in ixheaacd_mps_create()
104 self->in_ch_count = 1; in ixheaacd_mps_create()
105 self->out_ch_count = 2; in ixheaacd_mps_create()
106 self->residual_coding = residual_coding; in ixheaacd_mps_create()
107 if (self->residual_coding) { in ixheaacd_mps_create()
[all …]
|
| /external/tensorflow/tensorflow/compiler/jit/ |
| D | node_matchers.h | 7 http://www.apache.org/licenses/LICENSE-2.0
20 // tensorflow::Node* node = ...;
21 // EXPECT_THAT(node, NodeWith(Name("name"), Op("op"),
24 // Matchable node properties (the expressions that go inside NodeWith(...))
27 // - Name(string): matches the node name exactly. We will probably need to
30 // - Op(string): matches the op exactly.
32 // - AssignedDevice(string): matches the assigned device exactly.
34 // - Inputs(<ordered list>): matches the list of non-control inputs to the node
36 // matches an output of a node (see Out(idx, node) below).
38 // - CtrlDeps(<unordered list>): matches the list of control dependences on the
[all …]
|
| /external/flatbuffers/ts/ |
| D | BUILD.bazel | 7 "builder.ts",
8 "byte-buffer.ts",
9 "constants.ts",
10 "encoding.ts",
11 "index.ts",
12 "types.ts",
13 "utils.ts",
20 "moduleResolution": "node",
26 "types": ["node"],
31 deps = ["@npm//@types/node"],
|
| /external/ComputeLibrary/arm_compute/graph/ |
| D | Graph.h | 2 * Copyright (c) 2018-2020 Arm Limited.
4 * SPDX-License-Identifier: MIT
51 * Represents a multiple source - multiple sink directed graph
71 /** Adds a node to the graph
73 * @note Models a single output node
75 * @tparam NT Node operation
76 * @tparam Ts Arguments to operation
78 * @param[in] args Node arguments
80 * @return ID of the node
82 template <typename NT, typename... Ts>
[all …]
|
| /external/pigweed/pw_ide/ts/pigweed-vscode/ |
| D | webpack.config.js | 7 // https://www.apache.org/licenses/LICENSE-2.0
18 const NodePolyfillPlugin = require('node-polyfill-webpack-plugin');
24 // Code web �� -> https://webpack.js.org/configuration/target/#target
27 // the entry point of this extension, �� ->
28 // https://webpack.js.org/configuration/entry-context/
29 entry: './src/extension.ts',
32 // the bundle is stored in the 'dist' folder (check package.json), �� ->
37 devtoolModuleFilenameTemplate: '../[resource-path]',
39 devtool: 'source-map',
42 // the vscode-module is created on-the-fly and must
[all …]
|
| /external/perfetto/python/tools/ |
| D | check_imports.py | 8 # http://www.apache.org/licenses/LICENSE-2.0
20 coupling (aka fewer imports) outside of the directory - but also
22 - "base should not depend on the fronted"
23 - "plugins should only directly depend on the public API"
24 - "we should not have circular dependencies"
40 # Current plan for the dependency tree of the UI code (2023-09-21)
69 engine_worker_bundle -> _engine;
70 frontend_bundle -> _core [color=green];
71 frontend_bundle -> _frontend [color=red];
73 _core -> _public;
[all …]
|
| /external/private-join-and-compute/third_party/abseil-cpp-20230125.2/absl/container/internal/ |
| D | node_slot_policy.h | 7 // https://www.apache.org/licenses/LICENSE-2.0
17 // The node policy should model:
20 // // Returns a new node allocated and constructed using the allocator, using
25 // // Destroys and deallocates node using the allocator.
27 // void delete_element(Alloc* alloc, value_type* node) const;
78 static auto value(T* elem) -> decltype(P::value(elem)) {
82 template <class... Ts, class P = Policy>
83 static auto apply(Ts&&... ts) -> decltype(P::apply(std::forward<Ts>(ts)...)) {
84 return P::apply(std::forward<Ts>(ts)...);
|
| /external/tensorflow/third_party/absl/abseil-cpp/absl/container/internal/ |
| D | node_slot_policy.h | 7 // https://www.apache.org/licenses/LICENSE-2.0
17 // The node policy should model:
20 // // Returns a new node allocated and constructed using the allocator, using
25 // // Destroys and deallocates node using the allocator.
27 // void delete_element(Alloc* alloc, value_type* node) const;
78 static auto value(T* elem) -> decltype(P::value(elem)) {
82 template <class... Ts, class P = Policy>
83 static auto apply(Ts&&... ts) -> decltype(P::apply(std::forward<Ts>(ts)...)) {
84 return P::apply(std::forward<Ts>(ts)...);
|
| /external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/container/internal/ |
| D | node_slot_policy.h | 7 // https://www.apache.org/licenses/LICENSE-2.0
17 // The node policy should model:
20 // // Returns a new node allocated and constructed using the allocator, using
25 // // Destroys and deallocates node using the allocator.
27 // void delete_element(Alloc* alloc, value_type* node) const;
78 static auto value(T* elem) -> decltype(P::value(elem)) {
82 template <class... Ts, class P = Policy>
83 static auto apply(Ts&&... ts) -> decltype(P::apply(std::forward<Ts>(ts)...)) {
84 return P::apply(std::forward<Ts>(ts)...);
|
| /external/angle/third_party/abseil-cpp/absl/container/internal/ |
| D | node_slot_policy.h | 7 // https://www.apache.org/licenses/LICENSE-2.0
17 // The node policy should model:
20 // // Returns a new node allocated and constructed using the allocator, using
25 // // Destroys and deallocates node using the allocator.
27 // void delete_element(Alloc* alloc, value_type* node) const;
81 static auto value(T* elem) -> decltype(P::value(elem)) {
85 template <class... Ts, class P = Policy>
86 static auto apply(Ts&&... ts) -> decltype(P::apply(std::forward<Ts>(ts)...)) {
87 return P::apply(std::forward<Ts>(ts)...);
|
| /external/cronet/third_party/abseil-cpp/absl/container/internal/ |
| D | node_slot_policy.h | 7 // https://www.apache.org/licenses/LICENSE-2.0
17 // The node policy should model:
20 // // Returns a new node allocated and constructed using the allocator, using
25 // // Destroys and deallocates node using the allocator.
27 // void delete_element(Alloc* alloc, value_type* node) const;
81 static auto value(T* elem) -> decltype(P::value(elem)) {
85 template <class... Ts, class P = Policy>
86 static auto apply(Ts&&... ts) -> decltype(P::apply(std::forward<Ts>(ts)...)) {
87 return P::apply(std::forward<Ts>(ts)...);
|
| /external/libtextclassifier/abseil-cpp/absl/container/internal/ |
| D | node_slot_policy.h | 7 // https://www.apache.org/licenses/LICENSE-2.0
17 // The node policy should model:
20 // // Returns a new node allocated and constructed using the allocator, using
25 // // Destroys and deallocates node using the allocator.
27 // void delete_element(Alloc* alloc, value_type* node) const;
78 static auto value(T* elem) -> decltype(P::value(elem)) {
82 template <class... Ts, class P = Policy>
83 static auto apply(Ts&&... ts) -> decltype(P::apply(std::forward<Ts>(ts)...)) {
84 return P::apply(std::forward<Ts>(ts)...);
|
| /external/openscreen/third_party/abseil/src/absl/container/internal/ |
| D | node_hash_policy.h | 7 // https://www.apache.org/licenses/LICENSE-2.0
17 // The node policy should model:
20 // // Returns a new node allocated and constructed using the allocator, using
25 // // Destroys and deallocates node using the allocator.
27 // void delete_element(Alloc* alloc, value_type* node) const;
78 static auto value(T* elem) -> decltype(P::value(elem)) {
82 template <class... Ts, class P = Policy>
83 static auto apply(Ts&&... ts) -> decltype(P::apply(std::forward<Ts>(ts)...)) {
84 return P::apply(std::forward<Ts>(ts)...);
|