Current IDEA versions load dictionaries in UTF-8, you don’t need to convert them to the platform encoding, ignore the iconv step below. The dictionary can be produced using aspell for Unix/Mac OS X or under Cygwin. You need to have aspell and appropriate dictionary installed. Here is the example for Russian dictionary I’ve used: aspell … Read more
Overview of inputs input_0.mp4 has the desired video stream and input_1.mp4 has the desired audio stream: In ffmpeg the streams look like this: $ ffmpeg -i input_0.mp4 -i input_1.mp4 Input #0, mov,mp4,m4a,3gp,3g2,mj2, from ‘input_0.mp4’: Duration: 00:01:48.50, start: 0.000000, bitrate: 4144 kb/s Stream #0:0(und): Video: h264 (High) (avc1 / 0x31637661), yuv420p, 1280×720, 4014 kb/s, SAR 115:87 … Read more
You are not copying the map, but the reference to the map. Your delete thus modifies the values in both your original map and the super map. To copy a map, you have to use a for loop like this: for k,v := range originalMap { newMap[k] = v } Here’s an example from the … Read more
Use subscripting to access the value for a dictionary key. This will return an Optional: let apple: String? = companies[“AAPL”] or if let apple = companies[“AAPL”] { // … } You can also enumerate over all of the keys and values: var companies = [“AAPL” : “Apple Inc”, “GOOG” : “Google Inc”, “AMZN” : “Amazon.com, … Read more
There is no built in way, nor any method in the standard packages to do such a merge. The idomatic way is to simply iterate: for k, v := range b { a[k] = v }
As an addition to jimt’s post: You may also use append rather than explicitly assigning the values to their indices: m := make(map[int]string) m[1] = “a” m[2] = “b” m[3] = “c” m[4] = “d” v := make([]string, 0, len(m)) for _, value := range m { v = append(v, value) } Note that the … Read more
The Gutenberg Project hosts Webster’s Unabridged English Dictionary plus many other public domain literary works. Actually it looks like they’ve got several versions of the dictionary hosted with copyright from different years. The one I linked has a 2009 copyright. You may want to poke around the site and investigate the different versions of Webster’s … Read more
I like your reduce version just fine. I think it’s idiomatic. Here’s a version using list comprehension anyways. (defn foo [m f] (into {} (for [[k v] m] [k (f v)])))
This is safe! You can also find a similar sample in Effective Go: for key := range m { if key.expired() { delete(m, key) } } And the language specification: The iteration order over maps is not specified and is not guaranteed to be the same from one iteration to the next. If map entries … Read more
You can define += operator for Dictionary, e.g., func += <K, V> (left: inout [K:V], right: [K:V]) { for (k, v) in right { left[k] = v } }