The short answer is that you don’t. delete simply removes a reference (and not in the way you try to use it, see the above link – delete is one of those language features few people actually understand), nothing more. The implementation clears memory for you, but it’s not your business when (and even if, … Read more
If this class is immutable, won’t it take a huge amount of memory? Typically your memory requirements for that single object might double, because you might have an “old copy” and a “new copy” live at once. So you can view this phenomenon, over the lifetime of the program, as having one more large object … Read more
Methods are stored somewhere else in the memory. Notice that methods are per-class, not per-instance. So typically, the number of methods doesn’t change over the run-time of a program (there are exceptions). In traditional models, the place where the methods live is called the “code segment”. In .net, it’s more difficult: the methods originally live … Read more
I did not find ruby-prof very useful when it came to locating memory leaks, because you need a patched Ruby interpreter. Tracking object allocation has become easier in Ruby 2.1. Maybe it is the best choice to explore this yourself. I recommend the blog post Ruby 2.1: objspace.so by tmml who is one of the … Read more
By default, <javac> runs in-process with Ant. It is a general limitation of Java that you can’t adjust a JVM process’ Xms and Xmx once that JVM process has launched. So, the error message that you are seeing is the software rejecting your attempt to violate this principle (using an unhelpful, unfriendly error message.) If, … Read more
Typed Arrays were designed by the WebGL standards committee, for performance reasons. Typically Javascript arrays are generic and can hold objects, other arrays and so on – and the elements are not necessarily sequential in memory, like they would be in C. WebGL requires buffers to be sequential in memory, because that’s how the underlying … Read more
(This is my third answer because I misunderstood what your code was doing in my original, and then made a small but crucial mistake in my second—hopefully three’s a charm. Edits: Since this seems to be a popular answer, I’ve made a few modifications to improve its implementation over the years—most not too major. This … Read more
What is happening here is, if you have an array of n elements, then the segment tree will have a leaf node for each of these n entries. Thus, we have (n) leaf nodes, and also (n-1) internal nodes. Total number of nodes= n + (n-1) = 2n-1 Now, we know its a full binary … Read more
Remember what Azul used to do: make customized multicore Java appliances. An Azul machine might have 60 or 100 cores and there was all sorts of cleverness to take advantage of the parallelization (the one that impressed me was the optimistic locking: a thread that was supposed to obtain a lock just assumed that it … Read more