Here are my 3 basic sorting algorithms written in Scheme: Read More
1. If you don’t know anything about SQLite, please read:
http://en.wikipedia.org/wiki/SQLite
2. Install sqlitebrowser:
sudo apt-get install sqlitebrowser
3. Run sqlitebrowser
4. Open file:
/home/your username/.mozilla/firefox/your profile/places.sqlite
It’s a SQLite database where firefox stores information about history.
5. Execute following command:
SELECT url FROM moz_places WHERE url LIKE "%wojtekrj.net%"
6. You should have list of all vistied by you pages from my blog.
You can check your program using command:
valgrind your_programExample of usage:
We have following C++ program (tst.cpp):
int main() { int * tab = new int[1000000]; return 0; }
Obviously it generates memory leak. We compile it to tst file and execute:
valgrind tstHere are some useful links about Scheme programming language:
in English
http://www.ccs.neu.edu/home/dorai/t-y-scheme/t-y-scheme-Z-H-1.html
http://www.r6rs.org/final/html/r6rs/r6rs-Z-H-2.html
and in Polish:
http://wazniak.mimuw.edu.pl/index.php?title=Programowanie_funkcyjne/Scheme
http://www.ds5.agh.edu.pl/~kubek2k/papers/gimp-scheme/scheme.html