| bits | bvh::v2::Index< Bits, PrimCountBits > | static |
| first_id() const | bvh::v2::Index< Bits, PrimCountBits > | inline |
| Index()=default | bvh::v2::Index< Bits, PrimCountBits > | |
| Index(Type value) | bvh::v2::Index< Bits, PrimCountBits > | inlineexplicit |
| Index(size_t first_id, size_t prim_count) | bvh::v2::Index< Bits, PrimCountBits > | inlineexplicitprivate |
| is_inner() const | bvh::v2::Index< Bits, PrimCountBits > | inline |
| is_leaf() const | bvh::v2::Index< Bits, PrimCountBits > | inline |
| make_inner(size_t first_child) | bvh::v2::Index< Bits, PrimCountBits > | inlinestatic |
| make_leaf(size_t first_prim, size_t prim_count) | bvh::v2::Index< Bits, PrimCountBits > | inlinestatic |
| max_first_id | bvh::v2::Index< Bits, PrimCountBits > | static |
| max_prim_count | bvh::v2::Index< Bits, PrimCountBits > | static |
| operator!=(const Index &other) const | bvh::v2::Index< Bits, PrimCountBits > | inline |
| operator==(const Index &other) const | bvh::v2::Index< Bits, PrimCountBits > | inline |
| prim_count() const | bvh::v2::Index< Bits, PrimCountBits > | inline |
| prim_count_bits | bvh::v2::Index< Bits, PrimCountBits > | static |
| set_first_id(size_t first_id) | bvh::v2::Index< Bits, PrimCountBits > | inline |
| set_prim_count(size_t prim_count) | bvh::v2::Index< Bits, PrimCountBits > | inline |
| Type typedef | bvh::v2::Index< Bits, PrimCountBits > | |
| value | bvh::v2::Index< Bits, PrimCountBits > | |
