You are not logged in.
Pages: 1
fpc speed is comparable to gcc....
my object notation is very simple and fast ... it's a binary one. it's much like bson
it's several times more compact than xml and json, more powerfull than bson and far more fast to transverse/parse.
all strings have a length prefix (1..4 bytes depending on str len ) and are not read during parsing ... they are only read when needed.
integers are also stored in a compact format - 1..8 bytes
it's not object oriented - you do not have to declare complex classes to use it ... but TPersitent serialization can be done very easy
Hi!
thanks for the reply ... i will test it asap.
but the hole idea about fpc is not to use any asm because the code must be compiling not only on x86 ...
i dropped delphi as compiler 4 years ago and i'm pretty happy with fpc + lazarus just because it runs on any (major) platform
i'm building a object notation framework and i plan to use your code to compress the buffers before sending over the wire, so server and clients can be any device.
both compile ok under FPC 2.4.3 after removing all "asm" stuff,
but gives runtime errors during decompression ... any idea?
Pages: 1