Package | Description |
---|---|
org.tensorflow.framework |
Modifier and Type | Method and Description |
---|---|
TensorInfo.CooSparse.Builder |
TensorInfo.CooSparse.Builder.addRepeatedField(org.nd4j.shade.protobuf.Descriptors.FieldDescriptor field,
Object value) |
TensorInfo.CooSparse.Builder |
TensorInfo.CooSparse.Builder.clear() |
TensorInfo.CooSparse.Builder |
TensorInfo.CooSparse.Builder.clearDenseShapeTensorName()
The dynamic logical shape represented by the SparseTensor is recorded in
the Tensor referenced here.
|
TensorInfo.CooSparse.Builder |
TensorInfo.CooSparse.Builder.clearField(org.nd4j.shade.protobuf.Descriptors.FieldDescriptor field) |
TensorInfo.CooSparse.Builder |
TensorInfo.CooSparse.Builder.clearIndicesTensorName()
The indices Tensor must have dtype int64 and shape [?, ?].
|
TensorInfo.CooSparse.Builder |
TensorInfo.CooSparse.Builder.clearOneof(org.nd4j.shade.protobuf.Descriptors.OneofDescriptor oneof) |
TensorInfo.CooSparse.Builder |
TensorInfo.CooSparse.Builder.clearValuesTensorName()
The shape of the values Tensor is [?].
|
TensorInfo.CooSparse.Builder |
TensorInfo.CooSparse.Builder.clone() |
TensorInfo.CooSparse.Builder |
TensorInfo.Builder.getCooSparseBuilder()
There are many possible encodings of sparse matrices
(https://en.wikipedia.org/wiki/Sparse_matrix).
|
TensorInfo.CooSparse.Builder |
TensorInfo.CooSparse.Builder.mergeFrom(org.nd4j.shade.protobuf.CodedInputStream input,
org.nd4j.shade.protobuf.ExtensionRegistryLite extensionRegistry) |
TensorInfo.CooSparse.Builder |
TensorInfo.CooSparse.Builder.mergeFrom(org.nd4j.shade.protobuf.Message other) |
TensorInfo.CooSparse.Builder |
TensorInfo.CooSparse.Builder.mergeFrom(TensorInfo.CooSparse other) |
TensorInfo.CooSparse.Builder |
TensorInfo.CooSparse.Builder.mergeUnknownFields(org.nd4j.shade.protobuf.UnknownFieldSet unknownFields) |
static TensorInfo.CooSparse.Builder |
TensorInfo.CooSparse.newBuilder() |
static TensorInfo.CooSparse.Builder |
TensorInfo.CooSparse.newBuilder(TensorInfo.CooSparse prototype) |
TensorInfo.CooSparse.Builder |
TensorInfo.CooSparse.newBuilderForType() |
protected TensorInfo.CooSparse.Builder |
TensorInfo.CooSparse.newBuilderForType(org.nd4j.shade.protobuf.GeneratedMessageV3.BuilderParent parent) |
TensorInfo.CooSparse.Builder |
TensorInfo.CooSparse.Builder.setDenseShapeTensorName(String value)
The dynamic logical shape represented by the SparseTensor is recorded in
the Tensor referenced here.
|
TensorInfo.CooSparse.Builder |
TensorInfo.CooSparse.Builder.setDenseShapeTensorNameBytes(org.nd4j.shade.protobuf.ByteString value)
The dynamic logical shape represented by the SparseTensor is recorded in
the Tensor referenced here.
|
TensorInfo.CooSparse.Builder |
TensorInfo.CooSparse.Builder.setField(org.nd4j.shade.protobuf.Descriptors.FieldDescriptor field,
Object value) |
TensorInfo.CooSparse.Builder |
TensorInfo.CooSparse.Builder.setIndicesTensorName(String value)
The indices Tensor must have dtype int64 and shape [?, ?].
|
TensorInfo.CooSparse.Builder |
TensorInfo.CooSparse.Builder.setIndicesTensorNameBytes(org.nd4j.shade.protobuf.ByteString value)
The indices Tensor must have dtype int64 and shape [?, ?].
|
TensorInfo.CooSparse.Builder |
TensorInfo.CooSparse.Builder.setRepeatedField(org.nd4j.shade.protobuf.Descriptors.FieldDescriptor field,
int index,
Object value) |
TensorInfo.CooSparse.Builder |
TensorInfo.CooSparse.Builder.setUnknownFields(org.nd4j.shade.protobuf.UnknownFieldSet unknownFields) |
TensorInfo.CooSparse.Builder |
TensorInfo.CooSparse.Builder.setValuesTensorName(String value)
The shape of the values Tensor is [?].
|
TensorInfo.CooSparse.Builder |
TensorInfo.CooSparse.Builder.setValuesTensorNameBytes(org.nd4j.shade.protobuf.ByteString value)
The shape of the values Tensor is [?].
|
TensorInfo.CooSparse.Builder |
TensorInfo.CooSparse.toBuilder() |
Modifier and Type | Method and Description |
---|---|
TensorInfo.Builder |
TensorInfo.Builder.setCooSparse(TensorInfo.CooSparse.Builder builderForValue)
There are many possible encodings of sparse matrices
(https://en.wikipedia.org/wiki/Sparse_matrix).
|
Copyright © 2020. All rights reserved.