org.freedesktop.dbus.EfficientMap クラス

org.freedesktop.dbus.EfficientMap 連携図

公開メンバ関数
	EfficientMap (int initial_size)
long []	getKeys ()
void	put (long l, MethodCall m)
MethodCall	remove (long l)
boolean	contains (long l)

非公開メンバ関数
void	grow ()
void	shrink ()
int	find (long l)

非公開変数類
long []	kv
MethodCall []	vv
int	start
int	end
int	init_size

詳解

Provides a long => MethodCall map which doesn't allocate objects on insertion/removal. Keys must be inserted in ascending order.

構築子と解体子

EfficientMap()

org.freedesktop.dbus.EfficientMap.EfficientMap ( int  initial_size )

inline

                                          {
        init_size = initial_size;
        shrink();
    }

関数詳解

contains()

boolean org.freedesktop.dbus.EfficientMap.contains ( long  l )

inline

                                    {
        // check if find succeeds
        return -1 != find(l);
    }

find()

int org.freedesktop.dbus.EfficientMap.find ( long  l )

inlineprivate

                             {
        int i = start;
        while (i != end && kv[i] != l)
            if (i == (kv.length - 1)) i = 0;
            else i++;
        if (i == end) return -1;
        return i;
    }

getKeys()

long [] org.freedesktop.dbus.EfficientMap.getKeys ( )

inline

                            {
        int size;
        if (start < end) size = end - start;
        else size = kv.length - (start - end);
        long[] lv = new long[size];
        int copya;
        if (size > kv.length - start) copya = kv.length - start;
        else copya = size;
        System.arraycopy(kv, start, lv, 0, copya);
        if (copya < size) {
            System.arraycopy(kv, 0, lv, copya, size - copya);
        }
        return lv;
    }

grow()

void org.freedesktop.dbus.EfficientMap.grow ( )

inlineprivate

                        {
        // create new vectors twice as long
        long[] oldkv = kv;
        kv = new long[oldkv.length * 2];
        MethodCall[] oldvv = vv;
        vv = new MethodCall[oldvv.length * 2];

        // copy start->length to the start of the new vector
        System.arraycopy(oldkv, start, kv, 0, oldkv.length - start);
        System.arraycopy(oldvv, start, vv, 0, oldvv.length - start);
        // copy 0->end to the next part of the new vector
        if (end != (oldkv.length - 1)) {
            System.arraycopy(oldkv, 0, kv, oldkv.length - start, end + 1);
            System.arraycopy(oldvv, 0, vv, oldvv.length - start, end + 1);
        }
        // reposition pointers
        start = 0;
        end = oldkv.length;
    }

put()

void org.freedesktop.dbus.EfficientMap.put ( long  l, MethodCall  m  )

inline

                                          {
        // put this at the end
        kv[end] = l;
        vv[end] = m;
        // move the end
        if (end == (kv.length - 1)) end = 0;
        else end++;
        // if we are out of space, grow.
        if (end == start) grow();
    }

remove()

MethodCall org.freedesktop.dbus.EfficientMap.remove ( long  l )

inline

                                     {
        // find the item
        int pos = find(l);
        // if we don't have it return null
        if (-1 == pos) return null;
        // get the value
        MethodCall m = vv[pos];
        // set it as unused
        vv[pos] = null;
        kv[pos] = -1;
        // move the pointer to the first full element
        while (-1 == kv[start]) {
            if (start == (kv.length - 1)) start = 0;
            else start++;
            // if we have emptied the list, shrink it
            if (start == end) {
                shrink();
                break;
            }
        }
        return m;
    }

shrink()

void org.freedesktop.dbus.EfficientMap.shrink ( )

inlineprivate

                          {
        if (null != kv && kv.length == init_size) return;
        // reset to original size
        kv = new long[init_size];
        vv = new MethodCall[init_size];
        start = 0;
        end = 0;
    }

メンバ詳解

end

int org.freedesktop.dbus.EfficientMap.end

private

init_size

int org.freedesktop.dbus.EfficientMap.init_size

private

kv

long [] org.freedesktop.dbus.EfficientMap.kv

private

start

int org.freedesktop.dbus.EfficientMap.start

private

vv

MethodCall [] org.freedesktop.dbus.EfficientMap.vv

private

---

このクラス詳解は次のファイルから抽出されました:

• D:/AppData/doxygen/keycloak/federation/src/federation/sssd/src/main/java/org/freedesktop/dbus/EfficientMap.java