Ordinal data type

Ordinal data type

In computer programming, an ordinal data type is a data type with the property that its values can be counted. That is, the values can be put in a one-to-one correspondence with the positive integers. For example, characters are ordinal because we can call 'A' the first character, 'B' the second, etc. The term is often used in programming for variables that can take one of a finite (often small) number of values. While the values are often implemented as integers (or similar types such as bytes) they are assigned literal names and the programming language (and the compiler for that language) can enforce that variables only be assigned those literals.

Wikimedia Foundation. 2010.

Look at other dictionaries:

• Ordinal — may refer to: Ordinal number (linguistics), a word representing the rank of a number Ordinal scale, ranking things that are not necessarily numbers Ordinal indicator, the sign adjacent to a numeral denoting that it is an ordinal number Ordinal… …   Wikipedia

• Data analysis — Analysis of data is a process of inspecting, cleaning, transforming, and modeling data with the goal of highlighting useful information, suggesting conclusions, and supporting decision making. Data analysis has multiple facets and approaches,… …   Wikipedia

• Enumerated type — In computer programming, an enumerated type is a data type (usually user defined) consisting of a set of named constants called enumerators . The act of creating an enumerated type defines an enumeration. When an identifier such as a variable is… …   Wikipedia

• Relative Record Data Set — A Relative Record Data Set (RRDS) is a type of data set used by the VSAM computer data storage system. Records are accessed based on their ordinal position in the file ( relative record number , RRN). For example, the desired record to be… …   Wikipedia

• Level of measurement — The levels of measurement , or scales of measure are expressions that typically refer to the theory of scale types developed by the psychologist Stanley Smith Stevens. Stevens proposed his theory in a 1946 Science article titled On the theory of… …   Wikipedia

• Quark Framework — CAL Paradigm(s) functional, non strict, modular Appeared in 2004 Designed by Luke Evans, Bo Ilic (Business Objects) Typing discipline static, strong …   Wikipedia

• Oxygene (programming language) — Oxygene Developer RemObjects Software Stable release 3.0.21 (August 29, 2009; 2 years ago (2009 08 29)) Influenced by Object Pas …   Wikipedia

• Pascal (programming language) — Pascal Paradigm(s) imperative, structured Appeared in 1970 Designed by Niklaus Wirth Typing discipline static, strong, safe …   Wikipedia

• Comparison of Pascal and C — Programming language comparisons General comparison Basic syntax Basic instructions Arrays Associative arrays String operations …   Wikipedia

• Relational model — The relational model for database management is a database model based on first order predicate logic, first formulated and proposed in 1969 by Edgar Codd. [ Derivability, Redundancy, and Consistency of Relations Stored in Large Data Banks , E.F …   Wikipedia