Summary: Nested Classes | Inherited Fields | Methods | Inherited Methods

PagedList

The android.arch Architecture Components packages are no longer maintained. They have been superseded by the corresponding androidx.* packages. See androidx.paging.PagedList instead.

public abstract class PagedList
extends AbstractList<T>

java.lang.Object
↳	java.util.AbstractCollection<T>
	↳	java.util.AbstractList<T>
		↳	android.arch.paging.PagedList<T>

Lazy loading list that pages in immutable content from a DataSource.

A PagedList is a List which loads its data in chunks (pages) from a DataSource. Items can be accessed with get(int), and further loading can be triggered with loadAround(int). To display a PagedList, see PagedListAdapter, which enables the binding of a PagedList to a RecyclerView.

Loading Data

All data in a PagedList is loaded from its DataSource. Creating a PagedList loads the first chunk of data from the DataSource immediately, and should for this reason be done on a background thread. The constructed PagedList may then be passed to and used on the UI thread. This is done to prevent passing a list with no loaded content to the UI thread, which should generally not be presented to the user.

A PagedList initially presents this first partial load as its content, and expands over time as content is loaded in. When loadAround(int) is called, items will be loaded in near the passed list index. If placeholder nulls are present in the list, they will be replaced as content is loaded. If not, newly loaded items will be inserted at the beginning or end of the list.

PagedList can present data for an unbounded, infinite scrolling list, or a very large but countable list. Use PagedList.Config to control how many items a PagedList loads, and when.

If you use LivePagedListBuilder to get a LiveData<PagedList>, it will initialize PagedLists on a background thread for you.

Placeholders

There are two ways that PagedList can represent its not-yet-loaded data - with or without null placeholders.

With placeholders, the PagedList is always the full size of the data set. get(N) returns the Nth item in the data set, or null if its not yet loaded.

Without null placeholders, the PagedList is the sublist of data that has already been loaded. The size of the PagedList is the number of currently loaded items, and get(N) returns the Nth loaded item. This is not necessarily the Nth item in the data set.

Placeholders have several benefits:

They express the full sized list to the presentation layer (often a PagedListAdapter), and so can support scrollbars (without jumping as pages are loaded) and fast-scrolling to any position, whether loaded or not.
They avoid the need for a loading spinner at the end of the loaded list, since the list is always full sized.

They also have drawbacks:

Your Adapter (or other presentation mechanism) needs to account for null items. This often means providing default values in data you bind to a RecyclerView.ViewHolder.
They don't work well if your item views are of different sizes, as this will prevent loading items from cross-fading nicely.
They require you to count your data set, which can be expensive or impossible, depending on where your data comes from.

Placeholders are enabled by default, but can be disabled in two ways. They are disabled if the DataSource does not count its data set in its initial load, or if false is passed to setEnablePlaceholders(boolean) when building a PagedList.Config.

Mutability and Snapshots

A PagedList is mutable while loading, or ready to load from its DataSource. As loads succeed, a mutable PagedList will be updated via Runnables on the main thread. You can listen to these updates with a PagedList.Callback. (Note that PagedListAdapter will listen to these to signal RecyclerView about the updates/changes).

If a PagedList attempts to load from an invalid DataSource, it will detach() from the DataSource, meaning that it will no longer attempt to load data. It will return true from isImmutable(), and a new DataSource / PagedList pair must be created to load further data. See DataSource and LivePagedListBuilder for how new PagedLists are created to represent changed data.

A PagedList snapshot is simply an immutable shallow copy of the current state of the PagedList as a List. It will reference the same inner items, and contain the same null placeholders, if present.

Summary

Nested classes
`class`	`PagedList.BoundaryCallback<T>` Signals when a PagedList has reached the end of available data.
`class`	`PagedList.Builder<Key, Value>` Builder class for PagedList.
`class`	`PagedList.Callback` Callback signaling when content is loaded into the list.
`class`	`PagedList.Config` Configures how a PagedList loads content from its DataSource.

Inherited fields

From class java.util.AbstractList


    protected
    
    
    int

modCount

Public methods
`void`	`addWeakCallback(List<T> previousSnapshot, PagedList.Callback callback)` Adds a callback, and issues updates since the previousSnapshot was created.
`void`	`detach()` Detach the PagedList from its DataSource, and attempt to load no more data.
`T`	`get(int index)` Get the item in the list of loaded items at the provided index.
`PagedList.Config`	`getConfig()` Return the Config used to construct this PagedList.
`abstract DataSource<?, T>`	`getDataSource()` Return the DataSource that provides data to this PagedList.
`abstract Object`	`getLastKey()` Return the key for the position passed most recently to `loadAround(int)`.
`int`	`getPositionOffset()` Position offset of the data in the list.
`boolean`	`isDetached()` True if the PagedList has detached the DataSource it was loading from, and will no longer load new data.
`boolean`	`isImmutable()` Returns whether the list is immutable.
`void`	`loadAround(int index)` Load adjacent items to passed index.
`void`	`removeWeakCallback(PagedList.Callback callback)` Removes a previously added callback.
`int`	`size()` Returns size of the list, including any not-yet-loaded null padding.
`List<T>`	`snapshot()` Returns an immutable snapshot of the PagedList in its current state.

