| 词汇 | example_english_garbage-collector |
| 释义 | Examples of garbage collectorThese examples are from corpora and from sources on the web. Any opinions in the examples do not represent the opinion of the Cambridge Dictionary editors or of Cambridge University Press or its licensors. This is because the garbagecollector is rarely being activated. These closures must not be moved by the garbagecollector. The result of all this is that the garbagecollector reclaims redundant update frames. We achieve this by allocating control flow compiled code on the heap, and extending the heap garbagecollector to support this new data structure. A concurrent garbagecollector might have trouble finding all these pointers quickly. The update routine must then be careful to save any pointers being returned in registers into a place where the garbagecollector will find them. Deallocation is done by the garbagecollector once for each segment when there are no more references to a segment. Figure 4 illustrates the difference between the characteristic space profiles for a reference-counting garbagecollector and for a raark-and-sweep or two-space copying collector. These schemes rely on support from the underlying runtime system, especially the garbagecollector. The garbagecollector and other components of the run-time system must be modified to cope with the larger tagged cells. This could be useful to a garbagecollector. The next attempt to allocate space from the heap is then certain to call the garbagecollector. This allows us to avoid the need for a garbagecollector, which is particularly important to guarantee that our cost analysis evaluates real runtime costs. So it should be possible to improve the low-level management of non-determinism and to combine this with an efficient garbagecollector. The efficiency could probably be increased further by using a generational garbagecollector instead of a copying one. The garbagecollector skips heap blocks with a survival rate of more than 80%. This makes them more interesting for testing garbagecollector performance. A concurrent copying garbagecollector for languages that distinguish immutable data. However, it later became necessary to introduce explicit management for payloads of messages because the garbagecollector caused memory fragmentation and high processing overhead. The garbagecollector examines the heap limit register and decides whether to perform an ordinary garbage collection or one with sampling. To be able to collect the increments independently of each other, the garbagecollector needs to keep track of the references between increments. The front of the list is thus available for recycling by the garbagecollector. Normally, these cells would have become garbage, but if the global list holds pointers to them, the garbagecollector must consider them live. The question is: how is the garbagecollector to find all such pointers? The garbagecollector can therefore reclaim the memory used by input as soon as the parser has consumed it. But consider a variation in which a generational garbagecollector does hash-merging of objects that survive into the second generation. If we moreover assumed existence of a garbagecollector, we could alleviate the programmer from needing to always free memory. Our experiences with the garbagecollector have been positive, with two exceptions. For some programs, this allows a region-based memory manager to reclaim strictly more objects than a trace-based garbagecollector. An accurate garbagecollector must be able to identify every pointer in the stack. The extra load placed on the garbagecollector by heap-allocated frames is small. Our garbagecollector 'marks' any frame that survives a collection; marked frames are not put back on the freelist upon procedure return. Unfortunately, the abstract machine is subject to a space leak- objects are unnecessarily preserved by the garbagecollector. For example, an implementation that uses a copying garbagecollector is free to rearrange heap values without observably affecting the machine state. The large overhead for garbage collection is partly due to the use of a simple two-space copying garbagecollector. This is made possible in 1993 by the garbagecollector that delivers good performance. Currently a two-space copying garbagecollector is used. Fixing some space leaks with a garbagecollector. The advantage is that the marking phase of the garbagecollector can be used to implement retain. With early reset, the garbagecollector takes over some of the untrailing work that would be done upon backtracking. It eliminates our problems with the garbagecollector because memory allocated for message payloads is rapidly recovered without requiring a garbage collection. The argument is often made that these tags are there to allow the garbagecollector to traverse pointers and records. The garbagecollector cannot remove them as their future use depends on the input. Even worse, because of the dynamic memory behaviour a complex heap allocation mechanism, including a garbagecollector, is necessary. This is sufficient to remove the space leak as only the new argument(s) plus a single cell are preserved by the garbagecollector. The major reason we choose not to do so is to avoid confusing the garbagecollector. This can result in chains of at most two indirections; and remember that indirections are all eliminated by the garbagecollector. Another alternative is to use a conservative garbagecollector, but there are a number of problems with this approach. The chronological garbagecollector is a generational copying collector with particular choices regarding generation organisation, garbage collection scheduling and survivor promotion. This means that the garbagecollector will never be able to collect any of the values used in the past. Finally, the code itself contains pointers to terms on the heap, which are handled by the heap garbagecollector as well. Store is allocated and initialised implicitly, and reclaimed by the garbagecollector. Of course, with realistic language implementations, storage will be reused, perhaps after being reclaimed by a garbagecollector. Critical to our focus on higher-order languages, we extend the concept of garbage collection beyond its traditional realm of the store, as our garbagecollector operates over environment structure. This approach can be implemented entirely within the source language, but to implement it efficiently requires unsafe type coercions and some support from the garbagecollector. Linear tabling is probably the easiest scheme to implement since no effort is needed to preserve states of consumers and the garbagecollector can be kept untouched for tabling. The effect is that all small integers are 'commoned up' by the garbagecollector, and made to point to one of a fixed collection of small-integer closures. In contrast, since this reference information is not available for a mark-and-sweep or a copying garbagecollector, this trick cannot be used to avoid locking at copying time. A reference number is an index into an array of addresses of functions and constant applicative forms that is kept with each function for use by the garbagecollector. A softly reachable object may be garbage collected at the discretion of the garbagecollector. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. The problem of lacking registers was solved by a new conservative garbagecollector. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. Constraints imposed on a real-time garbagecollector are usually either work based or time based. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. The garbagecollector runs in the background, turning "dirty" blocks into "free" blocks. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. It was thrown out with the garbage and was subject to a police investigation when it was discovered by the garbagecollector. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. Reference counting alone can not move objects to improve cache performance, so high performance collectors implement a tracing garbagecollector as well. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. It is sometimes referred to as the garbagecollector by locals. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. By pinning the data in memory, the garbagecollector will be prevented from moving it, allowing it to be shared in-place with the unmanaged application. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. The keyword prevents the garbagecollector from relocating this variable. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. The garbagecollector uses generations and the virtual memory is divided into areas. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. For example, it needs a dedicated garbagecollector to remove unused nodes from the cache. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. The garbagecollector can treat a weakly reachable object graph as unreachable and deallocate it. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. This new garbagecollector has many advantages over a traditional conservative scanner. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. The garbagecollector will then soon collect and destroy it. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. This allows the garbagecollector to relocate referenced objects and ensures type safety and security. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. She wants to be a garbagecollector like her father, although he wants her to become famous and is afraid of her intelligence at times. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. The garbagecollector helps to reduce (not completely though) the frequency of these errors. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. A weak reference is not merely just any pointer to the object that a garbagecollector does not care about. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. The compacting garbagecollector can run either synchronously or asynchronously within its own thread. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. It comprises an interpreter, several just-in-time compilers, a decompiler and a garbagecollector. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. It featured no gangsters, but instead a deaf garbagecollector who is determined to learn how to surf after discovering a broken surfboard. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. Its garbagecollector is a hybrid of reference counting and a real-time coloring collector that gathers cyclic data. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. Python uses dynamic typing and a combination of reference counting and a cycle-detecting garbagecollector for memory management. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. The garbagecollector must also account for the possibility of object resurrection. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. One way to defer reclamation is to run the algorithm in an environment featuring an automatic garbagecollector. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. Weak references may be used by a garbagecollector to determine the objects that are almost collectable. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. A softly referenced object is only eligible for reclamation, if the garbagecollector decides that the program is low on memory. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. The garbagecollector then needs to know whether to treat the element as a reference and follow it, or whether it is a primitive value. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. A real-time garbagecollector should guarantee that even in the worst case it will dedicate a certain number of computational resources to mutator threads. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. Under reference counting, a weak reference is similar to a weak reference under a tracing garbagecollector. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. The "garbagecollector", or just "collector", attempts to reclaim "garbage", or memory occupied by objects that are no longer in use by the program. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. Heap cleaning is done by incremental garbagecollector. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. One of the possible solutions of this problem is to use a deterministic garbagecollector. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. Once no references to an object remain, the unreachable memory becomes eligible to be freed automatically by the garbagecollector. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. In dynamic memory allocation implementations that employ a garbagecollector, objects are reclaimed after they become unreachable. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. These examples are from corpora and from sources on the web. Any opinions in the examples do not represent the opinion of the Cambridge Dictionary editors or of Cambridge University Press or its licensors. |
反思网英语在线翻译词典收录了377474条英语词汇在线翻译词条，基本涵盖了全部常用英语词汇的中英文双语翻译及用法，是英语学习的有利工具。