so I wanna wrap all these functions into contracts that enforce the intended types.
ideally, it would work well with tail calls by coalescing checks for the same type, but oh well.
also ideally, it would be mostly eliminated at compile time by careful type analysis, but oh well, too.
and ideally, it would pay incremental cost for verifying recursive data structures, rather than O(n) or worse at each check.
or
{foo:: Integer foo: 1}
is there an example or code of a way to create a port? IE: I have a C function,
gsf_input_read (*inp, n) which returns a pointer to n bytes. Is there an easy way to read-subu8vector? I can simple build it in gerbil and call a __u8_vector_append(scheme_object, byte) type thing, or even do that with a bidirectional port I suppose, which is likely part of the answer to my question... but it seems like it must be quite common :)
Is there a make_u8vector(uint8_t *start, size_t length) thing somewhere?
drewc @drewc thinks he should ask that on the gambit channel lol
drewc @drewc thinks he figured it out... asking the question simply phrases it in a way that gets out of the coding zone :P
To follow myself (is this a searchable chat?) https://gist.github.com/drewc/ee25525a9cb6c380df37436acd14be93
it defines a setq macro
so you can match (with the literal)
set! expansion
you want it only for the bin?
you might set GAMBOPT before running
was not sure if there was a compile time argument one could set to enact it as default
17 replies
I'm having an issue with what I guess are 'lexeme literals', where I have a production of the following form
VarAssn <- (VarIdent $1) '=' (Expr $2)
=> ['def $1 $2]
VarIdent <- (Ident $1)
=> $1
Expr <- IntWhere Int and Ident are regex lexer tokens.
The error I get is
> (reload "teraterm.ss")
> (teraterm-parse "a = 123")
*** ERROR IN (stdin)@2.1 -- Syntax Error
*** ERROR IN (string)@1.3
--- Syntax Error: Bad-syntax; No lexeme matching input
... form: (ERROR "=")
1>
add a lexer rule for it
now to try bebox
let's add it to the directory as well
how would they work? be backed by a regular vector that resizes?
and/or backed by a family of regular vectors.
e.g. every time you collect X (constant, 2, 3 or 4) vectors of a given size, you merge them.
assuming frequent automatic extends, and infrequent shrinks
So I'll be issuing a PR.
and yeah, using a struct in a single parameter speeding up things no surprise