Yuta HIGUCHI

Fixing javadoc

Change-Id: I1d325ae71b9f1df7a2387a134269d3e5cad12e41
...@@ -36,6 +36,7 @@ public interface ConsistentMultimap<K, V> extends DistributedPrimitive { ...@@ -36,6 +36,7 @@ public interface ConsistentMultimap<K, V> extends DistributedPrimitive {
36 36
37 /** 37 /**
38 * Returns if this multimap contains no key-value pairs. 38 * Returns if this multimap contains no key-value pairs.
39 + *
39 * @return true if no key-value pairs exist, false otherwise 40 * @return true if no key-value pairs exist, false otherwise
40 */ 41 */
41 boolean isEmpty(); 42 boolean isEmpty();
...@@ -43,6 +44,7 @@ public interface ConsistentMultimap<K, V> extends DistributedPrimitive { ...@@ -43,6 +44,7 @@ public interface ConsistentMultimap<K, V> extends DistributedPrimitive {
43 /** 44 /**
44 * Returns true if there is at lease one key-value pair with a key equal to 45 * Returns true if there is at lease one key-value pair with a key equal to
45 * key. 46 * key.
47 + *
46 * @param key the key to query 48 * @param key the key to query
47 * @return true if the map contains a 49 * @return true if the map contains a
48 * key-value pair with key false otherwise 50 * key-value pair with key false otherwise
...@@ -52,6 +54,7 @@ public interface ConsistentMultimap<K, V> extends DistributedPrimitive { ...@@ -52,6 +54,7 @@ public interface ConsistentMultimap<K, V> extends DistributedPrimitive {
52 /** 54 /**
53 * Returns true if this map contains at lease one key-value pair with a 55 * Returns true if this map contains at lease one key-value pair with a
54 * value equal to value. 56 * value equal to value.
57 + *
55 * @param value the value to query 58 * @param value the value to query
56 * @return true if there is a key-value pair with the specified value, 59 * @return true if there is a key-value pair with the specified value,
57 * false otherwise. 60 * false otherwise.
...@@ -61,6 +64,9 @@ public interface ConsistentMultimap<K, V> extends DistributedPrimitive { ...@@ -61,6 +64,9 @@ public interface ConsistentMultimap<K, V> extends DistributedPrimitive {
61 /** 64 /**
62 * Returns true if this map contains at least one key-value pair with key 65 * Returns true if this map contains at least one key-value pair with key
63 * and value specified. 66 * and value specified.
67 + *
68 + * @param key the key to query
69 + * @param value the value to query
64 * @return true if there is a key-value pair with the specified key and 70 * @return true if there is a key-value pair with the specified key and
65 * value, false otherwise. 71 * value, false otherwise.
66 */ 72 */
...@@ -72,6 +78,7 @@ public interface ConsistentMultimap<K, V> extends DistributedPrimitive { ...@@ -72,6 +78,7 @@ public interface ConsistentMultimap<K, V> extends DistributedPrimitive {
72 * returns true, if the key-value pair already exists then behavior is 78 * returns true, if the key-value pair already exists then behavior is
73 * implementation specific with some implementations allowing duplicates 79 * implementation specific with some implementations allowing duplicates
74 * and others ignoring put requests for existing entries. 80 * and others ignoring put requests for existing entries.
81 + *
75 * @param key the key to add 82 * @param key the key to add
76 * @param value the value to add 83 * @param value the value to add
77 * @return true if the map has changed because of this call, 84 * @return true if the map has changed because of this call,
...@@ -83,6 +90,7 @@ public interface ConsistentMultimap<K, V> extends DistributedPrimitive { ...@@ -83,6 +90,7 @@ public interface ConsistentMultimap<K, V> extends DistributedPrimitive {
83 * Removes the key-value pair with the specified values if it exists. In 90 * Removes the key-value pair with the specified values if it exists. In
84 * implementations that allow duplicates which matching entry will be 91 * implementations that allow duplicates which matching entry will be
85 * removed is undefined. 92 * removed is undefined.
93 + *
86 * @param key the key of the pair to be removed 94 * @param key the key of the pair to be removed
87 * @param value the value of the pair to be removed 95 * @param value the value of the pair to be removed
88 * @return true if the map changed because of this call, false otherwise. 96 * @return true if the map changed because of this call, false otherwise.
...@@ -95,6 +103,7 @@ public interface ConsistentMultimap<K, V> extends DistributedPrimitive { ...@@ -95,6 +103,7 @@ public interface ConsistentMultimap<K, V> extends DistributedPrimitive {
95 * will remove one matching entry, which one is not defined. Equivalent to 103 * will remove one matching entry, which one is not defined. Equivalent to
96 * repeated calls to {@code remove()} for each key value pair but more 104 * repeated calls to {@code remove()} for each key value pair but more
97 * efficient. 105 * efficient.
106 + *
98 * @param key the key of the pair to be removed 107 * @param key the key of the pair to be removed
99 * @param values the set of values to be removed 108 * @param values the set of values to be removed
100 * @return true if the map changes because of this call, false otherwise. 109 * @return true if the map changes because of this call, false otherwise.
...@@ -104,6 +113,7 @@ public interface ConsistentMultimap<K, V> extends DistributedPrimitive { ...@@ -104,6 +113,7 @@ public interface ConsistentMultimap<K, V> extends DistributedPrimitive {
104 /** 113 /**
105 * Removes all values associated with the specified key as well as the key 114 * Removes all values associated with the specified key as well as the key
106 * itself. 115 * itself.
116 + *
107 * @param key the key whose key-value pairs will be removed 117 * @param key the key whose key-value pairs will be removed
108 * @return the set of values that were removed, which may be empty, if the 118 * @return the set of values that were removed, which may be empty, if the
109 * values did not exist the version will be less than one. 119 * values did not exist the version will be less than one.
...@@ -115,6 +125,7 @@ public interface ConsistentMultimap<K, V> extends DistributedPrimitive { ...@@ -115,6 +125,7 @@ public interface ConsistentMultimap<K, V> extends DistributedPrimitive {
115 * values in the iterable if each key-value pair does not already exist, 125 * values in the iterable if each key-value pair does not already exist,
116 * if the pair does exist the behavior is implementation specific. 126 * if the pair does exist the behavior is implementation specific.
117 * (Same as repeated puts but with efficiency gains.) 127 * (Same as repeated puts but with efficiency gains.)
128 + *
118 * @param key the key to use for all pairs to be added 129 * @param key the key to use for all pairs to be added
119 * @param values the set of values to be added in pairs with the key 130 * @param values the set of values to be added in pairs with the key
120 * @return true if any change in the map results from this call, 131 * @return true if any change in the map results from this call,
...@@ -126,6 +137,7 @@ public interface ConsistentMultimap<K, V> extends DistributedPrimitive { ...@@ -126,6 +137,7 @@ public interface ConsistentMultimap<K, V> extends DistributedPrimitive {
126 * Stores all the values in values associated with the key specified, 137 * Stores all the values in values associated with the key specified,
127 * removes all preexisting values and returns a collection of the removed 138 * removes all preexisting values and returns a collection of the removed
128 * values which may be empty if the entry did not exist. 139 * values which may be empty if the entry did not exist.
140 + *
129 * @param key the key for all entries to be added 141 * @param key the key for all entries to be added
130 * @param values the values to be associated with the key 142 * @param values the values to be associated with the key
131 * @return the collection of removed values, which may be empty 143 * @return the collection of removed values, which may be empty
...@@ -135,13 +147,13 @@ public interface ConsistentMultimap<K, V> extends DistributedPrimitive { ...@@ -135,13 +147,13 @@ public interface ConsistentMultimap<K, V> extends DistributedPrimitive {
135 147
136 /** 148 /**
137 * Removes all key-value pairs, after which it will be empty. 149 * Removes all key-value pairs, after which it will be empty.
138 - * @return irrelevant, simply used to determine if the call has completed
139 */ 150 */
140 void clear(); 151 void clear();
141 152
142 /** 153 /**
143 * Returns a collection of values associated with the specified key, if the 154 * Returns a collection of values associated with the specified key, if the
144 * key is not in the map it will return an empty collection. 155 * key is not in the map it will return an empty collection.
156 + *
145 * @param key the key whose associated values will be returned 157 * @param key the key whose associated values will be returned
146 * @return the collection of the values 158 * @return the collection of the values
147 * associated with the specified key, the collection may be empty 159 * associated with the specified key, the collection may be empty
...@@ -151,6 +163,7 @@ public interface ConsistentMultimap<K, V> extends DistributedPrimitive { ...@@ -151,6 +163,7 @@ public interface ConsistentMultimap<K, V> extends DistributedPrimitive {
151 /** 163 /**
152 * Returns a set of the keys contained in this multimap with one or more 164 * Returns a set of the keys contained in this multimap with one or more
153 * associated values. 165 * associated values.
166 + *
154 * @return the collection of all keys with one or more associated values, 167 * @return the collection of all keys with one or more associated values,
155 * this may be empty 168 * this may be empty
156 */ 169 */
...@@ -160,6 +173,7 @@ public interface ConsistentMultimap<K, V> extends DistributedPrimitive { ...@@ -160,6 +173,7 @@ public interface ConsistentMultimap<K, V> extends DistributedPrimitive {
160 * Returns a multiset of the keys present in this multimap with one or more 173 * Returns a multiset of the keys present in this multimap with one or more
161 * associated values each. Keys will appear once for each key-value pair 174 * associated values each. Keys will appear once for each key-value pair
162 * in which they participate. 175 * in which they participate.
176 + *
163 * @return a multiset of the keys, this may be empty 177 * @return a multiset of the keys, this may be empty
164 */ 178 */
165 Multiset<K> keys(); 179 Multiset<K> keys();
...@@ -168,12 +182,14 @@ public interface ConsistentMultimap<K, V> extends DistributedPrimitive { ...@@ -168,12 +182,14 @@ public interface ConsistentMultimap<K, V> extends DistributedPrimitive {
168 * Returns a collection of values in the set with duplicates permitted, the 182 * Returns a collection of values in the set with duplicates permitted, the
169 * size of this collection will equal the size of the map at the time of 183 * size of this collection will equal the size of the map at the time of
170 * creation. 184 * creation.
185 + *
171 * @return a collection of values, this may be empty 186 * @return a collection of values, this may be empty
172 */ 187 */
173 Multiset<V> values(); 188 Multiset<V> values();
174 189
175 /** 190 /**
176 * Returns a collection of each key-value pair in this map. 191 * Returns a collection of each key-value pair in this map.
192 + *
177 * @return a collection of all entries in the map, this may be empty 193 * @return a collection of all entries in the map, this may be empty
178 */ 194 */
179 Collection<Map.Entry<K, V>> entries(); 195 Collection<Map.Entry<K, V>> entries();
...@@ -182,6 +198,7 @@ public interface ConsistentMultimap<K, V> extends DistributedPrimitive { ...@@ -182,6 +198,7 @@ public interface ConsistentMultimap<K, V> extends DistributedPrimitive {
182 * Returns a map of keys to collections of values that reflect the set of 198 * Returns a map of keys to collections of values that reflect the set of
183 * key-value pairs contained in the multimap, where the key value pairs 199 * key-value pairs contained in the multimap, where the key value pairs
184 * would be the key paired with each of the values in the collection. 200 * would be the key paired with each of the values in the collection.
201 + *
185 * @return a map of keys to collections of values, the returned map may be 202 * @return a map of keys to collections of values, the returned map may be
186 * empty. 203 * empty.
187 */ 204 */
......