com.baidu.brpc.client

类 FastFutureStore

java.lang.Object

com.baidu.brpc.client.FastFutureStore

public class FastFutureStore
extends Object

A lock-free datastructure faster than #ConcurrentHashMap in certain circumstance. When the underlying array runs out of space, FastFutureStore will downgrade to #ConcurrentHashMap

Created by wanghongfei on 2018/11/19.

嵌套类概要

嵌套类

限定符和类型	类和说明
static interface	FastFutureStore.StoreWalker

构造器概要

构造器

构造器和说明
FastFutureStore(int cap)

方法概要

限定符和类型	方法和说明
RpcFuture	get(long id) Retrieve object identified by id
RpcFuture	getAndRemove(long id) Retrieve and remove object identified by id
static FastFutureStore	getInstance(int cap) Obtain singleton object
long	put(RpcFuture fut) Add an object.
int	size() Return the count of the objects.
void	traverse(FastFutureStore.StoreWalker walker) Traverse and invoke #FastFutureStore.StoreWalker on every element.

从类继承的方法 java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

构造器详细资料

FastFutureStore

public FastFutureStore(int cap)

参数:

cap - capacity of the internal array

方法详细资料

getInstance

public static FastFutureStore getInstance(int cap)

Obtain singleton object

参数:

cap - Capacity of the internal array

返回:

The singleton instance.

put

public long put(RpcFuture fut)

Add an object.

返回:

Identifier of the added object

get

public RpcFuture get(long id)

Retrieve object identified by id

参数:

id - Identifier returned by #put(RpcFuture)

getAndRemove

public RpcFuture getAndRemove(long id)

Retrieve and remove object identified by id

参数:

id - Identifier returned by #put(RpcFuture)

返回:

null if nothing found

size

public int size()

Return the count of the objects.

traverse

public void traverse(FastFutureStore.StoreWalker walker)

Traverse and invoke #FastFutureStore.StoreWalker on every element.

参数:

walker - Define the action needed to be performed for elements