public static class tensorflow.MatrixTriangularSolve.Attrs extends Pointer
Pointer.CustomDeallocator, Pointer.Deallocator, Pointer.NativeDeallocator| Constructor and Description |
|---|
Attrs()
Default native constructor.
|
Attrs(long size)
Native array allocator.
|
Attrs(Pointer p)
Pointer cast constructor.
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
adjoint_() |
tensorflow.MatrixTriangularSolve.Attrs |
adjoint_(boolean adjoint_) |
tensorflow.MatrixTriangularSolve.Attrs |
Adjoint(boolean x)
Boolean indicating whether to solve with
matrix or its (block-wise)
adjoint. |
boolean |
lower_() |
tensorflow.MatrixTriangularSolve.Attrs |
lower_(boolean lower_) |
tensorflow.MatrixTriangularSolve.Attrs |
Lower(boolean x)
Boolean indicating whether the innermost matrices in
matrix are
lower or upper triangular. |
tensorflow.MatrixTriangularSolve.Attrs |
position(long position) |
address, asBuffer, asByteBuffer, availablePhysicalBytes, calloc, capacity, capacity, close, deallocate, deallocate, deallocateReferences, deallocator, deallocator, equals, fill, formatBytes, free, hashCode, isNull, limit, limit, malloc, maxBytes, maxPhysicalBytes, memchr, memcmp, memcpy, memmove, memset, offsetof, parseBytes, physicalBytes, position, put, realloc, setNull, sizeof, toString, totalBytes, totalPhysicalBytes, withDeallocator, zeropublic Attrs()
public Attrs(long size)
Pointer.position(long).public Attrs(Pointer p)
Pointer.Pointer(Pointer).public tensorflow.MatrixTriangularSolve.Attrs position(long position)
@ByVal public tensorflow.MatrixTriangularSolve.Attrs Lower(@Cast(value="bool") boolean x)
matrix are
lower or upper triangular.
Defaults to true@ByVal public tensorflow.MatrixTriangularSolve.Attrs Adjoint(@Cast(value="bool") boolean x)
matrix or its (block-wise)
adjoint.
\compatibility(numpy)
Equivalent to scipy.linalg.solve_triangular
\end_compatibility
Defaults to falsepublic tensorflow.MatrixTriangularSolve.Attrs lower_(boolean lower_)
public tensorflow.MatrixTriangularSolve.Attrs adjoint_(boolean adjoint_)
Copyright © 2019. All rights reserved.