CUtlRBTree<CUtlMap<char_const*,int,int>::Node_t,int,CUtlMap<char_const*,int,int>::CKeyLess,CUtlMemory<UtlRBTreeNode_t<CUtlMap<char_const*,int,int>::Node_t,int>,int>>::RemoveAll

/* CUtlRBTree<CUtlMap<char const*, int, int>::Node_t, int, CUtlMap<char const*, int, int>::CKeyLess,
   CUtlMemory<UtlRBTreeNode_t<CUtlMap<char const*, int, int>::Node_t, int>, int> >::RemoveAll() */

void __thiscall
CUtlRBTree<CUtlMap<char_const*,int,int>::Node_t,int,CUtlMap<char_const*,int,int>::CKeyLess,CUtlMemory<UtlRBTreeNode_t<CUtlMap<char_const*,int,int>::Node_t,int>,int>>
::RemoveAll(CUtlRBTree<CUtlMap<char_const*,int,int>::Node_t,int,CUtlMap<char_const*,int,int>::CKeyLess,CUtlMemory<UtlRBTreeNode_t<CUtlMap<char_const*,int,int>::Node_t,int>,int>>
            *this)

{
  int iVar1;
  int iVar2;
  int iVar3;
  
  iVar1 = *(int *)(this + 0x1c);
  if (iVar1 != -1) {
    iVar3 = 0;
    iVar2 = 0;
    if (0 < *(int *)(this + 8)) {
      do {
        if ((iVar2 < *(int *)(this + 8)) && (iVar2 <= iVar1)) {
          if ((Links(int)::s_Sentinel == '\0') &&
             (iVar1 = __cxa_guard_acquire(&Links(int)::s_Sentinel), iVar1 != 0)) {
            Links(int)::s_Sentinel = 0xffffffff;
            DAT_0034075c = 0xffffffff;
            DAT_00340760 = 0xffffffff;
            __cxa_guard_release(&Links(int)::s_Sentinel);
          }
          if (*(int *)(*(int *)(this + 4) + iVar3) != iVar2) {
            ((int *)(*(int *)(this + 4) + iVar3))[1] = *(int *)(this + 0x18);
            *(int *)(*(int *)(this + 4) + iVar3) = iVar2;
            *(int *)(this + 0x18) = iVar2;
          }
          iVar1 = *(int *)(this + 0x1c);
        }
        do {
          if (((iVar1 == iVar2) || (iVar2 = iVar2 + 1, iVar2 < 0)) || (*(int *)(this + 8) <= iVar2))
          goto LAB_000f53a0;
          iVar3 = iVar3 + 0x18;
        } while (iVar2 < 0);
      } while( true );
    }
LAB_000f53a0:
    *(undefined4 *)(this + 0x10) = 0xffffffff;
    *(undefined4 *)(this + 0x14) = 0;
  }
  return;
}