Thread overview | |||||
---|---|---|---|---|---|
|
March 31, 2016 Continuous integral range predicate | ||||
---|---|---|---|---|
| ||||
Is there a function in Phobos to check if a range of integral elements is adjacent, that is x[i+1] == x[i] + 1 where x[i] is the i:th element of the range. |
March 31, 2016 Re: Continuous integral range predicate | ||||
---|---|---|---|---|
| ||||
Posted in reply to Nordlöw | On Thursday, 31 March 2016 at 11:33:36 UTC, Nordlöw wrote: > Is there a function in Phobos to check if a range of integral elements is adjacent, that is > > x[i+1] == x[i] + 1 > > where x[i] is the i:th element of the range. (untested) std.algorithm.findAdjacent!((a, b) => a != b+1)(range).empty; |
March 31, 2016 Re: Continuous integral range predicate | ||||
---|---|---|---|---|
| ||||
Posted in reply to Rene Zwanenburg | On Thursday, 31 March 2016 at 11:41:17 UTC, Rene Zwanenburg wrote: > std.algorithm.findAdjacent!((a, b) => a != b+1)(range).empty; Correction: Should be: std.algorithm.findAdjacent!((a, b) => a+1 != b)(range).empty; Thanks! |
Copyright © 1999-2021 by the D Language Foundation