// File: /workspace/github_cpp_makefile_star2_O2/attractivechaos[P]udb2/sparsepp/./sparsepp/spp.h
// Function: spp::sparse_hashtable<std::pair<unsigned int const, unsigned int>, unsigned int, Hash32, spp::sparse_hash_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, spp::libc_allocator<std::pair<unsigned int const, unsigned int>>>::SelectKey, spp::sparse_hash_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, spp::libc_allocator<std::pair<unsigned int const, unsigned int>>>::SetKey, std::equal_to<unsigned int>, spp::libc_allocator<std::pair<unsigned int const, unsigned int>>>::_move_from(spp::sparse_hashtable<std::pair<unsigned int const, unsigned int>, unsigned int, Hash32, spp::sparse_hash_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, spp::libc_allocator<std::pair<unsigned int const, unsigned int>>>::SelectKey, spp::sparse_hash_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, spp::libc_allocator<std::pair<unsigned int const, unsigned int>>>::SetKey, std::equal_to<unsigned int>, spp::libc_allocator<std::pair<unsigned int const, unsigned int>>>::MoveDontCopyT, spp::sparse_hashtable<std::pair<unsigned int const, unsigned int>, unsigned int, Hash32, spp::sparse_hash_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, spp::libc_allocator<std::pair<unsigned int const, unsigned int>>>::SelectKey, spp::sparse_hash_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, spp::libc_allocator<std::pair<unsigned int const, unsigned int>>>::SetKey, std::equal_to<unsigned int>, spp::libc_allocator<std::pair<unsigned int const, unsigned int>>>&, unsigned long)
void _move_from(MoveDontCopyT mover, sparse_hashtable &ht,
                   size_type min_buckets_wanted)
    {
        clear();

        // If we need to change the size of our table, do it now
        size_type resize_to;
        if (mover == MoveDontGrow)
            resize_to = ht.bucket_count();       // keep same size as old ht
        else                                     // MoveDontCopy
            resize_to = settings.min_buckets(ht.size(), min_buckets_wanted);
        if (resize_to > bucket_count())
        {
            // we don't have enough buckets
            table.resize(resize_to);               // sets the number of buckets
            settings.reset_thresholds(bucket_count());
        }

        // We use a normal iterator to get bcks from ht
        // We could use insert() here, but since we know there are
        // no duplicates, we can be more efficient
        assert((bucket_count() & (bucket_count()-1)) == 0);      // a power of two
        const size_type bucket_count_minus_one = (const size_type)(bucket_count() - 1);

        // THIS IS THE MAJOR LINE THAT DIFFERS FROM COPY_FROM():
        for (destructive_iterator it = ht.destructive_begin();
              it != ht.destructive_end(); ++it)
        {
            size_type num_probes = 0;
            size_type bucknum;
            for (bucknum = hash(get_key(*it)) & bucket_count_minus_one;
                 table.test(bucknum);                          // table.test() OK since no erase()
                 bucknum = (size_type)((bucknum + JUMP_(key, num_probes)) & (bucket_count()-1)))
            {
                ++num_probes;
                assert(num_probes < bucket_count()
                       && "Hashtable is full: an error in key_equal<> or hash<>");
            }
            table.move(bucknum, *it);    // moves the value to here
        }
        settings.inc_num_ht_copies();
    }

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x38, %rsp
movq %rcx, %r15
movq %rdx, %rbx
movl %esi, %ebp
movq %rdi, %r14
callq 0x1f46
cmpl $0x1, %ebp
jne 0x1e23
movq 0x40(%rbx), %rax
jmp 0x1e32
movq 0x48(%rbx), %rsi
movq %r14, %rdi
movq %r15, %rdx
callq 0x1744
movq 0x40(%r14), %rbp
cmpq %rbp, %rax
jbe 0x1e57
leaq 0x30(%r14), %rdi
movq %rax, %rsi
callq 0x1fc2
movq 0x40(%r14), %rsi
movq %r14, %rdi
callq 0x183e
movq 0x40(%r14), %rbp
leaq -0x1(%rbp), %rax
testq %rax, %rbp
jne 0x1f26
movl $0xffffffff, %eax       # imm = 0xFFFFFFFF
addq %rax, %rbp
addq $0x30, %rbx
leaq 0x8(%rsp), %r15
movq %r15, %rdi
movq %rbx, %rsi
callq 0x21d8
leaq 0x30(%r14), %r12
leaq 0x20(%rsp), %r13
movq %r13, %rdi
movq %rbx, %rsi
callq 0x22b0
movq %r15, %rdi
movq %r13, %rsi
callq 0x20e2
testb %al, %al
je 0x1ef4
movq 0x10(%rsp), %rdx
movl (%rdx), %esi
andl %ebp, %esi
movq 0x30(%r14), %rax
movq 0x40(%r14), %rcx
leaq -0x1(%rcx), %rdi
pushq $0x1
popq %r8
movq %rsi, %r9
shrq $0x5, %r9
imulq $0x18, %r9, %r9
movl 0x8(%rax,%r9), %r9d
btl %esi, %r9d
jae 0x1ee2
cmpq %rcx, %r8
jae 0x1f07
addq %r8, %rsi
andq %rdi, %rsi
incq %r8
jmp 0x1ebc
movq %r12, %rdi
callq 0x20ec
movq %r15, %rdi
callq 0x213c
jmp 0x1e89
incl 0x1c(%r14)
addq $0x38, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
leaq 0x1905(%rip), %rdi      # 0x3813
leaq 0x11b2(%rip), %rsi      # 0x30c7
leaq 0x15d4(%rip), %rcx      # 0x34f0
movl $0xb0b, %edx            # imm = 0xB0B
callq 0x10a0
leaq 0x12b7(%rip), %rdi      # 0x31e4
leaq 0x1193(%rip), %rsi      # 0x30c7
leaq 0x15b5(%rip), %rcx      # 0x34f0
movl $0xafc, %edx            # imm = 0xAFC
callq 0x10a0
nop