|
Has-a
In database design, object-oriented programming and design (see object oriented program architecture), has-a (has_a or has a) is a composition relationship where one object (often called the constituted object, or part/constituent/member object) "belongs to" (is part or member of) another object (called the composite type), and behaves according to the rules of ownership. In simple words, has-a relationship in an object is called a member field of an object. Multiple has-a relationships will combine to form a possessive hierarchy. This is to be contrasted with an ''is-a'' (''is_a'' or ''is a'') relationship which constitutes a taxonomic hierarchy (subtyping). The decision whether the most logical relationship for an object and its subordinate is not always clearly ''has-a'' or ''is-a''. Confusion over such decisions have necessitated the creation of these metalinguistic terms. A good example of the ''has-a'' relationship is containers in the C++ STL. To summarize the relation ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Composition (object-oriented Programming)
In computer science, object composition and object aggregation are closely related ways to combine objects or data types into more complex ones. In conversation the distinction between composition and aggregation is often ignored. Common kinds of compositions are objects used in object-oriented programming, tagged unions, sets, sequences, and various graph structures. Object compositions relate to, but are not the same as, data structures. Object composition refers to the logical or conceptual structure of the information, not the implementation or physical data structure used to represent it. For example, a sequence differs from a set because (among other things) the order of the composed items matters for the former but not the latter. Data structures such as arrays, linked lists, hash tables, and many others can be used to implement either of them. Perhaps confusingly, some of the same terms are used for both data structures and composites. For example, "binary tree" ca ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hyponym
In linguistics, semantics, general semantics, and ontologies, hyponymy () is a semantic relation between a hyponym denoting a subtype and a hypernym or hyperonym (sometimes called umbrella term or blanket term) denoting a supertype. In other words, the semantic field of the hyponym is included within that of the hypernym. In simpler terms, a hyponym is in a ''type-of'' relationship with its hypernym. For example, ''pigeon'', ''crow'', ''eagle'', and ''seagull'' are all hyponyms of ''bird'', their hypernym, which itself is a hyponym of ''animal'', its hypernym. Hyponyms and hypernyms Hyponymy shows the relationship between a generic term (hypernym) and a specific instance of it (hyponym). A hyponym is a word or phrase whose semantic field is more specific than its hypernym. The semantic field of a hypernym, also known as a superordinate, is broader than that of a hyponym. An approach to the relationship between hyponyms and hypernyms is to view a hypernym as consisting of hypo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Containment (computer Programming)
In computer science, object composition and object aggregation are closely related ways to combine objects or data types into more complex ones. In conversation the distinction between composition and aggregation is often ignored. Common kinds of compositions are objects used in object-oriented programming, tagged unions, sets, sequences, and various graph structures. Object compositions relate to, but are not the same as, data structures. Object composition refers to the logical or conceptual structure of the information, not the implementation or physical data structure used to represent it. For example, a sequence differs from a set because (among other things) the order of the composed items matters for the former but not the latter. Data structures such as arrays, linked lists, hash tables, and many others can be used to implement either of them. Perhaps confusingly, some of the same terms are used for both data structures and composites. For example, " binary tree" ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Part-of
In linguistics, meronymy () is a semantic relation between a meronym denoting a part and a holonym denoting a whole. In simpler terms, a meronym is in a ''part-of'' relationship with its holonym. For example, ''finger'' is a meronym of ''hand'' which is its holonym. Similarly, ''engine'' is a meronym of ''car'' which is its holonym. Holonymy () is the converse of meronymy. A closely related concept is that of mereology, which specifically deals with part–whole relations and is used in logic. It is formally expressed in terms of first-order logic. A meronymy can also be considered a partial order. Meronym and holonym refer to ''part'' and ''whole'' respectively, which is not to be confused with hyponym which refers to ''type''. For example, a holonym of ''leaf'' might be ''tree'' (a leaf is a part of a tree), whereas a hyponym of ''oak tree'' might be ''tree'' (an oak tree is a type of tree). See also * Has-a * Hyponymy and hypernymy * Is-a * Mereological nihilism In p ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Aggregation (object-oriented Programming)
In computer science, object composition and object aggregation are closely related ways to combine objects or data types into more complex ones. In conversation the distinction between composition and aggregation is often ignored. Common kinds of compositions are objects used in object-oriented programming, tagged unions, sets, sequences, and various graph structures. Object compositions relate to, but are not the same as, data structures. Object composition refers to the logical or conceptual structure of the information, not the implementation or physical data structure used to represent it. For example, a sequence differs from a set because (among other things) the order of the composed items matters for the former but not the latter. Data structures such as arrays, linked lists, hash tables, and many others can be used to implement either of them. Perhaps confusingly, some of the same terms are used for both data structures and composites. For example, " binary tre ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Meronym
In linguistics, meronymy () is a semantic relation between a meronym denoting a part and a holonym denoting a whole. In simpler terms, a meronym is in a ''part-of'' relationship with its holonym. For example, ''finger'' is a meronym of ''hand'' which is its holonym. Similarly, ''engine'' is a meronym of ''car'' which is its holonym. Holonymy () is the converse of meronymy. A closely related concept is that of mereology, which specifically deals with part–whole relations and is used in logic. It is formally expressed in terms of first-order logic. A meronymy can also be considered a partial order. Meronym and holonym refer to ''part'' and ''whole'' respectively, which is not to be confused with hyponym which refers to ''type''. For example, a holonym of ''leaf'' might be ''tree'' (a leaf is a part of a tree), whereas a hyponym of ''oak tree'' might be ''tree'' (an oak tree is a type of tree). See also * Has-a * Hyponymy and hypernymy * Is-a * Mereological nihilism * Synecd ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Holonym
In linguistics, meronymy () is a semantic relation between a meronym denoting a part and a holonym denoting a whole. In simpler terms, a meronym is in a ''part-of'' relationship with its holonym. For example, ''finger'' is a meronym of ''hand'' which is its holonym. Similarly, ''engine'' is a meronym of ''car'' which is its holonym. Holonymy () is the converse of meronymy. A closely related concept is that of mereology, which specifically deals with part–whole relations and is used in logic. It is formally expressed in terms of first-order logic. A meronymy can also be considered a partial order. Meronym and holonym refer to ''part'' and ''whole'' respectively, which is not to be confused with hyponym which refers to ''type''. For example, a holonym of ''leaf'' might be ''tree'' (a leaf is a part of a tree), whereas a hyponym of ''oak tree'' might be ''tree'' (an oak tree is a type of tree). See also * Has-a * Hyponymy and hypernymy * Is-a * Mereological nihilism * Synecd ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hypernym
In linguistics, semantics, general semantics, and ontologies, hyponymy () is a semantic relation between a hyponym denoting a subtype and a hypernym or hyperonym (sometimes called umbrella term or blanket term) denoting a supertype. In other words, the semantic field of the hyponym is included within that of the hypernym. In simpler terms, a hyponym is in a ''type-of'' relationship with its hypernym. For example, ''pigeon'', ''crow'', ''eagle'', and ''seagull'' are all hyponyms of ''bird'', their hypernym, which itself is a hyponym of ''animal'', its hypernym. Hyponyms and hypernyms Hyponymy shows the relationship between a generic term (hypernym) and a specific instance of it (hyponym). A hyponym is a word or phrase whose semantic field is more specific than its hypernym. The semantic field of a hypernym, also known as a superordinate, is broader than that of a hyponym. An approach to the relationship between hyponyms and hypernyms is to view a hypernym as consisting of hypo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Holonymy
In linguistics, meronymy () is a semantic relation between a meronym denoting a part and a holonym denoting a whole. In simpler terms, a meronym is in a ''part-of'' relationship with its holonym. For example, ''finger'' is a meronym of ''hand'' which is its holonym. Similarly, ''engine'' is a meronym of ''car'' which is its holonym. Holonymy () is the converse of meronymy. A closely related concept is that of mereology, which specifically deals with part–whole relations and is used in logic. It is formally expressed in terms of first-order logic. A meronymy can also be considered a partial order. Meronym and holonym refer to ''part'' and ''whole'' respectively, which is not to be confused with hyponym which refers to ''type''. For example, a holonym of ''leaf'' might be ''tree'' (a leaf is a part of a tree), whereas a hyponym of ''oak tree'' might be ''tree'' (an oak tree is a type of tree). See also * Has-a * Hyponymy and hypernymy * Is-a * Mereological nihilism * Synecd ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Is-a
In knowledge representation, object-oriented programming and design (see object-oriented program architecture), is-a (is_a or is a) is a subsumption relationship between abstractions (e.g. types, classes), wherein one class ''A'' is a subclass of another class ''B'' (and so ''B'' is a superclass of ''A''). In other words, type A is a subtype of type B when A's specification implies B's specification. That is, any object (or class) that satisfies A's specification also satisfies B's specification, because B's specification is weaker. The ''is-a'' relationship is to be contrasted with the ''has-a'' (''has_a'' or ''has a'') relationship between types (classes); confusing the relations ''has-a'' and ''is-a'' is a common error when designing a model (e.g., a computer program) of the real-world relationship between an object and its subordinate. The ''is-a'' relationship may also be contrasted with the '' instance-of'' relationship between objects (instances) and types (classes): se ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Object Composition
In computer science, object composition and object aggregation are closely related ways to combine objects or data types into more complex ones. In conversation the distinction between composition and aggregation is often ignored. Common kinds of compositions are objects used in object-oriented programming, tagged unions, sets, sequences, and various graph structures. Object compositions relate to, but are not the same as, data structures. Object composition refers to the logical or conceptual structure of the information, not the implementation or physical data structure used to represent it. For example, a sequence differs from a set because (among other things) the order of the composed items matters for the former but not the latter. Data structures such as arrays, linked lists, hash tables, and many others can be used to implement either of them. Perhaps confusingly, some of the same terms are used for both data structures and composites. For example, "binary tree" ca ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Object Composition
In computer science, object composition and object aggregation are closely related ways to combine objects or data types into more complex ones. In conversation the distinction between composition and aggregation is often ignored. Common kinds of compositions are objects used in object-oriented programming, tagged unions, sets, sequences, and various graph structures. Object compositions relate to, but are not the same as, data structures. Object composition refers to the logical or conceptual structure of the information, not the implementation or physical data structure used to represent it. For example, a sequence differs from a set because (among other things) the order of the composed items matters for the former but not the latter. Data structures such as arrays, linked lists, hash tables, and many others can be used to implement either of them. Perhaps confusingly, some of the same terms are used for both data structures and composites. For example, "binary tree" ca ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
