AI & ChatGPT searches , social queries for LINEAR HASHING
Search references for LINEAR HASHING. Phrases containing LINEAR HASHING
See searches and references containing LINEAR HASHING!
Search references for LINEAR HASHING. Phrases containing LINEAR HASHING
See searches and references containing LINEAR HASHING!LINEAR HASHING
Dynamic data structure
Linear hashing (LH) is a dynamic data structure which implements a hash table and grows or shrinks one bucket at a time. It was invented by Witold Litwin
Linear_hashing
Associative array for storing key–value pairs
perfect hash function can be created if all the keys are known ahead of time. The schemes of hashing used in integer universe assumption include hashing by
Hash_table
hopscotch hashing, as in cuckoo hashing, and unlike in linear probing, a given item will always be inserted-into and found-in the neighborhood of its hashed bucket
Hopscotch_hashing
Computer programming method for hashing
double hashing, linear probing is a form of open addressing. In these schemes, each cell of a hash table stores a single key–value pair. When the hash function
Linear_probing
Mapping arbitrary data to fixed-size values
H(z,n) with probability close to n/(n + 1). Linear hashing and spiral hashing are examples of dynamic hash functions that execute in constant time but
Hash_function
Data structure for query optimization in databases
systems is linear hashing. Indices can be implemented using a variety of data structures. Popular indices include balanced trees, B+ trees and hashes. In Microsoft
Database_index
Hashing technique
In computer science, consistent hashing is a special kind of hashing technique such that when a hash table is resized, only n / m {\displaystyle n/m} keys
Consistent_hashing
Technique for selecting hash functions
families are known (for hashing integers, vectors, strings), and their evaluation is often very efficient. Universal hashing has numerous uses in computer
Universal_hashing
Hash function that is suitable for use in cryptography
Hashing is a one-directional mathematical operation which is quick to calculate, yet hard to reverse. So password storage and digital signatures benefit
Cryptographic_hash_function
Computer programming technique
Double hashing is a computer programming technique used in conjunction with open addressing in hash tables to resolve hash collisions, by using a secondary
Double_hashing
Hash collision resolution technique
addressing methods, such as Hopscotch hashing, Robin Hood hashing, last-come-first-served hashing and cuckoo hashing move existing keys around in the array
Open_addressing
Type of hash system
Extendible hashing: ZFS and GFS" and "Table 4.1: Directory organization in filesystems" Trie Hash table Stable hashing Consistent hashing Linear hashing Fagin
Extendible_hashing
Data structure hashing scheme
inserting a new key into a cuckoo hashing table may push an older key to a different location in the table. Cuckoo hashing was first described by Rasmus Pagh
Cuckoo_hashing
Hash function construction used in computer programs that play abstract board games
materials. Zobrist hashing is the first known instance of the generally useful underlying technique called tabulation hashing. Zobrist hashing starts by randomly
Zobrist_hashing
Spiral hashing, also known as Spiral Storage is an extensible hashing algorithm. As in all hashing schemes, spiral hashing stores records in a varying
Spiral_hashing
Vectorizing features using a hash function
In machine learning, feature hashing, also known as the hashing trick (by analogy to the kernel trick), is a fast and space-efficient way of vectorizing
Feature_hashing
Data organization and storage formats
Distributed hash table Double hashing Dynamic perfect hash table Hash array mapped trie Hash list Hash table Hash tree Hash trie Koorde Prefix hash tree Rolling
List_of_data_structures
Problem in computational complexity theory
probability. Unfortunately, we do not have linear perfect hashing, so we have to use an almost linear hash function, i.e. a function h such that: h (
3SUM
Type of hash function
A rolling hash (also known as recursive hashing or rolling checksum) is a hash function where the input is hashed in a window that moves through the input
Rolling_hash
Hash functions computed by exclusive or
methods that require a high-quality hash function, including hopscotch hashing, cuckoo hashing, and the MinHash technique for estimating the size of
Tabulation_hashing
Hash function without any collisions
perfect hashing in Java MPHSharp: perfect hashing methods in C# BBHash: minimal perfect hash function in header-only C++ Perfect::Hash, perfect hash generator
Perfect_hash_function
Family of hash functions
the same value that it would for a truly random hash function. Double hashing is another method of hashing that requires a low degree of independence. It
K-independent_hashing
Message-digest hashing algorithm
content management systems were reported to still use MD5 for password hashing. In 1996, a flaw was found in the design of MD5. While it was not deemed
MD5
Any algorithm which solves the search problem
algorithms: linear, binary, and hashing. Linear search algorithms check every record for the one associated with a target key in a linear fashion. Binary, or half-interval
Search_algorithm
Data mining technique
computer science and data mining, MinHash (or the min-wise independent permutations locality sensitive hashing scheme) is a technique for quickly estimating
MinHash
Hash function phenomenon
take place when a hash collision happens and this method is implemented. Some types of probing are linear probing, double hashing, and quadratic probing
Hash_collision
Topics referred to by the same term
Fareham, UK County Louth, Ireland (code LH) Linear hashing, a computer science algorithm for a dynamic hash LH, a type of single-mode optical fiber LH
LH
Programming technique for resolving duplicate hash values in a hash table data structure
perfect hashing is a programming technique for resolving collisions in a hash table data structure. While more memory-intensive than its hash table counterparts
Dynamic_perfect_hashing
passenger information systems. Ethernet Train Backbone (ETB) "A Dynamic Linear Hashing Method for Redundancy Management in Train Ethernet Consist Network"
Ethernet_consist_network
Sequentially looking in an array
element vary. Linear search is rarely practical because other search algorithms and schemes, such as the binary search algorithm and hash tables, allow
Linear_search
Abstract data type for storing distinct values
operations), or a hash table for unsorted sets (which has O(1) average-case, but O(n) worst-case, for most operations). A sorted linear hash table may be used
Set_(abstract_data_type)
American computer scientist
Larson) is a computer scientist. He is most famous for inventing the linear hashing algorithm with Witold Litwin. Paul Larson is currently a senior researcher
Paul Larson (computer scientist)
Paul_Larson_(computer_scientist)
Data structure for approximate set membership
double hashing and triple hashing, variants of double hashing that are effectively simple random number generators seeded with the two or three hash values
Bloom_filter
Process of reducing the number of random variables under consideration
semantic analysis Local tangent space alignment Locality-sensitive hashing MinHash Multifactor dimensionality reduction Nearest neighbor search Nonlinear
Dimensionality_reduction
Phenomenon observed in hash tables
performance degradation in linear-probing hash tables. The phenomenon states that, as elements are added to a linear probing hash table, they have a tendency
Primary_clustering
Address collision resolution scheme
alternative to linear probing because it incurs less clustering. Quadratic probing exhibits better locality of reference than many other hash table such as
Quadratic_probing
Set of cryptographic hash functions
stream cipher, an authenticated encryption system, a "tree" hashing scheme for faster hashing on certain architectures, and AEAD ciphers Keyak and Ketje
SHA-3
Single-use value in secure communications
a large number of values until a "desirable" hash was obtained. Similarly, the Bitcoin blockchain hashing algorithm can be tuned to an arbitrary difficulty
Cryptographic_nonce
space into a nonperiodic grid. Each spatial dimension is divided by a linear hash. Cells may intersect and points may be distributed between them. Freeston
BANG_file
Cryptographic attack
vulnerable to hash collisions as soon as the underlying hash function is practically broken; techniques like randomized (salted) hashing will buy extra
Collision_attack
Probabilistic data structure in computer science
procedure makes the sketch not a linear sketch, it is still mergeable. Feature hashing Locality-sensitive hashing MinHash The following discussion assumes
Count–min_sketch
Cryptographic hash function
Implementation of the Whirlpool Hashing Function RHash, an open source command-line tool, which can calculate and verify Whirlpool hash. Perl Whirlpool module
Whirlpool_(hash_function)
String searching algorithm
Michael O. Rabin (1987) that uses hashing to find an exact match of a pattern string in a text. It uses a rolling hash to quickly filter out positions of
Rabin–Karp_algorithm
Type of timestamping
authenticated data structure include: Linear hash chain Merkle tree (binary hash tree) Skip list The simplest linear hash chain-based time-stamping scheme
Linked_timestamping
Method of a dimension reduction
identical[citation needed] to the Feature hashing algorithm by John Moody, but differs in its use of hash functions with low dependence, which makes
Count_sketch
Data structure holding key/value pairs
for smaller hash tables, where the time spent inserting into and balancing the tree is greater than the time needed to perform a linear search on all
Associative_array
Method for data management
supports linear time lookup. Built by storing the suffixes of words. The suffix tree is a type of trie. Tries support extendible hashing, which is important
Search_engine_indexing
Multithreaded to allow concurrent access
access scheme based on cuckoo hashing that is not only concurrent, but also keeps the space efficiency of its hashing function while also improving cache
Concurrent_hash_table
Astronomical technique
Michael Blanton (2006-09-28). "Making the Sky Searchable: Fast Geometric Hashing for Automated Astrometry" (PDF). [cosmo]. W. M. Smart (1977). "XII Astronomical
Astrometric_solving
Overview of and topical guide to algorithms
B+ tree Hash join Sort-merge join Query optimization PageRank Inverted index Tf–idf BM25 Locality-sensitive hashing MapReduce Consistent hashing Consensus
Outline_of_algorithms
Cryptography secured against quantum computers
signatures. Moni Naor and Moti Yung invented UOWHF hashing in 1989 and designed a signature based on hashing (the Naor-Yung scheme) which can be unlimited-time
Post-quantum_cryptography
Search algorithm finding the position of a target value within a sorted array
Knuth 1998, §6.2.4 ("Multiway trees"). Knuth 1998, §6.4 ("Hashing"). Knuth 1998, §6.4 ("Hashing"), subsection "History". Dietzfelbinger, Martin; Karlin
Binary_search
Type of data structure
a tuple, known as an index tuple. In general, an array is a mutable and linear collection of elements with the same data type. An array is stored such
Array_(data_structure)
Russian cryptographic hash function
hashing message length h := f ( h , Σ ) {\displaystyle h:=f(h,\,\Sigma )} – hash control sum The output value is h {\displaystyle h} . The step hash function
GOST_(hash_function)
Optimization problem in computer science
learning k-nearest neighbor algorithm Linear least squares Locality sensitive hashing Maximum inner-product search MinHash Multidimensional analysis Nearest-neighbor
Nearest_neighbor_search
Practice and study of secure communication techniques
key sought will have been found. But this may not be enough assurance; a linear cryptanalysis attack against DES requires 243 known plaintexts (with their
Cryptography
Data structure in computer board games
piece are required for the hashing scheme. Magic bitboards are an extrapolation of the time-space tradeoff of direct hashing lookup of attack vectors.
Bitboard
Implementation of an associative array
comparatively low memory usage and low read latency, without relying on hashing or tree balancing, and without sacrificing in-order traversal. Per-operation
Judy_array
Fowler–Noll–Vo hash function: fast with low collision rate Pearson hashing: computes 8-bit value only, optimized for 8-bit computers Zobrist hashing: used in
List_of_algorithms
Family of cryptographic hash functions
provably secure cryptographic hash function Saarinen, Markku-Juhani O. (2007), "Linearization Attacks Against Syndrome Based Hashes", Progress in Cryptology
Fast_syndrome-based_hash
Type of message authentication code
cryptography, a universal hashing message authentication code, or UMAC, is a message authentication code (MAC) calculated using universal hashing, which involves
UMAC_(cryptography)
Cryptographic primitives that involve lattices
Selected lattice-based cryptographic schemes for the purpose of hashing: SWIFFT. Lattice Based Hash Function (LASH). Selected schemes for the purpose of key
Lattice-based_cryptography
Properties of the operation of a secure cipher
between the input and the output by applying a key-dependent non-linear transformation (linear calculations are easier to reverse and thus are easier to break)
Confusion_and_diffusion
Danish computer scientist
Pătraşcu he has shown that simple tabulation hashing schemes achieve the same or similar performance criteria as hash families that have higher independence
Mikkel_Thorup
Family of authenticated ciphers
(22 June 2021). "Ascon v1.2: Lightweight Authenticated Encryption and Hashing". Journal of Cryptology. 34 (3) 33. doi:10.1007/s00145-021-09398-9. eISSN 1432-1378
Ascon_(cipher)
Publicly known attacks against cryptographic hash functions
cryptographic hash functions. Note that not all entries may be up to date. For a summary of other hash function parameters, see comparison of cryptographic hash functions
Hash function security summary
Hash_function_security_summary
Data type in computer science
maintain a linear ordering of items – with access to one or both ends. The data structure implementing such a collection need not be linear. For example
Collection (abstract data type)
Collection_(abstract_data_type)
Authenticated encryption mode for block ciphers
C)=X_{m+n+1}} , where H = E k ( 0 128 ) {\displaystyle H=E_{k}(0^{128})} is the hash key, a string of 128 zero bits encrypted using the block cipher; A {\displaystyle
Galois/Counter_Mode
Cryptography algorithm
authenticated encryption – for example key feedback mode and Davies–Meyer hashing. NIST maintains a list of proposed modes for block ciphers at Modes Development
Block cipher mode of operation
Block_cipher_mode_of_operation
Cryptanalytic method for unauthorized users to access data
a brute-force attack grow exponentially with increasing key size, not linearly. Although U.S. export regulations historically restricted key lengths to
Brute-force_attack
Particular way of storing and organizing data in a computer
objects. Hash tables, also known as hash maps, are data structures that provide fast retrieval of values based on keys. They use a hashing function to
Data_structure
Block cipher
1994, Ohta and Aoki presented a linear cryptanalytic attack against FEAL-8 that required 212 known plaintexts. N-Hash "Q79: What is FEAL?". X5.net. Retrieved
FEAL
Extracting features from raw data for machine learning
process. Covariate Data transformation Feature extraction Feature learning Hashing trick Instrumental variables estimation Kernel method List of datasets
Feature_engineering
The perfect hash function is given by h D ( x ) ( x ) {\displaystyle h_{D(x)}(x)} . Stefan, Walzer (2020). Random hypergraphs for hashing-based data structures
Retrieval_Data_Structure
Tool for verifying the correctness of software models
order reduction; state compression; bitstate hashing (instead of storing whole states, only their hash code is remembered in a bitfield; this saves a
SPIN_model_checker
Measurable property or characteristic
features itself. Covariate Dimensionality reduction Feature engineering Hashing trick Statistical classification Explainable artificial intelligence Bishop
Feature_(machine_learning)
Probability of shared birthdays
formulation, which asks for the median. The problem is relevant to several hashing algorithms analyzed by Donald Knuth in his book The Art of Computer Programming
Birthday_problem
Concept in cryptography
property of cryptographic algorithms, typically block ciphers and cryptographic hash functions, wherein if an input is changed slightly (for example, flipping
Avalanche_effect
Mapping function that preserves data point locality
octree hashing, the Z-order curve naturally iterates the octree in depth-first order. Geohash Hilbert R-tree Linear algebra Locality preserving hashing Matrix
Z-order_curve
compression function consisting of H-Rounds and L-Rounds using S-boxes, linear diffusion and variable rotations, details can be found here The S-boxes
SMASH_(hash)
arrays based on geometric expansion waste linear (Ω(n)) space, where n is the number of elements in the array, hashed array trees waste only order O(√n) storage
Hashed_array_tree
General form of cryptanalysis applicable primarily to block ciphers
primarily to block ciphers, but also to stream ciphers and cryptographic hash functions. In the broadest sense, it is the study of how differences in information
Differential_cryptanalysis
Message authentication code algorithm
Code using Universal Hashing". CFRG Working Group. IETF. Retrieved 2010-08-12. J. Carter; M. Wegman (1977). "Universal classes of hash functions (Extended
VMAC
Cryptographic hash function
operations for finding collisions, and a digest size of 512 bits. Universal hashing. The SWIFFT family of functions is universal. This means that for any fixed
SWIFFT
Family of stream ciphers
the same area as keystream generation. However, unkeyed authentication (hashing) is performed only 8 bits at a time by loading the plaintext into the counters
VEST
Highest rate quantum information can be sent through a noisy quantum channel
channel produces. Theorem (hashing bound). There exists a stabilizer quantum error-correcting code that achieves the hashing limit R = 1 − H ( p ) {\displaystyle
Quantum_capacity
Form of cryptanalysis
In cryptography, linear cryptanalysis is a general form of cryptanalysis based on finding affine approximations to the action of a cipher. Attacks have
Linear_cryptanalysis
Search problem
Anshumali; Li, Ping (2015-07-12). "Improved asymmetric locality sensitive hashing (ALSH) for Maximum Inner Product Search (MIPS)". Proceedings of the Thirty-First
Maximum_inner-product_search
Public domain geocoding invented in 2008
mmcloughlin/geohash-assembly. Vukovic, Tibor (2016). Hilbert-Geohash - Hashing Geographical Point Data Using the Hilbert Space-Filling Curve. 70 (Thesis)
Geohash
Merkle–Damgård construction N-Hash Negative-acknowledge character One-way compression function Parity bit Pearson hashing Perfect code Quantum fingerprinting
List of algebraic coding theory topics
List_of_algebraic_coding_theory_topics
Authenticated encryption mode for block ciphers
Streebog Tiger VSH Whirlpool Password hashing/ key stretching functions Argon2 Balloon bcrypt Catena crypt LM hash Lyra2 Makwa PBKDF2 scrypt yescrypt General
CCM_mode
Protocol for distributed hash table
identifier using consistent hashing. The SHA-1 algorithm is the base hashing function for consistent hashing. Consistent hashing is integral to the robustness
Chord_(peer-to-peer)
Comparison sorting algorithm
constant-time hashing and cumulative sum table lookup rather than a linear search. sr:Ciklično sortiranje#Algoritam ^ "Cycle-Sort: A Linear Sorting Method"
Cycle_sort
Set of cryptographic algorithms by the NSA
Streebog Tiger VSH Whirlpool Password hashing/ key stretching functions Argon2 Balloon bcrypt Catena crypt LM hash Lyra2 Makwa PBKDF2 scrypt yescrypt General
Commercial National Security Algorithm Suite
Commercial_National_Security_Algorithm_Suite
Divisioning of a logical database
partitioning and then a hash partitioning. Consistent hashing could be considered a composite of hash and list partitioning where the hash reduces the key space
Partition_(database)
Digital signature scheme
is built, by placing these 2 n {\displaystyle 2^{n}} hash values as leaves and recursively hashing to form a binary tree. Let a i , j {\displaystyle a_{i
Merkle_signature_scheme
Approximate distinct counting algorithm
paper proposes using a different algorithm for small cardinalities known as Linear Counting. In the case where the estimate provided above is less than the
HyperLogLog
American computer programmer
addressing and linear probing, still frequently used in modern hash table data structures. This was not the first use of hash tables – hash tables with chaining
Elaine_M._McGraw
Machine learning system
need to load all data into memory The hashing trick: feature identities are converted to a weight index via a hash (uses 32-bit MurmurHash3) Exploiting
Vowpal_Wabbit
Topics referred to by the same term
conditional expression in several programming languages Coalesced hashing, a strategy of hash collision resolution in computing Interrupt coalescing, a technique
Coalescence
LINEAR HASHING
LINEAR HASHING
Female
English
English name probably derived from Germanic lindi, LINDA means "serpent."Â In some cases, it may have been derived from the Spanish word for "pretty."
Surname or Lastname
English (Devon; of Cornish origin)
English (Devon; of Cornish origin) : topographic name for someone who lived by a menhir, i.e. a tall standing stone erected in prehistoric times (Cornish men ‘stone’ + hir ‘long’).
Boy/Male
Sikh
Love unending
Female
English
Variant spelling of English Linsey, LINSAY means "Lincoln's wetlands."
Boy/Male
Hindu
The Sun
Boy/Male
Hindu
Lingam
Male
Yiddish
 Variant spelling of Yiddish Lieber, LIBER means "beloved." Compare with another form of Liber.
Female
Scottish
Variant spelling of Scottish Lilias, LILEAS means "lily."
Surname or Lastname
English (Cornish)
English (Cornish) : habitational name from a place named with Cornish lan ‘church’. In England this surname is now found chiefly in the southern counties of Wiltshire and Hampshire, and Berkshire; it has no doubt moved there from Cornwall.
Surname or Lastname
English
English : habitational name from Lingart, Lancashire, or Lingards Wood in Marsden, West Yorkshire, both named from Old English līn ‘flax’ + garðr ‘enclosure’.
Surname or Lastname
Swedish
Swedish : ornamental name from lind ‘lime tree’ + either the German suffix -er denoting an inhabitant, or the surname suffix -ér, derived from the Latin adjectival ending -er(i)us.English (mainly southeastern) : variant of Lind 2.German : habitational name from any of numerous places called Linden or Lindern, named with German Linden ‘lime trees’.
Boy/Male
Irish
Meaning “â€fair-haired,â€â€ the name has been popular since the sixth century when St. Finbar came to an area of Cork that was being tormented by a serpent. The people begged him to do something to help them. One night he went to where the serpent was sleeping and sprinkled it with holy water. The angry serpent tore and devoured the land until she slithered into the sea at Cork Harbor. The track she left behind filled with water and became the River Lee and that’s why St. Finbar is the patron saint of Cork. It is said that the sun didn’t set for two weeks after Finbar’s death.
Male
English
Irish Anglicized form of Gaelic Fionnbarr, FINBAR means "fair-headed."
Surname or Lastname
English
English : variant of Lingard.French : occupational name for a maker of or dealer in linen goods, from Old French linge ‘linen (goods)’ (see Linge 1).
Girl/Female
Irish
Eimear possessed the “Six Gifts of Womanhood†– “beauty, a gentle voice, sweet words, wisdom, needlework and chastity!†She was bethrothed to the warrior Cuchulainn (read the legend) when they were children and they loved each other very deeply. But Cuchulainn had “a wandering eye†and Eimear endured this, realizing “everything new is fair,†but when he made love to Fand, wife of the sea god Manannan, Eimear confronted the lovers. After seeing the strength of Fand’s love she offered to withdraw. Touched by this display of unselfishness, Fand left Cuchulainn and returned to the sea. When Cuchulainn died Eimear spoke movingly and lovingly at his graveside.
Surname or Lastname
English
English : metronymic from Line.
Surname or Lastname
English
English : variant of Lanier 1.Dutch : variant of Leonard.Jewish (western Ashkenazic) : name taken by someone who was good at chanting the Pentateuch at public worship in the synagogue or who regularly did so, from West Yiddish layner ‘reader’ (a derivative of West Yiddish laynen ‘to read’, which comes ultimately from Latin legere ‘to read’).Jewish (Ashkenazic) : occupational name for a flax grower or merchant, from German Lein ‘flax’ + agent suffix -er.
Surname or Lastname
English
English : occupational name for a whitewasher, Middle English limer, lymer, an agent derivative of Old English līm ‘lime’.
Male
Greek
(ΑἰνÎας) Variant spelling of Greek AineÃas, AINEAS means "praiseworthy."
Male
Scandinavian
Scandinavian form of Old Norse Einarr, EINAR means "lone warrior."
LINEAR HASHING
LINEAR HASHING
Girl/Female
Indian, Telugu
Goddess Laxmi
Girl/Female
Greek American
Speaker.
Boy/Male
Hindu
Another name of Agni, Inspirational, Strong
Boy/Male
Tamil
One who is given
Male
Croatian
, little spirit.
Girl/Female
English
Dearly loved.
Girl/Female
Hindu, Indian, Tamil, Telugu
A Song; A Little Song
Girl/Female
Hindu
Art, Phases of Moon
Boy/Male
Gujarati, Hindu, Indian
Name of Lord Shiva
Male
Norwegian
 Norwegian form of Old Norse Arnþórr, ANDOR means "eagle of Thor." Compare with another form of Andor.
LINEAR HASHING
LINEAR HASHING
LINEAR HASHING
LINEAR HASHING
LINEAR HASHING
a.
Of or pertaining to a line; consisting of lines; in a straight direction; lineal.
a.
Formed by right lines; rectilineal; as, a right-lined angle.
n.
Made of linen; as, linen cloth; a linen stocking.
n.
One who adjusts things to a line or lines or brings them into line.
v. t.
To convert into vinegar; to make like vinegar; to render sour or sharp.
n.
A dealer in linen; a linen draper.
n.
Alt. of Lingam
v. t.
To mark with a line or lines; to cover with lines; as, to line a copy book.
a.
Descending in a direct line from an ancestor; hereditary; derived from ancestors; -- opposed to collateral; as, a lineal descent or a lineal descendant.
a.
Of, pertaining to, or included by, two lines; as, bilinear coordinates.
adv.
In a linear manner; with lines.
n.
A vessel belonging to a regular line of packets; also, a line-of-battle ship; a ship of the line.
a.
Linear.
n.
A lunar distance.
a.
Like a line; narrow; of the same breadth throughout, except at the extremities; as, a linear leaf.
n.
One who lines, as, a liner of shoes.
prep. & adv.
Near.
a.
In the direction of a line; of or pertaining to a line; measured on, or ascertained by, a line; linear; as, lineal magnitude.
a.
Composed of lines; delineated; as, lineal designs.
a.
Of a linear shape.