Inherited methods

From class


        
          java.util.AbstractList

`void`	`add(int arg0, T arg1)`
`boolean`	`add(T arg0)`
`boolean`	`addAll(int arg0, Collection<? extends E> arg1)`
`void`	`clear()`
`boolean`	`equals(Object arg0)`
`abstract T`	`get(int arg0)`
`int`	`hashCode()`
`int`	`indexOf(Object arg0)`
`Iterator<T>`	`iterator()`
`int`	`lastIndexOf(Object arg0)`
`ListIterator<T>`	`listIterator(int arg0)`
`ListIterator<T>`	`listIterator()`
`T`	`remove(int arg0)`
`void`	`removeRange(int arg0, int arg1)`
`T`	`set(int arg0, T arg1)`
`List<T>`	`subList(int arg0, int arg1)`

From class


        
          java.util.AbstractCollection

`boolean`	`add(T arg0)`
`boolean`	`addAll(Collection<? extends E> arg0)`
`void`	`clear()`
`boolean`	`contains(Object arg0)`
`boolean`	`containsAll(Collection<?> arg0)`
`boolean`	`isEmpty()`
`abstract Iterator<T>`	`iterator()`
`boolean`	`remove(Object arg0)`
`boolean`	`removeAll(Collection<?> arg0)`
`boolean`	`retainAll(Collection<?> arg0)`
`abstract int`	`size()`
`<T> T[]`	`toArray(T[] arg0)`
`Object[]`	`toArray()`
`String`	`toString()`

From class


        
          java.lang.Object

`Object`	`clone()`
`boolean`	`equals(Object arg0)`
`void`	`finalize()`
`final Class<?>`	`getClass()`
`int`	`hashCode()`
`final void`	`notify()`
`final void`	`notifyAll()`
`String`	`toString()`
`final void`	`wait(long arg0, int arg1)`
`final void`	`wait(long arg0)`
`final void`	`wait()`

From interface


        
          java.util.List

`abstract boolean`	`add(T arg0)`
`abstract void`	`add(int arg0, T arg1)`
`abstract boolean`	`addAll(Collection<? extends E> arg0)`
`abstract boolean`	`addAll(int arg0, Collection<? extends E> arg1)`
`abstract void`	`clear()`
`abstract boolean`	`contains(Object arg0)`
`abstract boolean`	`containsAll(Collection<?> arg0)`
`abstract boolean`	`equals(Object arg0)`
`abstract T`	`get(int arg0)`
`abstract int`	`hashCode()`
`abstract int`	`indexOf(Object arg0)`
`abstract boolean`	`isEmpty()`
`abstract Iterator<T>`	`iterator()`
`abstract int`	`lastIndexOf(Object arg0)`
`abstract ListIterator<T>`	`listIterator(int arg0)`
`abstract ListIterator<T>`	`listIterator()`
`abstract T`	`remove(int arg0)`
`abstract boolean`	`remove(Object arg0)`
`abstract boolean`	`removeAll(Collection<?> arg0)`
`default void`	`replaceAll(UnaryOperator<T> arg0)`
`abstract boolean`	`retainAll(Collection<?> arg0)`
`abstract T`	`set(int arg0, T arg1)`
`abstract int`	`size()`
`default void`	`sort(Comparator<? super E> arg0)`
`default Spliterator<T>`	`spliterator()`
`abstract List<T>`	`subList(int arg0, int arg1)`
`abstract Object[]`	`toArray()`
`abstract <T> T[]`	`toArray(T[] arg0)`

From interface


        
          java.util.Collection

`abstract boolean`	`add(T arg0)`
`abstract boolean`	`addAll(Collection<? extends E> arg0)`
`abstract void`	`clear()`
`abstract boolean`	`contains(Object arg0)`
`abstract boolean`	`containsAll(Collection<?> arg0)`
`abstract boolean`	`equals(Object arg0)`
`abstract int`	`hashCode()`
`abstract boolean`	`isEmpty()`
`abstract Iterator<T>`	`iterator()`
`default Stream<T>`	`parallelStream()`
`abstract boolean`	`remove(Object arg0)`
`abstract boolean`	`removeAll(Collection<?> arg0)`
`default boolean`	`removeIf(Predicate<? super E> arg0)`
`abstract boolean`	`retainAll(Collection<?> arg0)`
`abstract int`	`size()`
`default Spliterator<T>`	`spliterator()`
`default Stream<T>`	`stream()`
`abstract <T> T[]`	`toArray(T[] arg0)`
`abstract Object[]`	`toArray()`

