The sorted() function takes a key= parameter newlist = sorted(list_to_be_sorted, key=lambda d: d[‘name’]) Alternatively, you can use operator.itemgetter instead of defining the function yourself from operator import itemgetter newlist = sorted(list_to_be_sorted, key=itemgetter(‘name’)) For completeness, add reverse=True to sort in descending order newlist = sorted(list_to_be_sorted, key=itemgetter(‘name’), reverse=True)
You need to create a recursive function: >>> def depth(d): … if isinstance(d, dict): … return 1 + (max(map(depth, d.values())) if d else 0) … return 0 … >>> d = {‘a’:1, ‘b’: {‘c’:{}}} >>> depth(d) 3
Now let’s try some Java 8 code: static public Map<String, Integer> toMap(List<String> lst) { return lst.stream() .collect(HashMap<String, Integer>::new, (map, str) -> { if (!map.containsKey(str)) { map.put(str, 1); } else { map.put(str, map.get(str) + 1); } }, HashMap<String, Integer>::putAll); } static public Map<String, Integer> toMap(List<String> lst) { return lst.stream().collect(Collectors.groupingBy(s -> s, Collectors.counting())); } I think this … Read more
I had at one time downloaded a wiktionary dump, trying to gather together words and definitions for slavic languages. I approached it using elementtree to go thru the xml file that is the dump. I would avoid trying to scrape or crawl the site, and just download the xml dump that wikimedia provides for wiktionary. … Read more
You can always pass a dictionary as an argument to a function. For instance, dict = {‘a’:1, ‘b’:2} def myFunc(a=0, b=0, c=0): print(a,b,c) myFunc(**dict)
This would work: random.choice([k for k in d for x in d[k]])
You need to get a list of all the keys, loop over them and add them to your map as shown in the example below: String s = “{menu:{\”1\”:\”sql\”, \”2\”:\”android\”, \”3\”:\”mvc\”}}”; JSONObject jObject = new JSONObject(s); JSONObject menu = jObject.getJSONObject(“menu”); Map<String,String> map = new HashMap<String,String>(); Iterator iter = menu.keys(); while(iter.hasNext()){ String key = (String)iter.next(); String … Read more
V8 developer here. I can confirm that 2^24 is the maximum number of entries in a Map. That’s not a bug, it’s just the implementation-defined limit. The limit is determined by: The FixedArray backing store of the Map has a maximum size of 1GB (independent of the overall heap size limit) On a 64-bit system … Read more
If you want to keep the key:value in the permutations you can use: import itertools keys, values = zip(*my_dict.items()) permutations_dicts = [dict(zip(keys, v)) for v in itertools.product(*values)] this will provide you a list of dicts with the permutations: print(permutations_dicts) [{‘A’:’D’, ‘B’:’F’, ‘C’:’I’}, {‘A’:’D’, ‘B’:’F’, ‘C’:’J’}, … ] Disclaimer: not exactly what the OP was asking, … Read more
I just ran into a similar scenario (“I am interested in a fast Add and Contains and Remove”) and implemented this sucker: using System.Collections.Generic; using System.Threading; namespace BlahBlah.Utilities { public class ConcurrentHashSet<T> : IDisposable { private readonly ReaderWriterLockSlim _lock = new ReaderWriterLockSlim(LockRecursionPolicy.SupportsRecursion); private readonly HashSet<T> _hashSet = new HashSet<T>(); #region Implementation of ICollection<T> …ish public … Read more