mirror of
https://github.com/cincheo/jsweet.git
synced 2025-12-15 15:29:22 +00:00
11c00b0a57
This patch ignores any arguments that isn't of Map type during the invocation of a Map collection. Based on the supported data-structures, these non-Map arguments can either be of type int (capacity, loadFactor) or Comparator. The use case for the latter is not currently supported while the former have no equivalent in javascript. Fixes #508
142 lines
3.0 KiB
Java
142 lines
3.0 KiB
Java
package source.nativestructures;
|
|
|
|
import static jsweet.util.Lang.$export;
|
|
|
|
import java.util.Arrays;
|
|
import java.util.Collections;
|
|
import java.util.Comparator;
|
|
import java.util.HashMap;
|
|
import java.util.Map;
|
|
import java.util.Map.Entry;
|
|
import java.util.TreeMap;
|
|
|
|
import def.js.Array;
|
|
|
|
/**
|
|
* This test is executed without any Java runtime.
|
|
*/
|
|
public class Maps {
|
|
|
|
static Array<String> trace = new Array<>();
|
|
|
|
static String key1() {
|
|
return "1";
|
|
}
|
|
|
|
static String key2() {
|
|
return "a";
|
|
}
|
|
|
|
public static void main(String[] args) {
|
|
HashMap<String, String> m = new HashMap<>();
|
|
|
|
m.put(key1(), "a");
|
|
m.put("2", "b");
|
|
|
|
for(Entry<String, String> e : m.entrySet()) {
|
|
trace.push("" + e.getKey());
|
|
trace.push("" + e.getValue());
|
|
}
|
|
|
|
trace.push("" + m.size());
|
|
trace.push(m.get("1"));
|
|
|
|
trace.push("" + m.containsKey("2"));
|
|
|
|
trace.push(m.keySet().toString());
|
|
|
|
trace.push("" + m.values());
|
|
|
|
Map<String, String> m2 = (Map) m.clone();
|
|
|
|
String removed = m.remove("1");
|
|
|
|
trace.push(removed);
|
|
trace.push("" + m.size());
|
|
trace.push("" + (m.get("1") == null));
|
|
|
|
trace.push("size2=" + m2.size());
|
|
|
|
trace.push(Collections.singletonMap(key2(), "1").get("a"));
|
|
trace.push(Collections.singletonMap("b", "2").get("b"));
|
|
|
|
m.clear();
|
|
trace.push(m.values().toString());
|
|
trace.push("empty=" + m.isEmpty());
|
|
|
|
trace.push("-" + m.get("undefinedKey") + "-");
|
|
|
|
Map<String, String> tm = new TreeMap<>();
|
|
|
|
tm.put(key1(), "a");
|
|
tm.put("2", "b");
|
|
|
|
for(Entry<String, String> e : tm.entrySet()) {
|
|
trace.push("" + e.getKey());
|
|
trace.push("" + e.getValue());
|
|
}
|
|
|
|
Map<String, Integer> m3 = new HashMap<>();
|
|
m3.put("a", 1);
|
|
assert m3.size() == 1;
|
|
m3.remove("a");
|
|
assert m3.size() == 0;
|
|
m3.put("b", 2);
|
|
m3.remove("a");
|
|
assert m3.size() == 1;
|
|
|
|
m3.put("c", 0);
|
|
assert m3.get("c") == 0;
|
|
|
|
Map<Integer, Integer> m4 = new HashMap<>();
|
|
m4.put(1, 1);
|
|
assert m4.size() == 1;
|
|
m4.remove(1);
|
|
assert m4.size() == 0;
|
|
m4.put(2, 2);
|
|
m4.remove(1);
|
|
assert m4.size() == 1;
|
|
|
|
Map<String, Integer> m5 = new HashMap<>();
|
|
m5.put("a", 1);
|
|
m5.put("b", 2);
|
|
assert m5.size() == 2;
|
|
Map<String, Integer> m6 = new HashMap<>(m5);
|
|
assert m6.size() == 2;
|
|
assert m6.containsKey("a");
|
|
m6.put("c", 3);
|
|
assert m6.containsKey("c");
|
|
assert m5.containsKey("a");
|
|
assert !m5.containsKey("c");
|
|
|
|
Map<Integer, Integer> m7 = new HashMap<>();
|
|
m7.put(1, 1);
|
|
m7.put(2, 2);
|
|
assert m7.size() == 2;
|
|
Map<Integer, Integer> m8 = new HashMap<>(m7);
|
|
assert m8.size() == 2;
|
|
assert m8.containsKey(1);
|
|
m8.put(3, 3);
|
|
assert m8.containsKey(3);
|
|
assert m7.containsKey(1);
|
|
assert !m7.containsKey(3);
|
|
|
|
for (Map<String, Integer> map : Arrays.<Map<String, Integer>>asList(
|
|
new HashMap<>(10),
|
|
new HashMap<>(10, 11),
|
|
new TreeMap<>(Comparator.comparingInt(String::hashCode))
|
|
)) {
|
|
map.put("a", 1);
|
|
map.put("b", 2);
|
|
assert map.size() == 2;
|
|
assert map.get("a") == 1;
|
|
assert map.get("b") == 2;
|
|
assert map.get("c") == null;
|
|
}
|
|
|
|
$export("trace", trace.join(","));
|
|
|
|
}
|
|
|
|
}
|