| /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/guava/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());
203 public Optional<E> edgeConnecting(EndpointPair<N> endpoints) {
204 validateEndpoints(endpoints);
205 return edgeConnecting(endpoints.nodeU(), endpoints.nodeV());
222 public @Nullable E edgeConnectingOrNull(EndpointPair<N> endpoints) {
223 validateEndpoints(endpoints);
224 return edgeConnectingOrNull(endpoints.nodeU(), endpoints.nodeV());
235 public boolean hasEdgeConnecting(EndpointPair<N> endpoints) {
[all …]
|
| D | StandardMutableGraph.java | 55 public boolean putEdge(EndpointPair<N> endpoints) { in putEdge() argument
56 validateEndpoints(endpoints); in putEdge()
57 return putEdge(endpoints.nodeU(), endpoints.nodeV()); in putEdge()
71 public boolean removeEdge(EndpointPair<N> endpoints) { in removeEdge() argument
72 validateEndpoints(endpoints); in removeEdge()
73 return removeEdge(endpoints.nodeU(), endpoints.nodeV()); in removeEdge()
|
| D | ForwardingNetwork.java | 129 public Set<E> edgesConnecting(EndpointPair<N> endpoints) { in edgesConnecting() argument
130 return delegate().edgesConnecting(endpoints); in edgesConnecting()
139 public Optional<E> edgeConnecting(EndpointPair<N> endpoints) { in edgeConnecting() argument
140 return delegate().edgeConnecting(endpoints); in edgeConnecting()
149 public E edgeConnectingOrNull(EndpointPair<N> endpoints) { in edgeConnectingOrNull() argument
150 return delegate().edgeConnectingOrNull(endpoints); in edgeConnectingOrNull()
159 public boolean hasEdgeConnecting(EndpointPair<N> endpoints) { in hasEdgeConnecting() argument
160 return delegate().hasEdgeConnecting(endpoints); in hasEdgeConnecting()
|
| D | AbstractBaseGraph.java | 176 public boolean hasEdgeConnecting(EndpointPair<N> endpoints) {
177 checkNotNull(endpoints);
178 if (!isOrderingCompatible(endpoints)) {
181 N nodeU = endpoints.nodeU();
182 N nodeV = endpoints.nodeV();
190 protected final void validateEndpoints(EndpointPair<?> endpoints) {
191 checkNotNull(endpoints);
192 checkArgument(isOrderingCompatible(endpoints), ENDPOINTS_MISMATCH);
195 protected final boolean isOrderingCompatible(EndpointPair<?> endpoints) {
196 return endpoints.isOrdered() || !this.isDirected();
|
| D | StandardValueGraph.java | 136 public boolean hasEdgeConnecting(EndpointPair<N> endpoints) {
137 checkNotNull(endpoints);
138 return isOrderingCompatible(endpoints)
139 && hasEdgeConnecting_internal(endpoints.nodeU(), endpoints.nodeV());
148 public @Nullable V edgeValueOrDefault(EndpointPair<N> endpoints, @Nullable V defaultValue) {
149 validateEndpoints(endpoints);
150 return edgeValueOrDefault_internal(endpoints.nodeU(), endpoints.nodeV(), defaultValue);
|
| D | Graphs.java | 249 static <N> EndpointPair<N> transpose(EndpointPair<N> endpoints) { in transpose() argument
250 if (endpoints.isOrdered()) { in transpose()
251 return EndpointPair.ordered(endpoints.target(), endpoints.source()); in transpose()
253 return endpoints; in transpose()
313 public boolean hasEdgeConnecting(EndpointPair<N> endpoints) {
314 return delegate().hasEdgeConnecting(transpose(endpoints));
358 public boolean hasEdgeConnecting(EndpointPair<N> endpoints) {
359 return delegate().hasEdgeConnecting(transpose(endpoints));
368 public Optional<V> edgeValue(EndpointPair<N> endpoints) {
369 return delegate().edgeValue(transpose(endpoints));
[all …]
|
| D | StandardMutableValueGraph.java | 111 public V putEdgeValue(EndpointPair<N> endpoints, V value) { in putEdgeValue() argument
112 validateEndpoints(endpoints); in putEdgeValue()
113 return putEdgeValue(endpoints.nodeU(), endpoints.nodeV(), value); in putEdgeValue()
171 public V removeEdge(EndpointPair<N> endpoints) { in removeEdge() argument
172 validateEndpoints(endpoints); in removeEdge()
173 return removeEdge(endpoints.nodeU(), endpoints.nodeV()); in removeEdge()
|
| D | ForwardingValueGraph.java | 104 public boolean hasEdgeConnecting(EndpointPair<N> endpoints) { in hasEdgeConnecting() argument
105 return delegate().hasEdgeConnecting(endpoints); in hasEdgeConnecting()
114 public Optional<V> edgeValue(EndpointPair<N> endpoints) { in edgeValue() argument
115 return delegate().edgeValue(endpoints); in edgeValue()
124 public @Nullable V edgeValueOrDefault(EndpointPair<N> endpoints, @Nullable V defaultValue) { in edgeValueOrDefault() argument
125 return delegate().edgeValueOrDefault(endpoints, defaultValue); in edgeValueOrDefault()
|
| D | Network.java | 308 Set<E> edgesConnecting(EndpointPair<N> endpoints); in edgesConnecting() argument
337 Optional<E> edgeConnecting(EndpointPair<N> endpoints); in edgeConnecting() argument
367 E edgeConnectingOrNull(EndpointPair<N> endpoints); in edgeConnectingOrNull() argument
391 boolean hasEdgeConnecting(EndpointPair<N> endpoints); in hasEdgeConnecting() argument
|
| D | ValueGraph.java | 277 boolean hasEdgeConnecting(EndpointPair<N> endpoints); in hasEdgeConnecting() argument
300 Optional<V> edgeValue(EndpointPair<N> endpoints); in edgeValue() argument
326 V edgeValueOrDefault(EndpointPair<N> endpoints, @Nullable V defaultValue); in edgeValueOrDefault() argument
|
| /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 | StandardMutableGraph.java | 55 public boolean putEdge(EndpointPair<N> endpoints) { in putEdge() argument
56 validateEndpoints(endpoints); in putEdge()
57 return putEdge(endpoints.nodeU(), endpoints.nodeV()); in putEdge()
71 public boolean removeEdge(EndpointPair<N> endpoints) { in removeEdge() argument
72 validateEndpoints(endpoints); in removeEdge()
73 return removeEdge(endpoints.nodeU(), endpoints.nodeV()); in removeEdge()
|
| D | AbstractNetwork.java | 182 public Set<E> edgesConnecting(EndpointPair<N> endpoints) {
183 validateEndpoints(endpoints);
184 return edgesConnecting(endpoints.nodeU(), endpoints.nodeV());
212 public E edgeConnectingOrNull(EndpointPair<N> endpoints) {
213 validateEndpoints(endpoints);
214 return edgeConnectingOrNull(endpoints.nodeU(), endpoints.nodeV());
225 public boolean hasEdgeConnecting(EndpointPair<N> endpoints) {
226 checkNotNull(endpoints);
227 if (!isOrderingCompatible(endpoints)) {
230 return hasEdgeConnecting(endpoints.nodeU(), endpoints.nodeV());
[all …]
|
| D | AbstractBaseGraph.java | 176 public boolean hasEdgeConnecting(EndpointPair<N> endpoints) {
177 checkNotNull(endpoints);
178 if (!isOrderingCompatible(endpoints)) {
181 N nodeU = endpoints.nodeU();
182 N nodeV = endpoints.nodeV();
190 protected final void validateEndpoints(EndpointPair<?> endpoints) {
191 checkNotNull(endpoints);
192 checkArgument(isOrderingCompatible(endpoints), ENDPOINTS_MISMATCH);
195 protected final boolean isOrderingCompatible(EndpointPair<?> endpoints) {
196 return endpoints.isOrdered() || !this.isDirected();
|
| D | StandardValueGraph.java | 136 public boolean hasEdgeConnecting(EndpointPair<N> endpoints) {
137 checkNotNull(endpoints);
138 return isOrderingCompatible(endpoints)
139 && hasEdgeConnecting_internal(endpoints.nodeU(), endpoints.nodeV());
150 public V edgeValueOrDefault(EndpointPair<N> endpoints, @NullableDecl V defaultValue) {
151 validateEndpoints(endpoints);
152 return edgeValueOrDefault_internal(endpoints.nodeU(), endpoints.nodeV(), defaultValue);
|
| D | StandardMutableValueGraph.java | 111 public V putEdgeValue(EndpointPair<N> endpoints, V value) { in putEdgeValue() argument
112 validateEndpoints(endpoints); in putEdgeValue()
113 return putEdgeValue(endpoints.nodeU(), endpoints.nodeV(), value); in putEdgeValue()
171 public V removeEdge(EndpointPair<N> endpoints) { in removeEdge() argument
172 validateEndpoints(endpoints); in removeEdge()
173 return removeEdge(endpoints.nodeU(), endpoints.nodeV()); in removeEdge()
|
| D | ForwardingNetwork.java | 128 public Set<E> edgesConnecting(EndpointPair<N> endpoints) { in edgesConnecting() argument
129 return delegate().edgesConnecting(endpoints); in edgesConnecting()
138 public E edgeConnectingOrNull(EndpointPair<N> endpoints) { in edgeConnectingOrNull() argument
139 return delegate().edgeConnectingOrNull(endpoints); in edgeConnectingOrNull()
148 public boolean hasEdgeConnecting(EndpointPair<N> endpoints) { in hasEdgeConnecting() argument
149 return delegate().hasEdgeConnecting(endpoints); in hasEdgeConnecting()
|
| D | Graphs.java | 251 static <N> EndpointPair<N> transpose(EndpointPair<N> endpoints) { in transpose() argument
252 if (endpoints.isOrdered()) { in transpose()
253 return EndpointPair.ordered(endpoints.target(), endpoints.source()); in transpose()
255 return endpoints; in transpose()
315 public boolean hasEdgeConnecting(EndpointPair<N> endpoints) {
316 return delegate().hasEdgeConnecting(transpose(endpoints));
360 public boolean hasEdgeConnecting(EndpointPair<N> endpoints) {
361 return delegate().hasEdgeConnecting(transpose(endpoints));
372 public V edgeValueOrDefault(EndpointPair<N> endpoints, @NullableDecl V defaultValue) {
373 return delegate().edgeValueOrDefault(transpose(endpoints), defaultValue);
[all …]
|
| D | ForwardingValueGraph.java | 103 public boolean hasEdgeConnecting(EndpointPair<N> endpoints) { in hasEdgeConnecting() argument
104 return delegate().hasEdgeConnecting(endpoints); in hasEdgeConnecting()
115 public V edgeValueOrDefault(EndpointPair<N> endpoints, @NullableDecl V defaultValue) { in edgeValueOrDefault() argument
116 return delegate().edgeValueOrDefault(endpoints, defaultValue); in edgeValueOrDefault()
|
| /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/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/number/ |
| D | PatternStringParser.java | 98 long endpoints = getEndpoints(flags); in charAt() local
99 int left = (int) (endpoints & 0xffffffff); in charAt()
100 int right = (int) (endpoints >>> 32); in charAt()
112 public static int getLengthFromEndpoints(long endpoints) { in getLengthFromEndpoints() argument
113 int left = (int) (endpoints & 0xffffffff); in getLengthFromEndpoints()
114 int right = (int) (endpoints >>> 32); in getLengthFromEndpoints()
120 long endpoints = getEndpoints(flags); in getString() local
121 int left = (int) (endpoints & 0xffffffff); in getString()
122 int right = (int) (endpoints >>> 32); in getString()
294 long endpoints = state.offset; in consumeAffix() local
[all …]
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/number/ |
| D | PatternStringParser.java | 101 long endpoints = getEndpoints(flags); in charAt() local
102 int left = (int) (endpoints & 0xffffffff); in charAt()
103 int right = (int) (endpoints >>> 32); in charAt()
115 public static int getLengthFromEndpoints(long endpoints) { in getLengthFromEndpoints() argument
116 int left = (int) (endpoints & 0xffffffff); in getLengthFromEndpoints()
117 int right = (int) (endpoints >>> 32); in getLengthFromEndpoints()
123 long endpoints = getEndpoints(flags); in getString() local
124 int left = (int) (endpoints & 0xffffffff); in getString()
125 int right = (int) (endpoints >>> 32); in getString()
300 long endpoints = state.offset; in consumeAffix() local
[all …]
|
| /external/openscreen/osp/impl/quic/testing/ |
| D | fake_quic_connection_factory.cc | 160 const std::vector<IPEndpoint>& endpoints) { in SetServerDelegate() argument
192 const std::vector<IPEndpoint>& endpoints) { in SetServerDelegate() argument
194 OSP_DCHECK_EQ(1u, endpoints.size()) in SetServerDelegate()
198 endpoints.empty() ? IPEndpoint{} : endpoints[0]); in SetServerDelegate()
|