linked_queue
1���� � H __PAGEZERO � __TEXT @ @ __text __TEXT ` � ` � __stubs __TEXT < $ < � __cstring __TEXT ` � ` __unwind_info __TEXT h � __DATA_CONST @ @ @ @ __got __DATA_CONST @ @ H __LINKEDIT � @ � � 4 � � x 3 � x� � H� P� � P 8� /usr/lib/dyld �R-�0>��E�@Q}W2 �* ( � � 8 L /usr/lib/libSystem.B.dylib & 8� ) H� � � �� ��{��C � ��� �� ��@�( � �@� ��@� ��@� � �@��{A��� ��_��� ��{��� ��� ���_�@�� � � @�H � � @�@�� �� @�� ��@�� ������_�� ��{B��� ��_��C �� ��@�@� ����C ��_��� ��{��� �� �� � ��� �� ��@�H � � �1�� � �R �� 8! �@��@�( ��@� �� @�@� � �@�� @�( �� @�( � �@�� @�)@�( ��@�� @�( � � @�H@�) �R H �(
2�� 8 ��_8 �{B��� ��_��� ��{��� �� �� �� @�����@ 6 � �1�� � �R �� 8 � @�@�� ��@�@��@�( ��@�@�� @�( �� @�@�� � � @� � �@�g �� @�(@� q( �( �R �� 8 ��_8 �{B��� ��_��� ��{��� �� �� �� @������ 6 �R �� 8 � @�@�@��@�( �( �R �� 8 ��_8 �{B��� ��_��� ��{��� �� �� �� @�j���� 6 �R �� 8 � @�@�@��@�( �( �R �� 8 ��_8 �{B��� ��_��� ��{��� ��� ���_�@�� �( � � ,2� ���_�@�� � � @�� � � @�@�� �( � � �2� �� @�@�� ���� � �2� ��{B��� ��_��C �� ��@� @��C ��_��� ��{��C �� � �@�� �c���` 6 ����{A��� ��_��C��{����� ������ ��_� � � �2�� �( �R�� �� � 3�� � � �3�� �( �R�� � ��^� q T ��^�I�R� �
3} � ��
4�( � � H4�� ��@��_���^�} �����_����� ��^� �� ���� � �4�� ��_��c �X���� 6 �_��s �p��� 6 ��^�� �( � � 5�� ��C^�� �( � � �5�� ��_�}��� � @6�� �� � � @� q� T �_�� ����` 6 �#@�� �( � � �6�� ��_�f��� � @� � ���� � �6�� �� �R� � �@� q T �@�I�R� �
5} � ��
6�( � � H4�p �� @��_��@�} �����_�E��� �@� � ���� � t7�a � �_�� �����` 6 �#@�� �( � � �6�U ��_�/������ � 8�O � � �8�L ��_�� ����� � �8�F � � �9�C �� � �@� �R kJ T �_��@�p��� �@� � �����_�1���� �� �( � � :�, � � �:�) �� � �@� q
7 T �_�� ������#@�� �( � � ;� � �@� � ���� � P;� ��_�'��� � �;�
8 ��� � ��_��{D��C��_�0 �@� �0 �@� �0 �
9@� �메모리 할당 실패!
10 Queue is empty!
11 Queue (size=%d): front -> %d <- rear
12 큐 생성 실패!
13 === 연결 리스트 기반 큐 테스트 ===
14
15 [ 1단계: Enqueue 5개 ]
16 Enqueue %d ->
17[ 2단계: Front/Rear 확인 ]
18 Front 값: %d (먼저 들어온 값)
19 Rear 값: %d (나중에 들어온 값)
20
21[ 3단계: Dequeue 2개 ]
22 Dequeued: %d ->
23[ 4단계: Enqueue 2개 더 ]
24
25[ 5단계: 모든 요소 Dequeue ]
26
27[ 6단계: Empty 상태에서 Dequeue 시도 ]
28 Dequeue ->
29[ 7단계: 대량 삽입 테스트 ]
30 10000개 요소 삽입 중...
31 삽입 완료! 현재 크기: %d
32
33처음 5개 요소 확인:
34 Dequeued: %d
35
36메모리 해제 중...
37 큐 해제 완료!
38 $ $ ` H H < H � � � � � � P \ @ @ _free _malloc _printf _ � � � lear
39reate � � queue &stroy + �
40 �
41 �
42 � � � c de 0enqueue @front EisEmpty Jprint Orear Tsize Y � _mh_execute_header lqueue_ ^main � �P` ��tt�8 h $ ` 3 C � S 0 c � q � � � P � P � � � � �
43
44 __mh_execute_header _lqueue_clear _lqueue_create _lqueue_dequeue _lqueue_destroy _lqueue_enqueue _lqueue_front _lqueue_isEmpty _lqueue_print _lqueue_rear _lqueue_size _main _free _malloc _printf �� � � �� � e X � � linked_queue ����A�;����<�+����I��T'q�;lCq���Xo��f����kOX�|�|z�ڽ�H�,����Xo��f����kOX�|�|z�ڽ�H�,����Xo��f����kOX�|�|z�ڽ�H�,�r����A.��ʁ�Ѱ�I�&� 銾���Xo��f����kOX�|�|z�ڽ�H�,����Xo��f����kOX�|�|z�ڽ�H�,����Xo��f����kOX�|�|z�ڽ�H�,�M:,:�$ '�,Be@=�ld2Ǐ�g �T��
45