English Dictionary: flawlessly | by the DICT Development Group |
From WordNet (r) 3.0 (2006) [wn]: | |
| |
From WordNet (r) 3.0 (2006) [wn]: | |
From WordNet (r) 3.0 (2006) [wn]: | |
| |
From WordNet (r) 3.0 (2006) [wn]: | |
| |
From Webster's Revised Unabridged Dictionary (1913) [web1913]: | |
Fallals \Fal"*lals`\, n.pl. Gay ornaments; frippery; gewgaws. [Colloq.] --Thackeray. | |
From Webster's Revised Unabridged Dictionary (1913) [web1913]: | |
Fellowless \Fel"low*less\, a. Without fellow or equal; peerless. Whose well-built walls are rare and fellowless. --Chapman. | |
From Webster's Revised Unabridged Dictionary (1913) [web1913]: | |
Fellowlike \Fel"low*like`\, a. Like a companion; companionable; on equal terms; sympathetic. [Obs.] --Udall. | |
From Webster's Revised Unabridged Dictionary (1913) [web1913]: | |
Flawless \Flaw"less\, a. Free from flaws. --Boyle. | |
From Webster's Revised Unabridged Dictionary (1913) [web1913]: | |
Flea-louse \Flea"-louse`\, n. (Zo[94]l.) A jumping plant louse of the family {Psyllid[91]}, of many species. That of the pear tree is {Psylla pyri}. | |
From The Free On-line Dictionary of Computing (15Feb98) [foldoc]: | |
File Allocation Table 95} {file system} which describes the {files}, {directories}, and free space on a {hard disk} or {floppy disk}. A disk is divided into {partitions}. Under the FAT {file system} each partition is divided into {clusters}, each of which can be one or more {sectors}, depending on the size of the partition. Each cluster is either allocated to a file or directory or it is free (unused). A directory lists the name, size, modification time and starting cluster of each file or subdirectory it contains. At the start of the partition is a table (the FAT) with one entry for each cluster. Each entry gives the number of the next cluster in the same file or a special value for "not allocated" or a special value for "this is the last cluster in the chain". The first few clusters after the FAT contain the {root directory}. The FAT file system was originally created for the {CP/M}[?] {operating system} where files were catalogued using 8-bit addressing. {MS DOS}'s FAT allows only {8.3} filenames. With the introduction of MS-DOS 4 an incompatible 16-bit FAT (FAT16) with 32-kilobyte {clusters} was introduced that allowed {partitions} of up to 2 gigabytes. Microsoft later created {FAT32} to support partitions larger than two gigabytes and {pathnames} greater that 256 characters. It also allows more efficient use of disk space since {clusters} are four kilobytes rather than 32 kilobytes. FAT32 was first available in {OEM} Service Release 2 of {Windows 95} in 1996. It is not fully {backward compatible} with the 16-bit and 8-bit FATs. {IDG article (http://www.idg.net/idgframes/english/content.cgi?vc=docid_9-62525.html)}. {(http://home.c2i.net/tkjoerne/os/fat.htm)}. {(http://www.teleport.com/~brainy/)}. {(http://209.67.75.168/hardware/fatgen.htm)}. {(http://support.microsoft.com/support/kb/articles/q154/9/97.asp)}. Compare: {NTFS}. [How big is a FAT? Is the term used outside MS DOS? How long is a FAT16 filename?] (2000-02-05) | |
From The Free On-line Dictionary of Computing (15Feb98) [foldoc]: | |
fully lazy lambda lifting John Hughes's optimisation of {lambda lifting} to give {full laziness}. {Maximal free expression}s are shared to minimise the amount of recalculation. Each inner sub-expression is replaced by a function of its maximal free expressions (expressions not containing any {bound variable}) applied to those expressions. E.g. f = \ x . (\ y . (+) (sqrt x) y) ((+) (sqrt x)) is a maximal free expression in (\ y . (+) (sqrt x) y) so this inner {abstraction} is replaced with (\ g . \ y . g y) ((+) (sqrt x)) Now, if a {partial application} of f is shared, the result of evaluating (sqrt x) will also be shared rather than re-evaluated on each application of f. As Chin notes, the same benefit could be achieved without introducing the new {higher-order function}, g, if we just extracted out (sqrt x). This is similar to the {code motion} optimisation in {procedural language}s where constant expressions are moved outside a loop or procedure. (1994-12-01) |