// Represents a specific input of an operation.
typedef struct TF_Input {
  TF_Operation* oper;
  int index;  // The index of the input within oper.
} TF_Input;

// Represents a specific output of an operation.
typedef struct TF_Output {
  TF_Operation* oper;
  int index;  // The index of the output within oper.
} TF_Output;

// TF_Function is a grouping of operations with defined inputs and outputs.

        preWriteCleanup(now);

        int newCount = this.count - 1;
        AtomicReferenceArray<ReferenceEntry<K, V>> table = this.table;
        int index = hash & (table.length() - 1);
        ReferenceEntry<K, V> first = table.get(index);

        for (e = first; e != null; e = e.getNext()) {
          K entryKey = e.getKey();
          if (e.getHash() == hash
              && entryKey != null

	Nullable() (nullable bool, ok bool)
	Unique() (unique bool, ok bool)
	ScanType() reflect.Type
	Comment() (value string, ok bool)
	DefaultValue() (value string, ok bool)
}

type Index interface {
	Table() string
	Name() string
	Columns() []string
	PrimaryKey() (isPrimaryKey bool, ok bool)
	Unique() (unique bool, ok bool)
	Option() string
}

// TableType table type interface

        // Fail 3 times to open circuit
        for (int i = 0; i < 3; i++) {
            final int index = i;
            try {
                circuitBreaker.executeWithCircuitBreaker(() -> {
                    throw new RuntimeException("Test failure " + index);
                });
                fail("Should have thrown exception");
            } catch (CIFSException e) {
                // Expected

    private static class IndexedIterator<E extends @Nullable Object> {
      final PeekingIterator<E> iterator;
      final int index;

      IndexedIterator(PeekingIterator<E> iterator, int index) {
        this.iterator = iterator;
        this.index = index;
      }
    }

    final Queue<IndexedIterator<T>> queue;

    MergingIterator(

    private static class IndexedIterator<E extends @Nullable Object> {
      final PeekingIterator<E> iterator;
      final int index;

      IndexedIterator(PeekingIterator<E> iterator, int index) {
        this.iterator = iterator;
        this.index = index;
      }
    }

    final Queue<IndexedIterator<T>> queue;

    MergingIterator(

          },
          "updatedTime" : {
            "type" : "long"
          },
          "username" : {
            "type" : "keyword"
          }
        }
      }
    },
    "settings" : {
      "index" : {
        "creation_date" : "1509021053135",
        "number_of_shards" : "5",
        "number_of_replicas" : "1",
        "uuid" : "-gono3d2R0KP5po-ggBr0A",
        "version" : {
          "created" : "6000051"

     * @param body the plugin installation data containing name and version
     * @return JSON response indicating success or failure
     */
    // POST /api/admin/plugin
    @Execute
    public JsonResponse<ApiResult> post$index(final InstallBody body) {
        validateApi(body, messages -> {});
        final Artifact artifact = ComponentUtil.getPluginHelper().getArtifact(body.name, body.version);
        if (artifact == null) {

	})
}

func bmIndexRuneASCII(index func([]byte, rune) int) func(b *testing.B, n int) {
	return func(b *testing.B, n int) {
		buf := bmbuf[0:n]
		buf[n-1] = 'x'
		for i := 0; i < b.N; i++ {
			j := index(buf, 'x')
			if j != n-1 {
				b.Fatal("bad index", j)
			}
		}
		buf[n-1] = '\x00'
	}
}

func bmIndexRune(index func([]byte, rune) int) func(b *testing.B, n int) {

    sink: BufferedSink,
  ): Boolean {
    val index =
      mappings.binarySearch {
        when {
          it.sourceCodePoint1 < codePoint -> -1
          it.sourceCodePoint0 > codePoint -> 1
          else -> 0
        }
      }

    // Code points must be in 0..0x10ffff.
    require(index in mappings.indices) { "unexpected code point: $codePoint" }

    val mapping = mappings[index]
    var result = true