naturalsorter | Sorting an array in a natural way | Natural Language Processing library

by versioneye Ruby Version: Current License: MIT

X-Ray Key Features Code Snippets Community Discussions(1)Vulnerabilities Install Support

kandi X-RAY | naturalsorter Summary

naturalsorter is a Ruby library typically used in Artificial Intelligence, Natural Language Processing applications. naturalsorter has no bugs, it has no vulnerabilities, it has a Permissive License and it has low support. You can download it from GitHub.

Sorting an array in a natural way

Support

Quality

Security

License

Reuse

Support

naturalsorter has a low active ecosystem.

It has 21 star(s) with 5 fork(s). There are 5 watchers for this library.

It had no major release in the last 6 months.

There are 1 open issues and 9 have been closed. On average issues are closed in 301 days. There are no pull requests.

It has a neutral sentiment in the developer community.

The latest version of naturalsorter is current.

Quality

naturalsorter has no bugs reported.

Security

naturalsorter has no vulnerabilities reported, and its dependent libraries have no vulnerabilities reported.

License

naturalsorter is licensed under the MIT License. This license is Permissive.

Permissive licenses have the least restrictions, and you can use them in most projects.

Reuse

naturalsorter releases are not available. You will need to build from source code and install.

Installation instructions, examples and code snippets are available.

Top functions reviewed by kandi - BETA

kandi's functional review helps you automatically verify the functionalities of the libraries and avoid rework.
Currently covering the most popular Java, JavaScript and Python libraries. See a Sample of naturalsorter

Get all kandi verified functions for this library.

naturalsorter Key Features

No Key Features are available at this moment for naturalsorter.

naturalsorter Examples and Code Snippets

No Code Snippets are available at this moment for naturalsorter.

Community Discussions

Trending Discussions on naturalsorter

How does this natural sort function work?

QUESTION

How does this natural sort function work?

Asked 2017-Nov-27 at 16:58

function naturalSorter(as, bs){
    var a, b, a1, b1, i= 0, n, L,
    rx=/(\.\d+)|(\d+(\.\d+)?)|([^\d.]+)|(\.\D+)|(\.$)/g;
    if(as=== bs) return 0;
    a= as.toLowerCase().match(rx);
    b= bs.toLowerCase().match(rx);
    L= a.length;
    while(ib1? 1:-1;
        }
    }
    return b[i]? -1:0;
}

...

ANSWER

Answered 2017-Nov-27 at 16:58

This is an implementation of natural sorting.

It's splitting strings into sequences of numbers, and comparing them. This enables 1-2 to be less than 1-3 to be less than 2-1.

Source https://stackoverflow.com/questions/47515423

Community Discussions, Code Snippets contain sources that include Stack Exchange Network

Vulnerabilities

No vulnerabilities reported

Install naturalsorter

You should add this line to your Gemfile. and run this command in your app root directory.

Support

For any new features, suggestions and bugs create an issue on GitHub. If you have any questions check and ask questions on community page Stack Overflow .

Find more information at: