| /prebuilts/ndk/8/platforms/android-14/arch-mips/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/8/platforms/android-14/arch-x86/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/8/platforms/android-3/arch-arm/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/8/platforms/android-4/arch-arm/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/8/platforms/android-5/arch-arm/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/8/platforms/android-8/arch-arm/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/8/platforms/android-9/arch-arm/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/8/platforms/android-9/arch-mips/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/8/platforms/android-9/arch-x86/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/9/platforms/android-12/arch-arm/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/9/platforms/android-12/arch-mips/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/9/platforms/android-12/arch-x86/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/9/platforms/android-13/arch-arm/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/9/platforms/android-13/arch-mips/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/9/platforms/android-13/arch-x86/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/9/platforms/android-14/arch-arm/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/9/platforms/android-14/arch-mips/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/9/platforms/android-14/arch-x86/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/9/platforms/android-15/arch-arm/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/9/platforms/android-15/arch-mips/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/9/platforms/android-15/arch-x86/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/9/platforms/android-16/arch-arm/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/9/platforms/android-16/arch-mips/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/9/platforms/android-16/arch-x86/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
| /prebuilts/ndk/9/platforms/android-17/arch-arm/usr/include/sys/ |
| queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions
[all...] |