From interface


        
          java.lang.Iterable

`default void`	`forEach(Consumer<? super T> arg0)`
`abstract Iterator<T>`	`iterator()`
`default Spliterator<T>`	`spliterator()`

Public methods

addWeakCallback

void addWeakCallback (List<T> previousSnapshot, 
                PagedList.Callback callback)

Adds a callback, and issues updates since the previousSnapshot was created.

If previousSnapshot is passed, the callback will also immediately be dispatched any differences between the previous snapshot, and the current state. For example, if the previousSnapshot was of 5 nulls, 10 items, 5 nulls, and the current state was 5 nulls, 12 items, 3 nulls, the callback would immediately receive a call of onChanged(14, 2).

This allows an observer that's currently presenting a snapshot to catch up to the most recent version, including any changes that may have been made.

The callback is internally held as weak reference, so PagedList doesn't hold a strong reference to its observer, such as a PagedListAdapter. If an adapter were held with a strong reference, it would be necessary to clear its PagedList observer before it could be GC'd.

Parameters
`previousSnapshot`	`List`: Snapshot previously captured from this List, or null.
`callback`	`PagedList.Callback`: Callback to dispatch to.

See also:

removeWeakCallback(Callback)

detach

void detach ()

Detach the PagedList from its DataSource, and attempt to load no more data.

This is called automatically when a DataSource load returns null, which is a signal to stop loading. The PagedList will continue to present existing data, but will not initiate new loads.

get

T get (int index)

Get the item in the list of loaded items at the provided index.

Parameters
`index`	`int`: Index in the loaded item list. Must be >= 0, and < `size()`

Returns
`T`	The item at the passed index, or null if a null placeholder is at the specified position.

See also:

size()

getConfig

PagedList.Config getConfig ()

Return the Config used to construct this PagedList.

Returns
`PagedList.Config`	the Config of this PagedList

getDataSource

DataSource<?, T> getDataSource ()

Return the DataSource that provides data to this PagedList.

Returns
`DataSource<?, T>`	the DataSource of this PagedList.

getLastKey

Object getLastKey ()

Return the key for the position passed most recently to loadAround(int).

When a PagedList is invalidated, you can pass the key returned by this function to initialize the next PagedList. This ensures (depending on load times) that the next PagedList that arrives will have data that overlaps. If you use LivePagedListBuilder, it will do this for you.

Returns
`Object`	Key of position most recently passed to `loadAround(int)`.

getPositionOffset

int getPositionOffset ()

Position offset of the data in the list.

If data is supplied by a PositionalDataSource, the item returned from get(i) has a position of i + getPositionOffset().

If the DataSource is a ItemKeyedDataSource or PageKeyedDataSource, it doesn't use positions, returns 0.

Returns
`int`

isDetached

boolean isDetached ()

True if the PagedList has detached the DataSource it was loading from, and will no longer load new data.

A detached list is immutable.

Returns
`boolean`	True if the data source is detached.

isImmutable

boolean isImmutable ()

Returns whether the list is immutable. Immutable lists may not become mutable again, and may safely be accessed from any thread.

In the future, this method may return true when a PagedList has completed loading from its DataSource. Currently, it is equivalent to isDetached().

Returns
`boolean`	True if the PagedList is immutable.

loadAround

void loadAround (int index)

Load adjacent items to passed index.

Parameters
`index`	`int`: Index at which to load.

removeWeakCallback

void removeWeakCallback (PagedList.Callback callback)

Removes a previously added callback.

Parameters
`callback`	`PagedList.Callback`: Callback, previously added.

See also:

addWeakCallback(List, Callback)

size

int size ()

Returns size of the list, including any not-yet-loaded null padding.

Returns
`int`	Current total size of the list.

snapshot

List<T> snapshot ()

Returns an immutable snapshot of the PagedList in its current state. If this PagedList is immutable due to its DataSource being invalid, it will be returned.

Returns
`List<T>`	Immutable snapshot of PagedList data.

PagedList

Loading Data

Placeholders

Mutability and Snapshots

Summary

Nested classes

Inherited fields

Public methods

Inherited methods

Public methods

addWeakCallback

detach

get

getConfig

getDataSource

getLastKey

getPositionOffset

isDetached

isImmutable

loadAround

removeWeakCallback

size

snapshot

Interfaces

Classes