| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/licenses/mpfr-3.1.1/ |
| COPYING.LESSER | 29 with which the Combined Work was made is also called the "Linked
35 based on the Application, and not on the Linked Version.
105 the Linked Version to produce a modified Combined Work, in the
113 of the Library that is interface-compatible with the Linked
121 Application with a modified version of the Linked Version. (If
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/share/doc/mpfr/ |
| COPYING.LESSER | 29 with which the Combined Work was made is also called the "Linked
35 based on the Application, and not on the Linked Version.
105 the Linked Version to produce a modified Combined Work, in the
113 of the Library that is interface-compatible with the Linked
121 Application with a modified version of the Linked Version. (If
|
| /bionic/libc/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...] |
| /development/ndk/platforms/android-3/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...] |
| /development/ndk/platforms/android-L/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/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/sysroot/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/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/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/4/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/4/platforms/android-8/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/5/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/6/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/6/platforms/android-3/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/7/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/7/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/7/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/7/platforms/android-3/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/7/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/7/platforms/android-4/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/7/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/7/platforms/android-5/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/7/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/7/platforms/android-8/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/7/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/7/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/8/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...] |
