Module rank 

Provides rank function to assign a rank to each value in an array

Constants

BYTE_VIEW_KEY_FALLBACK_COLLISION_RATIO 🔒

BYTE_VIEW_KEY_LEN 🔒

BYTE_VIEW_KEY_MAX_PROBES_PER_WINDOW 🔒

BYTE_VIEW_KEY_SAMPLES_PER_WINDOW 🔒

BYTE_VIEW_KEY_SAMPLE_SIZE 🔒

Functions

boolean_rank 🔒

byte_view_key 🔒

byte_view_rank 🔒

bytes_rank 🔒

can_rank 🔒

Whether arrow_ord::rank can rank an array of given data type.

compare_view_key 🔒

equal_view_key 🔒

get_boolean_rank_index 🔒

Return the index for the rank when ranking boolean array

has_high_byte_view_key_collision_rate 🔒

Estimates whether cached byte-view keys collide often enough to make the key-based ranking path unattractive. Caching a wider key usually avoids repeated backing-buffer reads for long views. If sampled keys collide frequently, resolving full values plus the extra key comparison can be slower than comparing slices directly, so the caller falls back to that path. The bounded two-window sample keeps this check inexpensive.

primitive_rank 🔒

rank

Assigns a rank to each value in array based on its position in the sorted order

rank_impl 🔒

rank_impl_by 🔒