Noun
(set theory) A finite sequence of terms.
Hyponyms: (n terms) n-tuple, (two terms) ordered pair, (three terms) triple, triplet
(databases) A single row in a relational database.
(computing) A set of comma-separated values passed to a program or operating system as a parameter to a function call.
(programming) A fixed-size container data type similar to a list that can hold different types of elements.
Both Python and Haskell have a tuple data type as well as a list data type.
Unlike lists, tuples are not formed by consing.
An array is stored so that the position of each element can be computed from its index tuple by a mathematical formula. citation citation citation The simplest type of data structure is a linear array, also called one-dimensional array. Source: Internet
Each tuple of the relation body provides attribute values to instantiate the predicate by substituting each of its free variables. Source: Internet
Acknowledgements flow in the opposite direction to the data or tuple flow. Source: Internet
Any element of a tuple can be accessed in constant time. Source: Internet
A pre-compiler takes the record definition and replaces it with the appropriate tuple reference. Source: Internet
A tuple is an ordered set of attribute values. Source: Internet