// File: attractivechaos[P]udb2/robin_hood/./robin_hood.h
// Function: std::pair<unsigned long, robin_hood::detail::Table<true, 80ul, unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>>::InsertionState> robin_hood::detail::Table<true, 80ul, unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>>::insertKeyPrepareEmptySpot<unsigned int&>(unsigned int&)
std::pair<size_t, InsertionState> insertKeyPrepareEmptySpot(OtherKey&& key) {
        for (int i = 0; i < 256; ++i) {
            size_t idx{};
            InfoType info{};
            keyToIdx(key, &idx, &info);
            nextWhileLess(&info, &idx);

            // while we potentially have a match
            while (info == mInfo[idx]) {
                if (WKeyEqual::operator()(key, mKeyVals[idx].getFirst())) {
                    // key already exists, do NOT insert.
                    // see http://en.cppreference.com/w/cpp/container/unordered_map/insert
                    return std::make_pair(idx, InsertionState::key_found);
                }
                next(&info, &idx);
            }

            // unlikely that this evaluates to true
            if (ROBIN_HOOD_UNLIKELY(mNumElements >= mMaxNumElementsAllowed)) {
                if (!increase_size()) {
                    return std::make_pair(size_t(0), InsertionState::overflow_error);
                }
                continue;
            }

            // key not found, so we are now exactly where we want to insert it.
            auto const insertion_idx = idx;
            auto const insertion_info = info;
            if (ROBIN_HOOD_UNLIKELY(insertion_info + mInfoInc > 0xFF)) {
                mMaxNumElementsAllowed = 0;
            }

            // find an empty spot
            while (0 != mInfo[idx]) {
                next(&info, &idx);
            }

            if (idx != insertion_idx) {
                shiftUp(idx, insertion_idx);
            }
            // put at empty spot
            mInfo[insertion_idx] = static_cast<uint8_t>(insertion_info);
            ++mNumElements;
            return std::make_pair(insertion_idx, idx == insertion_idx
                                                     ? InsertionState::new_node
                                                     : InsertionState::overwrite_node);
        }

        // enough attempts failed, so finally give up.
        return std::make_pair(size_t(0), InsertionState::overflow_error);
    }

