tf.sets.size
Stay organized with collections
Save and categorize content based on your preferences.
Compute number of unique elements along last dimension of a
.
tf.sets.size(
a, validate_indices=True
)
Args |
a
|
SparseTensor , with indices sorted in row-major order.
|
validate_indices
|
Whether to validate the order and range of sparse indices
in a . Note that setting this to false allows for undefined behavior
when calling this function with invalid indices.
|
Returns |
int32 Tensor of set sizes. For a ranked n , this is a Tensor with
rank n-1 , and the same 1st n-1 dimensions as a . Each value is the
number of unique elements in the corresponding [0...n-1] dimension of a .
|
Raises |
TypeError
|
If a is an invalid types.
|
Except as otherwise noted, the content of this page is licensed under the Creative Commons Attribution 4.0 License, and code samples are licensed under the Apache 2.0 License. For details, see the Google Developers Site Policies. Java is a registered trademark of Oracle and/or its affiliates. Some content is licensed under the numpy license.
Last updated 2024-04-26 UTC.
[{
"type": "thumb-down",
"id": "missingTheInformationINeed",
"label":"Missing the information I need"
},{
"type": "thumb-down",
"id": "tooComplicatedTooManySteps",
"label":"Too complicated / too many steps"
},{
"type": "thumb-down",
"id": "outOfDate",
"label":"Out of date"
},{
"type": "thumb-down",
"id": "samplesCodeIssue",
"label":"Samples / code issue"
},{
"type": "thumb-down",
"id": "otherDown",
"label":"Other"
}]
[{
"type": "thumb-up",
"id": "easyToUnderstand",
"label":"Easy to understand"
},{
"type": "thumb-up",
"id": "solvedMyProblem",
"label":"Solved my problem"
},{
"type": "thumb-up",
"id": "otherUp",
"label":"Other"
}]
{
"lastModified": "Last updated 2024-04-26 UTC.",
"confidential": False
}