Skip to content
Snippets Groups Projects
  1. Dec 13, 2005
  2. Nov 17, 2005
  3. Oct 29, 2005
  4. Oct 11, 2005
  5. Sep 21, 2005
  6. Sep 16, 2005
  7. Sep 15, 2005
  8. Jul 13, 2005
  9. Jun 18, 2005
  10. May 10, 2005
  11. Apr 12, 2005
  12. Apr 08, 2005
  13. Apr 07, 2005
  14. Apr 04, 2005
  15. Mar 25, 2005
  16. Mar 18, 2005
  17. Mar 15, 2005
  18. Mar 14, 2005
  19. Mar 11, 2005
  20. Mar 03, 2005
  21. Mar 01, 2005
    • Eelco Dolstra's avatar
      * Doh! · 9e50e648
      Eelco Dolstra authored
      9e50e648
    • Eelco Dolstra's avatar
      * Add missing file to dist. · 8d364e5b
      Eelco Dolstra authored
      8d364e5b
    • Eelco Dolstra's avatar
      * Use a weighted use heuristic to disambiguate between multiple · db322a47
      Eelco Dolstra authored
        occurances of a component.  If the shortest path distance between a
        component P and Q in the referers graph is D, then the contribution
        of Q to the use of P is 1 / R^D, where R >= 1, typically 2.  This
        expresses that distant indirect uses are less important than nearby
        uses.
      
        For instance, this can disambiguate between the bootstrap GCC in
        Nixpkgs and the GCC of the final stdenv (the former has more uses,
        but they are further away),  and between the GCC of the final stdenv
        and the GCC+G77 build (the latter has very few uses).
      db322a47
  22. Feb 28, 2005
  23. Feb 25, 2005
  24. Feb 24, 2005
  25. Feb 22, 2005
Loading