Help protect the Great Barrier Reef with TensorFlow on Kaggle Join Challenge


Creates an empty anonymous mutable hash table that uses tensors as the backing store.

This op creates a new anonymous mutable hash table (as a resource) everytime it is executed, with the specified dtype of its keys and values, returning the resource handle. Each value must be a scalar. Data can be inserted into the table using the insert operations. It does not support the initialization operation.

It uses "open addressing" with quadratic reprobing to resolve collisions.

The table is anonymous in the sense that it can only be accessed by the returned resource handle (e.g. it cannot be looked up by a name in a resource manager). The table will be automatically deleted when all resource handles pointing to it are gone.

empty_key A Tensor. The key used to represent empty key buckets internally. Must not be used in insert or lookup operations.
deleted_key A Tensor. Must have the same type as empty_key.
value_dtype A tf.DType. Type of the table values.
value_shape An optional tf.TensorShape or list of ints. Defaults to []. The shape of each value.
initial_num_buckets An optional int. Defaults to 131072. The initial number of hash table buckets. Must be a power to 2.
max_load_factor An optional float. Defaults to 0.8. The maximum ratio between number of entries and number of buckets before growing the table. Must be between 0 and 1.
name A name for the operation (optional).

A Tensor of type resource.