OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:n_g
(Results
1 - 4
of
4
) sorted by null
/system/update_engine/payload_generator/
tarjan_unittest.cc
43
const Vertex::Index
n_g
= 6;
local
58
graph[n_f].out_edges.insert(make_pair(
n_g
, EdgeProperties()));
59
graph[
n_g
].out_edges.insert(make_pair(n_h, EdgeProperties()));
60
graph[n_h].out_edges.insert(make_pair(
n_g
, EdgeProperties()));
84
for (Vertex::Index i =
n_g
; i <= n_h; i++) {
89
EXPECT_TRUE(utils::VectorContainsValue(vertex_indexes,
n_g
));
topological_sort_unittest.cc
60
const Vertex::Index
n_g
= counter++;
local
75
graph[n_e].out_edges.insert(make_pair(
n_g
, EdgeProperties()));
76
graph[
n_g
].out_edges.insert(make_pair(n_d, EdgeProperties()));
77
graph[
n_g
].out_edges.insert(make_pair(n_f, EdgeProperties()));
cycle_breaker_unittest.cc
56
const Vertex::Index
n_g
= counter++;
local
72
graph[n_f].out_edges.insert(make_pair(
n_g
, EdgeProperties()));
73
graph[
n_g
].out_edges.insert(make_pair(n_h, EdgeProperties()));
74
graph[n_h].out_edges.insert(make_pair(
n_g
, EdgeProperties()));
92
EXPECT_TRUE(utils::SetContainsKey(broken_edges, make_pair(
n_g
, n_h)) ||
93
utils::SetContainsKey(broken_edges, make_pair(n_h,
n_g
)));
186
const Vertex::Index
n_g
= counter++;
local
205
graph[n_e].out_edges.insert(EdgeWithWeight(
n_g
, 5));
206
graph[n_f].out_edges.insert(EdgeWithWeight(
n_g
, 2));
207
graph[
n_g
].out_edges.insert(EdgeWithWeight(n_f, 3))
[
all
...]
/external/webrtc/webrtc/modules/rtp_rtcp/source/
rtp_format_vp9.cc
119
// G: |
N_G
| (OPTIONAL)
121
//
N_G
: | T |U| R |-|-| (OPTIONAL) .
122
// +-+-+-+-+-+-+-+-+ -| .
N_G
times
140
//
N_G
263
// G: |
N_G
| (OPTIONAL)
265
//
N_G
: | T |U| R |-|-| (OPTIONAL) .
266
// +-+-+-+-+-+-+-+-+ -| .
N_G
times
418
// G: |
N_G
| (OPTIONAL)
420
//
N_G
: | T |U| R |-|-| (OPTIONAL) .
421
// +-+-+-+-+-+-+-+-+ -| .
N_G
time
442
uint8_t
n_g
;
local
[
all
...]
Completed in 834 milliseconds