String Data Structure
(Redirected from String Structure)
Jump to navigation
Jump to search
A String Data Structure is a data structure that can represent a string item.
- Context:
- It can be processed by a String Structure Operation (e.g. in a Regular Expression System).
- It can be referenced by a String Variable.
- It can range from being a Finite String Data Structure to being an Infinite String Data Structure.
- Example(s):
- a Language-Dependent String Data Structure, such as:
- a Python String Data Structure, such as a pandas.Series.
- a Scala String Data Structure.
- a Perl String Data Structure (for a Perl string variable).
- a Biological String Structure.
- a Text String Structure.
- …
- a Language-Dependent String Data Structure, such as:
- Counter-Example(s):
- See: Software Code Item, Text Item Record, Character (Computing), Literal (Computer Programming), Data Type, Array Data Structure, List (Abstract Data Type),----
References
2014
- (Wikipedia, 2014) ⇒ http://en.wikipedia.org/wiki/String_(computer_science) Retrieved:2014-10-4.
- In computer programming, a string is traditionally a sequence of characters, either as a literal constant or as some kind of variable. The latter may allow its elements to be mutated and the length changed, or it may be fixed (after creation). A string is generally understood as a data type and is often implemented as an array of bytes (or words) that stores a sequence of elements, typically characters, using some character encoding. A string may also denote more general arrays or other sequence (or list) data types and structures.
Depending on programming language and precise data type used, a variable declared to be a string may either cause storage in memory to be statically allocated for a predetermined maximum length or employ dynamic allocation to allow it to hold variable number of elements.
When a string appears literally in source code, it is known as a string literal.
In formal languages, which are used in mathematical logic and theoretical computer science, a string is a finite sequence of symbols that are chosen from a set called an alphabet.
- In computer programming, a string is traditionally a sequence of characters, either as a literal constant or as some kind of variable. The latter may allow its elements to be mutated and the length changed, or it may be fixed (after creation). A string is generally understood as a data type and is often implemented as an array of bytes (or words) that stores a sequence of elements, typically characters, using some character encoding. A string may also denote more general arrays or other sequence (or list) data types and structures.
1996
- (Wall et al., 1996) ⇒ Larry Wall, Tom Christiansen, and Randal L. Schwartz. (1996). “Programming Perl, 2nd edition." O'Reilly. ISBN:1565921496
- string: A sequence of characters such as "He said !@#*&%@#*?\n." A string does not have to be entirely printable.