AI & ChatGPT searches , social queriess for PERFECT HASH-FUNCTION
Search references for PERFECT HASH-FUNCTION. Phrases containing PERFECT HASH-FUNCTION
See searches and references containing PERFECT HASH-FUNCTION!
Search references for PERFECT HASH-FUNCTION. Phrases containing PERFECT HASH-FUNCTION
See searches and references containing PERFECT HASH-FUNCTION!PERFECT HASH-FUNCTION
Hash function without any collisions
In computer science, a perfect hash function h for a set S is a hash function that maps distinct elements in S to a set of m integers, with no collisions
Perfect_hash_function
Hash function phenomenon
Technique for selecting hash functions Perfect hash function – Hash function without any collisions Injective map – Function that preserves distinctnessPages
Hash_collision
Mapping arbitrary data to fixed-size values
output. The values returned by a hash function are called hash values, hash codes, (hash/message) digests, or simply hashes. The values are usually used to
Hash_function
Associative array for storing key–value pairs
data type that maps keys to values. A hash table uses a hash function to compute an index, also called a hash code, into an array of buckets or slots
Hash_table
the perfect hash function. Using a minimum perfect hash function gives a big space improvement if the associated values are relatively small. Hashed filters
Retrieval_Data_Structure
Programming technique for resolving duplicate hash values in a hash table data structure
dynamic perfect hashing is a programming technique for resolving collisions in a hash table data structure. While more memory-intensive than its hash table
Dynamic_perfect_hashing
Technique for selecting hash functions
universal hashing (in a randomized algorithm or data structure) refers to selecting a hash function at random from a family of hash functions with a certain
Universal_hashing
Data structure which is efficient to both store in memory and query
perfect hash function, and can be implemented using as few as O ( m log log log n ) {\displaystyle O(m\log \log \log n)} bits. A succinct hash table
Succinct_data_structure
Data structure in computer board games
squares (~bits in the corresponding hash function). As with other schemes which require a perfect hashing function, an exhaustive process of enumeration
Bitboard
Fast 8-bit hash function
adjusted so that those inputs yield distinct hash values, producing what is called a perfect hash function. Two input strings differing by exactly one
Pearson_hashing
Hash functions intended for applications that do not need rigorous security
non-cryptographic hash functions (NCHFs) are hash functions intended for applications that do not need the rigorous security requirements of the cryptographic hash functions
Non-cryptographic hash function
Non-cryptographic_hash_function
Topics referred to by the same term
International Airport Perfect Hair Forever, an American animated television comedy Perfect hash function, a set of hash functions which generate no collisions
PHF
Data structure hashing scheme
Cuckoo hashing is a scheme in computer programming for resolving hash collisions of values of hash functions in a table, with worst-case constant lookup
Cuckoo_hashing
Algorithmic technique using hashing
to cryptographic hash functions, which are designed to have significantly different hashes for even minor differences. Fuzzy hashing has been used to
Fuzzy_hashing
Form of hashing
2 n {\displaystyle 2n} . Hash function Dynamic perfect hashing Daniel Roche (2013). SI486D: Randomness in Computing, Hashing Unit. United States Naval
Static_hashing
their nesting GNU Fontutils – font management utilities GNU gperf – perfect hash function generator GNU indent – program to indent C and C++ source code GNU
List_of_GNU_packages
Cryptographic signature scheme
be built from any cryptographically secure one-way function; usually, a cryptographic hash function is used. Although the potential development of quantum
Lamport_signature
Decentralized distributed system with lookup service
A distributed hash table (DHT) is a distributed system that provides a lookup service similar to a hash table. Key–value pairs are stored in a DHT, and
Distributed_hash_table
Method for finding patterns in networks
|S|=k} , there exists a hash function h in F such that h : S → {1, ..., k} is perfect. In other words, there must exist a hash function in F that colors any
Color-coding
Type of cryptographic attack
values of a hash function, with H = 2 l {\textstyle H=2^{l}} . With a birthday attack, it is possible to find a collision of a hash function with 50 % {\textstyle
Birthday_attack
Concept in cryptography
cryptographic algorithms, typically block ciphers and cryptographic hash functions, wherein if an input is changed slightly (for example, flipping a single
Avalanche_effect
Type of Linux installation
system can be linked against it as well. During the chroot phase, bash's hashing feature is turned off and the temporary toolchain's bin directory moved
Linux_from_Scratch
Comparison sorting algorithm
duplicates of a relatively small number of items, a constant-time perfect hash function can greatly speed up finding where to put an item1, turning the
Cycle_sort
Family of hash functions
computer science, a family of hash functions is said to be k-independent, k-wise independent or k-universal if selecting a function at random from the family
K-independent_hashing
Data structure in chess programs for game state
occupancy bits in the masked portion. One such scheme that uses a perfect hash function along with tricks to minimize the potential size of the table that
Board representation (computer chess)
Board_representation_(computer_chess)
Data structure for approximate set membership
different bit-fields of such a hash, so this type of hash can be used to generate multiple "different" hash functions by slicing its output into multiple
Bloom_filter
Collection of efficiently-computable functions which emulate a random oracle
used for: dynamic perfect hashing; even if the adversary can change the key-distribution depending on the values the hashing function has assigned to the
Pseudorandom_function_family
that a hypothetical hashing function will evenly distribute items into the slots of a hash table. Moreover, each item to be hashed has an equal probability
SUHA_(computer_science)
Algorithm
and disruption is minimal. Rendezvous hashing has the following properties: Low overhead: The hash function used is efficient, so overhead at the clients
Rendezvous_hashing
Family of related bitwise operations on machine words
for 32-bit ctz uses a de Bruijn sequence to construct a minimal perfect hash function that eliminates all branches. This algorithm assumes that the result
Find_first_set
Hopscotch hashing is a scheme in computer programming for resolving hash collisions of values of hash functions in a table using open addressing. It is
Hopscotch_hashing
Cryptographic scheme
the committed value is a bit. Prior to that, commitment via one-way hash functions was considered, e.g., as part of, say, Lamport signature, the original
Commitment_scheme
Practice and study of secure communication techniques
a cryptographic hash function is computed, and only the resulting hash is digitally signed. Cryptographic hash functions are functions that take a variable-length
Cryptography
Data used for bitwise operations
token[] = "some hashable value"; uint32_t hashedToken = hashFunction(token, strlen(token), NUM_BUCKETS); // Using modulo: size_t index = hashedToken % MAX_RECORDS;
Mask_(computing)
Data structure holding key/value pairs
outperform alternative implementations. Hash tables must be able to handle collisions: the mapping by the hash function of two different keys to the same bucket
Associative_array
Adding data to a message prior to encryption to hide its length
difficult. Most modern cryptographic hash functions process messages in fixed-length blocks; all but the earliest hash functions include some sort of padding
Padding_(cryptography)
Perfect matching Hamming distance Hash function Hash collision Perfect hash function Heilbronn triangle problem Helly family Hypergeometric function identities
Index of combinatorics articles
Index_of_combinatorics_articles
Mathematical scheme for verifying the authenticity of digital documents
trapdoor function. This forgery attack, then, only produces the padded hash function output that corresponds to σ, but not a message that leads to that value
Digital_signature
to the data to be hashed, the hash function produces a fixed-length output. Essentially, anything passed through the hash function should resolve to the
History_of_cryptography
Digital verification standard
computes a single key pair for one user. Choose an approved cryptographic hash function H {\displaystyle H} with output length | H | {\displaystyle |H|} bits
Digital_Signature_Algorithm
Thesis on the nature of computability
(December 1984). On tape versus core: an application of space efficient perfect hash functions to the invariance of space. STOC. Eberbach & Wegner 2003, p. 287
Church–Turing_thesis
Cryptography secured against quantum computers
public-key algorithms, most current symmetric cryptographic algorithms and hash functions are considered to be relatively secure against attacks by quantum computers
Post-quantum_cryptography
Cache of previously seen positions, and associated evaluations in a game tree
Transposition tables are typically implemented as hash tables encoding the current board position as the hash index. The number of possible positions that
Transposition_table
array of m {\displaystyle m} bits with k {\displaystyle k} hash functions. Each hash function maps an element to one of the m {\displaystyle m} positions
Approximate membership query filter
Approximate_membership_query_filter
Special type of Boolean function
CAST-128 and CAST-256, makes use of bent functions. The cryptographic hash function HAVAL uses Boolean functions built from representatives of all four
Bent_function
Search algorithm finding the position of a target value within a sorted array
For implementing associative arrays, hash tables, a data structure that maps keys to records using a hash function, are generally faster than binary search
Binary_search
Computational concept
is also possible to use a cryptographic hash function as a randomness extractor. However, not every hashing algorithm is suitable for this purpose.[citation
Randomness_extractor
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
original fusion tree algorithm. A dynamic version of fusion trees using hash tables was proposed in 1996 which matched the original structure's O(logw
Fusion_tree
Type of data storage mechanism
systems work by passing the content of the file through a cryptographic hash function to generate a unique key, the "content address". The file system's directory
Content-addressable_storage
Encryption technique
padding and Russian copulation, but they all lack the perfect security the OTP itself has. Universal hashing provides a way to authenticate messages up to an
One-time_pad
Type of functions designed for being unsolvable by root-finding algorithms
A cryptographically secure hash might also be a base of a good CSPRNG, using, for example, a construct that NIST calls Hash DRBG. An HMAC primitive can
Cryptographically secure pseudorandom number generator
Cryptographically_secure_pseudorandom_number_generator
Term applied to cryptographic systems that are highly resistant to cryptanalysis
describe hashing and unique identifier and filename creation algorithms. See for example the description of the Microsoft .NET runtime library function Path
Strong_cryptography
Problem in computational complexity theory
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 ( x + y ) = h ( x )
3SUM
2011 edition of the C++ programming language standard
allow developers to provide perfect function forwarding. When combined with variadic templates, this ability allows for function templates that can perfectly
C++11
Mechanism for authenticating cryptographic keys
and leaves trust decisions in the hands of individual users. It is not perfect and requires both caution and intelligent supervision by users. Essentially
Web_of_trust
Properties of the operation of a secure cipher
diffusion. These concepts are also important in the design of cryptographic hash functions, and pseudorandom number generators, where decorrelation of the generated
Confusion_and_diffusion
Number divisible only by 1 and itself
large primes. As well as in the hash function, prime numbers are used for the hash table size in quadratic probing based hash tables to ensure that the probe
Prime_number
Creating sequence of numbers that cannot be predicted
adversary might move in a computer game. Weaker forms of randomness are used in hash algorithms and in creating amortized searching and sorting algorithms. Some
Random_number_generation
Hiding messages in other messages
significant bits but it can introduce a random area that is too perfect. This area of perfect randomization stands out and can be detected by comparing the
Steganography
Used for encoding or decoding ciphertext
Cryptographic key types Diceware EKMS Group key Keyed hash algorithm Key authentication Key derivation function Key distribution center Key escrow Key exchange
Key_(cryptography)
Represents a function with diffusion properties useful in cryptography
and HADESMiMC, and in the stream cipher MUGI and the cryptographic hash function Whirlpool, Poseidon. Vaudenay, Serge (1995), Preneel, Bart (ed.), "On
MDS_matrix
Harvest (computer) • HAS-160 • Hash-based cryptography • Hashcash • Hash chain • Hash function security summary • Hash list • Hasty Pudding cipher • HAVAL
Index of cryptography articles
Index_of_cryptography_articles
Product of numbers from 1 to n
expressions for the gamma function at half-integers and the volumes of hyperspheres, and in counting binary trees and perfect matchings. Exponential factorial
Factorial
Algorithmic determination of legal moves in a strategy game engine
Fenner, Trevor; Levene, Mark (March 15, 2008). "Move generation with perfect hash functions". ICGA Journal. 31 (1): 3–12. doi:10.3233/ICG-2008-31102. eISSN 2468-2438
Move_generation
Infinite binary sequence generated by repeated complementation and concatenation
are mapped to 0 by a wide class of polynomial hash functions modulo a power of two, which can lead to hash collisions. Certain linear combinations of Dirichlet
Thue–Morse_sequence
Simple type of polyalphabetic encryption system
pp. 217–221. ISBN 0-684-83130-9. Stanislaw Jarecki, "Crypto Overview, Perfect Secrecy, One-time Pad", University of California, September 28, 2004, Retrieved
Vigenère_cipher
Number whose square is a given number
square roots of small integers are used in both the SHA-1 and SHA-2 hash function designs to provide nothing up my sleeve numbers. A result from the study
Square_root
Surveillance strategy
interception (disambiguation) Indiscriminate monitoring Mass surveillance Perfect forward secrecy Also known as "store now, decrypt later", "steal now, decrypt
Harvest_now,_decrypt_later
nodes in the trees. A randomized algorithm that uses hash tables that are not necessarily perfect has been shown to approximate the Robinson-Foulds distance
Robinson–Foulds_metric
Cryptography based on quantum mechanical phenomena
commitment scheme in which the "unconditional hiding" is perfect. Physical unclonable functions can be also exploited for the construction of cryptographic
Quantum_cryptography
strength of the hash function ensures that it is not computationally feasible to reconstruct the original nor any biometric features from the hash. According
Private_biometrics
function are called hash values, hash codes, digests, or simply hashes. Hash functions are often used in combination with a hash table, a common data
Glossary_of_computer_science
Number of bits in a key used by a cryptographic algorithm
symmetric ciphers (such as AES or Twofish) and collision resistant hash functions (such as SHA) are widely conjectured to offer greater security against
Key_size
Any attack based on information gained from the implementation of a computer system
exploitable correlations are likely to remain unless the balancing is perfect. This "balanced design" can be approximated in software by manipulating
Side-channel_attack
Basic component of symmetric key algorithms
linear combination of output bits is produced by a bent function of the input bits is termed a perfect S-box. S-boxes can be analyzed using linear cryptanalysis
S-box
Integer having only small prime factors
factorization algorithms, for example: the general number field sieve), the VSH hash function is another example of a constructive use of smoothness to obtain a provably
Smooth_number
Programming statement for branching control based on a value
branch table. When implemented as such, a switch statement embodies a perfect hash. An optimizing compiler such as GCC or Clang may compile a switch statement
Switch_statement
Neural network that learns efficient data encoding in an unsupervised manner
would perform as close to perfect reconstruction as possible, with "close to perfect" defined by the reconstruction quality function d {\displaystyle d} .
Autoencoder
Authentication and encryption system
"AES-VCM, an AES-GCM Construction Using an Integer-based Universal Hash Function". ai.google. Retrieved 18 November 2023. "Encryption in Transit in Google
ALTS
Cryptographic protocols for securing data in transit
supported cipher suites (ciphers and hash functions). From this list, the server picks a cipher and hash function that it also supports and notifies the
Transport_Layer_Security
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
Resistance of a password to being guessed
a key derivation function that performs some key stretching, as opposed to in plaintext or solely with a cryptographic hash function. Other implementation
Password_strength
Network security standard to create a secure wireless home network
| PKe | PKr), respectively. The hashing function is HMAC-SHA-256 and uses the "authkey" that is the key used to hash the data. Since both the client and
Wi-Fi_Protected_Setup
Type of data structure
locality of reference (this does not mean however, that using a perfect hash or trivial hash within the same (local) array, will not be even faster - and
Array_(data_structure)
Sentence containing all letters of the English alphabet
computer keyboards. In cryptography, it is commonly used as a test vector for hash and encryption algorithms to verify their implementation, as well as to ensure
The quick brown fox jumps over the lazy dog
The_quick_brown_fox_jumps_over_the_lazy_dog
Encryption and decryption method
and its relationship with the English Civil War. In John Le Carre's A Perfect Spy, the protagonist Magnus Pym uses a book cipher based on the German
Book_cipher
Tool used in probabilistic polynomial identity testing
polynomial time. Prime numbers are used in a number of applications such as hash table sizing, pseudorandom number generators and in key generation for cryptography
Schwartz–Zippel_lemma
Machine learning technique
involve no learning ("static routing"): It can be done by a deterministic hash function or a random number generator. MoE layers are used in the largest transformer
Mixture_of_experts
Repeated sum of a number's digits
roots and additive persistences in Java. import java.util.HashSet; public class DigitFunctions { // Sum of digits in base b static int digitSum(int x, int
Digital_root
Tree data structure
inserted element is always the new maximum. This structure uses dynamic perfect hashing to implement the tree in small space and moreover decrease the size
Van_Emde_Boas_tree
Cryptographic key agreement scheme
key from an attacker, the STS protocol uses no timestamps and provides perfect forward secrecy. It also entails two-way explicit key confirmation, making
Station-to-Station_protocol
Free and open-source VPN protocol
while BLAKE2s cryptographic hash functions, a faster and more compact version of SHA-3, are incorporated. Key derivation functions are handled using HKDF and
WireGuard
Type of cryptographic software obfuscation
to construct), but with the notable exception of collision-resistant hash function families. For this reason, it has been referred to as "crypto-complete"
Indistinguishability obfuscation
Indistinguishability_obfuscation
Set of rules defining correctly structured programs
such as an integer or a string, because they are implemented via a hash function. This makes for much faster lookup times, but requires keys to remain
Python_syntax_and_semantics
Freeware peer-to-peer file sharing program
can also be made with hashes instead of words and numbers. WinMX allows a person to host chatrooms with its built-in Chat function. There are some rooms
WinMX
Branch of pure mathematics
numbers, and perfect numbers. Important number-theoretic functions include the divisor-counting function, the divisor summatory function and its modifications
Number_theory
Mechanical cipher machine
The security of the M-209 was good for its time, but it was by no means perfect. As with the Lorenz Electric teletypewriter cipher machine (codenamed Tunny
M-209
Self-balancing binary search tree data structure
specifically uses red–black trees as part of its data structure. As of Java 8, the HashMap has been modified such that instead of using a LinkedList to store different
Red–black_tree
Virtual marketplace in the darknet
website on the dark web that operates via darknets such as Tor and I2P. They function primarily as black markets, selling or brokering transactions involving
Darknet_market
PERFECT HASH-FUNCTION
PERFECT HASH-FUNCTION
Surname or Lastname
French
French : from a pet form of the personal name P(i)erre, French form of Peter.English (Bristol) : variant of Parrott
Surname or Lastname
English
English : topographic name for someone who lived by an ash tree, a variant of Ash by misdivision of Middle English atten ash ‘at the ash’, or a habitational name from any of the many places in England and Wales named Nash, from this phrase, as for example Nash in Buckinghamshire, Herefordshire, or Shropshire. The name was established from an early date in Wales and Ireland.Jewish : of unknown origin, possibly an Americanized form of one or more like-sounding Jewish surnames.The surname Nash was taken to Ireland from England or Wales by a family who established themselves in Co. Kerry in the 13th century, during the second wave of Anglo-Norman settlement.
Boy/Male
Tamil
Perfect
Male
English
 Short form of English unisex Ashley, ASH means "ash-tree grove."Â
Male
Hindi/Indian
(यश) Hindi name YASH means "glory."
Girl/Female
Tamil
Nicika | நீஸீகா  Â
Perfect
Nicika | நீஸீகா  Â
Surname or Lastname
German
German : probably a habitational name from Haste near Wunstorf or Osnabrück.Dutch : nickname from Middle Dutch haest ‘hasty’.Swedish : soldier’s name, from hast ‘haste’, ‘hurry’.English (Lancashire and Yorkshire) : reduced form of Hayhurst.
Surname or Lastname
German
German : nickname for a swift runner or a timorous person, from Middle High German, Middle Low German hase ‘hare’.Jewish (Ashkenazic) : ornamental name from German Hase ‘hare’.English : from a Middle English nickname, Hase, from Old English hÄs ‘harsh, raucous, or hoarse voice’.Japanese : usually written with characters meaning ‘long valley’; habitational name from a place in Yamato (now Nara prefecture). Listed in the Shinsen shÅjiroku. Some bearers are descended from the Taira clan; they are found mainly in eastern Japan. Also pronounced Nagaya and Nagatani; the original pronunciation was Hatsuse, meaning ‘beginning of the strait’.
Female
Vietnamese
Vietnamese name HANH means "has good conduct."
Surname or Lastname
English
English : topographic name for someone who lived near an ash tree, or a habitational name from a place named with the Old English word æsc (see Ash). The Anglo-Norman French preposition de ‘of’, ‘from’ has become fused to the name.Americanized spelling of German Dasch.Indian : variant of Das.
Surname or Lastname
English
English : variant of Ash; the name arose as the result of misdivision of Middle English atter ashe ‘at the ash tree’ (Old English æt þǣre æsce).Jewish : of uncertain origin; the Guggenheimers consider it to be a variant of Rasch 1.Americanized spelling of German and Jewish Rasch.
Boy/Male
American, Australian, British, English, Hebrew, Hindu, Indian
From the Ash Tree Farm; Ash Trees Meadow; Felicitous
Surname or Lastname
English
English : from Middle English asche ‘ash tree’ (Old English æsc), hence a topographic name for someone living by an ash tree or a habitational name from any of the many places in southern and central England named with this word (Derbyshire, Dorset, Hampshire, Herefordshire, Kent, Surrey, Shropshire, Somerset, and elsewhere).In New England, Ash is commonly found for French Dufresne, with the same meaning.Jewish (Ashkenazic) : from an acronym for Yiddish AltSHul (see Altschul) or AyznSHtot (see Eisenstadt).
Boy/Male
Tamil
Perfect
Girl/Female
Australian, British, Chinese, English, Gujarati, Indian
Form of Ashley; Ash Tree Meadow
Girl/Female
Spanish
Perfect.
Surname or Lastname
English (Bristol)
English (Bristol) : variant of Parrott 1.
Surname or Lastname
English
English : variant of Parfitt.
Boy/Male
American, Australian, British, Chinese, Christian, English
Dweller by the Ash Tree; Adventurer; Cliff
Surname or Lastname
English
English : topographic name for someone who lived by an ash tree, from the Middle English phrase at(te) asche ‘at (the) ash’.Jewish (Ashkenazic) : metonymic occupational name for a maker or seller of bags and purses, from German Tasche ‘bag’, ‘purse’. Compare Taschner.
PERFECT HASH-FUNCTION
PERFECT HASH-FUNCTION
Boy/Male
Tamil
Lord of earth, King, Lord of the gods
Boy/Male
Hindu, Indian, Punjabi, Sikh
Beautiful Like Flowers
Boy/Male
Biblical English Hebrew
The Lord is good.
Female
Greek
(Θάλεια) Greek name derived from the word thallein, THALEIA means "blooming, flourishing." In mythology, this is the name of the muse of comedy and pastoral poetry.
Male
English
Anglicized form of Latin Premislaus, PREMISLAS means "cunning."
Boy/Male
Hindu, Indian
Brightness of Good Shiva
Boy/Male
Bengali, Hindu, Indian, Malayalam, Marathi, Mythological, Sanskrit
A Rishi
Girl/Female
Gujarati, Hindu, Indian, Kannada, Sanskrit, Telugu
A Raga
Girl/Female
Muslim
Gold maker
Boy/Male
Bengali, Gujarati, Hindu, Indian, Kannada, Telugu
Blessing of Goddess Parvati
PERFECT HASH-FUNCTION
PERFECT HASH-FUNCTION
PERFECT HASH-FUNCTION
PERFECT HASH-FUNCTION
PERFECT HASH-FUNCTION
n.
Failing; fault; imperfection, whether physical or moral; blemish; as, a defect in the ear or eye; a defect in timber or iron; a defect of memory or judgment.
n.
A sash.
n.
The perfect tense, or a form in that tense.
3d pers. sing. pres.
Has.
a.
Liable to defect; imperfect.
adv.
In a perfect manner or degree; in or to perfection; completely; wholly; throughly; faultlessly.
n.
A Roman officer who controlled or superintended a particular command, charge, department, etc.; as, the prefect of the aqueducts; the prefect of a camp, of a fleet, of the city guard, of provisions; the pretorian prefect, who was commander of the troops guarding the emperor's person.
imp. & p. p.
of Perfect
superl.
Uttered or undertaken with too much haste or too little reflection; as, rash words; rash measures.
v. t.
To cover with water or any liquid; to wet; to fall on and moisten; hence, to overflow or dash against; as, waves wash the shore.
a.
Not perfect; not complete in all its parts; wanting a part; deective; deficient.
n.
One who, or that which, makes perfect.
a.
To make perfect; to finish or complete, so as to leave nothing wanting; to give to anything all that is requisite to its nature and kind.
n.
To /hop into small pieces; to mince and mix; as, to hash meat.
v. t.
To furnish with a sash or sashes; as, to sash a door or a window.
v. t.
To make imperfect.
a.
Imperfect.
v. t.
To strike with a lash ; to whip or scourge with a lash, or with something like one.
n.
The imperfect tense; or the form of a verb denoting the imperfect tense.
a.
Perfect.