hope for dynamic memory management with microthread
and orthogonal persistence


try to implement pow(2,exp)/pow(format,exp) algo
give precision to float 2 str at decimal level

find a way to detect and note periodic number

str2str format conversion can be usefull
//----------------------------------------------------


now float2hex float2bin and bin2float hex2float work in the same function
rest to make a float2dec and dec2float function that work
and imagine a pointer system in ascii working with @ as a prefix
also make a label system
and support raw text

already , noidea_insert and noidea_extract work like a stack were i push and i read str

i want to build a complete transparent file system

//-------------------------------------------------------------
possible data:
	string (name or number(int,float,hex,bin,signed,unsigned))
	integer (short,long,long long, signed ,unsigned)
	float (single, double, long float)
	boolean (true, false)
	pointer (void *)

think ascii are best for indianness independance
	hex : ("7f80h")			#identification character ("h")
		possible to store a nibble here ("Ah")
	bin : ("111:1111:1000:0000b")	#ignorable character (":") identification character ("b")
		can also take only two character for a boolean expression True = ("1b") , False ("0b")
	dec : ("32640d")		#no identification character or ("d")
		character (".") can determine floating point
		("7.25d") = ("7.4h") = ("111.01b")
	nom : ("un mots@")		#identification character ("@")
		not necessary a number but concatenation
identification character can be termination character also so the node dont need to know the size of the str
that only matter on the creation !!!

of course all value will take a lots of memory space, i dont care
but they take also lot of cpu cycle to compute , thus can be optimized by keeping true number in the structure

then the object will be able to do many operation
	var.store([float or int or str....])
	var.copy(...)
	var.add(var2)	arithmetic or concatenation
	var.sub(var2)
	var.mul(var2)	arithmetic or duplication
	var.div(var2)
	var.pow(var2)
	var.root(var2)
	var.sqpw()
	var.sqrt()
	var.sin(var2) .cos .tan .cot .sec .cosec .log

will keep constant like
pi 
e as log base
phi as golden number

asciiz should be packed togeter in a str , starting by control character (modification) ending by # character
so when creating a str from int , i must know the size of the str
size = 1
while int != 0:
	size+=1
	int /= 10
*str = alloc (((size/4)+1)*4)
str = "d"
while int != 0:
	*(*str+size) = (char)(0x30 + (int % 10))
	size -= 1
	int /= 10


