There&#39;s a simpler syntax for immutably sorting an array using ES6 spread operator:

    [...array].sort(sortFn)

As the comments have repeated a few times:  
 
1. `shuffledArray.slice().sort()` is the default way to go. 
2. It&#39;s not really clear how we could have a better algorithm / method using the libraries your mentioned.

Seeing as the motivation for non-destructive sorting is related to writing functional code, and you&#39;re looking at Ramda...check out Facebook&#39;s ImmutableJS library if you haven&#39;t already.

Particularly, the `Seq`.
You could start storing your array of floats in a `Seq`, sort it, and be sure the original Seq remains in the right order.
In addition, it utilizes Lazy evaluation.
http://facebook.github.io/immutable-js/docs/#/Seq  
http://facebook.github.io/immutable-js/docs/#/Seq/sortBy


I am using the following commands to see all the local commits which are not pushed to remote branch but I am not getting all those local commits.  
   

     git log  
     git log origin/master..master  

I want to see at-least 10 local commits(only local).




How to see all local commits which are not pushed to the remote branch?

I&#39;m trying out the PHP micro Framework Lumen (from Laravel).

One of my first steps was to look into the `.env.example` file and make a copy of it to have my `.env` file. There is a variable APP_KEY just like there is in Laravel. Now I tried out the simple command `php artisan key:generate` to get my new key But I ran into the following error message:

&gt; **[InvalidArgumentException]** There are no commands defined in the &quot;key&quot;
&gt; namespace.

Does some one know how I can generate keys for Lumen?

**Update with solution**

So I found my favorite solution for this problem. On the command line (Linux) I run `php -r &quot;echo md5(uniqid()).\&quot;\n\&quot;;&quot;` what gives me something like this `7142720170cef01171fd4af26ef17c93`.

If you are going to use Lumen more often, you may want to create an alias in your `.bashrc`, which is located in your home directory `/home/USERNAME`. To do so, you can open the file with `nano ~/.bashrc` or `vi ~/.bashrc` and copy the following alias at the end of the file, `alias phpkey=&#39;php -r &quot;echo md5(uniqid()).\&quot;\n\&quot;;&quot;&#39;`. Now you can use the command `phpkey` which will give you a 32 character long random string :)


Lumen Micro Framework =&gt; php artisan key:generate

Apart for the native way of cloning an array and then sorting it in place, is there an algorithm and existing implementation that is more suited for non-destructive sorting?

Need to sort an array of floats into a new array without changing the source. My search results were rather thin since most of the literature is focused on reducing the memory requirements with in-place sorting. 

**Using the native `sorted = [].slice().sort()` works fine**. This question is about understanding if there are other performant sorting implementations when memory constraints are removed since a new array is needed anyway.




functional non-destructive array sort

Apart for the native way of cloning an array and then sorting it in place, is there an algorithm and existing implementation that is more suited for non-destructive sorting?
Need to sort an array of floats into a new array without changing the source. My search results were rather thin since most of the literature is focused on reducing the memory requirements with in-place sorting.
Using the native <code>sorted = [].slice().sort()</code> works fine. This question is about understanding if there are other performant sorting implementations when memory constraints are removed since a new array is needed anyway.

The typical way to loop `x` times in JavaScript is:

    for (var i = 0; i &lt; x; i++)
      doStuff(i);

But I don&#39;t want to use the `++` operator or have any mutable variables at all. So is there a way, in ES6, to loop `x` times another way? I love Ruby&#39;s mechanism:

    x.times do |i|
      do_stuff(i)
    end

Anything similar in JavaScript/ES6? I could kind of cheat and make my own generator:

    function* times(x) {
      for (var i = 0; i &lt; x; i++)
        yield i;
    }
    
    for (var i of times(5)) {
      console.log(i);
    }

Of course I&#39;m still using `i++`. At least it&#39;s out of sight :), but I&#39;m hoping there&#39;s a better mechanism in ES6.

Is there a mechanism to loop x times in ES6 (ECMAScript 6) without mutable variables?

In JS it doesn&#39;t seem possible to check if an argument passed to a function is actually of the type &#39;error&#39; or an instance of Error.

For example, this is not valid:

