close(r.exitReader)
		r.readerWg.Wait()
		r.exitReader = nil
		r.input = nil
	}
	return nil
}

// startReader will start a reader that accepts input from r.input.
// Input should be root -> object input. Each root indicates a record.
// If r.input is closed, it is assumed that no more input will come.
// When this function returns r.readerWg will be decremented and r.decoded will be closed.

//     token: "Bearer xxxxx" # optional authentication token for the notification endpoint

//   retry:
//     attempts: 10 # number of retries for the job before giving up
//     delay: "500ms" # least amount of delay between each retry

//go:generate msgp -file $GOFILE -unexported

// BatchKeyRotationType defines key rotation type
type BatchKeyRotationType string

const (
	sses3  BatchKeyRotationType = "sse-s3"

 * available online).
 * <p>
 * Direct ACEs are evaluated first in order. The SID of the user performing
 * the operation and the desired access bits are compared to the SID
 * and access mask of each ACE. If the SID matches, the allow/deny flags
 * and access mask are considered. If the ACE is a "deny"
 * ACE and <i>any</i> of the desired access bits match bits in the access

    private ArgumentCaptor<MsrpcSamrCloseHandle> closeHandleCaptor;

    @BeforeEach
    void setUp() {
        // Initialize mocks and captors before each test
        MockitoAnnotations.openMocks(this);
        openDomainCaptor = ArgumentCaptor.forClass(MsrpcSamrOpenDomain.class);
        closeHandleCaptor = ArgumentCaptor.forClass(MsrpcSamrCloseHandle.class);
    }

        LogStream.setInstance(stream1);
        LogStream instance1 = LogStream.getInstance();

        LogStream.setInstance(stream2);
        LogStream instance2 = LogStream.getInstance();

        // Each setInstance should create a new LogStream
        assertNotNull(instance1);
        assertNotNull(instance2);
        // The second setInstance replaces the first, so they should not be the same

        filterList.add(filter);
        createFilterChain();
    }

    /**
     * Creates the filter chain from the registered filters.
     * The chain starts with the default filter chain and appends each registered filter.
     */
    protected void createFilterChain() {
        FilterChain chain = createDefaultFilterChain();
        for (final Filter element : filterList) {

        } else {
          break@mergeAdjacent
        }
      }
    }
    i++
  }
  return ranges
}

/**
 * Returns a copy of [mappings], splitting to ensure that each mapping is entirely contained within
 * a single section.
 */
internal fun withoutSectionSpans(mappings: List<Mapping>): List<Mapping> {
  val result = mutableListOf<Mapping>()

  val i = mappings.iterator()

   *
   * <p>The initial invocation of {@link #hasNext()} or {@link #next()} calls this method, as does
   * the first invocation of {@code hasNext} or {@code next} following each successful call to
   * {@code next}. Once the implementation either invokes {@code endOfData} or throws an exception,
   * {@code computeNext} is guaranteed to never be called again.
   *

	// Max time between client calls before dropping an async cache listing.
	metacacheMaxClientWait = 3 * time.Minute

	// metacacheBlockSize is the number of file/directory entries to have in each block.
	metacacheBlockSize = 5000

	// metacacheSharePrefix controls whether prefixes on dirty paths are always shared.
	// This will make `test/a` and `test/b` share listings if they are concurrent.

  // Maps from name of an operation to the Node* in 'graph'.
  std::unordered_map<std::string, tensorflow::Node*> name_map TF_GUARDED_BY(mu);

  // The keys of this map are all the active sessions using this graph. Each
  // value records whether the graph has been mutated since the corresponding
  // session has been run (this is detected in RecordMutation function). If the
  // string is empty, no mutation has occurred. Otherwise the string is a