| /external/mesa3d/src/mesa/main/ |
| D | texcompress_bptc_tmp.h | 357 uint8_t endpoints[][4]) in extract_unorm_endpoints()
369 endpoints[subset * 2 + endpoint][component] = in extract_unorm_endpoints()
380 endpoints[subset * 2 + endpoint][3] = in extract_unorm_endpoints()
390 endpoints[subset * 2 + endpoint][3] = 255; in extract_unorm_endpoints()
403 endpoints[subset * 2 + endpoint][component] <<= 1; in extract_unorm_endpoints()
404 endpoints[subset * 2 + endpoint][component] |= pbit; in extract_unorm_endpoints()
415 endpoints[subset * 2 + endpoint][component] <<= 1; in extract_unorm_endpoints()
416 endpoints[subset * 2 + endpoint][component] |= pbit; in extract_unorm_endpoints()
426 endpoints[subset * 2 + endpoint][component] = in extract_unorm_endpoints()
427 expand_component(endpoints[subset * 2 + endpoint][component], in extract_unorm_endpoints()
[all …]
|
| /external/cronet/net/socket/ |
| D | transport_connect_job_unittest.cc | 527 std::vector<HostResolverEndpointResult> endpoints(3); in TEST_F() local
528 endpoints[0].ip_endpoints = {IPEndPoint(ParseIP("1::"), 8441), in TEST_F()
530 endpoints[0].metadata.supported_protocol_alpns = {"h3", "h2", "http/1.1"}; in TEST_F()
531 endpoints[1].ip_endpoints = {IPEndPoint(ParseIP("2::"), 8442), in TEST_F()
533 endpoints[1].metadata.supported_protocol_alpns = {"h3"}; in TEST_F()
534 endpoints[2].ip_endpoints = {IPEndPoint(ParseIP("4::"), 443), in TEST_F()
537 kHostName, MockHostResolverBase::RuleResolver::RuleResult(endpoints)); in TEST_F()
543 std::vector{endpoints[0].ip_endpoints[0]}), in TEST_F()
546 std::vector{endpoints[0].ip_endpoints[1]}), in TEST_F()
551 std::vector{endpoints[2].ip_endpoints[0]}), in TEST_F()
[all …]
|
| /external/guava/guava/src/com/google/common/graph/ |
| D | AbstractNetwork.java | 184 public Set<E> edgesConnecting(EndpointPair<N> endpoints) {
185 validateEndpoints(endpoints);
186 return edgesConnecting(endpoints.nodeU(), endpoints.nodeV());
204 public Optional<E> edgeConnecting(EndpointPair<N> endpoints) {
205 validateEndpoints(endpoints);
206 return edgeConnecting(endpoints.nodeU(), endpoints.nodeV());
225 public E edgeConnectingOrNull(EndpointPair<N> endpoints) {
226 validateEndpoints(endpoints);
227 return edgeConnectingOrNull(endpoints.nodeU(), endpoints.nodeV());
238 public boolean hasEdgeConnecting(EndpointPair<N> endpoints) {
[all …]
|
| D | StandardMutableGraph.java | 56 public boolean putEdge(EndpointPair<N> endpoints) { in putEdge() argument
57 validateEndpoints(endpoints); in putEdge()
58 return putEdge(endpoints.nodeU(), endpoints.nodeV()); in putEdge()
72 public boolean removeEdge(EndpointPair<N> endpoints) { in removeEdge() argument
73 validateEndpoints(endpoints); in removeEdge()
74 return removeEdge(endpoints.nodeU(), endpoints.nodeV()); in removeEdge()
|
| D | AbstractBaseGraph.java | 161 public boolean hasEdgeConnecting(EndpointPair<N> endpoints) {
162 checkNotNull(endpoints);
163 if (!isOrderingCompatible(endpoints)) {
166 N nodeU = endpoints.nodeU();
167 N nodeV = endpoints.nodeV();
175 protected final void validateEndpoints(EndpointPair<?> endpoints) {
176 checkNotNull(endpoints);
177 checkArgument(isOrderingCompatible(endpoints), ENDPOINTS_MISMATCH);
180 protected final boolean isOrderingCompatible(EndpointPair<?> endpoints) {
181 return endpoints.isOrdered() || !this.isDirected();
|
| D | ForwardingNetwork.java | 131 public Set<E> edgesConnecting(EndpointPair<N> endpoints) { in edgesConnecting() argument
132 return delegate().edgesConnecting(endpoints); in edgesConnecting()
141 public Optional<E> edgeConnecting(EndpointPair<N> endpoints) { in edgeConnecting() argument
142 return delegate().edgeConnecting(endpoints); in edgeConnecting()
153 public E edgeConnectingOrNull(EndpointPair<N> endpoints) { in edgeConnectingOrNull() argument
154 return delegate().edgeConnectingOrNull(endpoints); in edgeConnectingOrNull()
163 public boolean hasEdgeConnecting(EndpointPair<N> endpoints) { in hasEdgeConnecting() argument
164 return delegate().hasEdgeConnecting(endpoints); in hasEdgeConnecting()
|
| D | Graphs.java | 254 static <N> EndpointPair<N> transpose(EndpointPair<N> endpoints) { in transpose() argument
255 if (endpoints.isOrdered()) { in transpose()
256 return EndpointPair.ordered(endpoints.target(), endpoints.source()); in transpose()
258 return endpoints; in transpose()
318 public boolean hasEdgeConnecting(EndpointPair<N> endpoints) {
319 return delegate().hasEdgeConnecting(transpose(endpoints));
363 public boolean hasEdgeConnecting(EndpointPair<N> endpoints) {
364 return delegate().hasEdgeConnecting(transpose(endpoints));
373 public Optional<V> edgeValue(EndpointPair<N> endpoints) {
374 return delegate().edgeValue(transpose(endpoints));
[all …]
|
| D | StandardValueGraph.java | 137 public boolean hasEdgeConnecting(EndpointPair<N> endpoints) {
138 checkNotNull(endpoints);
139 return isOrderingCompatible(endpoints)
140 && hasEdgeConnectingInternal(endpoints.nodeU(), endpoints.nodeV());
151 public V edgeValueOrDefault(EndpointPair<N> endpoints, @CheckForNull V defaultValue) {
152 validateEndpoints(endpoints);
153 return edgeValueOrDefaultInternal(endpoints.nodeU(), endpoints.nodeV(), defaultValue);
|
| D | ForwardingValueGraph.java | 105 public boolean hasEdgeConnecting(EndpointPair<N> endpoints) { in hasEdgeConnecting() argument
106 return delegate().hasEdgeConnecting(endpoints); in hasEdgeConnecting()
115 public Optional<V> edgeValue(EndpointPair<N> endpoints) { in edgeValue() argument
116 return delegate().edgeValue(endpoints); in edgeValue()
127 public V edgeValueOrDefault(EndpointPair<N> endpoints, @CheckForNull V defaultValue) { in edgeValueOrDefault() argument
128 return delegate().edgeValueOrDefault(endpoints, defaultValue); in edgeValueOrDefault()
|
| D | StandardMutableValueGraph.java | 116 public V putEdgeValue(EndpointPair<N> endpoints, V value) { in putEdgeValue() argument
117 validateEndpoints(endpoints); in putEdgeValue()
118 return putEdgeValue(endpoints.nodeU(), endpoints.nodeV(), value); in putEdgeValue()
182 public V removeEdge(EndpointPair<N> endpoints) { in removeEdge() argument
183 validateEndpoints(endpoints); in removeEdge()
184 return removeEdge(endpoints.nodeU(), endpoints.nodeV()); in removeEdge()
|
| /external/openscreen/discovery/dnssd/impl/ |
| D | dns_data_graph_unittest.cc | 265 std::vector<ErrorOr<DnsSdInstanceEndpoint>> endpoints = in TEST_F() local
268 ASSERT_EQ(endpoints.size(), size_t{1}); in TEST_F()
269 ErrorOr<DnsSdInstanceEndpoint> endpoint_or_error = std::move(endpoints[0]); in TEST_F()
279 endpoints = graph_->CreateEndpoints(DnsDataGraph::GetDomainGroup(srv), in TEST_F()
281 ASSERT_EQ(endpoints.size(), size_t{1}); in TEST_F()
282 endpoint_or_error = std::move(endpoints[0]); in TEST_F()
306 std::vector<ErrorOr<DnsSdInstanceEndpoint>> endpoints = in TEST_F() local
309 EXPECT_EQ(endpoints.size(), size_t{0}); in TEST_F()
312 endpoints = graph_->CreateEndpoints(DnsDataGraph::GetDomainGroup(srv), in TEST_F()
314 ASSERT_EQ(endpoints.size(), size_t{1}); in TEST_F()
[all …]
|
| /external/guava/android/guava/src/com/google/common/graph/ |
| D | AbstractNetwork.java | 183 public Set<E> edgesConnecting(EndpointPair<N> endpoints) {
184 validateEndpoints(endpoints);
185 return edgesConnecting(endpoints.nodeU(), endpoints.nodeV());
213 public E edgeConnectingOrNull(EndpointPair<N> endpoints) {
214 validateEndpoints(endpoints);
215 return edgeConnectingOrNull(endpoints.nodeU(), endpoints.nodeV());
226 public boolean hasEdgeConnecting(EndpointPair<N> endpoints) {
227 checkNotNull(endpoints);
228 if (!isOrderingCompatible(endpoints)) {
231 return hasEdgeConnecting(endpoints.nodeU(), endpoints.nodeV());
[all …]
|
| D | StandardMutableGraph.java | 56 public boolean putEdge(EndpointPair<N> endpoints) { in putEdge() argument
57 validateEndpoints(endpoints); in putEdge()
58 return putEdge(endpoints.nodeU(), endpoints.nodeV()); in putEdge()
72 public boolean removeEdge(EndpointPair<N> endpoints) { in removeEdge() argument
73 validateEndpoints(endpoints); in removeEdge()
74 return removeEdge(endpoints.nodeU(), endpoints.nodeV()); in removeEdge()
|
| D | AbstractBaseGraph.java | 161 public boolean hasEdgeConnecting(EndpointPair<N> endpoints) {
162 checkNotNull(endpoints);
163 if (!isOrderingCompatible(endpoints)) {
166 N nodeU = endpoints.nodeU();
167 N nodeV = endpoints.nodeV();
175 protected final void validateEndpoints(EndpointPair<?> endpoints) {
176 checkNotNull(endpoints);
177 checkArgument(isOrderingCompatible(endpoints), ENDPOINTS_MISMATCH);
180 protected final boolean isOrderingCompatible(EndpointPair<?> endpoints) {
181 return endpoints.isOrdered() || !this.isDirected();
|
| D | StandardValueGraph.java | 137 public boolean hasEdgeConnecting(EndpointPair<N> endpoints) {
138 checkNotNull(endpoints);
139 return isOrderingCompatible(endpoints)
140 && hasEdgeConnectingInternal(endpoints.nodeU(), endpoints.nodeV());
151 public V edgeValueOrDefault(EndpointPair<N> endpoints, @CheckForNull V defaultValue) {
152 validateEndpoints(endpoints);
153 return edgeValueOrDefaultInternal(endpoints.nodeU(), endpoints.nodeV(), defaultValue);
|
| D | StandardMutableValueGraph.java | 116 public V putEdgeValue(EndpointPair<N> endpoints, V value) { in putEdgeValue() argument
117 validateEndpoints(endpoints); in putEdgeValue()
118 return putEdgeValue(endpoints.nodeU(), endpoints.nodeV(), value); in putEdgeValue()
182 public V removeEdge(EndpointPair<N> endpoints) { in removeEdge() argument
183 validateEndpoints(endpoints); in removeEdge()
184 return removeEdge(endpoints.nodeU(), endpoints.nodeV()); in removeEdge()
|
| D | Graphs.java | 253 static <N> EndpointPair<N> transpose(EndpointPair<N> endpoints) { in transpose() argument
254 if (endpoints.isOrdered()) { in transpose()
255 return EndpointPair.ordered(endpoints.target(), endpoints.source()); in transpose()
257 return endpoints; in transpose()
317 public boolean hasEdgeConnecting(EndpointPair<N> endpoints) {
318 return delegate().hasEdgeConnecting(transpose(endpoints));
362 public boolean hasEdgeConnecting(EndpointPair<N> endpoints) {
363 return delegate().hasEdgeConnecting(transpose(endpoints));
374 public V edgeValueOrDefault(EndpointPair<N> endpoints, @CheckForNull V defaultValue) {
375 return delegate().edgeValueOrDefault(transpose(endpoints), defaultValue);
[all …]
|
| D | ForwardingNetwork.java | 130 public Set<E> edgesConnecting(EndpointPair<N> endpoints) { in edgesConnecting() argument
131 return delegate().edgesConnecting(endpoints); in edgesConnecting()
142 public E edgeConnectingOrNull(EndpointPair<N> endpoints) { in edgeConnectingOrNull() argument
143 return delegate().edgeConnectingOrNull(endpoints); in edgeConnectingOrNull()
152 public boolean hasEdgeConnecting(EndpointPair<N> endpoints) { in hasEdgeConnecting() argument
153 return delegate().hasEdgeConnecting(endpoints); in hasEdgeConnecting()
|
| /external/cronet/net/dns/ |
| D | address_sorter_win.cc | 38 void Sort(const std::vector<IPEndPoint>& endpoints, in Sort() argument
40 DCHECK(!endpoints.empty()); in Sort()
41 Job::Start(endpoints, std::move(callback)); in Sort()
49 static void Start(const std::vector<IPEndPoint>& endpoints, in Start() argument
51 auto job = base::WrapRefCounted(new Job(endpoints, std::move(callback))); in Start()
65 Job(const std::vector<IPEndPoint>& endpoints, CallbackType callback) in Job() argument
68 base::CheckedNumeric<DWORD>(endpoints.size()) * in Job()
75 input_buffer_->iAddressCount = base::checked_cast<INT>(endpoints.size()); in Job()
79 for (size_t i = 0; i < endpoints.size(); ++i) { in Job()
80 IPEndPoint ipe = endpoints[i]; in Job()
|
| D | address_sorter_unittest.cc | 60 std::vector<IPEndPoint> endpoints; in TEST() local
61 endpoints.push_back(MakeEndPoint("10.0.0.1")); in TEST()
62 endpoints.push_back(MakeEndPoint("8.8.8.8")); in TEST()
63 endpoints.push_back(MakeEndPoint("::1")); in TEST()
64 endpoints.push_back(MakeEndPoint("2001:4860:4860::8888")); in TEST()
68 sorter->Sort(endpoints, in TEST()
|
| /external/cronet/net/extras/sqlite/ |
| D | sqlite_persistent_reporting_and_nel_store_unittest.cc | 117 std::vector<ReportingEndpoint> endpoints; in InitializeStore() local
119 LoadReportingClients(&endpoints, &groups); in InitializeStore()
120 EXPECT_EQ(0u, endpoints.size()); in InitializeStore()
155 std::vector<ReportingEndpoint> endpoints, in OnReportingClientsLoaded() argument
157 endpoints_out->swap(endpoints); in OnReportingClientsLoaded()
933 std::vector<ReportingEndpoint> endpoints; in TEST_F() local
935 LoadReportingClients(&endpoints, &groups); in TEST_F()
936 ASSERT_EQ(1u, endpoints.size()); in TEST_F()
938 endpoints[0].group_key.network_anonymization_key); in TEST_F()
939 EXPECT_EQ(endpoint.group_key.origin, endpoints[0].group_key.origin); in TEST_F()
[all …]
|
| /external/openscreen/discovery/dnssd/public/ |
| D | dns_sd_instance_endpoint.cc | 23 std::vector<IPEndpoint> endpoints) in DnsSdInstanceEndpoint() argument
29 std::move(endpoints), in DnsSdInstanceEndpoint()
38 std::vector<IPEndpoint> endpoints, in DnsSdInstanceEndpoint() argument
44 endpoints.empty() ? 0 : endpoints[0].port, in DnsSdInstanceEndpoint()
46 endpoints_(std::move(endpoints)), in DnsSdInstanceEndpoint()
54 std::vector<IPEndpoint> endpoints) in DnsSdInstanceEndpoint() argument
56 endpoints_(std::move(endpoints)), in DnsSdInstanceEndpoint()
|
| D | dns_sd_instance_endpoint.h | 50 TEndpoints... endpoints) in DnsSdInstanceEndpoint()
54 std::vector<IPEndpoint>{std::move(endpoints)...}) {} in DnsSdInstanceEndpoint()
87 const std::vector<IPEndpoint>& endpoints() const { return endpoints_; } in endpoints() function
100 std::vector<IPEndpoint> endpoints, in DnsSdInstanceEndpoint() argument
109 Append(std::move(endpoints), std::move(endpoint)), in DnsSdInstanceEndpoint()
121 std::vector<IPEndpoint> endpoints, in DnsSdInstanceEndpoint() argument
130 std::move(endpoints), in DnsSdInstanceEndpoint()
|
| /external/cronet/net/reporting/ |
| D | reporting_cache_unittest.cc | 1694 std::vector<ReportingEndpoint> endpoints; in TEST_P() local
1695 endpoints.emplace_back(kGroupKey11_, in TEST_P()
1697 endpoints.emplace_back(kGroupKey22_, in TEST_P()
1699 endpoints.emplace_back(kGroupKey11_, in TEST_P()
1701 endpoints.emplace_back(kGroupKey21_, in TEST_P()
1713 store()->SetPrestoredClients(endpoints, groups); in TEST_P()
1742 std::vector<ReportingEndpoint> endpoints; in TEST_P() local
1743 endpoints.emplace_back(kGroupKey11_, in TEST_P()
1745 endpoints.emplace_back(kGroupKey21_, in TEST_P()
1747 endpoints.emplace_back(kOtherGroupKey21_, in TEST_P()
[all …]
|
| D | reporting_header_parser_unittest.cc | 122 const std::vector<ReportingEndpoint::EndpointInfo>& endpoints, in MakeEndpointGroup() argument
132 group.endpoints = std::move(endpoints); in MakeEndpointGroup()
160 group.endpoints) { in ConstructHeaderGroupString()
178 if (!group.endpoints.empty()) in ConstructHeaderGroupString()
274 std::vector<ReportingEndpoint::EndpointInfo> endpoints = {{kEndpoint1_}}; in TEST_P() local
278 ConstructHeaderGroupString(MakeEndpointGroup(kGroup1_, endpoints)); in TEST_P()
360 std::vector<ReportingEndpoint::EndpointInfo> endpoints = {{kEndpoint1_}}; in TEST_P() local
362 ConstructHeaderGroupString(MakeEndpointGroup(std::string(), endpoints)); in TEST_P()
394 std::vector<ReportingEndpoint::EndpointInfo> endpoints = {{kEndpoint1_}}; in TEST_P() local
397 MakeEndpointGroup(kGroup1_, endpoints, OriginSubdomains::INCLUDE)); in TEST_P()
[all …]
|