// File: /workspace/github_cpp_makefile_star2_O3/wichtounet[P]articles/plf_colony_alpha/plf_timsort.h
// Function: plf::TimSort<Trivial<8>**, plf::colony<Trivial<8>, std::allocator<Trivial<8>>, unsigned short>::sort_dereferencer<plf::colony<Trivial<8>, std::allocator<Trivial<8>>, unsigned short>::less>>::mergeLo(Trivial<8>**, long, Trivial<8>**, long)
void mergeLo(iter_t const base1, diff_t len1, iter_t const base2, diff_t len2)
	{
		assert(len1 > 0 && len2 > 0 && base1 + len1 == base2);

		copy_to_tmp(base1, len1);

		tmp_iter_t cursor1 = tmp_.begin();
		iter_t cursor2 = base2;
		iter_t dest = base1;

		*(dest++) = PLF_TIMSORT_MOVE(*(cursor2++));
		if (--len2 == 0)
		{
			PLF_TIMSORT_MOVE_RANGE(cursor1, cursor1 + len1, dest);
			return;
		}
		if (len1 == 1)
		{
			PLF_TIMSORT_MOVE_RANGE(cursor2, cursor2 + len2, dest);
			*(dest + len2) = PLF_TIMSORT_MOVE(*cursor1);
			return;
		}

		int minGallop(minGallop_);

		// outer:
		while (true)
		{
			int count1 = 0;
			int count2 = 0;

			bool break_outer = false;
			do
			{
				assert(len1 > 1 && len2 > 0);

				if (comp_.lt(*cursor2, *cursor1))
				{
					*(dest++) = PLF_TIMSORT_MOVE(*(cursor2++));
					++count2;
					count1 = 0;
					if (--len2 == 0)
					{
						break_outer = true;
						break;
					}
				}
				else
				{
					*(dest++) = PLF_TIMSORT_MOVE(*(cursor1++));
					++count1;
					count2 = 0;
					if (--len1 == 1)
					{
						break_outer = true;
						break;
					}
				}
			} while ((count1 | count2) < minGallop);
			
			
			if (break_outer)
			{
				break;
			}

			do
			{
				assert(len1 > 1 && len2 > 0);
				count1 = gallopRight(*cursor2, cursor1, len1, 0);

				if (count1 != 0)
				{
					PLF_TIMSORT_MOVE_BACKWARD(cursor1, cursor1 + count1, dest + count1);
					dest += count1;
					cursor1 += count1;
					len1 -= count1;

					if (len1 <= 1)
					{
						break_outer = true;
						break;
					}
				}

				*(dest++) = PLF_TIMSORT_MOVE(*(cursor2++));

				if (--len2 == 0)
				{
					break_outer = true;
					break;
				}

				count2 = gallopLeft(*cursor1, cursor2, len2, 0);

				if (count2 != 0)
				{
					PLF_TIMSORT_MOVE_RANGE(cursor2, cursor2 + count2, dest);
					dest += count2;
					cursor2 += count2;
					len2 -= count2;
					if (len2 == 0)
					{
						break_outer = true;
						break;
					}
				}

				*(dest++) = PLF_TIMSORT_MOVE(*(cursor1++));

				if (--len1 == 1)
				{
					break_outer = true;
					break;
				}

				--minGallop;
			} while ((count1 >= MIN_GALLOP) | (count2 >= MIN_GALLOP));
			
			if (break_outer)
			{
				break;
			}

			if (minGallop < 0)
			{
				minGallop = 0;
			}
			
			minGallop += 2;
		} 

		minGallop_ = std::min(minGallop, 1);

		if (len1 == 1)
		{
			assert(len2 > 0);
			PLF_TIMSORT_MOVE_RANGE(cursor2, cursor2 + len2, dest);
			*(dest + len2) = PLF_TIMSORT_MOVE(*cursor1);
		}
		else
		{
			assert(len1 != 0 && "Comparison function violates its general contract");
			assert(len2 == 0);
			assert(len1 > 1);
			PLF_TIMSORT_MOVE_RANGE(cursor1, cursor1 + len1, dest);
		}
	}

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %r8, %r14
movq %rcx, %r15
movq %rdx, %rbp
movq %rsi, %r13
movq %rdi, %rbx
callq 0x6e474
movq %rbx, 0x8(%rsp)
movq 0x8(%rbx), %rbx
movq (%r15), %rax
movq %r14, %rcx
movq %rcx, %r12
leaq 0x8(%r13), %r14
decq %r12
movq %rax, (%r13)
je 0x6df23
addq $0x8, %r15
cmpq $0x1, %rbp
jne 0x6df31
leaq (,%rcx,8), %rdx
cmpq $0x8, %rdx
je 0x6df16
addq $-0x8, %rdx
movq %r14, %rdi
movq %r15, %rsi
movq %rcx, %r14
callq 0x42a0
movq %r14, %rcx
movq (%rbx), %rax
movq %rax, (%r13,%rcx,8)
jmp 0x6e0fe
testq %rbp, %rbp
jne 0x6e10d
jmp 0x6e0fe
movq 0x8(%rsp), %r13
movl 0x4(%r13), %r8d
xorl %eax, %eax
xorl %ecx, %ecx
movq (%r15), %rdx
movq (%rbx), %rsi
movq (%rdx), %rdi
cmpq (%rsi), %rdi
jae 0x6df62
addq $0x8, %r15
decq %r12
movq %rdx, (%r14)
je 0x6e097
incl %ecx
xorl %eax, %eax
jmp 0x6df7a
addq $0x8, %rbx
decq %rbp
movq %rsi, (%r14)
cmpq $0x1, %rbp
je 0x6e091
incl %eax
xorl %ecx, %ecx
movl %ecx, %edx
addq $0x8, %r14
orl %eax, %edx
cmpl %r8d, %edx
jl 0x6df3e
movl %r8d, 0x4(%rsp)
movq %r15, %rsi
movq %rbx, %rdx
movq %rbp, %rcx
xorl %r8d, %r8d
movq 0x8(%rsp), %r13
movq %r13, %rdi
callq 0x6e4b0
testl %eax, %eax
je 0x6dfe4
movq %rax, %rdx
shlq $0x20, %rdx
je 0x6dfcc
sarq $0x1d, %rdx
movq %r14, %rdi
movq %rbx, %rsi
movq %rax, %r13
callq 0x42a0
movq %r13, %rax
movq 0x8(%rsp), %r13
movslq %eax, %rcx
leaq (%rbx,%rcx,8), %rbx
leaq (%r14,%rcx,8), %r14
subq %rcx, %rbp
cmpq $0x2, %rbp
jl 0x6e0bf
movq (%r15), %rcx
addq $0x8, %r15
movq %rcx, (%r14)
addq $0x8, %r14
decq %r12
je 0x6e0bc
movq %rax, 0x10(%rsp)
movq %r13, %rdi
movq %rbx, %rsi
movq %r15, %rdx
movq %r12, %rcx
xorl %r8d, %r8d
callq 0x6ddbe
movq %rax, %r13
testl %r13d, %r13d
je 0x6e044
movq %r13, %rdx
shlq $0x20, %rdx
je 0x6e034
sarq $0x1d, %rdx
movq %r14, %rdi
movq %r15, %rsi
callq 0x42a0
movslq %r13d, %rax
leaq (%r15,%rax,8), %r15
leaq (%r14,%rax,8), %r14
subq %rax, %r12
je 0x6e0b7
movq (%rbx), %rax
movl 0x4(%rsp), %r8d
addq $0x8, %rbx
decq %rbp
movq %rax, (%r14)
addq $0x8, %r14
cmpq $0x1, %rbp
je 0x6e0a0
decl %r8d
cmpl $0x6, 0x10(%rsp)
jg 0x6df87
cmpl $0x6, %r13d
jg 0x6df87
movq 0x8(%rsp), %r13
movl %r8d, %eax
sarl $0x1f, %eax
andnl %r8d, %eax, %r8d
addl $0x2, %r8d
jmp 0x6df3a
addq $0x8, %r14
jmp 0x6e0a5
addq $0x8, %r14
xorl %r12d, %r12d
jmp 0x6e0c4
movq 0x8(%rsp), %r13
testl %r8d, %r8d
movl $0x1, %eax
cmovlel %r8d, %eax
movl %eax, 0x4(%r13)
jmp 0x6e0df
movq 0x8(%rsp), %r13
xorl %r12d, %r12d
movl 0x4(%rsp), %r8d
testl %r8d, %r8d
movl $0x1, %eax
cmovlel %r8d, %eax
movl %eax, 0x4(%r13)
testq %rbp, %rbp
je 0x6e0fe
cmpq $0x1, %rbp
jne 0x6e10d
testq %r12, %r12
je 0x6e0f7
leaq (,%r12,8), %rdx
movq %r14, %rdi
movq %r15, %rsi
callq 0x42a0
movq (%rbx), %rax
movq %rax, (%r14,%r12,8)
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
shlq $0x3, %rbp
movq %r14, %rdi
movq %rbx, %rsi
movq %rbp, %rdx
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
jmp 0x42a0
nop