0x119249bd1d6b8b077944935b04488b8bafa6c3978bb59eb03f66554f9d6897d4
I hereby claim:
- I am takagoto on github.
- I am takagoto (https://keybase.io/takagoto) on keybase.
- I have a public key ASDhhZ0S4OlHWAO1eFP86QOPsS1gjM7DshqOwJJXhYUylwo
To claim this, I am signing this object:
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#example from root: `bin/spec_js test/something/everything/view.coffee | |
#!/bin/bash | |
TEST_FILE=$(echo $1 | sed -e "s/test\///g" | sed -e "s/\.coffee//g") | |
sed -i '' "s|\*\*\/\*|$TEST_FILE|" testem.json | |
/usr/local/bin/testem | |
sed -i '' "s|spec/$TEST_FILE|spec\/**\/*|" testem.json |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
1. Took out the double failed test | |
2. will be inserting music during presentation, and explanation towards the end where I refactor the reduce enumerable. | |
3. fonts bigger now | |
4. testing naming, couldn't figure out anything better. to my "PrimeFactors returns [] for 1" makes sense independently" | |
5. reduce one of the test, the tests I ran are necessary in my opinion, to validate that it detects prime factors itself | |
(ex: 7), it detects more than 2 prime factors (ex: 8), and find different prime factors (ex: 6) | |