Age | Commit message (Expand) | Author |
2003-08-20 | * Fixed a serious bug in the computation of slices. Sometimes the slices | Eelco Dolstra |
2003-08-19 | * Pipe /dev/null into stdin. | Eelco Dolstra |
2003-08-19 | * Delete the temporary directories of failed builds by default, and an | Eelco Dolstra |
2003-08-18 | * Allow lists in package bindings, e.g., | Eelco Dolstra |
2003-08-18 | * Most shells initialise PATH to some default (/bin:/usr/bin:...) | Eelco Dolstra |
2003-08-15 | * Argument support in Fix. Arguments can be passed through the | Eelco Dolstra |
2003-08-15 | * Derivation expressions now can specify arguments to be passed to the | Eelco Dolstra |
2003-08-15 | * Fix can now read expressions from stdin (by saying `fix -'). | Eelco Dolstra |
2003-08-14 | * Detect infinite loops using blackholing. | Eelco Dolstra |
2003-08-14 | * Function() takes a list of formals. | Eelco Dolstra |
2003-08-14 | * Lam -> Function. Doh! | Eelco Dolstra |
2003-08-08 | * deletePath(): some operating systems (e.g., Mac OS X) don't like it | Eelco Dolstra |
2003-08-06 | * Allow locks on paths to be acquired recursively (that is, if the | Eelco Dolstra |
2003-08-06 | * A flag `--flat' to just compute the MD5 checksum of the contents of | Eelco Dolstra |
2003-08-06 | * App -> Call. | Eelco Dolstra |
2003-08-05 | * Conditionals. | Eelco Dolstra |
2003-08-05 | * Cache result of fstatePaths(). TODO: do this in fstore.cc. | Eelco Dolstra |
2003-08-05 | * Allow the top-level expression to be a list of expressions that | Eelco Dolstra |
2003-08-05 | * Delete obstructed paths prior to building. | Eelco Dolstra |
2003-08-04 | * Path locking in addToStore() and expandPath(). | Eelco Dolstra |
2003-08-01 | * In normaliseFState(), wrap registration of the output paths and the | Eelco Dolstra |
2003-08-01 | * Defensive programming against POSIX locking idiocy. | Eelco Dolstra |
2003-08-01 | * normaliseFState() now locks all output paths prior to building, thus | Eelco Dolstra |
2003-08-01 | * Don't use substitutes in addToStore(). | Eelco Dolstra |
2003-07-31 | * Put the database verifier in a transaction. | Eelco Dolstra |
2003-07-31 | * Enclose most operations that update the database in transactions. | Eelco Dolstra |
2003-07-31 | * Use a more reasonable log file size (256 KB instead of 10 MB). | Eelco Dolstra |
2003-07-31 | * Started using Berkeley DB environments. This is necessary for | Eelco Dolstra |
2003-07-31 | * Set execute bit. | Eelco Dolstra |
2003-07-30 | * Don't make the builder executable. | Eelco Dolstra |
2003-07-29 | * Get garbage collection and cache population to work *properly*. | Eelco Dolstra |
2003-07-29 | * Nicer dot graphs. | Eelco Dolstra |
2003-07-29 | * `fstateRefs' now works on derive expressions as well. TODO: make | Eelco Dolstra |
2003-07-29 | * Let `nix --install' print out the id of the normal form. | Eelco Dolstra |
2003-07-28 | * `nix --help'. | Eelco Dolstra |
2003-07-24 | * Fix message. | Eelco Dolstra |
2003-07-24 | * The `-v' flag no longer takes an argument; it should be repeated | Eelco Dolstra |
2003-07-24 | * Do sync the database, since not doing so caused database changes not | Eelco Dolstra |
2003-07-24 | * Debug levels. Use `--verbose / -v LEVEL' to display only messages | Eelco Dolstra |
2003-07-24 | * Don't sync the database on close. This was killing performance. | Eelco Dolstra |
2003-07-23 | * Incorporated Berkeley DB and ATerm into the source tree. | Eelco Dolstra |
2003-07-22 | * libdb_cxx-4 -> libdb_cxx | Eelco Dolstra |
2003-07-22 | * Substitutes now should produce a path with the same id as they are | Eelco Dolstra |
2003-07-22 | * `nix --query --expansion' (`-qe') to get any path with content | Eelco Dolstra |
2003-07-21 | * In `--query --generators', print out paths, not ids. | Eelco Dolstra |
2003-07-21 | * Check for errors. | Eelco Dolstra |
2003-07-21 | * Canonicalise path. | Eelco Dolstra |
2003-07-21 | * Allow the output/expression id to be forced to a certain | Eelco Dolstra |
2003-07-21 | * Changes to the command line syntax of Nix. | Eelco Dolstra |
2003-07-21 | * Memoize the evaluation of Fix expressions to speed up computation. | Eelco Dolstra |