Everything about Weak reference
In programming, a reference which does not protect its object from garbage collection
In computer programming, a weak reference is a reference that does not protect the referenced object from collection by a garbage collector, unlike a strong reference. An object referenced only by weak references – meaning "every chain of references that reaches the object includes at least one weak reference as a link" – is considered weakly reachable, and can be treated as unreachable and so may be collected at any time. Some garbage-collected languages feature or support various levels of weak references, such as C#, Lua, Java, Lisp, OCaml, MATLAB, Perl, Python, Racket, and PHP since the version 7.4. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Weak referenceA 5-minute orientation
- Skim a recent paper: A Reference Frame Rematching Method for Enhancing Large-Signal Stability of Grid-Following Inverter Under Weak GridInfluential work since 2022
- Pick up a classic book: The Art of WarThe most-reprinted book on the subject
- Read the landmark paper: MRP-WSCI: Multiple reference point based weak and strong composite indicatorsCited 48 times
- Go sideways: Destructor (computer programming)A closely related topic
- Go sideways: Smart pointerA closely related topic
📖 Definitions
Noun A reference that does not protect the referenced object from collection by a garbage collector.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
MRP-WSCI: Multiple reference point based weak and strong composite indicators
Rh phenotypes of Chinese blood donors in Hong Kong, with special reference to weak D antigens
Weak definites and reference to kinds
Multi-reference weak pairs local configuration interaction: efficient calculations of bond breaking
Weak disposability in nonparametric production analysis: A new taxonomy of reference technology sets
Anion gap reference intervals show instrument dependence and weak correlation with albumin levels
Radiometric reference for weak radiations: comparison of methods
Weak randomness impacts the security of reference-frame-independent quantum key distribution
🆕 Influential since 2022
A Reference Frame Rematching Method for Enhancing Large-Signal Stability of Grid-Following Inverter Under Weak Grid
Reference-renormalized curvature-primitive Gauss-Bonnet formalism for finite-distance weak gravitational lensing in static spherical spacetimes
An ultra-low power fully CMOS sub-bandgap reference in weak inversion
Reference Signal-Guided Adaptive FitzHugh-Nagumo Stochastic Resonance Method for Weak Magnetic Anomaly Signal Restoration
Robust Loop Correction Scheme Based on Reference Model for Inverters in Weak Grids
📚 Books worth reading
The Art of War孙武 (Sun Tzu) · 1900
State under siegePhilip Mauceri · 1991- 📕From Formalism to Weak FormStefano Corbo · 2014
- 📕Protecting the Weak in East AsiaIwo Amelung, Moritz Bälz · 2018
- 📕Composite Media with Weak Spatial DispersionConstantin Simovski · 2018
Labor laws and their enforcementSusan M. Kingsbury · 1911- 📕Study of the Weak Foot, with Reference to Its Causes, Its Diagnosis, and Its CureRoyal Whitman · 2018
Costaccounting desk reference bookThomas S. Dudick · 1986
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Destructor (computer programming) In object-oriented programming, a destructor (sometimes abbreviated dtor) is a method which is invoked mechanically just before the memory of the object…
- Smart pointer In computer science, a smart pointer is an abstract data type that simulates a pointer while providing added features, such as automatic memory management…
- Unreachable memory In computer science and programming, unreachable memory is a block of dynamically allocated memory where the program that allocated the memory no longer…
- Reference counting In computer science, reference counting is a programming technique of storing the number of references, pointers, or handles to a resource, such as an…
- Garbage collection (computer science) In computer science, garbage collection (GC) is a form of automatic memory management. The garbage collector attempts to reclaim memory that was allocated…
- Pointer (computer programming) I do consider assignment statements and pointer variables to be among computer science's "most valuable treasures." — Donald Knuth, Structured Programming…
- Resource acquisition is initialization Resource acquisition is initialization (RAII) is a programming idiom used in several object-oriented, statically typed programming languages to describe…
- Boxing (computer programming) In computer science, boxing (a.k.a. wrapping) is the transformation of placing a primitive type within an object so that the value can be used as a reference…