org.freedesktop.dbus.DBusMap< K, V > クラステンプレート

org.freedesktop.dbus.DBusMap< K, V > の継承関係図

org.freedesktop.dbus.DBusMap< K, V > 連携図

クラス
class	Entry

公開メンバ関数
	DBusMap (Object[][] entries)
void	clear ()
boolean	containsKey (Object key)
boolean	containsValue (Object value)
Set< Map.Entry< K, V > >	entrySet ()
V	get (Object key)
boolean	isEmpty ()
Set< K >	keySet ()
V	put (K key, V value)
void	putAll (Map<? extends K, ? extends V > t)
V	remove (Object key)
int	size ()
Collection< V >	values ()
int	hashCode ()
boolean	equals (Object o)
String	toString ()

変数
Object [][]	entries

詳解

構築子と解体子

DBusMap()

org.freedesktop.dbus.DBusMap< K, V >.DBusMap ( Object  entries[][] )

inline

                                       {
        this.entries = entries;
    }

関数詳解

clear()

void org.freedesktop.dbus.DBusMap< K, V >.clear ( )

inline

                        {
        throw new UnsupportedOperationException();
    }

containsKey()

boolean org.freedesktop.dbus.DBusMap< K, V >.containsKey ( Object  key )

inline

                                           {
        for (int i = 0; i < entries.length; i++)
            if (key == entries[i][0] || (key != null && key.equals(entries[i][0])))
                return true;
        return false;
    }

containsValue()

boolean org.freedesktop.dbus.DBusMap< K, V >.containsValue ( Object  value )

inline

                                               {
        for (int i = 0; i < entries.length; i++)
            if (value == entries[i][1] || (value != null && value.equals(entries[i][1])))
                return true;
        return false;
    }

entrySet()

Set<Map.Entry<K, V> > org.freedesktop.dbus.DBusMap< K, V >.entrySet ( )

inline

                                           {
        Set<Map.Entry<K, V>> s = new TreeSet<Map.Entry<K, V>>();
        for (int i = 0; i < entries.length; i++)
            s.add(new Entry(i));
        return s;
    }

equals()

boolean org.freedesktop.dbus.DBusMap< K, V >.equals ( Object  o )

inline

                                    {
        if (null == o) return false;
        if (!(o instanceof Map)) return false;
        return ((Map<K, V>) o).entrySet().equals(entrySet());
    }

get()

V org.freedesktop.dbus.DBusMap< K, V >.get ( Object  key )

inline

                             {
        for (int i = 0; i < entries.length; i++)
            if (key == entries[i][0] || (key != null && key.equals(entries[i][0])))
                return (V) entries[i][1];
        return null;
    }

hashCode()

int org.freedesktop.dbus.DBusMap< K, V >.hashCode ( )

inline

                          {
        return Arrays.deepHashCode(entries);
    }

isEmpty()

boolean org.freedesktop.dbus.DBusMap< K, V >.isEmpty ( )

inline

                             {
        return entries.length == 0;
    }

keySet()

Set<K> org.freedesktop.dbus.DBusMap< K, V >.keySet ( )

inline

                           {
        Set<K> s = new TreeSet<K>();
        for (Object[] entry : entries)
            s.add((K) entry[0]);
        return s;
    }

put()

V org.freedesktop.dbus.DBusMap< K, V >.put ( K  key, V  value  )

inline

                                 {
        throw new UnsupportedOperationException();
    }

putAll()

void org.freedesktop.dbus.DBusMap< K, V >.putAll ( Map<? extends K, ? extends V >  t )

inline

                                                        {
        throw new UnsupportedOperationException();
    }

remove()

V org.freedesktop.dbus.DBusMap< K, V >.remove ( Object  key )

inline

                                {
        throw new UnsupportedOperationException();
    }

size()

int org.freedesktop.dbus.DBusMap< K, V >.size ( )

inline

                      {
        return entries.length;
    }

toString()

String org.freedesktop.dbus.DBusMap< K, V >.toString ( )

inline

                             {
        String s = "{ ";
        for (int i = 0; i < entries.length; i++)
            s += entries[i][0] + " => " + entries[i][1] + ",";
        return s.replaceAll(".$", " }");
    }

values()

Collection<V> org.freedesktop.dbus.DBusMap< K, V >.values ( )

inline

                                  {
        List<V> l = new Vector<V>();
        for (Object[] entry : entries)
            l.add((V) entry[1]);
        return l;
    }

メンバ詳解

entries

Object [][] org.freedesktop.dbus.DBusMap< K, V >.entries

package

---

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

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