- Sort Score
- Result 10 results
- Languages All
Results 291 - 300 of 1,640 for results (0.05 sec)
-
src/main/java/jcifs/smb1/smb1/SmbComTransactionResponse.java
byte subCommand; boolean hasMore = true; boolean isPrimary = true; byte[] txn_buf; /* for doNetEnum and doFindFirstNext */ int status; int numEntries; FileEntry[] results; SmbComTransactionResponse() { txn_buf = null; } void reset() { super.reset(); bufDataStart = 0; isPrimary = hasMore = true;
Registered: Sun Nov 03 00:10:13 UTC 2024 - Last Modified: Fri Mar 22 21:10:40 UTC 2019 - 6K bytes - Viewed (0) -
src/main/java/jcifs/smb1/netbios/NodeStatusResponse.java
private byte[] macAddress; private byte[] stats; NbtAddress[] addressArray; /* It is a little awkward but prudent to pass the quering address * so that it may be included in the list of results. IOW we do * not want to create a new NbtAddress object for this particular * address from which the query is constructed, we want to populate * the data of the existing address that should be one of several
Registered: Sun Nov 03 00:10:13 UTC 2024 - Last Modified: Fri Mar 22 20:39:42 UTC 2019 - 6K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/base/AsciiBenchmark.java
@Param boolean noWorkToDo; Random random; String testString; @BeforeExperiment void setUp() { random = new Random(0xdeadbeef); // fix the seed so results are comparable across runs int nonAlpha = size / nonAlphaRatio; int alpha = size - nonAlpha; List<Character> chars = Lists.newArrayListWithCapacity(size); for (int i = 0; i < alpha; i++) {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Dec 04 17:37:03 UTC 2017 - 4.8K bytes - Viewed (0) -
tensorflow/c/eager/c_api_unified_experimental_internal.h
#include "tensorflow/c/tf_status.h" #include "tensorflow/core/framework/tensor_shape.h" #include "tensorflow/core/platform/casts.h" #include "tensorflow/core/platform/types.h" namespace tensorflow { // Represents the results of the execution of an operation. struct OutputList { std::vector<AbstractTensorHandle*> outputs; int expected_num_outputs = -1; }; namespace tracing {
Registered: Tue Nov 05 12:39:12 UTC 2024 - Last Modified: Sat Oct 12 05:11:17 UTC 2024 - 5.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Streams.java
if (splitOrNull == null) { return null; } @SuppressWarnings("unchecked") F split = (F) splitOrNull; S result = createSplit(split, index); this.index += split.getExactSizeIfKnown(); return result; } @Override public long estimateSize() { return fromSpliterator.estimateSize(); } @Override
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 31 14:20:11 UTC 2024 - 37.4K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/connection/RoutePlanner.kt
* If [nextPlan] is not-null, another attempt should be made by following it. If [throwable] is * non-null, it should be reported to the user should all further attempts fail. * * The two values are independent: results can contain both (recoverable error), neither * (success), just an exception (permanent failure), or just a plan (non-exceptional retry). */ data class ConnectResult( val plan: Plan,
Registered: Fri Nov 01 11:42:11 UTC 2024 - Last Modified: Wed Dec 20 23:27:07 UTC 2023 - 4.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/NetworkMutationTest.java
testNetworkMutation(NetworkBuilder.undirected()); } private static void testNetworkMutation(NetworkBuilder<? super Integer, Object> networkBuilder) { Random gen = new Random(42); // Fixed seed so test results are deterministic. for (int trial = 0; trial < NUM_TRIALS; ++trial) { MutableNetwork<Integer, Object> network = networkBuilder.allowsParallelEdges(true).allowsSelfLoops(true).build();
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Apr 10 19:42:18 UTC 2024 - 4.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/GraphMutationTest.java
testGraphMutation(GraphBuilder.undirected()); } private static void testGraphMutation(GraphBuilder<? super Integer> graphBuilder) { Random gen = new Random(42); // Fixed seed so test results are deterministic. for (int trial = 0; trial < NUM_TRIALS; ++trial) { MutableGraph<Integer> graph = graphBuilder.allowsSelfLoops(true).build(); assertThat(graph.nodes()).isEmpty();
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Aug 18 16:17:46 UTC 2017 - 4.2K bytes - Viewed (0) -
internal/grid/grid_test.go
defer close(stream.Requests) for i := 0; i < payloads; i++ { // t.Log("sending new client request") stream.Requests <- &testRequest{Num: i, String: testPayload} } }() var n int err = stream.Results(func(resp *testResponse) error { const wantString = testPayload + testPayload if resp.OrgString != testPayload+testPayload { t.Errorf("want %q, got %q", wantString, resp.OrgString) } if resp.OrgNum != n+1 {
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Mon Jul 29 18:10:04 UTC 2024 - 36.4K bytes - Viewed (0) -
ci/official/utilities/generate_index_html.sh
Registered: Tue Nov 05 12:39:12 UTC 2024 - Last Modified: Fri Sep 29 20:26:13 UTC 2023 - 2.3K bytes - Viewed (0)