Stefan O'Rear wrote:
Anyway, I have no more ideas, other than the obvious (you have a bug
that results in sporadic failure to hashcons, thus corrupting the
interfaces).
My mistake was: To put it approximately, I was storing Ptrs as map keys
when I should have been using persistent ForeignPtrs.
On Mon, Aug 13, 2007 at 12:30:55PM -0300, Isaac Dupree wrote:
> Isaac Dupree wrote:
>> Stefan O'Rear wrote:
>>> You patched GHC, so the version number (which is extracted from darcs)
>>> automatically went up. GHC assumes (incorrectly) that this broke the
>>> interface format, and is trying to sto
Isaac Dupree wrote:
Stefan O'Rear wrote:
You patched GHC, so the version number (which is extracted from darcs)
automatically went up. GHC assumes (incorrectly) that this broke the
interface format, and is trying to stop you from shooting yourself in
the foot.
But this was from a clean checko
Stefan O'Rear wrote:
You patched GHC, so the version number (which is extracted from darcs)
automatically went up. GHC assumes (incorrectly) that this broke the
interface format, and is trying to stop you from shooting yourself in
the foot.
But this was from a clean checkout that only containe
Stefan O'Rear wrote:
You patched GHC, so the version number (which is extracted from darcs)
automatically went up. GHC assumes (incorrectly) that this broke the
interface format, and is trying to stop you from shooting yourself in
the foot.
But this was from a clean checkout that only containe
Isaac Dupree wrote:
with my hacky patches
it looks to me like they should produce exactly the same behavior as the
current version, except I changed getFastStringTable to equal undefined...
Isaac
___
Cvs-ghc mailing list
Cvs-ghc@haskell.org
http:/
On Mon, Aug 13, 2007 at 12:11:13PM -0300, Isaac Dupree wrote:
> Currently FastString uses a custom-made hash table for their construction.
> I wanted to see how performance compared, using a binary search tree
> instead. Using FiniteMap made a module import loop that was hard to
> resolve, so
Currently FastString uses a custom-made hash table for their
construction. I wanted to see how performance compared, using a binary
search tree instead. Using FiniteMap made a module import loop that was
hard to resolve, so I switched to Data.Map for testing (I know it's only
available since ghc
Currently FastString uses a custom-made hash table for their
construction. I wanted to see how performance compared, using a binary
search tree instead. Using FiniteMap made a module import loop that was
hard to resolve, so I switched to Data.Map for testing (I know it's only
available since
