SYMBOL INDEX (320 symbols across 13 files) FILE: automated_test.py function connectomics_data (line 13) | def connectomics_data(): function test_empty_image (line 17) | def test_empty_image(): function test_very_sparse_image (line 23) | def test_very_sparse_image(): function test_solid_image (line 33) | def test_solid_image(): function test_binary_image (line 39) | def test_binary_image(): function test_square (line 49) | def test_square(fill_holes): function test_cube (line 89) | def test_cube(): function test_find_border_targets (line 104) | def test_find_border_targets(): function test_fix_borders_z (line 116) | def test_fix_borders_z(): function test_fix_borders_x (line 147) | def test_fix_borders_x(): function test_fix_borders_y (line 174) | def test_fix_borders_y(): function test_extra_targets (line 201) | def test_extra_targets(): function test_parallel (line 234) | def test_parallel(): function test_dimensions (line 261) | def test_dimensions(): function test_joinability (line 282) | def test_joinability(axis): function test_find_cycle (line 335) | def test_find_cycle(): function test_join_close_components_simple (line 384) | def test_join_close_components_simple(): function test_join_close_components_complex (line 406) | def test_join_close_components_complex(): function test_join_close_components_by_radius (line 424) | def test_join_close_components_by_radius(): function test_fill_all_holes (line 458) | def test_fill_all_holes(): function test_fix_avocados (line 478) | def test_fix_avocados(): function test_cross_sectional_area (line 512) | def test_cross_sectional_area(): function test_moving_average (line 530) | def test_moving_average(): function test_no_fix_branching (line 562) | def test_no_fix_branching(connectomics_data): function test_remove_row (line 566) | def test_remove_row(): function test_cross_sectional_area (line 588) | def test_cross_sectional_area(): function test_postprocess (line 611) | def test_postprocess(): FILE: ext/skeletontricks/dijkstra_invalidation.hpp type dijkstra_invalidation (line 42) | namespace dijkstra_invalidation { function _s (line 45) | inline float _s(const float wa, const float wb) { function _c (line 50) | inline float _c(const float wa, const float wb, const float wc) { function connectivity_check (line 54) | void connectivity_check(int connectivity) { function compute_neighborhood_helper_6 (line 60) | void compute_neighborhood_helper_6( function compute_neighborhood_helper_18 (line 77) | void compute_neighborhood_helper_18( function compute_neighborhood_helper_26 (line 106) | void compute_neighborhood_helper_26( function compute_neighborhood (line 126) | inline void compute_neighborhood( class HeapDistanceNode (line 204) | class HeapDistanceNode { method HeapDistanceNode (line 211) | HeapDistanceNode() { method HeapDistanceNode (line 218) | HeapDistanceNode (float d, uint64_t o_loc, uint64_t val, float mx_di... method HeapDistanceNode (line 225) | HeapDistanceNode (const HeapDistanceNode &h) { type HeapDistanceNodeCompare (line 233) | struct HeapDistanceNodeCompare { function _roll_invalidation_ball (line 239) | int64_t _roll_invalidation_ball( FILE: ext/skeletontricks/libdivide.h function LIBDIVIDE_INLINE (line 169) | static LIBDIVIDE_INLINE int __builtin_clz(unsigned x) { function LIBDIVIDE_CONSTEXPR (line 183) | static LIBDIVIDE_CONSTEXPR int __builtin_clzll(unsigned long long x) { function LIBDIVIDE_INLINE (line 3276) | LIBDIVIDE_INLINE __m128i divide(__m128i n) const { return div.divide(n); } function LIBDIVIDE_INLINE (line 3279) | LIBDIVIDE_INLINE __m256i divide(__m256i n) const { return div.divide(n); } function LIBDIVIDE_INLINE (line 3282) | LIBDIVIDE_INLINE __m512i divide(__m512i n) const { return div.divide(n); } FILE: ext/skeletontricks/skeletontricks.hpp type skeletontricks (line 40) | namespace skeletontricks { function _roll_invalidation_cube (line 42) | size_t _roll_invalidation_cube( function max (line 139) | inline size_t max(T* edges, const size_t size) { function printvec (line 155) | void printvec(std::vector vec) { function printstack (line 163) | void printstack(std::stack stack) { function stack2vec (line 173) | std::vector stack2vec(std::stack stk) { function _find_cycle (line 190) | std::vector _find_cycle(const T* edges, const size_t Ne) { function _create_distance_graph (line 284) | std::unordered_map _create_distance_graph( function compute_neighborhood (line 380) | inline void compute_neighborhood( type pair_hash (line 423) | struct pair_hash { function _extract_edges_from_binary_image (line 429) | std::unordered_set, pair_hash> FILE: ext/skeletontricks/unordered_dense.hpp type ankerl::unordered_dense (line 124) | namespace ankerl::unordered_dense { type ANKERL_UNORDERED_DENSE_NAMESPACE (line 125) | inline namespace ANKERL_UNORDERED_DENSE_NAMESPACE { type detail (line 127) | namespace detail { function ANKERL_UNORDERED_DENSE_NOINLINE (line 133) | [[noreturn]] inline ANKERL_UNORDERED_DENSE_NOINLINE void on_error_... function ANKERL_UNORDERED_DENSE_NOINLINE (line 136) | [[noreturn]] inline ANKERL_UNORDERED_DENSE_NOINLINE void on_error_... function ANKERL_UNORDERED_DENSE_NOINLINE (line 139) | [[noreturn]] inline ANKERL_UNORDERED_DENSE_NOINLINE void on_error_... function on_error_key_not_found (line 145) | [[noreturn]] inline void on_error_key_not_found() { function on_error_bucket_overflow (line 148) | [[noreturn]] inline void on_error_bucket_overflow() { function on_error_too_many_elements (line 151) | [[noreturn]] inline void on_error_too_many_elements() { type nonesuch (line 447) | struct nonesuch {} type default_container_t (line 448) | struct default_container_t {} type detector (line 451) | struct detector { type base_table_type_map (line 498) | struct base_table_type_map { type base_table_type_set (line 503) | struct base_table_type_set {} class table (line 817) | class table : public std::conditional_t, base_table_ty... method next (line 871) | [[nodiscard]] auto next(value_idx_type bucket_idx) const -> valu... method at (line 878) | [[nodiscard]] static constexpr auto at(bucket_container_type& bu... method at (line 882) | [[nodiscard]] static constexpr auto at(const bucket_container_ty... method dist_inc (line 887) | [[nodiscard]] static constexpr auto dist_inc(dist_and_fingerprin... method dist_dec (line 891) | [[nodiscard]] static constexpr auto dist_dec(dist_and_fingerprin... method mixed_hash (line 897) | [[nodiscard]] constexpr auto mixed_hash(K const& key) const -> u... method dist_and_fingerprint_from_hash (line 913) | [[nodiscard]] constexpr auto dist_and_fingerprint_from_hash(uint... method bucket_idx_from_hash (line 917) | [[nodiscard]] constexpr auto bucket_idx_from_hash(uint64_t hash)... method get_key (line 921) | [[nodiscard]] static constexpr auto get_key(value_type const& vt... method next_while_less (line 930) | [[nodiscard]] auto next_while_less(K const& key) const -> Bucket { method place_and_shift_up (line 942) | void place_and_shift_up(Bucket bucket, value_idx_type place) { method calc_num_buckets (line 951) | [[nodiscard]] static constexpr auto calc_num_buckets(uint8_t shi... method calc_shifts_for_size (line 955) | [[nodiscard]] constexpr auto calc_shifts_for_size(size_t s) cons... method copy_buckets (line 964) | void copy_buckets(table const& other) { method is_full (line 986) | [[nodiscard]] auto is_full() const -> bool { method deallocate_buckets (line 990) | void deallocate_buckets() { method allocate_buckets_from_shift (line 996) | void allocate_buckets_from_shift() { method clear_buckets (line 1016) | void clear_buckets() { method clear_and_fill_buckets_from_values (line 1026) | void clear_and_fill_buckets_from_values() { method increase_size (line 1038) | void increase_size() { method do_erase (line 1053) | void do_erase(value_idx_type bucket_idx, Op handle_erased_value) { method do_erase_key (line 1086) | auto do_erase_key(K&& key, Op handle_erased_value) -> size_t { method do_insert_or_assign (line 1107) | auto do_insert_or_assign(K&& key, M&& mapped) -> std::pair std::pair iterator { method do_find (line 1198) | auto do_find(K const& key) const -> const_iterator { method do_at (line 1203) | auto do_at(K const& key) -> Q& { method do_at (line 1211) | auto do_at(K const& key) const -> Q const& { method table (line 1216) | explicit table(size_t bucket_count, method table (line 1232) | table() method table (line 1235) | table(size_t bucket_count, allocator_type const& alloc) method table (line 1238) | table(size_t bucket_count, Hash const& hash, allocator_type cons... method table (line 1241) | explicit table(allocator_type const& alloc) method table (line 1245) | table(InputIt first, method table (line 1256) | table(InputIt first, InputIt last, size_type bucket_count, alloc... method table (line 1260) | table(InputIt first, InputIt last, size_type bucket_count, Hash ... method table (line 1263) | table(table const& other) method table (line 1266) | table(table const& other, allocator_type const& alloc) method table (line 1274) | table(table&& other) noexcept method table (line 1277) | table(table&& other, allocator_type const& alloc) noexcept method table (line 1282) | table(std::initializer_list ilist, method table (line 1291) | table(std::initializer_list ilist, size_type bucket_... method table (line 1294) | table(std::initializer_list init, size_type bucket_c... method get_allocator (line 1354) | auto get_allocator() const noexcept -> allocator_type { method begin (line 1360) | auto begin() noexcept -> iterator { method begin (line 1364) | auto begin() const noexcept -> const_iterator { method cbegin (line 1368) | auto cbegin() const noexcept -> const_iterator { method end (line 1372) | auto end() noexcept -> iterator { method cend (line 1376) | auto cend() const noexcept -> const_iterator { method end (line 1380) | auto end() const noexcept -> const_iterator { method empty (line 1386) | [[nodiscard]] auto empty() const noexcept -> bool { method size (line 1390) | [[nodiscard]] auto size() const noexcept -> size_t { method max_size (line 1394) | [[nodiscard]] static constexpr auto max_size() noexcept -> size_t { method clear (line 1404) | void clear() { method insert (line 1409) | auto insert(value_type const& value) -> std::pair { method insert (line 1413) | auto insert(value_type&& value) -> std::pair { method insert (line 1418) | auto insert(P&& value) -> std::pair { method insert (line 1422) | auto insert(const_iterator /*hint*/, value_type const& value) ->... method insert (line 1426) | auto insert(const_iterator /*hint*/, value_type&& value) -> iter... method insert (line 1431) | auto insert(const_iterator /*hint*/, P&& value) -> iterator { method insert (line 1436) | void insert(InputIt first, InputIt last) { method insert (line 1443) | void insert(std::initializer_list ilist) { method extract (line 1449) | auto extract() && -> value_container_type { method replace (line 1455) | auto replace(value_container_type&& container) { method insert_or_assign (line 1508) | auto insert_or_assign(Key const& key, M&& mapped) -> std::pair std::pair std::pair std::pair { method emplace (line 1573) | auto emplace(Args&&... args) -> std::pair { method emplace_hint (line 1604) | auto emplace_hint(const_iterator /*hint*/, Args&&... args) -> it... method try_emplace (line 1609) | auto try_emplace(Key const& key, Args&&... args) -> std::pair std::pair std::pair iterator { method extract (line 1666) | auto extract(iterator it) -> value_type { method erase (line 1683) | auto erase(const_iterator it) -> iterator { method extract (line 1688) | auto extract(const_iterator it) -> value_type { method erase (line 1692) | auto erase(const_iterator first, const_iterator last) -> iterator { method erase (line 1716) | auto erase(Key const& key) -> size_t { method extract (line 1721) | auto extract(Key const& key) -> std::optional { method erase (line 1730) | auto erase(K&& key) -> size_t { method extract (line 1736) | auto extract(K&& key) -> std::optional { method swap (line 1744) | void swap(table& other) noexcept(noexcept(std::is_nothrow_swappa... method at (line 1753) | auto at(key_type const& key) -> Q& { method at (line 1762) | auto at(K const& key) -> Q& { method at (line 1767) | auto at(key_type const& key) const -> Q const& { method at (line 1776) | auto at(K const& key) const -> Q const& { method count (line 1799) | auto count(Key const& key) const -> size_t { method count (line 1804) | auto count(K const& key) const -> size_t { method find (line 1808) | auto find(Key const& key) -> iterator { method find (line 1812) | auto find(Key const& key) const -> const_iterator { method find (line 1817) | auto find(K const& key) -> iterator { method find (line 1822) | auto find(K const& key) const -> const_iterator { method contains (line 1826) | auto contains(Key const& key) const -> bool { method contains (line 1831) | auto contains(K const& key) const -> bool { method equal_range (line 1835) | auto equal_range(Key const& key) -> std::pair { method equal_range (line 1840) | auto equal_range(const Key& key) const -> std::pair std::pair { method equal_range (line 1852) | auto equal_range(K const& key) const -> std::pair size_t { // NOLINT(moderni... method max_bucket_count (line 1863) | static constexpr auto max_bucket_count() noexcept -> size_t { //... method load_factor (line 1869) | [[nodiscard]] auto load_factor() const -> float { method max_load_factor (line 1873) | [[nodiscard]] auto max_load_factor() const -> float { method max_load_factor (line 1877) | void max_load_factor(float ml) { method rehash (line 1884) | void rehash(size_t count) { method reserve (line 1896) | void reserve(size_t capa) { method hash_function (line 1913) | auto hash_function() const -> hasher { method key_eq (line 1917) | auto key_eq() const -> key_equal { method values (line 1922) | [[nodiscard]] auto values() const noexcept -> value_container_ty... type detail::wyhash (line 164) | namespace detail::wyhash { function mum (line 166) | inline void mum(uint64_t* a, uint64_t* b) { function mix (line 196) | [[nodiscard]] inline auto mix(uint64_t a, uint64_t b) -> uint64_t { function r8 (line 202) | [[nodiscard]] inline auto r8(const uint8_t* p) -> uint64_t { function r4 (line 208) | [[nodiscard]] inline auto r4(const uint8_t* p) -> uint64_t { function r3 (line 215) | [[nodiscard]] inline auto r3(const uint8_t* p, size_t k) -> uint64... function hash (line 219) | [[maybe_unused]] [[nodiscard]] inline auto hash(void const* key, s... function hash (line 266) | [[nodiscard]] inline auto hash(uint64_t x) -> uint64_t { type hash::is_avalanching> (line 281) | struct hash::is_avalanching> { type hash> (line 290) | struct hash> { type hash> (line 298) | struct hash> { type hash (line 306) | struct hash { type hash> (line 315) | struct hash> { type hash> (line 324) | struct hash> { type hash::value>::type> (line 333) | struct hash::value>... type tuple_hash_helper (line 342) | struct tuple_hash_helper { method to64 (line 346) | [[nodiscard]] constexpr static auto to64(Arg const& arg) -> uint64... method mix64 (line 354) | [[nodiscard]] static auto mix64(uint64_t state, uint64_t v) -> uin... method calc_hash (line 362) | [[nodiscard]] static auto calc_hash(T const& t, std::index_sequenc... type hash> (line 378) | struct hash> : tuple_hash_helper { type bucket_type (line 425) | namespace bucket_type { type standard (line 427) | struct standard { type big (line 435) | struct big { type detail (line 445) | namespace detail { function ANKERL_UNORDERED_DENSE_NOINLINE (line 133) | [[noreturn]] inline ANKERL_UNORDERED_DENSE_NOINLINE void on_error_... function ANKERL_UNORDERED_DENSE_NOINLINE (line 136) | [[noreturn]] inline ANKERL_UNORDERED_DENSE_NOINLINE void on_error_... function ANKERL_UNORDERED_DENSE_NOINLINE (line 139) | [[noreturn]] inline ANKERL_UNORDERED_DENSE_NOINLINE void on_error_... function on_error_key_not_found (line 145) | [[noreturn]] inline void on_error_key_not_found() { function on_error_bucket_overflow (line 148) | [[noreturn]] inline void on_error_bucket_overflow() { function on_error_too_many_elements (line 151) | [[noreturn]] inline void on_error_too_many_elements() { type nonesuch (line 447) | struct nonesuch {} type default_container_t (line 448) | struct default_container_t {} type detector (line 451) | struct detector { type base_table_type_map (line 498) | struct base_table_type_map { type base_table_type_set (line 503) | struct base_table_type_set {} class table (line 817) | class table : public std::conditional_t, base_table_ty... method next (line 871) | [[nodiscard]] auto next(value_idx_type bucket_idx) const -> valu... method at (line 878) | [[nodiscard]] static constexpr auto at(bucket_container_type& bu... method at (line 882) | [[nodiscard]] static constexpr auto at(const bucket_container_ty... method dist_inc (line 887) | [[nodiscard]] static constexpr auto dist_inc(dist_and_fingerprin... method dist_dec (line 891) | [[nodiscard]] static constexpr auto dist_dec(dist_and_fingerprin... method mixed_hash (line 897) | [[nodiscard]] constexpr auto mixed_hash(K const& key) const -> u... method dist_and_fingerprint_from_hash (line 913) | [[nodiscard]] constexpr auto dist_and_fingerprint_from_hash(uint... method bucket_idx_from_hash (line 917) | [[nodiscard]] constexpr auto bucket_idx_from_hash(uint64_t hash)... method get_key (line 921) | [[nodiscard]] static constexpr auto get_key(value_type const& vt... method next_while_less (line 930) | [[nodiscard]] auto next_while_less(K const& key) const -> Bucket { method place_and_shift_up (line 942) | void place_and_shift_up(Bucket bucket, value_idx_type place) { method calc_num_buckets (line 951) | [[nodiscard]] static constexpr auto calc_num_buckets(uint8_t shi... method calc_shifts_for_size (line 955) | [[nodiscard]] constexpr auto calc_shifts_for_size(size_t s) cons... method copy_buckets (line 964) | void copy_buckets(table const& other) { method is_full (line 986) | [[nodiscard]] auto is_full() const -> bool { method deallocate_buckets (line 990) | void deallocate_buckets() { method allocate_buckets_from_shift (line 996) | void allocate_buckets_from_shift() { method clear_buckets (line 1016) | void clear_buckets() { method clear_and_fill_buckets_from_values (line 1026) | void clear_and_fill_buckets_from_values() { method increase_size (line 1038) | void increase_size() { method do_erase (line 1053) | void do_erase(value_idx_type bucket_idx, Op handle_erased_value) { method do_erase_key (line 1086) | auto do_erase_key(K&& key, Op handle_erased_value) -> size_t { method do_insert_or_assign (line 1107) | auto do_insert_or_assign(K&& key, M&& mapped) -> std::pair std::pair iterator { method do_find (line 1198) | auto do_find(K const& key) const -> const_iterator { method do_at (line 1203) | auto do_at(K const& key) -> Q& { method do_at (line 1211) | auto do_at(K const& key) const -> Q const& { method table (line 1216) | explicit table(size_t bucket_count, method table (line 1232) | table() method table (line 1235) | table(size_t bucket_count, allocator_type const& alloc) method table (line 1238) | table(size_t bucket_count, Hash const& hash, allocator_type cons... method table (line 1241) | explicit table(allocator_type const& alloc) method table (line 1245) | table(InputIt first, method table (line 1256) | table(InputIt first, InputIt last, size_type bucket_count, alloc... method table (line 1260) | table(InputIt first, InputIt last, size_type bucket_count, Hash ... method table (line 1263) | table(table const& other) method table (line 1266) | table(table const& other, allocator_type const& alloc) method table (line 1274) | table(table&& other) noexcept method table (line 1277) | table(table&& other, allocator_type const& alloc) noexcept method table (line 1282) | table(std::initializer_list ilist, method table (line 1291) | table(std::initializer_list ilist, size_type bucket_... method table (line 1294) | table(std::initializer_list init, size_type bucket_c... method get_allocator (line 1354) | auto get_allocator() const noexcept -> allocator_type { method begin (line 1360) | auto begin() noexcept -> iterator { method begin (line 1364) | auto begin() const noexcept -> const_iterator { method cbegin (line 1368) | auto cbegin() const noexcept -> const_iterator { method end (line 1372) | auto end() noexcept -> iterator { method cend (line 1376) | auto cend() const noexcept -> const_iterator { method end (line 1380) | auto end() const noexcept -> const_iterator { method empty (line 1386) | [[nodiscard]] auto empty() const noexcept -> bool { method size (line 1390) | [[nodiscard]] auto size() const noexcept -> size_t { method max_size (line 1394) | [[nodiscard]] static constexpr auto max_size() noexcept -> size_t { method clear (line 1404) | void clear() { method insert (line 1409) | auto insert(value_type const& value) -> std::pair { method insert (line 1413) | auto insert(value_type&& value) -> std::pair { method insert (line 1418) | auto insert(P&& value) -> std::pair { method insert (line 1422) | auto insert(const_iterator /*hint*/, value_type const& value) ->... method insert (line 1426) | auto insert(const_iterator /*hint*/, value_type&& value) -> iter... method insert (line 1431) | auto insert(const_iterator /*hint*/, P&& value) -> iterator { method insert (line 1436) | void insert(InputIt first, InputIt last) { method insert (line 1443) | void insert(std::initializer_list ilist) { method extract (line 1449) | auto extract() && -> value_container_type { method replace (line 1455) | auto replace(value_container_type&& container) { method insert_or_assign (line 1508) | auto insert_or_assign(Key const& key, M&& mapped) -> std::pair std::pair std::pair std::pair { method emplace (line 1573) | auto emplace(Args&&... args) -> std::pair { method emplace_hint (line 1604) | auto emplace_hint(const_iterator /*hint*/, Args&&... args) -> it... method try_emplace (line 1609) | auto try_emplace(Key const& key, Args&&... args) -> std::pair std::pair std::pair iterator { method extract (line 1666) | auto extract(iterator it) -> value_type { method erase (line 1683) | auto erase(const_iterator it) -> iterator { method extract (line 1688) | auto extract(const_iterator it) -> value_type { method erase (line 1692) | auto erase(const_iterator first, const_iterator last) -> iterator { method erase (line 1716) | auto erase(Key const& key) -> size_t { method extract (line 1721) | auto extract(Key const& key) -> std::optional { method erase (line 1730) | auto erase(K&& key) -> size_t { method extract (line 1736) | auto extract(K&& key) -> std::optional { method swap (line 1744) | void swap(table& other) noexcept(noexcept(std::is_nothrow_swappa... method at (line 1753) | auto at(key_type const& key) -> Q& { method at (line 1762) | auto at(K const& key) -> Q& { method at (line 1767) | auto at(key_type const& key) const -> Q const& { method at (line 1776) | auto at(K const& key) const -> Q const& { method count (line 1799) | auto count(Key const& key) const -> size_t { method count (line 1804) | auto count(K const& key) const -> size_t { method find (line 1808) | auto find(Key const& key) -> iterator { method find (line 1812) | auto find(Key const& key) const -> const_iterator { method find (line 1817) | auto find(K const& key) -> iterator { method find (line 1822) | auto find(K const& key) const -> const_iterator { method contains (line 1826) | auto contains(Key const& key) const -> bool { method contains (line 1831) | auto contains(K const& key) const -> bool { method equal_range (line 1835) | auto equal_range(Key const& key) -> std::pair { method equal_range (line 1840) | auto equal_range(const Key& key) const -> std::pair std::pair { method equal_range (line 1852) | auto equal_range(K const& key) const -> std::pair size_t { // NOLINT(moderni... method max_bucket_count (line 1863) | static constexpr auto max_bucket_count() noexcept -> size_t { //... method load_factor (line 1869) | [[nodiscard]] auto load_factor() const -> float { method max_load_factor (line 1873) | [[nodiscard]] auto max_load_factor() const -> float { method max_load_factor (line 1877) | void max_load_factor(float ml) { method rehash (line 1884) | void rehash(size_t count) { method reserve (line 1896) | void reserve(size_t capa) { method hash_function (line 1913) | auto hash_function() const -> hasher { method key_eq (line 1917) | auto key_eq() const -> key_equal { method values (line 1922) | [[nodiscard]] auto values() const noexcept -> value_container_ty... class segmented_vector (line 513) | class segmented_vector { class iter_t (line 515) | class iter_t method iter_t (line 567) | iter_t() noexcept = default; method iter_t (line 571) | constexpr iter_t(iter_t const& other) noexcept method iter_t (line 575) | constexpr iter_t(ptr_t data, size_t idx) noexcept method num_bits_closest (line 535) | static constexpr auto num_bits_closest(size_t max_val, size_t s) -... class iter_t (line 552) | class iter_t { method iter_t (line 567) | iter_t() noexcept = default; method iter_t (line 571) | constexpr iter_t(iter_t const& other) noexcept method iter_t (line 575) | constexpr iter_t(ptr_t data, size_t idx) noexcept method increase_capacity (line 626) | void increase_capacity() { method append_everything_from (line 633) | void append_everything_from(segmented_vector&& other) { method append_everything_from (line 641) | void append_everything_from(segmented_vector const& other) { method dealloc (line 648) | void dealloc() { method calc_num_blocks_for_capacity (line 655) | [[nodiscard]] static constexpr auto calc_num_blocks_for_capacity(s... method segmented_vector (line 660) | segmented_vector() = default; method segmented_vector (line 663) | segmented_vector(Allocator alloc) method segmented_vector (line 666) | segmented_vector(segmented_vector&& other, Allocator alloc) method segmented_vector (line 671) | segmented_vector(segmented_vector const& other, Allocator alloc) method segmented_vector (line 676) | segmented_vector(segmented_vector&& other) noexcept method segmented_vector (line 679) | segmented_vector(segmented_vector const& other) { method size (line 711) | [[nodiscard]] constexpr auto size() const -> size_t { method capacity (line 715) | [[nodiscard]] constexpr auto capacity() const -> size_t { method begin (line 728) | [[nodiscard]] constexpr auto begin() -> iterator { method begin (line 731) | [[nodiscard]] constexpr auto begin() const -> const_iterator { method cbegin (line 734) | [[nodiscard]] constexpr auto cbegin() const -> const_iterator { method end (line 738) | [[nodiscard]] constexpr auto end() -> iterator { method end (line 741) | [[nodiscard]] constexpr auto end() const -> const_iterator { method cend (line 744) | [[nodiscard]] constexpr auto cend() const -> const_iterator { method back (line 748) | [[nodiscard]] constexpr auto back() -> reference { method back (line 751) | [[nodiscard]] constexpr auto back() const -> const_reference { method pop_back (line 755) | void pop_back() { method empty (line 760) | [[nodiscard]] auto empty() const { method reserve (line 764) | void reserve(size_t new_capacity) { method get_allocator (line 771) | [[nodiscard]] auto get_allocator() const -> allocator_type { method emplace_back (line 776) | auto emplace_back(Args&&... args) -> reference { method clear (line 786) | void clear() { method shrink_to_fit (line 795) | void shrink_to_fit() { type detail (line 806) | namespace detail { function ANKERL_UNORDERED_DENSE_NOINLINE (line 133) | [[noreturn]] inline ANKERL_UNORDERED_DENSE_NOINLINE void on_error_... function ANKERL_UNORDERED_DENSE_NOINLINE (line 136) | [[noreturn]] inline ANKERL_UNORDERED_DENSE_NOINLINE void on_error_... function ANKERL_UNORDERED_DENSE_NOINLINE (line 139) | [[noreturn]] inline ANKERL_UNORDERED_DENSE_NOINLINE void on_error_... function on_error_key_not_found (line 145) | [[noreturn]] inline void on_error_key_not_found() { function on_error_bucket_overflow (line 148) | [[noreturn]] inline void on_error_bucket_overflow() { function on_error_too_many_elements (line 151) | [[noreturn]] inline void on_error_too_many_elements() { type nonesuch (line 447) | struct nonesuch {} type default_container_t (line 448) | struct default_container_t {} type detector (line 451) | struct detector { type base_table_type_map (line 498) | struct base_table_type_map { type base_table_type_set (line 503) | struct base_table_type_set {} class table (line 817) | class table : public std::conditional_t, base_table_ty... method next (line 871) | [[nodiscard]] auto next(value_idx_type bucket_idx) const -> valu... method at (line 878) | [[nodiscard]] static constexpr auto at(bucket_container_type& bu... method at (line 882) | [[nodiscard]] static constexpr auto at(const bucket_container_ty... method dist_inc (line 887) | [[nodiscard]] static constexpr auto dist_inc(dist_and_fingerprin... method dist_dec (line 891) | [[nodiscard]] static constexpr auto dist_dec(dist_and_fingerprin... method mixed_hash (line 897) | [[nodiscard]] constexpr auto mixed_hash(K const& key) const -> u... method dist_and_fingerprint_from_hash (line 913) | [[nodiscard]] constexpr auto dist_and_fingerprint_from_hash(uint... method bucket_idx_from_hash (line 917) | [[nodiscard]] constexpr auto bucket_idx_from_hash(uint64_t hash)... method get_key (line 921) | [[nodiscard]] static constexpr auto get_key(value_type const& vt... method next_while_less (line 930) | [[nodiscard]] auto next_while_less(K const& key) const -> Bucket { method place_and_shift_up (line 942) | void place_and_shift_up(Bucket bucket, value_idx_type place) { method calc_num_buckets (line 951) | [[nodiscard]] static constexpr auto calc_num_buckets(uint8_t shi... method calc_shifts_for_size (line 955) | [[nodiscard]] constexpr auto calc_shifts_for_size(size_t s) cons... method copy_buckets (line 964) | void copy_buckets(table const& other) { method is_full (line 986) | [[nodiscard]] auto is_full() const -> bool { method deallocate_buckets (line 990) | void deallocate_buckets() { method allocate_buckets_from_shift (line 996) | void allocate_buckets_from_shift() { method clear_buckets (line 1016) | void clear_buckets() { method clear_and_fill_buckets_from_values (line 1026) | void clear_and_fill_buckets_from_values() { method increase_size (line 1038) | void increase_size() { method do_erase (line 1053) | void do_erase(value_idx_type bucket_idx, Op handle_erased_value) { method do_erase_key (line 1086) | auto do_erase_key(K&& key, Op handle_erased_value) -> size_t { method do_insert_or_assign (line 1107) | auto do_insert_or_assign(K&& key, M&& mapped) -> std::pair std::pair iterator { method do_find (line 1198) | auto do_find(K const& key) const -> const_iterator { method do_at (line 1203) | auto do_at(K const& key) -> Q& { method do_at (line 1211) | auto do_at(K const& key) const -> Q const& { method table (line 1216) | explicit table(size_t bucket_count, method table (line 1232) | table() method table (line 1235) | table(size_t bucket_count, allocator_type const& alloc) method table (line 1238) | table(size_t bucket_count, Hash const& hash, allocator_type cons... method table (line 1241) | explicit table(allocator_type const& alloc) method table (line 1245) | table(InputIt first, method table (line 1256) | table(InputIt first, InputIt last, size_type bucket_count, alloc... method table (line 1260) | table(InputIt first, InputIt last, size_type bucket_count, Hash ... method table (line 1263) | table(table const& other) method table (line 1266) | table(table const& other, allocator_type const& alloc) method table (line 1274) | table(table&& other) noexcept method table (line 1277) | table(table&& other, allocator_type const& alloc) noexcept method table (line 1282) | table(std::initializer_list ilist, method table (line 1291) | table(std::initializer_list ilist, size_type bucket_... method table (line 1294) | table(std::initializer_list init, size_type bucket_c... method get_allocator (line 1354) | auto get_allocator() const noexcept -> allocator_type { method begin (line 1360) | auto begin() noexcept -> iterator { method begin (line 1364) | auto begin() const noexcept -> const_iterator { method cbegin (line 1368) | auto cbegin() const noexcept -> const_iterator { method end (line 1372) | auto end() noexcept -> iterator { method cend (line 1376) | auto cend() const noexcept -> const_iterator { method end (line 1380) | auto end() const noexcept -> const_iterator { method empty (line 1386) | [[nodiscard]] auto empty() const noexcept -> bool { method size (line 1390) | [[nodiscard]] auto size() const noexcept -> size_t { method max_size (line 1394) | [[nodiscard]] static constexpr auto max_size() noexcept -> size_t { method clear (line 1404) | void clear() { method insert (line 1409) | auto insert(value_type const& value) -> std::pair { method insert (line 1413) | auto insert(value_type&& value) -> std::pair { method insert (line 1418) | auto insert(P&& value) -> std::pair { method insert (line 1422) | auto insert(const_iterator /*hint*/, value_type const& value) ->... method insert (line 1426) | auto insert(const_iterator /*hint*/, value_type&& value) -> iter... method insert (line 1431) | auto insert(const_iterator /*hint*/, P&& value) -> iterator { method insert (line 1436) | void insert(InputIt first, InputIt last) { method insert (line 1443) | void insert(std::initializer_list ilist) { method extract (line 1449) | auto extract() && -> value_container_type { method replace (line 1455) | auto replace(value_container_type&& container) { method insert_or_assign (line 1508) | auto insert_or_assign(Key const& key, M&& mapped) -> std::pair std::pair std::pair std::pair { method emplace (line 1573) | auto emplace(Args&&... args) -> std::pair { method emplace_hint (line 1604) | auto emplace_hint(const_iterator /*hint*/, Args&&... args) -> it... method try_emplace (line 1609) | auto try_emplace(Key const& key, Args&&... args) -> std::pair std::pair std::pair iterator { method extract (line 1666) | auto extract(iterator it) -> value_type { method erase (line 1683) | auto erase(const_iterator it) -> iterator { method extract (line 1688) | auto extract(const_iterator it) -> value_type { method erase (line 1692) | auto erase(const_iterator first, const_iterator last) -> iterator { method erase (line 1716) | auto erase(Key const& key) -> size_t { method extract (line 1721) | auto extract(Key const& key) -> std::optional { method erase (line 1730) | auto erase(K&& key) -> size_t { method extract (line 1736) | auto extract(K&& key) -> std::optional { method swap (line 1744) | void swap(table& other) noexcept(noexcept(std::is_nothrow_swappa... method at (line 1753) | auto at(key_type const& key) -> Q& { method at (line 1762) | auto at(K const& key) -> Q& { method at (line 1767) | auto at(key_type const& key) const -> Q const& { method at (line 1776) | auto at(K const& key) const -> Q const& { method count (line 1799) | auto count(Key const& key) const -> size_t { method count (line 1804) | auto count(K const& key) const -> size_t { method find (line 1808) | auto find(Key const& key) -> iterator { method find (line 1812) | auto find(Key const& key) const -> const_iterator { method find (line 1817) | auto find(K const& key) -> iterator { method find (line 1822) | auto find(K const& key) const -> const_iterator { method contains (line 1826) | auto contains(Key const& key) const -> bool { method contains (line 1831) | auto contains(K const& key) const -> bool { method equal_range (line 1835) | auto equal_range(Key const& key) -> std::pair { method equal_range (line 1840) | auto equal_range(const Key& key) const -> std::pair std::pair { method equal_range (line 1852) | auto equal_range(K const& key) const -> std::pair size_t { // NOLINT(moderni... method max_bucket_count (line 1863) | static constexpr auto max_bucket_count() noexcept -> size_t { //... method load_factor (line 1869) | [[nodiscard]] auto load_factor() const -> float { method max_load_factor (line 1873) | [[nodiscard]] auto max_load_factor() const -> float { method max_load_factor (line 1877) | void max_load_factor(float ml) { method rehash (line 1884) | void rehash(size_t count) { method reserve (line 1896) | void reserve(size_t capa) { method hash_function (line 1913) | auto hash_function() const -> hasher { method key_eq (line 1917) | auto key_eq() const -> key_equal { method values (line 1922) | [[nodiscard]] auto values() const noexcept -> value_container_ty... type pmr (line 1995) | namespace pmr { type hash> (line 370) | struct hash> : tuple_hash_helper { type detector>, Op, Args...> (line 457) | struct detector>, Op, Args...> { type std (line 2065) | namespace std { // NOLINT(cert-dcl58-cpp) FILE: kimimaro/intake.py class DimensionError (line 44) | class DimensionError(Exception): function skeletonize (line 58) | def skeletonize( function connect_points (line 268) | def connect_points( function format_labels (line 315) | def format_labels(labels, in_place): function skeletonize_parallel (line 344) | def skeletonize_parallel( function parallel_skeletonize_subset (line 410) | def parallel_skeletonize_subset( function skeletonize_subset (line 434) | def skeletonize_subset( function apply_object_mask (line 519) | def apply_object_mask(all_labels, object_ids): function points_to_labels (line 537) | def points_to_labels(pts, cc_labels): function compute_border_targets (line 544) | def compute_border_targets(cc_labels, anisotropy): function merge (line 587) | def merge(skeletons): function argmax (line 595) | def argmax(arr): function engage_avocado_protection (line 600) | def engage_avocado_protection( function engage_avocado_protection_single_pass (line 646) | def engage_avocado_protection_single_pass( function synapses_to_targets (line 706) | def synapses_to_targets(labels, synapses, progress=False): function fill_all_holes (line 747) | def fill_all_holes(cc_labels, progress=False, return_fill_count=False): function print_quotes (line 796) | def print_quotes(parallel): FILE: kimimaro/post.py function postprocess (line 49) | def postprocess( function join_close_components (line 89) | def join_close_components( function remove_dust (line 222) | def remove_dust(skeleton, dust_threshold): function remove_ticks (line 235) | def remove_ticks(skeleton, threshold): function _remove_ticks (line 262) | def _remove_ticks(skeleton, threshold): function _create_distance_graph (line 364) | def _create_distance_graph(skeleton): function remove_loops (line 436) | def remove_loops(skeleton): function _remove_loops (line 446) | def _remove_loops(skeleton): function path2edge (line 565) | def path2edge(path): function remove_row (line 576) | def remove_row(array, rows2remove): function find_row (line 590) | def find_row(array, row): FILE: kimimaro/sharedmemory.py class SharedMemoryReadError (line 22) | class SharedMemoryReadError(Exception): class SharedMemoryAllocationError (line 25) | class SharedMemoryAllocationError(Exception): function ndarray (line 28) | def ndarray(shape, dtype, location, order='F', readonly=False, lock=None... function ndarray_fs (line 58) | def ndarray_fs( function allocate_shm_file (line 89) | def allocate_shm_file(filename, nbytes, dbytes, readonly): function ndarray_shm (line 130) | def ndarray_shm(shape, dtype, location, readonly=False, order='F', **kwa... function unlink (line 191) | def unlink(location): function unlink_shm (line 196) | def unlink_shm(location): function unlink_fs (line 204) | def unlink_fs(location): FILE: kimimaro/trace.py function trace (line 36) | def trace( function compute_paths (line 196) | def compute_paths( function find_soma_root (line 269) | def find_soma_root(DBF, dbf_max): function find_root (line 291) | def find_root(labels, anisotropy, voxel_graph): function is_power_of_two (line 310) | def is_power_of_two(num): function compute_pdrf (line 315) | def compute_pdrf( function point_to_point (line 358) | def point_to_point( FILE: kimimaro/utility.py function toabs (line 35) | def toabs(path): function mkdir (line 39) | def mkdir(path): function extract_skeleton_from_binary_image (line 54) | def extract_skeleton_from_binary_image(image): function compute_cc_labels (line 58) | def compute_cc_labels(all_labels, voxel_graph = None): function find_objects (line 85) | def find_objects(labels): function add_property (line 104) | def add_property(skel, prop): function shape_iterator (line 114) | def shape_iterator(all_labels, skeletons, fill_holes, in_place, progress... function cross_sectional_area_single (line 168) | def cross_sectional_area_single( function cross_sectional_area (line 351) | def cross_sectional_area( function oversegment (line 562) | def oversegment( function moving_average (line 647) | def moving_average(a:np.ndarray, n:int, mode:str = "symmetric") -> np.nd... FILE: kimimaro_cli/__init__.py class Tuple3 (line 14) | class Tuple3(click.ParamType): method convert (line 17) | def convert(self, value, param, ctx): function main (line 29) | def main(): function forge (line 68) | def forge( function swc (line 132) | def swc(): function from_image (line 138) | def from_image(src): function to_image (line 156) | def to_image(src, format): function view (line 201) | def view(filename, port, color_by): function license (line 222) | def license(): FILE: kimimaro_cli/codecs.py function normalize_file_ext (line 5) | def normalize_file_ext(filename): function load (line 21) | def load(filename): FILE: setup.py class NumpyImport (line 6) | class NumpyImport: method __repr__ (line 7) | def __repr__(self):