|
|
|
|
|
|
by marginalia_nu
1543 days ago
|
|
|
This is some of the nonsense you are dealing with implementing a search index in Java: * You can only allocate on-heap arrays of 2 billion items. * On-heap arrays have a massive size overhead in terms of GC book-keeping. * You can only allocate off-heap memory map 2 Gb at a time. * This also goes for memory mapped areas. * You have no control over the lifecycle of mapped memory and off-heap memory. They get cleared if and when the GC feels like it. * You have no madvise capabilities * The language barely acknowledges unsigned types |
|
|