Go sorts slice correctly, but doesn't sort array
I'm puzzled as why this code doesn't work: package main import ( "fmt" "sort" ) type T [2]int func (t T) Len() int { return len(t) } func (t T) Swap(i, j int) { t[i], t[j] = t[j], t[i] } func (t T) Less(i, j int) bool { return t[i] < t[j] } func main() { var x = [2]int{1, 0} fmt.Println(x) sort.Sort(T(x)) fmt.Println(x) } It outputs (incorrectly): [1 0] [1 0] Changing the type of T to slices does
Checking the equality of two slices
You should use reflect.DeepEqual() DeepEqual is a recursive relaxation of Go's == operator. DeepEqual reports whether x and y are “deeply equal,” defined as follows. Two values of identical type are deeply equal if one of the following cases applies. Values of distinct types are never deeply equal. Array values are deeply equal when their corresponding elements are deeply equal. Struct values are
What are "top level JSON arrays" and why are they a security risk?
In the video below, at time marker 21:40, the Microsoft PDC presenter says it's important that all JSON be wrapped so it's not a top level array: https://channel9.msdn.com/Events/PDC/PDC09/FT12 What is the risk of an unwrapped top level array? How should I check and see if I'm vulnerable? I purchase many components from 3rd parties and have external vendors who develop my code.
Short circuit Array.forEach like calling break
[1,2,3].forEach(function(el) { if(el === 1) break; }); How can I do this using the new forEach method in JavaScript? I've tried return;, return false; and break. break crashes and return does nothing but continue iteration.
How to merge YAML arrays?
I would like to merge arrays in YAML, and load them via ruby - some_stuff: &some_stuff - a - b - c combined_stuff: <<: *some_stuff - d - e - f I'd like to have the combined array as [a,b,c,d,e,f] I receive the error: did not find expected key while parsing a block mapping How do I merge arrays in YAML?
Why is sum so much faster than inject(:+)?
Short answer For an integer range : Enumerable#sum returns (range.max-range.min+1)*(range.max+range.min)/2 Enumerable#inject(:+) iterates over every element. Theory The sum of integers between 1 and n is called a triangular number, and is equal to n*(n+1)/2. The sum of integers between n and m is the triangular number of m minus the triangular number of n-1, which is equal to m*(m+1)/2-n*(n-1)/2,
How to determine if one array contains all elements of another array
Given: a1 = [5, 1, 6, 14, 2, 8] I would like to determine if it contains all elements of: a2 = [2, 6, 15] In this case the result is false. Are there any built-in Ruby/Rails methods to identify such array inclusion? One way to implement this is: a2.index{ |x| !a1.include?(x) }.nil? Is there a better, more readable, way?
Merge/flatten an array of arrays
I have a JavaScript array like: [["$6"], ["$12"], ["$25"], ["$25"], ["$18"], ["$22"], ["$10"]] How would I go about merging the separate inner arrays into one like: ["$6", "$12", "$25", ...]
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
Ruby string/array combinations preserving order
How do I reverse an array in Go?
Getting the indexes of duplicate elements in arrays (Ruby)
Javascript - insert an array inside another array
Javascript: How to clear undefined values from an array
ruby sort array of an array
"RangeError: Maximum call stack size exceeded" Why?
How do I get the last 5 elements, excluding the first element from an array?
How to split a string into an array in Bash?
How do I remove an array item in TypeScript?
Are there ruby equivalents to car, cdr, and cons?
Ruby Logical Operators - Elements in one but not both arrays