diff --git a/docs/rmem.html b/docs/rmem.html index cf38cee..8099c16 100644 --- a/docs/rmem.html +++ b/docs/rmem.html @@ -159,7 +159,7 @@

src/rmem

# let ptr3 = mp.realloc(ptr1, 150) # Free memory mp.free(ptr2) -echo "Free memory after reset: ", mp.getFreeMemory() +echo "Free memory after free: ", mp.getFreeMemory() # Example 2: ObjPool type @@ -187,7 +187,7 @@

src/rmem

var bs = createBiStack(buffer) # Choose between front and back allocations based on the lifetimes and # usage patterns of your data. -let front1 = cast[ptr int](bs.allocFront(sizeof(int))) # Memory is not cleared! +let front1 = cast[ptr int](bs.allocFront(sizeof(int))) let back1 = cast[ptr int](bs.allocBack(sizeof(int))) front1[] = 10 back1[] = 20 @@ -470,7 +470,7 @@

Procs

diff --git a/src/rmem.nim b/src/rmem.nim index b3b86d4..cc6a236 100644 --- a/src/rmem.nim +++ b/src/rmem.nim @@ -1,6 +1,6 @@ # **************************************************************************************** # -# rmem v1.0 - memory pool and objects pool +# rmem v1.0 - memory pool and objects pool - nim version # # DESCRIPTION: # A quick, efficient, and minimal free list and arena-based allocator @@ -61,7 +61,7 @@ runnableExamples: var bs = createBiStack(buffer) # Choose between front and back allocations based on the lifetimes and # usage patterns of your data. - let front1 = cast[ptr int](bs.allocFront(sizeof(int))) # Memory is not cleared! + let front1 = cast[ptr int](bs.allocFront(sizeof(int))) let back1 = cast[ptr int](bs.allocBack(sizeof(int))) front1[] = 10 back1[] = 20