Content deleted Content added
Jerryobject (talk | contribs) Small WP:EoS WP:COPYEDITs, WP:LEAD fix. WP:ABBReviation after full term. WP:LINKs: adds, update, fix-cut WP:OVERLINKs. WP:CITation: cut repeat text. Inline WP:EXTernal link > WP:REFerence. |
m fix broken links to nist.gov/dads and switch to HTTPS |
||
Line 4:
}}
In [[computer science]] and [[object-oriented programming]], a '''passive data structure''' ('''PDS''', not to be confused with IBM's [[partitioned data set]]s; also termed a '''plain old data structure''', or '''plain old data''' ('''POD''')), is a term for a [[Record (computer science)|record]], to contrast with objects. It is a [[data structure]] that is represented only as passive collections of [[Field (computer science)|field]] values ([[instance variable]]s), without using object-oriented features.<ref name ="psd">{{cite journal |last=Black |first=Paul E. |author2=Vreda Pieterse |title=passive data structure |journal=Dictionary of Algorithms and Data Structures |year=2007 |url=
Passive data structures are appropriate when there is a part of a system where it should be clearly indicated that the detailed logic for data manipulation and integrity are elsewhere. PDSs are often found at the boundaries of a system, where information is being moved to and from other systems or persistent storage and the problem ___domain logic that is found in other parts of the system is irrelevant. For example, PDS would be convenient for representing the field values of objects that are being constructed from external data, in a part of the system where the semantic checks and interpretations needed for valid objects are not applied yet.
| |||