0
I Use This!
Activity Not Available
Analyzed about 4 years ago. based on code collected over 8 years 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...

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

Place Warranty

Commercial Use

Modify

Distribute

Forbidden

Hold Liable

Use Trademarks

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
  • ...
    search using multiple tags to find exactly what you need
  • ...
    in 2016, 47% of companies did not have formal process in place to track OS code
  • ...
    learn about Open Hub updates and features on the Open Hub blog

30 Day Summary

Feb 5 2010 — Mar 7 2010

12 Month Summary

Mar 7 2009 — Mar 7 2010

Ratings

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