// File: /workspace/github_cpp_makefile_star2_O2/attractivechaos[P]udb2/sparsehash/./sparsehash/internal/densehashtable.h
// Function: google::dense_hashtable<std::pair<unsigned int const, unsigned int>, unsigned int, Hash32, google::dense_hash_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, google::libc_allocator_with_realloc<std::pair<unsigned int const, unsigned int>>>::SelectKey, google::dense_hash_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, google::libc_allocator_with_realloc<std::pair<unsigned int const, unsigned int>>>::SetKey, std::equal_to<unsigned int>, google::libc_allocator_with_realloc<std::pair<unsigned int const, unsigned int>>>::copy_from(google::dense_hashtable<std::pair<unsigned int const, unsigned int>, unsigned int, Hash32, google::dense_hash_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, google::libc_allocator_with_realloc<std::pair<unsigned int const, unsigned int>>>::SelectKey, google::dense_hash_map<unsigned int, unsigned int, Hash32, std::equal_to<unsigned int>, google::libc_allocator_with_realloc<std::pair<unsigned int const, unsigned int>>>::SetKey, std::equal_to<unsigned int>, google::libc_allocator_with_realloc<std::pair<unsigned int const, unsigned int>>> const&, unsigned long)
void copy_from(const dense_hashtable &ht, size_type min_buckets_wanted) {
    clear_to_size(settings.min_buckets(ht.size(), min_buckets_wanted));

    // We use a normal iterator to get non-deleted bcks from ht
    // We could use insert() here, but since we know there are
    // no duplicates and no deleted items, we can be more efficient
    assert((bucket_count() & (bucket_count()-1)) == 0);      // a power of two
    for ( const_iterator it = ht.begin(); it != ht.end(); ++it ) {
      size_type num_probes = 0;              // how many times we've probed
      size_type bucknum;
      const size_type bucket_count_minus_one = bucket_count() - 1;
      for (bucknum = hash(get_key(*it)) & bucket_count_minus_one;
           !test_empty(bucknum);                               // not empty
           bucknum = (bucknum + JUMP_(key, num_probes)) & bucket_count_minus_one) {
        ++num_probes;
        assert(num_probes < bucket_count()
               && "Hashtable is full: an error in key_equal<> or hash<>");
      }
      set_value(&table[bucknum], *it);       // copies the value to here
      num_elements++;
    }
    settings.inc_num_ht_copies();
  }

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x38, %rsp
movq %rsi, %r14
movq %rdi, %rbx
movq 0x30(%rsi), %rsi
subq 0x28(%r14), %rsi
callq 0x1658
movq %rbx, %rdi
movq %rax, %rsi
callq 0x1b8e
movq 0x38(%rbx), %rax
leaq -0x1(%rax), %rcx
testq %rcx, %rax
jne 0x1b6f
leaq 0x8(%rsp), %rdi
movq %r14, %rsi
callq 0x1c2c
leaq 0x20(%rsp), %r12
movq %r12, %rdi
movq %r14, %rsi
callq 0x1c52
movq 0x10(%rsp), %rax
cmpq 0x28(%rsp), %rax
je 0x1b3e
movq 0x38(%rbx), %rbp
decq %rbp
movl (%rax), %r13d
xorl %r15d, %r15d
andq %rbp, %r13
movq %rbx, %rdi
movq %r13, %rsi
callq 0x1c78
testb %al, %al
jne 0x1b1e
addq %r15, %r13
incq %r13
incq %r15
cmpq 0x38(%rbx), %r15
jb 0x1afb
jmp 0x1b50
movq 0x48(%rbx), %rax
movq 0x10(%rsp), %rcx
movq (%rcx), %rcx
movq %rcx, (%rax,%r13,8)
incq 0x30(%rbx)
leaq 0x8(%rsp), %rdi
callq 0x1cac
jmp 0x1ad7
incl 0x1c(%rbx)
addq $0x38, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
leaq 0x2659(%rip), %rdi      # 0x41b0
leaq 0x159d(%rip), %rsi      # 0x30fb
leaq 0x2309(%rip), %rcx      # 0x3e6e
movl $0x28d, %edx            # imm = 0x28D
callq 0x1070
leaq 0x22cd(%rip), %rdi      # 0x3e43
leaq 0x157e(%rip), %rsi      # 0x30fb
leaq 0x22ea(%rip), %rcx      # 0x3e6e
movl $0x283, %edx            # imm = 0x283
callq 0x1070