Dendro  5.01
Dendro in Greek language means tree. The Dendro library is a large scale (262K cores on ORNL's Titan) distributed memory adaptive octree framework. The main goal of Dendro is to perform large scale multiphysics simulations efficeiently in mordern supercomputers. Dendro consists of efficient parallel data structures and algorithms to perform variational ( finite element) methods and finite difference mthods on 2:1 balanced arbitary adaptive octrees which enables the users to perform simulations raning from black holes (binary black hole mergers) to blood flow in human body, where applications ranging from relativity, astrophysics to biomedical engineering.
Public Member Functions | Friends | List of all members
nlohmann::detail::primitive_iterator_t Class Reference

Public Member Functions

constexpr difference_type get_value () const noexcept
void set_begin () noexcept
 set iterator to a defined beginning
void set_end () noexcept
 set iterator to a defined past the end
constexpr bool is_begin () const noexcept
 return whether the iterator can be dereferenced
constexpr bool is_end () const noexcept
 return whether the iterator is at end
primitive_iterator_t operator+ (difference_type n) noexcept
primitive_iterator_toperator++ () noexcept
primitive_iterator_t const operator++ (int) noexcept
primitive_iterator_toperator-- () noexcept
primitive_iterator_t const operator-- (int) noexcept
primitive_iterator_toperator+= (difference_type n) noexcept
primitive_iterator_toperator-= (difference_type n) noexcept


constexpr bool operator== (primitive_iterator_t lhs, primitive_iterator_t rhs) noexcept
constexpr bool operator< (primitive_iterator_t lhs, primitive_iterator_t rhs) noexcept
constexpr difference_type operator- (primitive_iterator_t lhs, primitive_iterator_t rhs) noexcept

The documentation for this class was generated from the following file: