0
I Use This!
Activity Not Available
Analyzed about 1 month ago. based on code collected about 1 month ago.

Project Summary

Given:

This is some #[fun|excellent|amazing] text! It makes me #[laugh|giggle|puke]!

Swaplang will create a tree representing all the possible combinations based on the sets of words inside the brackets. Alternatively, if you don’t want to waste time computing the tree (as it gets very large very quickly - the above example has nine variations [obviously]), you can have it return a random selection.

Tags

No tags have been added

In a Nutshell, Swaplang...

 No recognizable code

Open Hub computes statistics on FOSS projects by examining source code and commit history in source code management systems. This project has code locations but that location contains no recognizable source code for Open Hub to analyze.

BSD 3-clause "New" or "Revised" License
Permitted

Commercial Use

Place Warranty

Modify

Distribute

Forbidden

Use Trademarks

Hold Liable

Required

Include Copyright

Include License

These details are provided for information only. No information here is legal advice and should not be used as such.

All Licenses

This Project has No vulnerabilities Reported Against it

Did You Know...

  • ...
    Black Duck offers a free trial so you can discover if there are open source vulnerabilities in your code
  • ...
    you can subscribe to e-mail newsletters to receive update from the Open Hub blog
  • ...
    nearly 1 in 3 companies have no process for identifying, tracking, or remediating known open source vulnerabilities
  • ...
    learn about Open Hub updates and features on the Open Hub blog

 No recognizable code

Open Hub computes statistics on FOSS projects by examining source code and commit history in source code management systems. This project has code locations but that location contains no recognizable source code for Open Hub to analyze.

Community Rating

Be the first to rate this project
Click to add your rating
   Spinner
Review this Project!