Probably you read about the usage of sorttype as a function in Tony’s answer to my thread http://www.trirand.com/blog/?page_id=393/help/custom-local-sort-with-respect-of-the-function-as-index/. Your problem could be very easy solved. My suggestion to use index as a function for custom sorting of local jqGrid data work fine in the version 3.7.1, but not more in the version 3.7.2 of jqGrid. … Read more
You mean something like this? quicksort [] = [] quicksort (x:xs) = quicksort less ++ (x : equal) ++ quicksort more where (less, equal, more) = partition3 x xs partition3 _ [] = ([], [], []) partition3 x (y:ys) = case compare y x of LT -> (y:less, equal, more) EQ -> (less, y:equal, more) … Read more
It seems to be missing the Apply. Can you Add MyWorksheet.Sort.Apply The custom order you have is working as is in my sample. EDIT Updated based on OP updated question Edit the macro to the following – using an array for the OrderCustom parameter. Dim oWorksheet As Worksheet Set oWorksheet = ActiveWorkbook.Worksheets(“Sheet1”) Dim oRangeSort As … Read more
You seem to misunderstand something. What you have here is a associative array. Associative arrays have no explicit order on them, e.g. it’s only the internal representation (usually sorted) that orders them. In short — in Lua, both of the arrays you posted are the same. What you would want instead, is such a representation: … Read more
Prior to 2015, the Internet Movie Database (IMDb) publicly listed the formula used to rank their Top 250 movies list. To quote: The formula for calculating the Top Rated 250 Titles gives a true Bayesian estimate: weighted rating (WR) = (v ÷ (v+m)) × R + (m ÷ (v+m)) × C where: R = average … Read more
First of all shuffling is the process of transfering data from the mappers to the reducers, so I think it is obvious that it is necessary for the reducers, since otherwise, they wouldn’t be able to have any input (or input from every mapper). Shuffling can start even before the map phase has finished, to … Read more
The true quicksort has two beautiful aspects: Divide and conquer: break the problem into two smaller problems. Partition the elements in-place. The short Haskell example demonstrates (1), but not (2). How (2) is done may not be obvious if you don’t already know the technique!
what about this one x[order(match(x,y))]
Natural ordering is a kind of alphanumerical sort which seems natural to humans. In a classical alphanumerical sort we will have something like : 1 10 11 12 2 20 21 3 4 5 6 7 If you’re using Natural ordering, it will be : 1 2 3 4 5 6 7 10 11 12 … Read more
I can think of 2 possibilities, one of which is suggested already by @JaredHoberock. I don’t know of a general methodology to fuse for-loop iterations in thrust, but the second method is the more general approach. My guess is that the first method would be the faster of the two approaches, in this case. Use … Read more