(data structure)
Definition: A data structure that is only changed by external threads or processes, in contrast to an active data structure.
Note: See the note for active data structure for an example.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 3 December 2007.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Paul E. Black, "passive data structure", in
Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 3 December 2007. (accessed TODAY)
Available from: https://www.nist.gov/dads/HTML/passiveDataStruc.html