| To Do List: | |
| * [x] Feature A | |
| * [ ] Feature B | |
| * [x] Feature C | |
| * [ ] Feature D |
| #!/bin/bash | |
| if [ -z "$1" ]; then | |
| echo "No file given! You may need to save first!" | |
| exit 5 | |
| fi | |
| cd `dirname "$1"` | |
| CMD="c --verbosity:0 --hints:off --parallelBuild:1 " | |
| FULL="`basename "$1"`" |
| import macros | |
| type Foo = object | |
| a: int | |
| b: int | |
| c: float | |
| #[ | |
| dumpTree: |
| #!/bin/sh | |
| # Called by "git push" after it has checked the remote status, | |
| # but before anything has been pushed. | |
| # | |
| # If this script exits with a non-zero status nothing will be pushed. | |
| # | |
| # Steps to install, from the root directory of your repo... | |
| # 1. Copy the file into your repo at `.git/hooks/pre-push` | |
| # 2. Set executable permissions, run `chmod +x .git/hooks/pre-push` |
See this Nim Forum Topic where this started.
Well I have a working Aporia version on my Yosemite OS X 10.10.2 from the new-suggest branch of the repository.
BUT the lengths I had to go to get this working are plastered with stuff I did not understand :)
| #!/bin/bash | |
| rm nim/nimcache/* | |
| nim c -c --verbosity:0 -w:off --hints:off nim/ex1.nim | |
| ./tcc nim/nimstub.c -I/usr/local/lib/nim nim/nimcache/*.c -run |
| #!/bin/bash | |
| if [ ! -d "nim-gtk3" ]; then | |
| git clone git@github.com:StefanSalewski/nim-gtk3.git | |
| fi | |
| cd nim-gtk3 && git pull && nimble install -y && cd .. | |
| if [ ! -d "nim-gdk3" ]; then | |
| git clone git@github.com:StefanSalewski/nim-gdk3.git | |
| fi |
| # regular expression to check a number for being prime | |
| # | |
| # see: http://www.noulakaz.net/weblog/2007/03/18/a-regular-expression-to-check-for-prime-numbers/ | |
| import re, strutils | |
| let rprime = re"^1?$|^(11+?)\1+$" | |
| proc testPrime(n: int): bool = | |
| not (repeatChar(n, '1') =~ rprime) |
| # Fancy ID generator that creates 20-character string identifiers with the following properties: | |
| # | |
| # 1. They're based on timestamp so that they sort *after* any existing ids. | |
| # 2. They contain 72-bits of random data after the timestamp so that IDs won't collide with other clients' IDs. | |
| # 3. They sort *lexicographically* (so the timestamp is converted to characters that will sort properly). | |
| # 4. They're monotonically increasing. Even if you generate more than one in the same timestamp, the | |
| # latter ones will sort after the former ones. We do this by using the previous random bits | |
| # but "incrementing" them by 1 (only in the case of a timestamp collision). | |
| # | |
| # Based on https://www.firebase.com/blog/2015-02-11-firebase-unique-identifiers.html |
I hereby claim:
To claim this, I am signing this object:
