// File: /workspace/github_cpp_makefile_star2_O1/dlbeer[P]summary_map/./summary_map.hpp
// Function: summary_map<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>, int, summary, std::less<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>>, aggregator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>, summary>, std::allocator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>>>::check_subtree(std::less<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>> const&, summary_map<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>, int, summary, std::less<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>>, aggregator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>, summary>, std::allocator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>>>::node const*, summary_map<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>, int, summary, std::less<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>>, aggregator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>, summary>, std::allocator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>>>::node const*, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const*, std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const*)
static std::pair<size_type, size_type>
    check_subtree(const key_compare& cmp,
		  const node *parent, const node *n,
		  const key_type *lower_bound,
		  const key_type *upper_bound)
    {
	if (!n)
	    return std::make_pair(0, 0);

	// Check that the parent pointer points to the node we came
	// from.
	assert(n->parent == parent);

	// Check that the key is within the expected range
	assert(!upper_bound || cmp(n->value.first, *upper_bound));
	assert(!lower_bound || cmp(*lower_bound, n->value.first));

	// Red nodes always have black parents
	assert(is_black(n) || is_black(parent));

	// Recursively check subtrees
	std::pair<size_type, size_type> left =
	    check_subtree(cmp, n, n->left, lower_bound, &n->value.first);
	std::pair<size_type, size_type> right =
	    check_subtree(cmp, n, n->right, &n->value.first, upper_bound);

	// Verify that this subtree is black-balanced
	assert(left.second == right.second);

	// Compile totals for this subtree
	const size_type black_self = is_black(n) ? 1 : 0;

	return std::make_pair(left.first + right.first + 1,
			      left.second + black_self);
    }

// Assembly:
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
testq %rdx, %rdx
je 0x2f49
movq %rdx, %rbx
movq %rsi, %r13
cmpq %rsi, 0x40(%rdx)
jne 0x2f5b
movq %r8, %r14
movq %rcx, %r12
movq %rdi, %r15
testq %r8, %r8
je 0x2ed1
movq %rbx, %rdi
movq %r14, %rsi
callq 0x2030
testl %eax, %eax
jns 0x2f99
testq %r12, %r12
je 0x2ee9
movq %r12, %rdi
movq %rbx, %rsi
callq 0x2030
testl %eax, %eax
jns 0x2fb8
testq %r13, %r13
je 0x2f01
movl 0x2c(%rbx), %eax
andl $0x1, %eax
je 0x2f01
testb $0x1, 0x2c(%r13)
jne 0x2fd7
movq 0x30(%rbx), %rdx
movq %r15, %rdi
movq %rbx, %rsi
movq %r12, %rcx
movq %rbx, %r8
callq 0x2e8e
movq %rax, %r13
movq %rdx, %r12
movq 0x38(%rbx), %rdx
movq %r15, %rdi
movq %rbx, %rsi
movq %rbx, %rcx
movq %r14, %r8
callq 0x2e8e
cmpq %rdx, %r12
jne 0x2f7a
movl 0x2c(%rbx), %ecx
notl %ecx
andl $0x1, %ecx
addq %r13, %rax
incq %rax
addq %rcx, %r12
jmp 0x2f4e
xorl %eax, %eax
xorl %r12d, %r12d
movq %r12, %rdx
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
retq
leaq 0x1418(%rip), %rdi      # 0x437a
leaq 0x12a0(%rip), %rsi      # 0x4209
leaq 0x141e(%rip), %rcx      # 0x438e
movl $0x38a, %edx            # imm = 0x38A
callq 0x20b0
leaq 0x1657(%rip), %rdi      # 0x45d8
leaq 0x1281(%rip), %rsi      # 0x4209
leaq 0x13ff(%rip), %rcx      # 0x438e
movl $0x39a, %edx            # imm = 0x39A
callq 0x20b0
leaq 0x15b4(%rip), %rdi      # 0x4554
leaq 0x1262(%rip), %rsi      # 0x4209
leaq 0x13e0(%rip), %rcx      # 0x438e
movl $0x38d, %edx            # imm = 0x38D
callq 0x20b0
leaq 0x15c7(%rip), %rdi      # 0x4586
leaq 0x1243(%rip), %rsi      # 0x4209
leaq 0x13c1(%rip), %rcx      # 0x438e
movl $0x38e, %edx            # imm = 0x38E
callq 0x20b0
leaq 0x15da(%rip), %rdi      # 0x45b8
leaq 0x1224(%rip), %rsi      # 0x4209
leaq 0x13a2(%rip), %rcx      # 0x438e
movl $0x391, %edx            # imm = 0x391
callq 0x20b0
jmp 0x2ff8
movq %rax, %rdi
callq 0x2b41