OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:LinkedList
(Results
1 - 25
of
36
) sorted by null
1
2
/system/core/libmemunreachable/
LinkedList.h
23
class
LinkedList
{
25
LinkedList
() : next_(this), prev_(this), data_() {}
26
explicit
LinkedList
(T data) :
LinkedList
() { data_ = data; }
27
~
LinkedList
() {}
28
void insert(
LinkedList
<T>& node) {
43
LinkedList
<T>* next() { return next_; }
46
LinkedList
<T>* next_;
47
LinkedList
<T>* prev_;
58
LinkedList
<T> node_
[
all
...]
/bionic/linker/
linked_list.h
77
class
LinkedList
{
82
LinkedList
() : head_(nullptr), tail_(nullptr) {}
83
~
LinkedList
() {
87
LinkedList
(
LinkedList
&& that) {
250
static
LinkedList
make_list(T* const element) {
251
LinkedList
<T, Allocator> one_element_list;
259
DISALLOW_COPY_AND_ASSIGN(
LinkedList
);
/external/libchrome/base/containers/
linked_list.h
10
// Simple
LinkedList
type. (See the Q&A section to understand how this
20
// Next, to keep track of the list's head/tail, use a
LinkedList
instance:
22
//
LinkedList
<MyNodeType> list;
24
// To add elements to the list, use any of
LinkedList
::Append,
55
// Q. Should I use std::list or base::
LinkedList
?
57
// A. The main reason to use base::
LinkedList
over std::list is
61
// Comparing the performance of base::
LinkedList
<T> to std::list<T*>:
63
// * Erasing an element of type T* from base::
LinkedList
<T> is
68
// * Insertion operations with base::
LinkedList
<T> never require
71
// Q. How does base::
LinkedList
implementation differ from std::list
[
all
...]
/external/guava/guava-tests/test/com/google/common/collect/
BenchmarkHelpers.java
88
LinkedList
{
/frameworks/native/libs/binder/
MemoryDealer.cpp
49
class
LinkedList
55
LinkedList
() : mFirst(0), mLast(0) { }
160
LinkedList
<chunk_t> mList;
/libcore/ojluni/src/main/java/java/util/
LinkedList.java
52
* List list = Collections.synchronizedList(new
LinkedList
(...));</pre>
83
public class
LinkedList
<E>
106
public
LinkedList
() {
117
public
LinkedList
(Collection<? extends E> c) {
1006
private
LinkedList
<E> superClone() {
1008
return (
LinkedList
<E>) super.clone();
1015
* Returns a shallow copy of this {@code
LinkedList
}. (The elements
1018
* @return a shallow copy of this {@code
LinkedList
} instance
1021
LinkedList
<E> clone = superClone();
[
all
...]
/libcore/jsr166-tests/src/test/java/jsr166/
CopyOnWriteArrayListTest.java
16
import java.util.
LinkedList
;
649
list.addAll(-1, new
LinkedList
());
663
list.addAll(list.size() + 1, new
LinkedList
());
LinkedListTest.java
14
import java.util.
LinkedList
;
35
private
LinkedList
<Integer> populatedQueue(int n) {
36
LinkedList
<Integer> q = new
LinkedList
<Integer>();
49
assertEquals(0, new
LinkedList
().size());
57
new
LinkedList
((Collection)null);
69
LinkedList
q = new
LinkedList
(Arrays.asList(ints));
78
LinkedList
q = new
LinkedList
();
[
all
...]
/prebuilts/misc/common/robolectric/3.1.1/lib/
backport-util-concurrent-3.1.jar
/prebuilts/tools/common/m2/repository/backport-util-concurrent/backport-util-concurrent/3.1/
backport-util-concurrent-3.1.jar
/prebuilts/misc/common/robolectric/android-all/
android-all-4.1.2_r1-robolectric-r1.jar
android-all-4.2.2_r1.2-robolectric-r1.jar
android-all-4.3_r2-robolectric-r1.jar
android-all-4.4_r1-robolectric-r2.jar
android-all-5.0.2_r3-robolectric-r0.jar
android-all-5.1.1_r9-robolectric-r2.jar
android-all-6.0.1_r3-robolectric-r1.jar
/prebuilts/sdk/10/
android.jar
/prebuilts/sdk/11/
android.jar
/prebuilts/sdk/13/
android.jar
/prebuilts/sdk/16/
android.jar
/prebuilts/sdk/20/
android.jar
/prebuilts/sdk/22/
android.jar
/prebuilts/sdk/23/
android.jar
/prebuilts/sdk/24/
android.jar
Completed in 301 milliseconds
1
2