// Assembly:
subq $0xb8, %rsp
movq %rdi, 0xa0(%rsp)
movq %rsi, 0x98(%rsp)
movq 0xa0(%rsp), %rax
movq %rax, 0x8(%rsp)
movl $0x0, 0x94(%rsp)
cmpl $0x100, 0x94(%rsp) # imm = 0x100
jge 0x1eb2
movq 0x8(%rsp), %rdi
movq $0x0, 0x88(%rsp)
movl $0x0, 0x84(%rsp)
movq 0x98(%rsp), %rsi
leaq 0x88(%rsp), %rdx
leaq 0x84(%rsp), %rcx
callq 0x20a0
movq 0x8(%rsp), %rdi
leaq 0x84(%rsp), %rsi
leaq 0x88(%rsp), %rdx
callq 0x2140
movq 0x8(%rsp), %rcx
movl 0x84(%rsp), %eax
movq 0x10(%rcx), %rcx
movq 0x88(%rsp), %rdx
movzbl (%rcx,%rdx), %ecx
cmpl %ecx, %eax
jne 0x1d2c
movq 0x8(%rsp), %rax
movq 0x98(%rsp), %rcx
movq %rcx, (%rsp)
movq 0x8(%rax), %rdi
movq 0x88(%rsp), %rax
shlq $0x3, %rax
addq %rax, %rdi
callq 0x21d0
movq 0x8(%rsp), %rdi
movq (%rsp), %rsi
movq %rax, %rdx
callq 0x21a0
testb $0x1, %al
jne 0x1cc7
jmp 0x1d0d
movl $0x1, 0x80(%rsp)
leaq 0x88(%rsp), %rdi
leaq 0x80(%rsp), %rsi
callq 0x21e0
movl %edx, 0x78(%rsp)
movq %rax, 0x70(%rsp)
movq 0x70(%rsp), %rax
movq %rax, 0xa8(%rsp)
movl 0x78(%rsp), %eax
movl %eax, 0xb0(%rsp)
jmp 0x1ef3
movq 0x8(%rsp), %rdi
leaq 0x84(%rsp), %rsi
leaq 0x88(%rsp), %rdx
callq 0x2210
jmp 0x1c63
movq 0x8(%rsp), %rcx
movq 0x18(%rcx), %rax
cmpq 0x28(%rcx), %rax
jb 0x1d94
movq 0x8(%rsp), %rdi
callq 0x2250
testb $0x1, %al
jne 0x1d8f
movq $0x0, 0x68(%rsp)
movl $0x0, 0x64(%rsp)
leaq 0x68(%rsp), %rdi
leaq 0x64(%rsp), %rsi
callq 0x2340
movl %edx, 0x58(%rsp)
movq %rax, 0x50(%rsp)
movq 0x50(%rsp), %rax
movq %rax, 0xa8(%rsp)
movl 0x58(%rsp), %eax
movl %eax, 0xb0(%rsp)
jmp 0x1ef3
jmp 0x1e9c
movq 0x8(%rsp), %rcx
movq 0x88(%rsp), %rax
movq %rax, 0x48(%rsp)
movl 0x84(%rsp), %eax
movl %eax, 0x44(%rsp)
movl 0x44(%rsp), %eax
addl 0x30(%rcx), %eax
cmpl $0xff, %eax
jbe 0x1dcc
movq 0x8(%rsp), %rax
movq $0x0, 0x28(%rax)
jmp 0x1dce
movq 0x8(%rsp), %rax
movq 0x10(%rax), %rax
movq 0x88(%rsp), %rcx
movzbl (%rax,%rcx), %ecx
xorl %eax, %eax
cmpl %ecx, %eax
je 0x1e05
movq 0x8(%rsp), %rdi
leaq 0x84(%rsp), %rsi
leaq 0x88(%rsp), %rdx
callq 0x2210
jmp 0x1dce
movq 0x88(%rsp), %rax
cmpq 0x48(%rsp), %rax
je 0x1e2b
movq 0x8(%rsp), %rdi
movq 0x88(%rsp), %rsi
movq 0x48(%rsp), %rdx
callq 0x2370
movq 0x8(%rsp), %rax
movb 0x44(%rsp), %sil
movq 0x10(%rax), %rcx
movq 0x48(%rsp), %rdx
movb %sil, (%rcx,%rdx)
movq 0x18(%rax), %rcx
incq %rcx
movq %rcx, 0x18(%rax)
movq 0x88(%rsp), %rax
movq 0x48(%rsp), %rcx
subq %rcx, %rax
sete %al
movzbl %al, %eax
xorl $0x3, %eax
movl %eax, 0x40(%rsp)
leaq 0x48(%rsp), %rdi
leaq 0x40(%rsp), %rsi
callq 0x2460
movl %edx, 0x38(%rsp)
movq %rax, 0x30(%rsp)
movq 0x30(%rsp), %rax
movq %rax, 0xa8(%rsp)
movl 0x38(%rsp), %eax
movl %eax, 0xb0(%rsp)
jmp 0x1ef3
movl 0x94(%rsp), %eax
addl $0x1, %eax
movl %eax, 0x94(%rsp)
jmp 0x1bff
movq $0x0, 0x28(%rsp)
movl $0x0, 0x24(%rsp)
leaq 0x28(%rsp), %rdi
leaq 0x24(%rsp), %rsi
callq 0x2340
movl %edx, 0x18(%rsp)
movq %rax, 0x10(%rsp)
movq 0x10(%rsp), %rax
movq %rax, 0xa8(%rsp)
movl 0x18(%rsp), %eax
movl %eax, 0xb0(%rsp)
movq 0xa8(%rsp), %rax
movl 0xb0(%rsp), %edx
addq $0xb8, %rsp
retq
nopw (%rax,%rax)