8 template <
typename MKey,
typename T>
13 template <
typename MKey,
typename T>
21 template <
typename MKey,
typename T>
30 int ind_plus = ind + 1;
33 for (
size_t j =
m_size; j > ind_plus; j--)
45 template <
typename MKey,
typename T>
57 template <
typename MKey,
typename T>
69 template <
typename MKey,
typename T>
75 template <
typename MKey,
typename T>
81 template <
typename MKey,
typename T>
85 if (ind >=
m_size)
return 0;
97 template <
typename MKey,
typename T>
DYN_FUNC uint count(MKey key)
Pair< MKey, T > * m_startLoc
DYN_FUNC T & operator[](MKey key)
DYN_FUNC iterator find(MKey key)
DYN_FUNC iterator insert(Pair< MKey, T > pair)
This is an implementation of AdditiveCCD based on peridyno.
DYN_FUNC int leftBound(T target, T *startLoc, uint maxSize)
Find the left bound of a target with a binary search algorithm.
DYN_FUNC int rightBound(T target, T *startLoc, uint maxSize)
Find the right bound of a target with a binary search algorithm.