if (!entryChildType.equals(TypeName.OBJECT)) {
                result.addStatement("$2T $1L = ($2T) $3L", paramVariable, entryChildType, argExpr);
            } else {
                result.addStatement("$2T $1L = $3L", paramVariable, entryChildType, argExpr);
            }
            paramVariablesStack.push(paramVariable);
        }
        visit(child, childArgCount);

        return result.stream().collect(CodeBlock.joining("\n\n"));
    }

    private static CodeBlock constructorScopeArg(TypeName constructedType) {
        return CodeBlock.of("$1T.constructorsOf($2T.class)", INTERCEPTED_SCOPE_CLASS, constructedType);
    }

    private static CodeBlock namedCallableScopesArgs(String name, List<CallInterceptionRequest> requests) {

000000a0  bb 17 03 03 00 42 02 e5  db dc 80 e1 c2 6f 31 1c  |.....B.......o1.|
000000b0  33 7b 76 8f 51 9c f8 a8  b0 1b 1a 8a 46 00 c7 ff  |3{v.Q.......F...|
000000c0  ff 4c c9 d8 28 14 32 74  ee 59 b3 15 4b 45 90 b6  |.L..(.2t.Y..KE..|
000000d0  da 56 b3 ef d4 6f 8a eb  96 b9 94 ab b9 9e b1 2e  |.V...o..........|
000000e0  fe 29 f2 0d 0d 93 66 1a  17 03 03 02 6d 84 4e 43  |.)....f.....m.NC|

multiplication, along with a few n-digit additions and subtractions. The standard
n-by-n-digit multiplication algorithm requires O(n²) time, making the overall
algorithm require time T(n) where

	T(n) = 2T(n/2) + O(n) + O(n²)

which, by the Bentley-Haken-Saxe theorem, ends up reducing to T(n) = O(n²).
This is not an improvement over regular long division.

000001e0  d5 20 37 57 35 0a d8 c6  13 0f 48 94 8f 50 7d 0e  |. 7W5.....H..P}.|
000001f0  5a f0 98 b2 5d 5f 46 fb  ba 85 c8 4f ba 02 19 86  |Z...]_F....O....|
00000200  0b ef 4a 04 49 1f 06 cd  be dc d5 32 74 14 d8 60  |..J.I......2t..`|
00000210  17 a5 b5 a2 70 8e b1 75  29 bc e0 02 e0 a2 1c 7b  |....p..u)......{|
00000220  58 cd 96 69 84 0f 95 7b  78 3e 09 72 a6 e0 50 7e  |X..i...{x>.r..P~|

� %�R��� �Y$��h�[��T|�ʋ�r������|�������Y�J�6b�*���)h�%ʀ%�Ɔ�T�C`/S-$�]���Υ�K�D�be�be�~���Y���O5K�E���
4�e�um�~��!�����.Tmd�Rť��r�2l�2t?U��,Tf�%�"�E��r�2`���a?U���T �a�6�s��ReQ�X�X���~s*��S͒s��"eM�D�DMm�O�=�2�Br؅���\��TAT.V�-V����ʬ�T��\��H@S.Q,Q� �����^�ZH�P���K�*#���ʰ����T�#��P���j���)h�%ʀ%jb�~��!�����.Tmd�Rť��r�2l�2t?U��,Tf�%�"�E��r�2`����^�/�K 6Z��{a�H�kޠ��r���ls��e�4t����,X%��x$��\!M�/�G������]���[���l�~�>���e�G6v5���&.�=��k/�^ i�%ٺ%����/����g�i�{...

		{"7.123456M", decQuantity(7123456, 0, DecimalSI)},
		{"6.987654321G", decQuantity(6987654321, 0, DecimalSI)},
		{"5.444T", decQuantity(5444, 9, DecimalSI)},
		{"40.1T", decQuantity(401, 11, DecimalSI)},
		{"300.2T", decQuantity(3002, 11, DecimalSI)},
		{"2.5P", decQuantity(25, 14, DecimalSI)},
		{"1.01E", decQuantity(101, 16, DecimalSI)},

		// Things that saturate/round
		{"3.001n", decQuantity(4, -9, DecimalSI)},

u���~�M�뛻�'���>0�C�oN��>49��'bP���n�Τ_,~��������]~��K��q�"���.y�WD`
�msvs�K���=Y`C�ޞ���b��l�{��\������
+�o�
�m��$�M4��;��������~~�u/����U�$�J��2z6�A>Ͷ�U��4K��s�乣�6����Ҿq�|�~�}���b��81��Ǐ�������� ����J��P���d�~�E~�*�~�k�N`��z�2T�_8ڥ봯�ξ�}� c�:N����'�yUUUU���*�������f4�5��g��:WUv�0~~�/7^�{�n�]~YUS��{�^�m�5J�Bɫl��V�DDDDDDDDAO�)E�����H��)E��1�4�Ҩ*��#�I�D�%>IC�nj""/I���)�m��| �%UUUUU�.\�\�!�N-�B��ud���^I$�3���~��[m������"#��-�C⠲t���y�[�jI������H^-��m��mp��...

\266\341\244\206W\330?r$*9\251g\335?\030\342\371s\247\305\356?`\024\005-.P\316?\013AT\031\345-\354?\364JG\355\217\230\343?&\222,Z\317p\347?\300\226:\316\304\271\205?2\037\033\013B\023\354?\022\367\356\377\227O\341??S\311\335Px\356?\026\002\204\242\210\375\323?:2t\347k7\343?@\303X\215QA\357?8\357\202a\255I\357?\0247\374~\322\333\334?P\256\213\031\334o\342?|>\375\nY%\310?\332\333\204\365\034\260\331?\355W\374\024\027\322\342?Y\026h:\250\326\342?\244\262\204\273\361_\321?\"\274\2359&m\321?\310\300;?\0272\325?\...