`typeof err === &#39;error&#39;`

since there are only 6 possible types (in the form of strings):

The typeof operator returns type information as a string. There are six possible values that `typeof` returns:

&gt;  &quot;number&quot;, &quot;string&quot;, &quot;boolean&quot;, &quot;object&quot;, &quot;function&quot; and &quot;undefined&quot;.

[MSDN][1]

But what if I have a simple use case like this:

    function errorHandler(err) {
    
        if (typeof err === &#39;error&#39;) {
            throw err;
        }
        else {
            console.error(&#39;Unexpectedly, no error was passed to error handler. But here is the message:&#39;,err);
        }
    }

so what is the best way to determine if an argument is an instance of Error?

is the `instanceof` operator of any help?


  [1]: https://msdn.microsoft.com/library/259s7zc1%28v=vs.94%29.aspx &quot;MSDN JS typeof info&quot;

checking for typeof error in JS

Firstly, in JavaScript&#39;s event model, you will come
across a concept called as event bubbling
(which makes an event to propagate from child
element to a parent element). In order to avoid
such kind of bubbling effect, many developers
use an event method called `stopPropagation( )`.
Alternatively, developers have started to use
`return false` statement to stop such propagation.
Now, there is another terminology called
`preventDefault( )`. As the name indicates, this
method prevents any default behavior of an
element to trigger. Best use case is to prevent an
anchor tag to open a link.

You may come across a scenario where you
would like to prevent the anchor tag from
opening a link (default behavior) as well as stop
the event from going up to the parent.
In such situation, instead of writing two lines of code,
you can get it done in single line i.e; `return false`



When to use PreventDefault( ) vs Return false?

I am using ng-disabled, I like it. It&#39;s working good for me for input and buttons. For anchor tag not working. How can I fix?

`HTML code`

    &lt;a ng-disabled=&quot;addInviteesDisabled()&quot;&gt;Add&lt;/a&gt;

`JS code`

      $scope.addInviteesDisabled = function() {
          return $scope.event.status === APP_CONSTANTS.STATUSES.PENDING_APPROVAL;
      };


AngularJS - ng-disabled not working for Anchor tag

Is it possible to get a random number between 1-100 and keep the results mainly within the 40-60 range? I mean, it will go out of that range rarely, but I want it to be mainly within that range... Is it possible with JavaScript/jQuery?

Right now I&#39;m just using the basic `Math.random() * 100 + 1`.


Get a random number focused on center

I&#39;ve seen a few examples of this but all of those seem to rely on knowing which element you want to count the occurrences of. My array is generated dynamically so I have no way of knowing which element I want to count the occurrences of (I want to count the occurrences of all of them). Can anyone advise?

Thanks in advance

EDIT:

Perhaps I should have been clearer, the array will contain multiple different strings (e.g. 
`[&quot;FOO&quot;, &quot;FOO&quot;, &quot;BAR&quot;, &quot;FOOBAR&quot;]`

How can I count the occurrences of foo, bar and foobar without knowing what they are in advance?

How to count occurrences of an element in a Swift array?

Though that may be a silly question, I can&#39;t figure out how to declare an array literal grouping some string literals.

For example, let&#39;s assume I want the java array `[&quot;January&quot;, &quot;February&quot;, &quot;March&quot;]`.
How can I translate this into the latest kotlin version `(today, 12.0.0)`?

What have I tried?

    stringArray(&quot;January&quot;, &quot;February&quot;, &quot;March&quot;)


string array literal ? How do I code it simply?

`Array.prototype.reverse` reverses the contents of an array in place (with mutation)...

Is there a similarly simple strategy for reversing an array without altering the contents of the original array (without mutation)? 




Reverse array in Javascript without mutating original array

I have the following array and when I do `print_r(array_values($get_user));`, I get:


    Array (
              [0] =&gt; 10499478683521864
              [1] =&gt; 07/22/1983
              [2] =&gt; email@saya.com
              [3] =&gt; Alan [4] =&gt; male
              [5] =&gt; Malmsteen
              [6] =&gt; https://www.facebook.com  app_scoped_user_id/1049213468352864/
              [7] =&gt; stdClass Object (
                       [id] =&gt; 102173722491792
                       [name] =&gt; Jakarta, Indonesia
              )
              [8] =&gt; id_ID
              [9] =&gt; El-nino
              [10] =&gt; Alan El-nino Malmsteen
              [11] =&gt; 7
              [12] =&gt; 2015-05-28T04:09:50+0000
              [13] =&gt; 1
            ) 

I tried to access the array as followed:

    echo $get_user[0];

But this displays me:

&gt;undefined 0


**Note:**

I get this array from the **Facebook SDK 4**, so I don&#39;t know the original array structure.

How can I access as an example the value `email@saya.com` from the array?


How can I access an array/object?

I need some help with iterating through array, I keep getting stuck or reinventing the wheel.

    values = [
        { name: &#39;someName1&#39; },
        { name: &#39;someName2&#39; },
        { name: &#39;someName1&#39; },
        { name: &#39;someName1&#39; }
    ]

How could I check if there are two (or more) same name value in array? I do not need a counter, just setting some variable if array values are not unique. Have in mind that array length is dynamic, also array values.

How can I check if the array of objects have duplicate property values?

I&#39;m looking for a simple way to sort a pandas dataframe by the absolute value of a particular column, but without actually changing the values within the dataframe. Something similar to `sorted(df, key=abs)`. So if I had a dataframe like:

        a	b
    0	1	-3
    1	2	5 
    2	3	-1
    3	4	2
    4	5	-9

The resultant sorted data when sorting on &#39;b&#39; would look like:

        a	b
    2	3	-1
    3	4	2
    0	1	-3
    1	2	5 
    4	5	-9


Sorting by absolute value without changing the data

Imagine you were given a string and you had to sort that string alphabetically using a function. Example:

    sortAlphabets( &#39;drpoklj&#39; ); //=&gt; returns &#39;djklopr&#39;

What would be the best way to do this?

Sort a string alphabetically using a function

I have a pandas dataframe. I want to print the unique values of one of its columns in ascending order. This is how I am doing it:

    import pandas as pd
    df = pd.DataFrame({&#39;A&#39;:[1,1,3,2,6,2,8]})
    a = df[&#39;A&#39;].unique()
    print a.sort()

The problem is that I am getting a `None` for the output.


Find the unique values in a column and then sort them

I&#39;m solving a problem and it involves sorting 10 numbers (int32) very quickly. My application needs to sort 10 numbers millions of times as fast as possible. I&#39;m sampling a data set of billions of elements and every time I need to pick 10 numbers out of it (simplified) and sort them (and make conclusions from the sorted 10 element list).

Currently I&#39;m using [insertion sort][1], but I imagine I could implement a very fast custom sorting algorithm for my specific problem of 10 numbers which would beat insertion sort.

How can I approach this problem?

  [1]: https://en.wikipedia.org/wiki/Insertion_sort


Fastest way to sort 10 numbers? (numbers are 32 bit)

I am using JDK-8 (x64). For `Arrays.sort` (primitives) I found the following in the Java documentation: 
 &gt; The sorting algorithm is a Dual-Pivot **Quicksort** by Vladimir Yaroslavskiy, Jon Bentley, and Joshua Bloch.`

For `Collections.sort` (objects) I found this &quot;Timsort&quot;: 
 &gt; This implementation is a stable, adaptive, iterative **mergesort** ... This implementation **dumps the specified list into an array, sorts the array**, and iterates over the list resetting each element from the corresponding position in the array.

If `Collections.sort` uses an array, why doesn&#39;t it just call `Arrays.sort` or use dual-pivot **QuickSort**? Why use **Mergesort**?


Content Type	Original Author	Original Content on Stackoverflow
Question	Hurelu	View Question on Stackoverflow
Solution 1 - Javascript	shuaibird	View Answer on Stackoverflow
Solution 2 - Javascript	Sze-Hung Daniel Tsui	View Answer on Stackoverflow

functional non-destructive array sort

Javascript Problem Overview

Javascript Solutions

Solution 1 - Javascript

Solution 2 - Javascript

Lumen Micro Framework => php artisan key:generate

How to see all local commits which are not pushed to the remote branch?

Attributions