Summary: 59 instances, 43 unique

Text	Count
//TODO: mimalloc	1
//TODO: this is odd... we want to handle general typedecl that are of API types as well somehow so we need to adjust this a bit	1
//TODO: this is super inefficient but for now we just want it to run on small strings and regexs-- :(	1
//TODO: compute constants info here...	1
//TODO: probably need to do some escaping here as well	2
//TODO: need to propagate the invariant call info and then check here -- for now pretend there are no additional checks	1
//TODO: we may want to handle some ISomething, Something, Option, Nothing situations more precisely if they can arise	1
//TODO: we want to add some order magic where we intern longer concat strings in sorted tree and can then just compare pointer equality or parent order instead of looking at full data	1
//TODO: we need to handle this	1
//TODO: need to string unescape here	1
//TODO: change impl to inline + https://github.com/dotnet/runtime/blob/main/src/libraries/System.Private.CoreLib/src/System/Number.BigInteger.cs	2
//TODO: split the string into multiple parts	2
//TODO: we actually have NFA semantics for our regex -- JS matching is a subset so we need to replace this!!!	1
//TODO: we may want to try and strip matching types in any options -- T | None ~~ Int | None should unify T -> Int	1
//TODO: update position info for debugging	1
//TODO: what about typed numbers -- also min/max	1
//TODO: not implemented yet	3
//TODO: we need to switch this to encode the underlying and primitive types in the type decl really -- not as	1
//TODO: see std::get_time here I think	1
//TODO: this is where it might be nice to do some mono/polymorphic inline caching vtable goodness	3
const std::map<BSQVirtualInvokeID, BSQInvokeID> vtable; //TODO: This is slow indirection but nice and simple	1
//TODO: this is where it might be nice to do some mono/polymorphic inline caching	2
(define-sort BUUID () (_ BitVec 12)) ;;TODO we should experiment with this encoding -- int, bv128, constructor?	1
//TODO: need to propagate the invariant call info and then check here -- for now pretend there are no additional checks	2
//TODO: we probably need to know about the layout and flow type of each arg too	1
//TODO: at some point in the future we might want to split this out with the 256 buffer as a	1
//TODO: it would be nice to set a more specifc logic here (than the ALL from the smtfile)	4
//TODO: implement this representation in the C++ interpreter etc.	2
//TODO: want to rebalance here later	4
//TODO: package.config data	1
//TODO: as an optimization we should mark all these roots as immortal and detach this so we don't repeatedly do (unneeded) GC work on it	1
//TODO: map option once we have map type	1
//TODO: win32 add checked arith	1
// TODO: check if `next` is `page->block_size` aligned?	1
//TODO: debugger break here	1
;;TODO BHashable and Hash + HashInvert and axioms	1
//TODO: we are limited here to 64 bit ints -- need to extend to a true big int search when we have the library support	1
//TODO: we probably want to make this a process parallel process	1
//TODO: remember to handle the case where rcvr layout is inline union but target call expects a ref union	1
//TODO: this is not a nice "large number of significant integral and fractional digits and no round-off error" like I want plus it is huge -- we need to get a better library later	1
//TODO: need to support things that are any APIType not just numeric	1
//TODO: not implemented yet -- see SMT implementation	1
//TODO: load constants	1