public static class HFile.FileInfo
extends java.lang.Object
implements java.util.SortedMap<byte[],byte[]>
Modifier and Type | Field and Description |
---|---|
static byte[] |
MAX_TAGS_LEN |
Constructor and Description |
---|
FileInfo() |
Modifier and Type | Method and Description |
---|---|
HFile.FileInfo |
append(byte[] k,
byte[] v,
boolean checkPrefix)
Append the given key/value pair to the file info, optionally checking the
key prefix.
|
void |
clear() |
java.util.Comparator<? super byte[]> |
comparator() |
boolean |
containsKey(java.lang.Object key) |
boolean |
containsValue(java.lang.Object value) |
java.util.Set<java.util.Map.Entry<byte[],byte[]>> |
entrySet() |
boolean |
equals(java.lang.Object o) |
byte[] |
firstKey() |
byte[] |
get(java.lang.Object key) |
int |
hashCode() |
java.util.SortedMap<byte[],byte[]> |
headMap(byte[] toKey) |
boolean |
isEmpty() |
java.util.Set<byte[]> |
keySet() |
byte[] |
lastKey() |
byte[] |
put(byte[] key,
byte[] value) |
void |
putAll(java.util.Map<? extends byte[],? extends byte[]> m) |
byte[] |
remove(java.lang.Object key) |
int |
size() |
java.util.SortedMap<byte[],byte[]> |
subMap(byte[] fromKey,
byte[] toKey) |
java.util.SortedMap<byte[],byte[]> |
tailMap(byte[] fromKey) |
java.util.Collection<byte[]> |
values() |
public HFile.FileInfo append(byte[] k, byte[] v, boolean checkPrefix) throws java.io.IOException
k
- key to addv
- value to addcheckPrefix
- whether to check that the provided key does not start
with the reserved prefixjava.io.IOException
- if the key or value is invalidpublic void clear()
clear
in interface java.util.Map<byte[],byte[]>
public java.util.Comparator<? super byte[]> comparator()
comparator
in interface java.util.SortedMap<byte[],byte[]>
public boolean containsKey(java.lang.Object key)
containsKey
in interface java.util.Map<byte[],byte[]>
public boolean containsValue(java.lang.Object value)
containsValue
in interface java.util.Map<byte[],byte[]>
public java.util.Set<java.util.Map.Entry<byte[],byte[]>> entrySet()
entrySet
in interface java.util.Map<byte[],byte[]>
entrySet
in interface java.util.SortedMap<byte[],byte[]>
public boolean equals(java.lang.Object o)
equals
in interface java.util.Map<byte[],byte[]>
equals
in class java.lang.Object
public byte[] firstKey()
firstKey
in interface java.util.SortedMap<byte[],byte[]>
public byte[] get(java.lang.Object key)
get
in interface java.util.Map<byte[],byte[]>
public int hashCode()
hashCode
in interface java.util.Map<byte[],byte[]>
hashCode
in class java.lang.Object
public java.util.SortedMap<byte[],byte[]> headMap(byte[] toKey)
headMap
in interface java.util.SortedMap<byte[],byte[]>
public boolean isEmpty()
isEmpty
in interface java.util.Map<byte[],byte[]>
public java.util.Set<byte[]> keySet()
keySet
in interface java.util.Map<byte[],byte[]>
keySet
in interface java.util.SortedMap<byte[],byte[]>
public byte[] lastKey()
lastKey
in interface java.util.SortedMap<byte[],byte[]>
public byte[] put(byte[] key, byte[] value)
put
in interface java.util.Map<byte[],byte[]>
public void putAll(java.util.Map<? extends byte[],? extends byte[]> m)
putAll
in interface java.util.Map<byte[],byte[]>
public byte[] remove(java.lang.Object key)
remove
in interface java.util.Map<byte[],byte[]>
public int size()
size
in interface java.util.Map<byte[],byte[]>
public java.util.SortedMap<byte[],byte[]> subMap(byte[] fromKey, byte[] toKey)
subMap
in interface java.util.SortedMap<byte[],byte[]>
public java.util.SortedMap<byte[],byte[]> tailMap(byte[] fromKey)
tailMap
in interface java.util.SortedMap<byte[],byte[]>
public java.util.Collection<byte[]> values()
values
in interface java.util.Map<byte[],byte[]>
values
in interface java.util.SortedMap<byte[],byte[]>