Use lateral view [outer] explode. A lateral view first applies the UDTF to each row of base table and then joins resulting output rows to the input rows to form a virtual table having the supplied table alias. This is example from Presto migration from Hive docs: SELECT student, score FROM tests LATERAL VIEW explode(scores) … Read more
As of Rust 1.24.1, the array length basically needs to either be a numeric literal or a “regular” constant that is a usize. There’s a small amount of constant evaluation that exists today, but it’s more-or-less limited to basic math. a perfectly valid expression in other contexts, just not as a length parameter to an … Read more
This isn’t exactly intuitive, but you cannot Redim(VB6 Ref) an array if you dimmed it with dimensions. Exact quote from linked page is: The ReDim statement is used to size or resize a dynamic array that has already been formally declared using a Private, Public, or Dim statement with empty parentheses (without dimension subscripts). In … Read more
In your example a.sort is equivalent to a.sort { |x, y| x <=> y } As you know, to sort an array, you need to be able to compare its elements (if you doubt that, just try to implement any sort algorithm without using any comparison, no <, >, <= or >=). The block you … Read more
If an object you export as CSV with Export-Csv or ConvertTo-Csv has property values that contain a collection (array) of values, these values are stringified via their .ToString() method, which results in an unhelpful representation, as in the case of your array-valued .IPV4Addresses property. To demonstrate this with the ConvertTo-Csv cmdlet (which works analogously to … Read more
This is a question crying out for a canonical one, really. In the interest of answering your specific question in the absence (as far as I can tell, but I may write one eventually), I’ll answer. The argument to size must not be an unallocated allocatable variable. For your code fred is an allocatable variable. … Read more
This will work: let digits = [1,2,3,4] let intValue = digits.reduce(0, combine: {$0*10 + $1}) For Swift 4+ : let digits = [1,2,3,4] let intValue = digits.reduce(0, {$0*10 + $1}) Or this compiles in more versions of Swift: (Thanks to Romulo BM.) let digits = [1,2,3,4] let intValue = digits.reduce(0) { return $0*10 + $1 … Read more
First, you need to create your index. I suggest that you create an index on the Calibration.Presettings.Date field. You can use the following JSON object to create it: { “index”: { “fields”: [ “_id”, “Calibration.Presettings.Date.[].Type” ] }, “type”: “json” } So the selector would be like this : { “selector”: { “Calibration.Presettings.Date”: { “$elemMatch”: { … Read more
If you want a collection of unique elements, that is the Set data type. Go does not have a builtin set data type, but you can use a map to act as a set: keys in a map must be unique. For a “nice” set, use a map with bool value type (with true values) … Read more
Here is a generic function that recursively combines two composite JSON entities by concatenating arrays at the same position: # Recursively meld a and b, # concatenating arrays and # favoring b when there is a conflict def meld(a; b): a as $a | b as $b | if ($a|type) == “object” and ($b|type) == … Read more