* <p>"In the order that they complete" means, for practical purposes, about what you would
   * expect, but there are some subtleties. First, we do guarantee that, if the output future at
   * index n is done, the output future at index n-1 is also done. (But as usual with futures, some
   * listeners for future n may complete before some for future n-1.) However, it is possible, if

    caused by looking up CA certificates. This is now fixed.


## Version 3.1.0

_2016-02-06_

 *  New: WebSockets now defer some writes. This should improve performance for
    some applications.
 *  New: Override `equals()` and `hashCode()` in our new cookie class. This
    class now defines equality by value rather than by reference.

                ctx.skipRoleQuery();
            });
            // If we get here without exception, that's actually fine for some invalid queries
            // that might be handled gracefully
        } catch (InvalidQueryException e) {
            // This is expected for some types of invalid queries
            assertNotNull(e.getMessage());
        }
    }

    public void test_buildBaseQuery_invalidQuery() {

                // Create directory structure
                Files.createDirectories(tempDir.resolve("public"));
                Files.createDirectories(tempDir.resolve("shared"));

                // Create some initial files
                Files.writeString(tempDir.resolve("public/readme.txt"), "This is a public share for testing");
                Files.writeString(tempDir.resolve("shared/initial.txt"), "Initial file in shared directory");

//   materialized in the address space of the calling process.
// * int is used as an index into arrays.
// * Deletion functions are safe to call on nullptr.
//
// Questions left to address:
// * Might at some point need a way for callers to provide their own Env.
// * Maybe add TF_TensorShape that encapsulates dimension info.
//
// Design decisions made:
// * Backing store for tensor memory has an associated deallocation

                this.in = this.socket.getInputStream();
            }

            if (this.credits.drainPermits() == 0) {
                log.debug("It appears we previously lost some credits");
            }

            if (this.smb2 || this.getContext().getConfig().isUseSMB2OnlyNegotiation()) {
                log.debug("Using SMB2 only negotiation");
                return negotiate2(null);

# @com_google_protobuf//python:protobuf_python will start depending on a bunch
# of cc_binary shared libraries artifacts, which will mess with how we link 
# protobuf dependencies ourselves. By default this value is false, but some 
# projects enable it, which we don't want here.
# build --define=use_fast_cpp_protos=true

# Make Bazel print out all options from rc files.
common --announce_rc

			metaArr[index].VersionID = versionID
			if !metaArr[index].InlineData() {
				// If the data is not inlined, we may end up incorrectly
				// inlining the data here, that leads to an inconsistent
				// situation where some objects are were not inlined
				// were now inlined, make sure to `nil` the Data such
				// that xl.meta is written as expected.
				metaArr[index].Data = nil
			}
			metaArr[index].Metadata = srcInfo.UserDefined

		// the ReadSlice test since ReadLine simply calls
		// ReadSlice, and it's that function that handles
		// the last byte.
	}

	// Try all readers with UnreadByte.
	for rno, read := range readers {
		// Some input data that is longer than the minimum reader buffer size.
		const n = 10
		var buf bytes.Buffer
		for i := 0; i < n; i++ {
			buf.WriteString("abcdefg")
		}

		r := NewReaderSize(&buf, minReadBufferSize)

   * <p><b>Warning:</b> if you ignore the above advice, and use this {@code CacheBuilder} to build a
   * cache whose key or value type is incompatible with the weigher, you will likely experience a
   * {@link ClassCastException} at some <i>undefined</i> point in the future.
   *
   * @param weigher the weigher to use in calculating the weight of cache entries
   * @return this {@code CacheBuilder} instance (for chaining)