On 8/3/06, Daishi Kato [EMAIL PROTECTED] wrote:
Now, I can reproduce the problem.
% cat dump.scm
(use s11n)
(define x (make-hash-table))
(hash-table-set! x 'aaa (make-hash-table))
(hash-table-set! x 'bbb (make-hash-table))
(with-output-to-file dump
(lambda ()
(serialize x)))
% cat
On 8/7/06, felix winkelmann [EMAIL PROTECTED] wrote:
On 8/3/06, Daishi Kato [EMAIL PROTECTED] wrote:
Now, I can reproduce the problem.
% cat dump.scm
(use s11n)
(define x (make-hash-table))
(hash-table-set! x 'aaa (make-hash-table))
(hash-table-set! x 'bbb (make-hash-table))
On 8/7/06, Daishi Kato [EMAIL PROTECTED] wrote:
If the procedure ID is really re-used, the fallback procedure is never
called, isn't it?
That's correct, unfortunately.
If I could not find any solution to this, my final resort would be
editting the binary dump file to change procedure IDs.
On 8/7/06, felix winkelmann [EMAIL PROTECTED] wrote:
On 8/7/06, Daishi Kato [EMAIL PROTECTED] wrote:
If the procedure ID is really re-used, the fallback procedure is never
called, isn't it?
That's correct, unfortunately.
OK, I found another weird behavior.
Procedures of hash-tables are
felix,
Should this be a bug?
Daishi
Index: s11n/s11n.scm
===
--- s11n/s11n.scm (revision 1371)
+++ s11n/s11n.scm (working copy)
@@ -237,6 +237,7 @@
(cond ((##core#inline set_procedure_ptr x
Now, I can reproduce the problem.
% cat dump.scm
(use s11n)
(define x (make-hash-table))
(hash-table-set! x 'aaa (make-hash-table))
(hash-table-set! x 'bbb (make-hash-table))
(with-output-to-file dump
(lambda ()
(serialize x)))
% cat undump.scm
(use s11n)
(define (deserialize-fallback id)
Looks like the s11n egg is updated. So I tried, only to see I'm
missing something.
Here is my fallback func:
(define (deserialize-fallback id)
(cond ((string=? id f_3497library.scm) ; chicken-2.315
equal?)
((string=? id f_6914extras.scm) ; chicken-2.315
hash)
On 7/21/06, Daishi Kato [EMAIL PROTECTED] wrote:
Hi,
Is it well known that a serialization and a deserialization
are not compatible between different chicken versions?
Any way for convertion? any workaround?
The remark about versions means, that it *can* be incompatible
among chicken
At Fri, 21 Jul 2006 08:58:50 +0200,
felix winkelmann wrote:
On 7/21/06, Daishi Kato [EMAIL PROTECTED] wrote:
So, the question is if there is an easy way to write a hash-table.
Converting a hash-table into an alist looks the way to go,
except that my hash-tables are nested.
Any idea
On 7/21/06, Daishi Kato [EMAIL PROTECTED] wrote:
Does SRFI-10 keep identity?
In other words, how can it handle this: (let ([x (cons 1 1)]) (cons x x))
No, it's just a means of extending the reader.
OK, it seems s11n is easier for my purpose.
Although I still do not understand the internals
Daishi,
A while ago we had a discussion on how portable s11n is, and how
portable it should strive to be. Felix gave a technical explanation
of the implementation here:
http://lists.gnu.org/archive/html/chicken-users/2005-11/msg00105.html.
The eggdoc also mentions that serialized data is
Oops, sorry about that.
I'll check the past discussion.
Daishi
At Thu, 20 Jul 2006 21:50:05 -0500,
Zbigniew wrote:
Daishi,
A while ago we had a discussion on how portable s11n is, and how
portable it should strive to be. Felix gave a technical explanation
of the implementation here:
Hm, maybe I don't need s11n for my purpose.
I simply would like to store hash-tables to a storage.
These hash tables are normal, meaning the procedures are default of
hash and equal?.
So, the question is if there is an easy way to write a hash-table.
Converting a hash-table into an alist looks the
13 matches
Mail list logo
