15 return new std::set<void *>();
20 delete reinterpret_cast<std::set<void *> *
>(
set);
26 return reinterpret_cast<std::set<void *> *
>(
set)->erase(entry);
34 reinterpret_cast<std::set<void *> *
>(
set)->
insert(entry);
41 std::set<void *> *rset =
reinterpret_cast<std::set<void *> *
>(
set);
43 std::set<void *>::iterator it = rset->begin();
void * AUD_getSet(void *set)
void AUD_addSet(void *set, void *entry)
void AUD_destroySet(void *set)
char AUD_removeSet(void *set, void *entry)
void BLI_kdtree_nd_ insert(KDTree *tree, int index, const float co[KD_DIMS]) ATTR_NONNULL(1
node_ attributes set("label", ss.str())