Be concise.
Be useful.
All contributions dictatorially edited by webmasters to match personal tastes.
Please do not paste any copyright violating resource.
Please try to avoid dependencies to third-party libraries and frameworks.
(shuffle collection)
var shuffled = x.toList()..shuffle();
x.shuffle();
y = Enum.shuffle x
[Y||{_,Y} <- lists:sort([ {rand:uniform(), N} || N <- X])].
module M_shuffle contains function scramble( number_of_values ) result(array) integer,intent(in) :: number_of_values integer,allocatable :: array(:) array=[(i,i=1,number_of_values)] n=1; m=number_of_values do k=1,2 do i=1,m call random_number(u) j = n + FLOOR((m+1-n)*u) itemp=array(j); array(j)=array(i); array(i)=itemp enddo enddo end function scramble end module M_shuffle : use M_shuffle, only : scramble newlist=list(scramble(size(list))
x.shuffle()
shuffle x = if length x < 2 then return x else do i <- System.Random.randomRIO (0, length(x)-1) r <- shuffle (take i x ++ drop (i+1) x) return (x!!i : r)
for (var i = x.length - 1; i > 0; i--) { var j = Math.floor(Math.random() * (i + 1)); var temp = x[j]; x[j] = x[i]; x[i] = temp; }
mutableList.shuffle()
val newList = list.shuffled()
function(list) for i = #list, 2, -1 do local j = math.random(i) list[i], list[j] = list[j], list[i] end end
shuffled = {} for i, v in ipairs(x) do local pos = math.random(1, #shuffled+1) table.insert(shuffled, pos, v) end
shuffle($x);
var Iter,rr: integer; [...] for Iter := 0 to high(List) do begin rr := random(high(List))+1; tmp := List[Iter]; List[Iter] := List[rr]; List[rr] := tmp; end;
x.shuffle
shuffled_list = x.shuffle
(shuffle x)
(define shuffle (lambda (list) (if (< (length list) 2) list (let ((item (list-ref list (random (length list))))) (cons item (shuffle (remove item list)))))))
Function Shuffle(Of T)(collection As IEnumerable(Of T)) As List(Of T) Dim r As Random = New Random() Shuffle = collection.OrderBy(Function(a) r.Next()).ToList() End Function