<commit_before># js-anagram

<!---
[![Build Status][1]][2]
[![Coverage Status][3]][4]
--->

[![License][5]][6]

<!---
[![Go and play][7]][8]
--->

## History

I love trying to find anagrams, but sometimes (especially with long phrases), trying to keep track
of letters you already used and letters still available can be a pain, so I wanted to make a small
tool to do this for me.

This was also the occasion for me to try a more formal way to do some JavaScript, with automation,
unit testing, and so on.

## What it is and is not

This JavaScript allows you to find which anagrams can or cannot be made using a set of letters,
provided **you** do the search.

It is **not** a script running automatically through a dictionary to find the possible
rearrangements. You will find plenty of those already, and though it is funny, it is not in the
current scope of this project.

## Roadmap

### Version 0.1.0

* [x] Get started with Grunt
* [x] Implement the JavaScript functions
  * [x] Implementation and testing
  * [x] Documentation
* [x] ~~Continuous integration~~ (this is a one-shot project, forget the CI)
  * [x] Clean what was begun for CI
* [ ] Create a ``gh-pages`` branch: use the script and two inputs to make something people can use

### Enhancements

* [ ] Make checker members private (manipulation of the attributes outside the class could cause
bugs which are willingly uncontrolled now for optimization)
* [ ] Move testing to nodeunit
<commit_msg>Establish roadmap for the demo page<commit_after># js-anagram

<!---
[![Build Status][1]][2]
[![Coverage Status][3]][4]
--->

[![License][5]][6]

<!---
[![Go and play][7]][8]
--->

## History

I love trying to find anagrams, but sometimes (especially with long phrases), trying to keep track
of letters you already used and letters still available can be a pain, so I wanted to make a small
tool to do this for me.

This was also the occasion for me to try a more formal way to do some JavaScript, with automation,
unit testing, and so on.

## What it is and is not

This JavaScript allows you to find which anagrams can or cannot be made using a set of letters,
provided **you** do the search.

It is **not** a script running automatically through a dictionary to find the possible
rearrangements. You will find plenty of those already, and though it is funny, it is not in the
current scope of this project.

## Roadmap

### Version 0.1.0

* [x] Get started with Grunt
* [x] Implement the JavaScript functions
  * [x] Implementation and testing
  * [x] Documentation
* [x] ~~Continuous integration~~ (this is a one-shot project, forget the CI)
  * [x] Clean what was begun for CI
* [ ] Create a ``gh-pages`` branch: use the script and two inputs to make something people can use
  * [ ] Make demo page allowing for computing anagrams
  * [ ] Links
    * [ ] Documentation
    * [ ] Source
    * [ ] Latest release
  * [ ] Make the demo code available as a sample of how to use (tab on the demo page)
  * [ ] Save anagrams

### Enhancements

* [ ] Make checker members private (manipulation of the attributes outside the class could cause
bugs which are willingly uncontrolled now for optimization)
* [ ] Move testing to nodeunit

{'fraction_non_alphanumeric': 0.09477635283077886, 'fraction_numerical': 0.00688145136065061, 'mean_word_length': 3.889908256880734, 'pattern_counts': {'":': 0, '<': 7, '<?xml version=': 0, '>': 7, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '2289460', 'n_tokens_mistral': 933, 'n_tokens_neox': 908, 'n_words': 482}