}

def TF_OneShotIteratorOp : TF_Op<"OneShotIterator", []> {
  let summary = [{
Makes a "one-shot" iterator that can be iterated only once.
  }];

  let description = [{
A one-shot iterator bundles the logic for defining the dataset and
the state of the iterator in a single op, which allows simple input
pipelines to be defined without an additional initialization
("MakeIterator") step.

- github.com/gorilla/mux: [v1.7.0 → v1.7.3](https://github.com/gorilla/mux/compare/v1.7.0...v1.7.3)
- github.com/json-iterator/go: [v1.1.8 → v1.1.10](https://github.com/json-iterator/go/compare/v1.1.8...v1.1.10)
- github.com/jstemmer/go-junit-report: [af01ea7 → v0.9.1](https://github.com/jstemmer/go-junit-report/compare/af01ea7...v0.9.1)

    been changed. It now returns a function that can be used as an argument to
    `Dataset.apply()`.
*   Remove `tf.contrib.data.Iterator.from_dataset()` method. Use
    `Dataset.make_initializable_iterator()` instead.
*   Remove seldom used and unnecessary `tf.contrib.data.Iterator.dispose_op()`.
*   Reorder some TF-GAN loss functions in a non-backwards compatible way.

## Known Issues

            "items": {
              "default": "",
              "type": "string"
            },
            "type": "array",

          },
          "storageVersionHash": {

		{"(*File).SetLinesForContent", Method, 0},
		{"(*File).Size", Method, 0},
		{"(*FileSet).AddFile", Method, 0},
		{"(*FileSet).Base", Method, 0},
		{"(*FileSet).File", Method, 0},
		{"(*FileSet).Iterate", Method, 0},
		{"(*FileSet).Position", Method, 0},
		{"(*FileSet).PositionFor", Method, 4},
		{"(*FileSet).Read", Method, 0},
		{"(*FileSet).RemoveFile", Method, 20},
		{"(*FileSet).Write", Method, 0},

describing such Glasses as shall make the last Image of any Object as
distinct and large and luminous as it can conveniently be made.

I have now given in Axioms and their Explications the sum of what hath
hitherto been treated of in Opticks. For what hath been generally
agreed on I content my self to assume under the notion of Principles, in
order to what I have farther to write. And this may suffice for an

                  that they are responsible for.


                  Note that to achieve this, the list of PolicyAncestorStatus structs
                  MUST be treated as a map with a composite key, made up of the AncestorRef
                  and ControllerName fields combined.


                  A maximum of 16 ancestors will be represented in this list. An empty list