// File: /workspace/github_cpp_makefile_star2_O1/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, %r14
movl %esi, %ebp
movq %rdi, %rbx
callq 0x21a8
cmpl $0x1, %ebp
jne 0x1fd7
movq 0x40(%r14), %rax
jmp 0x1fe6
movq 0x48(%r14), %rsi
movq %rbx, %rdi
movq %r15, %rdx
callq 0x18ae
cmpq 0x40(%rbx), %rax
jbe 0x2078
leaq 0x30(%rbx), %rdi
movq %rax, %rsi
callq 0x22f6
movq 0x40(%rbx), %rax
testq %rax, %rax
js 0x200c
cvtsi2ss %rax, %xmm0
jmp 0x2021
movq %rax, %rcx
shrq %rcx
andl $0x1, %eax
orq %rcx, %rax
cvtsi2ss %rax, %xmm0
addss %xmm0, %xmm0
movss 0x10(%rbx), %xmm1
mulss %xmm0, %xmm1
cvttss2si %xmm1, %rax
movq %rax, %rcx
sarq $0x3f, %rcx
movss 0x1002(%rip), %xmm2     # 0x3040
subss %xmm2, %xmm1
cvttss2si %xmm1, %rdx
andq %rcx, %rdx
orq %rax, %rdx
movq %rdx, (%rbx)
mulss 0x14(%rbx), %xmm0
cvttss2si %xmm0, %rax
movq %rax, %rcx
sarq $0x3f, %rcx
subss %xmm2, %xmm0
cvttss2si %xmm0, %rdx
andq %rcx, %rdx
orq %rax, %rdx
movq %rdx, 0x8(%rbx)
movb $0x0, 0x18(%rbx)
movq 0x40(%rbx), %rbp
leaq -0x1(%rbp), %rax
testq %rax, %rbp
jne 0x2189
movl $0xffffffff, %eax       # imm = 0xFFFFFFFF
addq %rax, %rbp
addq $0x30, %r14
leaq 0x8(%rsp), %r15
movq %r15, %rdi
movq %r14, %rsi
callq 0x24d0
leaq 0x30(%rbx), %r12
leaq 0x20(%rsp), %r13
movq %r13, %rdi
movq %r14, %rsi
callq 0x2590
movq 0x8(%rsp), %rax
cmpq 0x20(%rsp), %rax
jne 0x20e4
testq %rax, %rax
je 0x2158
cmpq $-0x1, (%rax)
je 0x2158
movq 0x10(%rsp), %rax
cmpq 0x28(%rsp), %rax
je 0x2158
movq 0x10(%rsp), %rdx
movl (%rdx), %esi
andl %ebp, %esi
movq 0x30(%rbx), %rax
movl %esi, %ecx
shrl $0x5, %ecx
leaq (%rcx,%rcx,2), %rcx
movl 0x8(%rax,%rcx,8), %ecx
btl %esi, %ecx
jae 0x213d
movq 0x40(%rbx), %rcx
leaq -0x1(%rcx), %rdi
cmpq $0x1, %rcx
adcq $0x0, %rcx
movl $0x1, %r8d
cmpq %r8, %rcx
je 0x216a
addq %r8, %rsi
andq %rdi, %rsi
movq %rsi, %r9
shrq $0x5, %r9
leaq (%r9,%r9,2), %r9
movl 0x8(%rax,%r9,8), %r9d
incq %r8
btl %esi, %r9d
jb 0x2119
movq %r12, %rdi
callq 0x2430
addq $0x8, 0x10(%rsp)
movq %r15, %rdi
callq 0x2510
jmp 0x20ae
incl 0x1c(%rbx)
addq $0x38, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
leaq 0x159a(%rip), %rdi      # 0x370b
leaq 0xf53(%rip), %rsi       # 0x30cb
leaq 0x1269(%rip), %rcx      # 0x33e8
movl $0xb0b, %edx            # imm = 0xB0B
callq 0x10a0
leaq 0xf4c(%rip), %rdi       # 0x30dc
leaq 0xf34(%rip), %rsi       # 0x30cb
leaq 0x124a(%rip), %rcx      # 0x33e8
movl $0xafc, %edx            # imm = 0xAFC
callq 0x10a0