org.freedesktop.dbus.DBusMap Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of dbus-java Show documentation
Show all versions of dbus-java Show documentation
Improved version of the DBus-Java library provided by freedesktop.org (https://dbus.freedesktop.org/doc/dbus-java/).
/*
D-Bus Java Implementation
Copyright (c) 2005-2006 Matthew Johnson
This program is free software; you can redistribute it and/or modify it
under the terms of either the GNU Lesser General Public License Version 2 or the
Academic Free Licence Version 2.1.
Full licence texts are included in the COPYING file with this program.
*/
package org.freedesktop.dbus;
import java.util.Arrays;
import java.util.Collection;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.TreeSet;
import java.util.Vector;
class DBusMap implements Map {
// CHECKSTYLE:OFF
Object[][] entries;
// CHECKSTYLE:ON
DBusMap(Object[][] _entries) {
this.entries = _entries;
}
class Entry implements Map.Entry, Comparable {
private int entry;
Entry(int i) {
this.entry = i;
}
@SuppressWarnings("unchecked")
@Override
public boolean equals(Object o) {
if (null == o) {
return false;
}
if (!(o instanceof DBusMap.Entry)) {
return false;
}
return this.entry == ((Entry) o).entry;
}
@Override
@SuppressWarnings("unchecked")
public K getKey() {
return (K) entries[entry][0];
}
@Override
@SuppressWarnings("unchecked")
public V getValue() {
return (V) entries[entry][1];
}
@Override
public int hashCode() {
return entries[entry][0].hashCode();
}
@Override
public V setValue(V value) {
throw new UnsupportedOperationException();
}
@Override
public int compareTo(Entry e) {
return entry - e.entry;
}
}
@Override
public void clear() {
throw new UnsupportedOperationException();
}
@Override
public boolean containsKey(Object key) {
for (Object[] entrie : entries) {
if (key == entrie[0] || (key != null && key.equals(entrie[0]))) {
return true;
}
}
return false;
}
@Override
public boolean containsValue(Object value) {
for (Object[] entrie : entries) {
if (value == entrie[1] || (value != null && value.equals(entrie[1]))) {
return true;
}
}
return false;
}
@Override
public Set> entrySet() {
Set> s = new TreeSet>();
for (int i = 0; i < entries.length; i++) {
s.add(new Entry(i));
}
return s;
}
@Override
@SuppressWarnings("unchecked")
public V get(Object key) {
for (Object[] entrie : entries) {
if (key == entrie[0] || (key != null && key.equals(entrie[0]))) {
return (V) entrie[1];
}
}
return null;
}
@Override
public boolean isEmpty() {
return entries.length == 0;
}
@Override
@SuppressWarnings("unchecked")
public Set keySet() {
Set s = new TreeSet();
for (Object[] entry : entries) {
s.add((K) entry[0]);
}
return s;
}
@Override
public V put(K key, V value) {
throw new UnsupportedOperationException();
}
@Override
public void putAll(Map extends K, ? extends V> t) {
throw new UnsupportedOperationException();
}
@Override
public V remove(Object key) {
throw new UnsupportedOperationException();
}
@Override
public int size() {
return entries.length;
}
@Override
@SuppressWarnings("unchecked")
public Collection values() {
List l = new Vector();
for (Object[] entry : entries) {
l.add((V) entry[1]);
}
return l;
}
@Override
public int hashCode() {
return Arrays.deepHashCode(entries);
}
@Override
@SuppressWarnings("unchecked")
public boolean equals(Object o) {
if (null == o) {
return false;
}
if (!(o instanceof Map)) {
return false;
}
return ((Map) o).entrySet().equals(entrySet());
}
@Override
public String toString() {
String s = "{ ";
for (Object[] entrie : entries) {
s += entrie[0] + " => " + entrie[1] + ",";
}
return s.replaceAll(".$", " }");
}
}