OnlineWoerterBuecher.de
Internes

Lexikon


reference counting


A garbage collection technique where each memory cell contains a count of the number of other cells which point to it. If this count reaches zero the cell is freed and its pointers to other cells are followed to decrement their counts, and so on recursively. This technique cannot cope with circular data structures. Cells in such structures refer (indirectly) to themselves and so will never have a zero reference count. This means they would never be reclaimed, even when there are no references from outside the structure. (1995-02-22)

In addition suitable contents:
[ 2 ] [ = ] [ ag ] [ ai ] [ am ] [ an ] [ ar ] [ arc ] [ at ] [ av ] [ b ] [ ba ] [ be ] [ C ] [ ca ] [ cell ] [ ch ] [ ci ] [ cl ] [ co ] [ con ] [ cr ] [ cu ] [ data ] [ data structure ] [ de ] [ dec ] [ du ] [ ec ] [ ed ] [ ee ] [ er ] [ es ] [ fi ] [ file ] [ fo ] [ fr ] [ free ] [ ga ] [ garbage collect ] [ garbage collection ] [ ge ] [ gr ] [ h ] [ hn ] [ hr ] [ id ] [ il ] [ in ] [ int ] [ io ] [ iq ] [ ir ] [ is ] [ it ] [ la ] [ ld ] [ Lex ] [ ls ] [ lv ] [ ly ] [ memory ] [ mm ] [ mo ] [ mod ] [ module ] [ ms ] [ na ] [ nc ] [ ne ] [ ng ] [ ni ] [ nn ] [ no ] [ ns ] [ nu ] [ om ] [ op ] [ pe ] [ ph ] [ point ] [ pointer ] [ pr ] [ program ] [ programming ] [ query ] [ rc ] [ re ] [ recursive ] [ reference ] [ ro ] [ ru ] [ se ] [ si ] [ so ] [ st ] [ struct ] [ su ] [ T ] [ th ] [ to ] [ tr ] [ um ] [ ve ] [ zero ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (3695 Reads)

All logos and trademarks in this site are property of their respective owner.

Page Generation in 0.0905 Seconds, with 17 Database-Queries
Zurück zur Startseite