var searchIndex = {};
searchIndex["succinct"] = {"doc":"Succinct data structures for Rust.","items":[[3,"BitVec","succinct","A bit vector implementation.",null,null],[3,"IntVec","","A vector of *k*-bit unsigned integers, where *k* is determined at\nrun time.",null,null],[3,"JacobsonRank","","Add-on to `Bits` to support fast rank queries.",null,null],[3,"BinSearchSelect","","Performs a select query by binary searching rank queries.",null,null],[0,"storage","","Traits for describing how bits and arrays of bits are stored.",null,null],[3,"Address","succinct::storage","Represents the address of a bit, broken into a block component\nand a bit offset component.",null,null],[12,"block_index","","The index of the block containing the bit in question.",0,null],[12,"bit_offset","","The position of the bit in question within its block.",0,null],[8,"BlockType","","Types that can be used for `IntVec` and `BitVec` storage.",null,null],[11,"nbits","","The number of bits in a block.",1,{"inputs":[],"output":{"name":"usize"}}],[11,"div_nbits","","Returns `index / Self::nbits()`, computed by shifting.",1,{"inputs":[{"name":"u64"}],"output":{"name":"usize"}}],[11,"div_nbits_checked","","Returns `index / Self::nbits()`, computed by shifting.",1,{"inputs":[{"name":"u64"}],"output":{"name":"option"}}],[11,"ceil_div_nbits_checked","","Returns `index / Self::nbits()` rounded up, computed by shifting.",1,{"inputs":[{"name":"u64"}],"output":{"name":"option"}}],[11,"ceil_div_nbits","","Returns `index / Self::nbits()` rounded up, computed by shifting.",1,{"inputs":[{"name":"u64"}],"output":{"name":"usize"}}],[11,"mod_nbits","","Returns `index % Self::nbits()`, computed by masking.",1,{"inputs":[{"name":"u64"}],"output":{"name":"usize"}}],[11,"mul_nbits","","Returns `index * Self::nbits()`, computed by shifting.",1,{"inputs":[{"name":"usize"}],"output":{"name":"u64"}}],[11,"last_block_bits","","Computes how many bits are in the last block of an array of\n`len` bits.",1,{"inputs":[{"name":"u64"}],"output":{"name":"usize"}}],[11,"lg_nbits","","Log-base-2 of the number of bits in a block.",1,{"inputs":[],"output":{"name":"usize"}}],[11,"lg_nbits_mask","","Mask with the lowest-order `lg_nbits()` set.",1,{"inputs":[],"output":{"name":"result"}}],[11,"low_mask","","The bit mask consisting of `Self::nbits() - element_bits` zeroes\nfollowed by `element_bits` ones.",1,{"inputs":[{"name":"usize"}],"output":{"name":"self"}}],[11,"nth_mask","","The bit mask with the `bit_index`th bit set.",1,{"inputs":[{"name":"usize"}],"output":{"name":"self"}}],[11,"get_bit","","Extracts the value of the `bit_index`th bit.",1,null],[11,"with_bit","","Functionally updates the value of the `bit_index`th bit to `bit_value`.",1,null],[11,"get_bits","","Extracts `len` bits starting at bit offset `start`.",1,null],[11,"with_bits","","Functionally updates `len` bits to `value` starting at offset `start`.",1,null],[11,"rank1","","Returns the total count of ones up through the `index`th digit,\nlittle-endian style.",1,null],[11,"ceil_lg","","Returns the smallest number `n` such that `2.pow(n) >= self`.",1,null],[11,"floor_lg","","Returns the largest number `n` such that `2.pow(n) <= self`.",1,null],[11,"ceil_div","","Returns the smallest number `n` such that `n * divisor >= self`.",1,null],[10,"read_block","","Reads a block with the specified endianness.",1,{"inputs":[{"name":"r"}],"output":{"name":"result"}}],[10,"write_block","","Writes a block with the specified endianness.",1,null],[11,"hash","","",0,null],[11,"partial_cmp","","",0,null],[11,"lt","","",0,null],[11,"le","","",0,null],[11,"gt","","",0,null],[11,"ge","","",0,null],[11,"cmp","","",0,null],[11,"eq","","",0,null],[11,"ne","","",0,null],[11,"fmt","","",0,null],[11,"clone","","",0,null],[11,"new","","Creates an `Address` for the given bit index for storage in\nblock type `Block`.",0,{"inputs":[{"name":"u64"}],"output":{"name":"address"}}],[11,"bit_index","","Converts an `Address` back into a raw bit index.",0,null],[0,"stream","succinct","Bit-oriented streams for coding.",null,null],[3,"BitBuffer","succinct::stream","A bit buffer can be used to read bits from or write bits to an\nunderlying bit vector.",null,null],[11,"fmt","","",2,null],[11,"clone","","",2,null],[11,"new","","Creates a new, empty bit buffer.",2,{"inputs":[],"output":{"name":"self"}}],[11,"with_capacity","","Creates a new, empty bit buffer with the given capacity (in\nbits) preallocated.",2,{"inputs":[{"name":"u64"}],"output":{"name":"self"}}],[11,"from","","Creates a new bit buffer for reading from a bit vector.",2,{"inputs":[{"name":"inner"}],"output":{"name":"self"}}],[11,"append","","Creates a new bit buffer for appending to a bit vector.",2,{"inputs":[{"name":"inner"}],"output":{"name":"self"}}],[11,"seek","","Moves the position for the next read or write.",2,null],[11,"into_inner","","Returns the bit vector underlying the bit buffer.",2,null],[11,"inner","","Gives access to the bit vector underlying the bit buffer.",2,null],[11,"position","","The position in the bit buffer where the next read or write will\noccur.",2,null],[11,"block_len","","",2,null],[11,"bit_len","","",2,null],[11,"get_block","","",2,null],[11,"set_block","","",2,null],[11,"read_bit","","",2,null],[11,"write_bit","","",2,null],[8,"BitRead","","Allows reading bits from a source.",null,null],[10,"read_bit","","Reads a single bit from the source.",3,null],[11,"read_int","","Reads `nbits` bits as an integer, least-significant bit first.",3,null],[11,"read_int_be","","Reads `nbits` bits as an integer, most-significant bit first.",3,null],[8,"BitWrite","","Allows writing bits to a sink.",null,null],[10,"write_bit","","Writes a single bit to the sink.",4,null],[11,"write_int","","Writes the lower `nbits` of `value`, least-significant first.",4,null],[11,"write_int_be","","Writes the lower `nbits` of `value`, most-significant first.",4,null],[0,"coding","succinct","Codes used for data compression.",null,null],[6,"Result","succinct::coding","",null,null],[3,"Unary","","Encodes _n_ as _n_ zeroes followed by a one.",null,null],[3,"Elias","","An Elias code.",null,null],[3,"Omega","","An Elias omega code iterates the Elias encoding.",null,null],[3,"Fibonacci","","A Fibonacci code.",null,null],[3,"Lift0","","Lifts any code by adding one to each encoded value, and subtracting\none from each decoded value.",null,null],[11,"encode","","",5,{"inputs":[{"name":"w"},{"name":"u64"}],"output":{"name":"result"}}],[11,"decode","","",5,{"inputs":[{"name":"r"}],"output":{"name":"result"}}],[11,"encode","","",6,{"inputs":[{"name":"w"},{"name":"u64"}],"output":{"name":"result"}}],[11,"decode","","",6,{"inputs":[{"name":"r"}],"output":{"name":"result"}}],[11,"encode","","",7,{"inputs":[{"name":"w"},{"name":"u64"}],"output":{"name":"result"}}],[11,"decode","","",7,{"inputs":[{"name":"r"}],"output":{"name":"result"}}],[11,"encode","","",8,{"inputs":[{"name":"w"},{"name":"u64"}],"output":{"name":"result"}}],[11,"decode","","",8,{"inputs":[{"name":"r"}],"output":{"name":"result"}}],[11,"encode","","",9,{"inputs":[{"name":"w"},{"name":"u64"}],"output":{"name":"result"}}],[11,"decode","","",9,{"inputs":[{"name":"r"}],"output":{"name":"result"}}],[6,"Gamma","","An Elias gamma code encodes the header in unary.",null,null],[6,"Delta","","An Elias delta code encodes the header using the Elias gamma code.",null,null],[8,"UniversalCode","","A universal code lets us encode arbitrary sized integers in a\nself-delimiting code.",null,null],[10,"encode","","Writes `value` to `sink`.",10,{"inputs":[{"name":"w"},{"name":"u64"}],"output":{"name":"result"}}],[10,"decode","","Reads a value from `source`.",10,{"inputs":[{"name":"r"}],"output":{"name":"result"}}],[0,"bit_vector","succinct","Bit vector interfaces and implementations.",null,null],[3,"BitVec","succinct::bit_vector","A bit vector implementation.",null,null],[3,"Iter","","Iterator over `BitVec`.",null,null],[3,"BitSlice","","A borrowed slice of a bit vector.",null,null],[3,"BitSliceMut","","A borrowed, mutable slice of a bit vector.",null,null],[11,"hash","succinct","",11,null],[11,"partial_cmp","","",11,null],[11,"lt","","",11,null],[11,"le","","",11,null],[11,"gt","","",11,null],[11,"ge","","",11,null],[11,"cmp","","",11,null],[11,"eq","","",11,null],[11,"ne","","",11,null],[11,"fmt","","",11,null],[11,"clone","","",11,null],[11,"new","","Creates a new, empty bit vector.",11,{"inputs":[],"output":{"name":"self"}}],[11,"with_capacity","","Creates a new, empty bit vector with space allocated for `capacity`\nbits.",11,{"inputs":[{"name":"u64"}],"output":{"name":"self"}}],[11,"with_block_capacity","","Creates a new, empty bit vector with space allocated for `capacity`\nblocks.",11,{"inputs":[{"name":"usize"}],"output":{"name":"self"}}],[11,"with_fill","","Creates a new bit vector of `len` bits initialized to `value`.",11,{"inputs":[{"name":"u64"},{"name":"bool"}],"output":{"name":"self"}}],[11,"with_fill_block","","Creates a new bit vector of `block_len` blocks initialized to `value`.",11,{"inputs":[{"name":"usize"},{"name":"block"}],"output":{"name":"self"}}],[11,"capacity","","How many bits the bit vector can hold without reallocating.",11,null],[11,"block_capacity","","How many blocks the bit vector can hold without reallocating.",11,null],[11,"resize","","Resizes the bit vector to the given number of elements,\nfilling if necessary.",11,null],[11,"resize_block","","Resizes the bit vector to the given number of blocks,\nfilling if necessary.",11,null],[11,"reserve","","Reserves capacity for at least `additional` more bits to be\ninserted.",11,null],[11,"reserve_block","","Reserves capacity for at least `additional` blocks of bits to be\ninserted.",11,null],[11,"reserve_exact","","Reserves capacity for at least `additional` more bits to be\ninserted.",11,null],[11,"reserve_exact_block","","Reserves capacity for at least `additional` more blocks of bits to be\ninserted.",11,null],[11,"shrink_to_fit","","Shrinks the capacity to just fit the number of elements.",11,null],[11,"truncate","","Shrinks to the given size.",11,null],[11,"truncate_block","","Shrinks to the given size in blocks.",11,null],[11,"clear","","Sets the size to 0 while retaining the allocated storage.",11,null],[11,"iter","","Returns an iterator over the bits of the bit vector",11,null],[11,"bit_len","","",11,null],[11,"get_bit","","",11,null],[11,"get_block","","",11,null],[11,"set_bit","","",11,null],[11,"set_block","","",11,null],[11,"push_bit","","",11,null],[11,"pop_bit","","",11,null],[11,"push_block","","",11,null],[11,"fmt","","",11,null],[11,"is_stack_only","","",11,{"inputs":[],"output":{"name":"bool"}}],[11,"heap_bytes","","",11,null],[11,"default","","",11,{"inputs":[],"output":{"name":"self"}}],[11,"hash","succinct::bit_vector","",12,null],[11,"partial_cmp","","",12,null],[11,"lt","","",12,null],[11,"le","","",12,null],[11,"gt","","",12,null],[11,"ge","","",12,null],[11,"cmp","","",12,null],[11,"eq","","",12,null],[11,"ne","","",12,null],[11,"fmt","","",12,null],[11,"clone","","",12,null],[11,"next","","",12,null],[11,"size_hint","","",12,null],[11,"count","","",12,null],[11,"last","","",12,null],[11,"nth","","",12,null],[11,"len","","",12,null],[11,"next_back","","",12,null],[11,"fmt","","",13,null],[11,"clone","","",13,null],[11,"fmt","","",14,null],[11,"new","","Slices base to the specified range.",13,{"inputs":[{"name":"base"},{"name":"range"}],"output":{"name":"self"}}],[11,"new","","Slices base to the specified range.",14,{"inputs":[{"name":"base"},{"name":"range"}],"output":{"name":"self"}}],[11,"bit_len","","",13,null],[11,"get_bit","","",13,null],[11,"bit_len","","",14,null],[11,"get_bit","","",14,null],[11,"set_bit","","",14,null],[11,"is_stack_only","","",13,{"inputs":[],"output":{"name":"bool"}}],[11,"is_stack_only","","",14,{"inputs":[],"output":{"name":"bool"}}],[8,"Bits","","Interface for read-only bit vector operations.",null,null],[16,"Block","","The underlying block type used to store the bits of the slice.",15,null],[10,"bit_len","","The length of the slice in bits.",15,null],[11,"block_len","","The length of the slice in blocks.",15,null],[11,"get_bit","","Gets the bit at `position`",15,null],[11,"get_block","","Gets the block at `position`",15,null],[11,"get_bits","","Gets `count` bits starting at bit index `start`, interpreted as a\nlittle-endian integer.",15,null],[8,"BitsMut","","Interface for mutable bit vector operations that don’t affect the\nlength.",null,null],[11,"set_bit","","Sets the bit at `position` to `value`.",16,null],[11,"set_block","","Sets the block at `position` to `value`.",16,null],[11,"set_bits","","Sets `count` bits starting at bit index `start`, interpreted as a\nlittle-endian integer.",16,null],[8,"BitVector","","Interface for full bit vector operations.",null,null],[10,"push_bit","","Adds the given bit to the end of the bit vector.",17,null],[10,"pop_bit","","Removes and returns the last bit, if any.",17,null],[11,"align_block","","Pushes `value` 0 or more times until the size of the bit\nvector is block-aligned.",17,null],[11,"push_block","","Pushes the given block onto the end of the bit vector.",17,null],[0,"int_vector","succinct","Bit-packed vectors of *k*-bit unsigned integers.",null,null],[3,"IntVec","succinct::int_vector","A vector of *k*-bit unsigned integers, where *k* is determined at\nrun time.",null,null],[3,"Iter","","An iterator over the elements of an [`IntVec`](struct.IntVec.html).",null,null],[4,"Fill","","Describes how to initialize the memory of an `IntVec`.",null,null],[13,"Block","","Initialize each block—not each element—to the value.",18,null],[13,"Element","","Initialize each element to the value. (What should happen to\nextra bits? Mask out or panic?)",18,null],[11,"cmp","succinct","",19,null],[11,"partial_cmp","","",19,null],[11,"lt","","",19,null],[11,"le","","",19,null],[11,"gt","","",19,null],[11,"ge","","",19,null],[11,"eq","","",19,null],[11,"ne","","",19,null],[11,"hash","","",19,null],[11,"clone","","",19,null],[11,"cmp","succinct::int_vector","",18,null],[11,"partial_cmp","","",18,null],[11,"lt","","",18,null],[11,"le","","",18,null],[11,"gt","","",18,null],[11,"ge","","",18,null],[11,"eq","","",18,null],[11,"ne","","",18,null],[11,"hash","","",18,null],[11,"fmt","","",18,null],[11,"clone","","",18,null],[11,"new","succinct","Creates a new integer vector.",19,{"inputs":[{"name":"usize"}],"output":{"name":"self"}}],[11,"with_capacity","","Creates a new, empty integer vector, allocating sufficient storage\nfor `capacity` elements.",19,{"inputs":[{"name":"usize"},{"name":"u64"}],"output":{"name":"self"}}],[11,"with_block_capacity","","Creates a new, empty integer vector, allocating `block_capacity`\nblocks of storage.",19,{"inputs":[{"name":"usize"},{"name":"usize"}],"output":{"name":"self"}}],[11,"with_fill","","Creates a new integer vector containing `len` copies of `value`.",19,{"inputs":[{"name":"usize"},{"name":"u64"},{"name":"block"}],"output":{"name":"self"}}],[11,"with_fill_block","","Creates a new integer vector containing `block_len` copies of the\nblock `value`.",19,{"inputs":[{"name":"usize"},{"name":"usize"},{"name":"block"}],"output":{"name":"self"}}],[11,"is_okay_size","","Determines whether we can support a vector with the given\nelement size and number of elements.",19,{"inputs":[{"name":"usize"},{"name":"u64"}],"output":{"name":"bool"}}],[11,"get_random","","Returns the element at a given index, also given an arbitrary\nelement size and bit offset.",19,null],[11,"set_random","","Sets the element at a given index to a given value, also given\nan arbitrary element size and bit offset.",19,null],[11,"push","","Pushes an element onto the end of the vector, increasing the\nlength by 1.",19,null],[11,"pop","","Removes and returns the last element of the vector, if present.",19,null],[11,"capacity","","The number of elements the vector can hold without reallocating.",19,null],[11,"block_capacity","","The number of blocks of elements the vector can hold without\nreallocating.",19,null],[11,"resize","","Resizes to the given number of elements, filling if necessary.",19,null],[11,"resize_block","","Resizes to the given number of blocks, filling if necessary.",19,null],[11,"reserve","","Reserves capacity for at least `additional` more elements to be\ninserted in the given `IntVec<Block>`.",19,null],[11,"reserve_block","","Reserves capacity for at least `additional` blocks of values to be\ninserted.",19,null],[11,"reserve_exact","","Reserves capacity for at least `additional` more elements to be\ninserted in the given `IntVec<Block>`.",19,null],[11,"reserve_exact_block","","Reserves capacity for at least `additional` blocks of values to be\ninserted.",19,null],[11,"shrink_to_fit","","Shrinks the capacity to just fit the number of elements.",19,null],[11,"truncate","","Shrinks to the given size.",19,null],[11,"truncate_block","","Shrinks to the given number of blocks.",19,null],[11,"clear","","Sets the size to 0 while retaining the allocated storage.",19,null],[11,"iter","","Gets an iterator over the elements of the vector.",19,null],[11,"block_bits","","The number of bits per block of storage.",19,{"inputs":[],"output":{"name":"usize"}}],[11,"is_packed","","True if elements are packed one per block.",19,null],[11,"is_aligned","","True if elements are aligned within blocks.",19,null],[11,"len","","",19,null],[11,"get","","",19,null],[11,"element_bits","","",19,null],[11,"set","","",19,null],[11,"block_len","","",19,null],[11,"bit_len","","",19,null],[11,"get_block","","",19,null],[11,"set_block","","",19,null],[11,"next","succinct::int_vector","",20,null],[11,"size_hint","","",20,null],[11,"count","","",20,null],[11,"last","","",20,null],[11,"nth","","",20,null],[11,"len","","",20,null],[11,"next_back","","",20,null],[11,"fmt","succinct","",19,null],[11,"is_stack_only","","",19,{"inputs":[],"output":{"name":"bool"}}],[11,"heap_bytes","","",19,null],[8,"IntVector","succinct::int_vector","Types that can be accessed as immutable arrays of integers of\nlimited width.",null,null],[16,"Block","","The type of primitive value to represent elements.",21,null],[10,"len","","The number of elements.",21,null],[11,"is_empty","","Is the vector empty?",21,null],[10,"element_bits","","The bit width of each element.",21,null],[10,"get","","Fetches the value of the `index`th element.",21,null],[8,"IntVectorMut","","Types that can be accessed as mutable arrays of integers of limited\nwidth.",null,null],[10,"set","","Updates the value of the `index`th element.",22,null],[0,"rank","succinct","Support for fast rank queries.",null,null],[3,"JacobsonRank","succinct::rank","Add-on to `Bits` to support fast rank queries.",null,null],[11,"fmt","succinct","",23,null],[11,"clone","","",23,null],[11,"new","","Creates a new rank support structure for the given bit vector.",23,{"inputs":[{"name":"store"}],"output":{"name":"self"}}],[11,"block_len","","",23,null],[11,"bit_len","","",23,null],[11,"get_block","","",23,null],[11,"get_bit","","",23,null],[11,"rank","","",23,null],[11,"limit","","",23,null],[11,"rank1","","",23,null],[11,"is_stack_only","","",23,{"inputs":[],"output":{"name":"bool"}}],[11,"heap_bytes","","",23,null],[8,"RankSupport","succinct::rank","Interface for types that support rank queries.",null,null],[16,"Over","","The type of value to rank.",24,null],[10,"rank","","Returns the rank of the given value at a given position.",24,null],[10,"limit","","The size of the vector being ranked.",24,null],[8,"BitRankSupport","","Convenience trait for `RankSupport` over `bool`.",null,null],[11,"rank1","","Returns the rank of 1 at the given position.",25,null],[11,"rank0","","Returns the rank of 0 at the given position.",25,null],[0,"select","succinct","Support for fast select queries.",null,null],[3,"BinSearchSelect","succinct::select","Performs a select query by binary searching rank queries.",null,null],[11,"new","succinct","Creates a new binary search selection support given a rank\nsupport.",26,{"inputs":[{"name":"rank"}],"output":{"name":"self"}}],[11,"inner","","Borrows a reference to the underlying rank support.",26,null],[11,"block_len","","",26,null],[11,"bit_len","","",26,null],[11,"get_block","","",26,null],[11,"get_bit","","",26,null],[11,"rank","","",26,null],[11,"limit","","",26,null],[11,"rank1","","",26,null],[11,"select1","","",26,null],[11,"select0","","",26,null],[11,"select","","",26,null],[11,"is_stack_only","","",26,{"inputs":[],"output":{"name":"bool"}}],[8,"SelectSupport1","succinct::select","Interface for types that support selecting for 1 bits.",null,null],[10,"select1","","Returns the position of the `index`th 1 bit.",27,null],[8,"SelectSupport0","","Interface for types that support selecting for 0 bits.",null,null],[10,"select0","","Returns the position of the `index`th 0 bit.",28,null],[8,"SelectSupport","","Interface for types that support select queries over values of\n(associated type) `Over`.",null,null],[16,"Over","","The type of value that we can search for.",29,null],[10,"select","","Returns the position of the `index`th occurrence of `value`.",29,null],[8,"Bits","succinct","Interface for read-only bit vector operations.",null,null],[16,"Block","","The underlying block type used to store the bits of the slice.",15,null],[10,"bit_len","","The length of the slice in bits.",15,null],[11,"block_len","succinct::bit_vector","The length of the slice in blocks.",15,null],[11,"get_bit","","Gets the bit at `position`",15,null],[11,"get_block","","Gets the block at `position`",15,null],[11,"get_bits","","Gets `count` bits starting at bit index `start`, interpreted as a\nlittle-endian integer.",15,null],[8,"BitsMut","succinct","Interface for mutable bit vector operations that don’t affect the\nlength.",null,null],[11,"set_bit","succinct::bit_vector","Sets the bit at `position` to `value`.",16,null],[11,"set_block","","Sets the block at `position` to `value`.",16,null],[11,"set_bits","","Sets `count` bits starting at bit index `start`, interpreted as a\nlittle-endian integer.",16,null],[8,"BitVector","succinct","Interface for full bit vector operations.",null,null],[10,"push_bit","","Adds the given bit to the end of the bit vector.",17,null],[10,"pop_bit","","Removes and returns the last bit, if any.",17,null],[11,"align_block","succinct::bit_vector","Pushes `value` 0 or more times until the size of the bit\nvector is block-aligned.",17,null],[11,"push_block","","Pushes the given block onto the end of the bit vector.",17,null],[8,"IntVector","succinct","Types that can be accessed as immutable arrays of integers of\nlimited width.",null,null],[16,"Block","","The type of primitive value to represent elements.",21,null],[10,"len","","The number of elements.",21,null],[11,"is_empty","succinct::int_vector","Is the vector empty?",21,null],[10,"element_bits","succinct","The bit width of each element.",21,null],[10,"get","","Fetches the value of the `index`th element.",21,null],[8,"IntVectorMut","","Types that can be accessed as mutable arrays of integers of limited\nwidth.",null,null],[10,"set","","Updates the value of the `index`th element.",22,null],[8,"SpaceUsage","","Types that know how to compute their space usage.",null,null],[11,"total_bytes","","Computes the size of the receiver in bytes.",30,null],[10,"is_stack_only","","Is the size of this type known statically?",30,{"inputs":[],"output":{"name":"bool"}}],[11,"stack_bytes","","Calculates the stack portion of the size of this type.",30,{"inputs":[],"output":{"name":"usize"}}],[11,"heap_bytes","","Calculates the heap portion of the size of an object.",30,null],[14,"impl_stack_only_space_usage!","","",null,null],[11,"read_int","succinct::stream","Reads `nbits` bits as an integer, least-significant bit first.",3,null],[11,"read_int_be","","Reads `nbits` bits as an integer, most-significant bit first.",3,null],[11,"write_int","","Writes the lower `nbits` of `value`, least-significant first.",4,null],[11,"write_int_be","","Writes the lower `nbits` of `value`, most-significant first.",4,null],[11,"block_len","succinct::bit_vector","The length of the slice in blocks.",15,null],[11,"get_bit","","Gets the bit at `position`",15,null],[11,"get_block","","Gets the block at `position`",15,null],[11,"get_bits","","Gets `count` bits starting at bit index `start`, interpreted as a\nlittle-endian integer.",15,null],[11,"set_bit","","Sets the bit at `position` to `value`.",16,null],[11,"set_block","","Sets the block at `position` to `value`.",16,null],[11,"set_bits","","Sets `count` bits starting at bit index `start`, interpreted as a\nlittle-endian integer.",16,null],[11,"align_block","","Pushes `value` 0 or more times until the size of the bit\nvector is block-aligned.",17,null],[11,"push_block","","Pushes the given block onto the end of the bit vector.",17,null],[11,"is_empty","succinct::int_vector","Is the vector empty?",21,null],[11,"total_bytes","succinct","Computes the size of the receiver in bytes.",30,null],[11,"stack_bytes","","Calculates the stack portion of the size of this type.",30,{"inputs":[],"output":{"name":"usize"}}],[11,"heap_bytes","","Calculates the heap portion of the size of an object.",30,null]],"paths":[[3,"Address"],[8,"BlockType"],[3,"BitBuffer"],[8,"BitRead"],[8,"BitWrite"],[3,"Unary"],[3,"Elias"],[3,"Omega"],[3,"Fibonacci"],[3,"Lift0"],[8,"UniversalCode"],[3,"BitVec"],[3,"Iter"],[3,"BitSlice"],[3,"BitSliceMut"],[8,"Bits"],[8,"BitsMut"],[8,"BitVector"],[4,"Fill"],[3,"IntVec"],[3,"Iter"],[8,"IntVector"],[8,"IntVectorMut"],[3,"JacobsonRank"],[8,"RankSupport"],[8,"BitRankSupport"],[3,"BinSearchSelect"],[8,"SelectSupport1"],[8,"SelectSupport0"],[8,"SelectSupport"],[8,"SpaceUsage"]]};
initSearch(searchIndex);