All Downloads are FREE. Search and download functionalities are using the official Maven repository.
Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $
You can buy this project and download/modify it how often you want.
org.tensorflow.op.io.RandomShuffleQueue Maven / Gradle / Ivy
/* Copyright 2018 The TensorFlow Authors. All Rights Reserved.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
=======================================================================*/
// This class has been generated, DO NOT EDIT!
package org.tensorflow.op.io;
import java.util.List;
import org.tensorflow.DataType;
import org.tensorflow.Operand;
import org.tensorflow.Operation;
import org.tensorflow.OperationBuilder;
import org.tensorflow.Output;
import org.tensorflow.Shape;
import org.tensorflow.op.PrimitiveOp;
import org.tensorflow.op.Scope;
import org.tensorflow.op.annotation.Operator;
/**
* A queue that randomizes the order of elements.
*/
@Operator(group = "io")
public final class RandomShuffleQueue extends PrimitiveOp implements Operand {
/**
* Optional attributes for {@link org.tensorflow.op.io.RandomShuffleQueue}
*/
public static class Options {
/**
* @param shapes The shape of each component in a value. The length of this attr must
* be either 0 or the same as the length of component_types. If the length of
* this attr is 0, the shapes of queue elements are not constrained, and
* only one element may be dequeued at a time.
*/
public Options shapes(List shapes) {
this.shapes = shapes;
return this;
}
/**
* @param capacity The upper bound on the number of elements in this queue.
* Negative numbers mean no limit.
*/
public Options capacity(Long capacity) {
this.capacity = capacity;
return this;
}
/**
* @param minAfterDequeue Dequeue will block unless there would be this
* many elements after the dequeue or the queue is closed. This
* ensures a minimum level of mixing of elements.
*/
public Options minAfterDequeue(Long minAfterDequeue) {
this.minAfterDequeue = minAfterDequeue;
return this;
}
/**
* @param seed If either seed or seed2 is set to be non-zero, the random number
* generator is seeded by the given seed. Otherwise, a random seed is used.
*/
public Options seed(Long seed) {
this.seed = seed;
return this;
}
/**
* @param seed2 A second seed to avoid seed collision.
*/
public Options seed2(Long seed2) {
this.seed2 = seed2;
return this;
}
/**
* @param container If non-empty, this queue is placed in the given container.
* Otherwise, a default container is used.
*/
public Options container(String container) {
this.container = container;
return this;
}
/**
* @param sharedName If non-empty, this queue will be shared under the given name
* across multiple sessions.
*/
public Options sharedName(String sharedName) {
this.sharedName = sharedName;
return this;
}
private List shapes;
private Long capacity;
private Long minAfterDequeue;
private Long seed;
private Long seed2;
private String container;
private String sharedName;
private Options() {
}
}
/**
* Factory method to create a class wrapping a new RandomShuffleQueue operation.
*
* @param scope current scope
* @param componentTypes The type of each component in a value.
* @param options carries optional attributes values
* @return a new instance of RandomShuffleQueue
*/
public static RandomShuffleQueue create(Scope scope, List> componentTypes, Options... options) {
OperationBuilder opBuilder = scope.env().opBuilder("RandomShuffleQueueV2", scope.makeOpName("RandomShuffleQueue"));
opBuilder = scope.applyControlDependencies(opBuilder);
DataType[] componentTypesArray = new DataType[componentTypes.size()];
for (int i = 0; i < componentTypesArray.length; ++i) {
componentTypesArray[i] = DataType.fromClass(componentTypes.get(i));
}
opBuilder.setAttr("component_types", componentTypesArray);
if (options != null) {
for (Options opts : options) {
if (opts.shapes != null) {
Shape[] shapesArray = new Shape[opts.shapes.size()];
for (int i = 0; i < shapesArray.length; ++i) {
shapesArray[i] = opts.shapes.get(i);
}
opBuilder.setAttr("shapes", shapesArray);
}
if (opts.capacity != null) {
opBuilder.setAttr("capacity", opts.capacity);
}
if (opts.minAfterDequeue != null) {
opBuilder.setAttr("min_after_dequeue", opts.minAfterDequeue);
}
if (opts.seed != null) {
opBuilder.setAttr("seed", opts.seed);
}
if (opts.seed2 != null) {
opBuilder.setAttr("seed2", opts.seed2);
}
if (opts.container != null) {
opBuilder.setAttr("container", opts.container);
}
if (opts.sharedName != null) {
opBuilder.setAttr("shared_name", opts.sharedName);
}
}
}
return new RandomShuffleQueue(opBuilder.build());
}
/**
* @param shapes The shape of each component in a value. The length of this attr must
* be either 0 or the same as the length of component_types. If the length of
* this attr is 0, the shapes of queue elements are not constrained, and
* only one element may be dequeued at a time.
*/
public static Options shapes(List shapes) {
return new Options().shapes(shapes);
}
/**
* @param capacity The upper bound on the number of elements in this queue.
* Negative numbers mean no limit.
*/
public static Options capacity(Long capacity) {
return new Options().capacity(capacity);
}
/**
* @param minAfterDequeue Dequeue will block unless there would be this
* many elements after the dequeue or the queue is closed. This
* ensures a minimum level of mixing of elements.
*/
public static Options minAfterDequeue(Long minAfterDequeue) {
return new Options().minAfterDequeue(minAfterDequeue);
}
/**
* @param seed If either seed or seed2 is set to be non-zero, the random number
* generator is seeded by the given seed. Otherwise, a random seed is used.
*/
public static Options seed(Long seed) {
return new Options().seed(seed);
}
/**
* @param seed2 A second seed to avoid seed collision.
*/
public static Options seed2(Long seed2) {
return new Options().seed2(seed2);
}
/**
* @param container If non-empty, this queue is placed in the given container.
* Otherwise, a default container is used.
*/
public static Options container(String container) {
return new Options().container(container);
}
/**
* @param sharedName If non-empty, this queue will be shared under the given name
* across multiple sessions.
*/
public static Options sharedName(String sharedName) {
return new Options().sharedName(sharedName);
}
/**
* The handle to the queue.
*/
public Output handle() {
return handle;
}
@Override
@SuppressWarnings("unchecked")
public Output asOutput() {
return (Output) handle;
}
private Output handle;
private RandomShuffleQueue(Operation operation) {
super(operation);
int outputIdx = 0;
handle = operation.output(outputIdx++);
}
}
