English Dictionary: iterative aspect | 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 Webster's Revised Unabridged Dictionary (1913) [web1913]: | |
Ioduret \I*od"u*ret\, n. (Chem.) Iodide. [Obs.] | |
From Webster's Revised Unabridged Dictionary (1913) [web1913]: | |
Iodyrite \I*od"y*rite\, n. [From {Iodine}.] (Min.) Silver iodide, a mineral of a yellowish color. | |
From Webster's Revised Unabridged Dictionary (1913) [web1913]: | |
Iterate \It"er*ate\, a. [L. iteratus, p. p. of iterare to repeat, fr. iterum again, prop. a compar. from the stem of is he, that; cf. L. ita so, item likewise, also, Skr. itara other, iti thus. Cf. {Identity}, {Item}.] Uttered or done again; repeated. [Obs.] --Bp. Gardiner. | |
From Webster's Revised Unabridged Dictionary (1913) [web1913]: | |
Iterate \It"er*ate\, v. t. [imp. & p. p. {Iterated}; p. pr. & vb. n. {Iterating}.] To utter or do a second time or many times; to repeat; as, to iterate advice. Nor Eve to iterate Her former trespass feared. --Milton. | |
From Webster's Revised Unabridged Dictionary (1913) [web1913]: | |
Iterate \It"er*ate\, adv. By way of iteration. | |
From Webster's Revised Unabridged Dictionary (1913) [web1913]: | |
Iterate \It"er*ate\, v. t. [imp. & p. p. {Iterated}; p. pr. & vb. n. {Iterating}.] To utter or do a second time or many times; to repeat; as, to iterate advice. Nor Eve to iterate Her former trespass feared. --Milton. | |
From Webster's Revised Unabridged Dictionary (1913) [web1913]: | |
Iterate \It"er*ate\, v. t. [imp. & p. p. {Iterated}; p. pr. & vb. n. {Iterating}.] To utter or do a second time or many times; to repeat; as, to iterate advice. Nor Eve to iterate Her former trespass feared. --Milton. | |
From Webster's Revised Unabridged Dictionary (1913) [web1913]: | |
Iteration \It`er*a"tion\, n. [L. iteratio.] Recital or performance a second time; repetition. --Bacon. What needs this iteration, woman? --Shak. | |
From Webster's Revised Unabridged Dictionary (1913) [web1913]: | |
Iterative \It"er*a*tive\, a. [L. iterativus: cf. F. it[82]ratif.] Repeating. --Cotgrave. -- {It"er*a*tive*ly}, adv. | |
From Webster's Revised Unabridged Dictionary (1913) [web1913]: | |
Iterative \It"er*a*tive\, a. [L. iterativus: cf. F. it[82]ratif.] Repeating. --Cotgrave. -- {It"er*a*tive*ly}, adv. | |
From The Free On-line Dictionary of Computing (15Feb98) [foldoc]: | |
Iterated Function System natural-looking forms like ferns or snowflakes. Iterated Function Systems use a very easy transformation that is done recursively. (1998-04-04) | |
From The Free On-line Dictionary of Computing (15Feb98) [foldoc]: | |
iteration fundamental part of many {algorithms}. Iteration is characterised by a set of initial conditions, an iterative step and a termination condition. A well known example of iteration in mathematics is Newton-Raphson iteration. Iteration in programs is expressed using {loops}, e.g. in {C}: new_x = n/2; do { x = new_x; new_x = 0.5 * (x + n/x); } while (abs(new_x-x) > epsilon); Iteration can be expressed in functional languages using recursion: solve x n = if abs(new_x-x) > epsilon then solve new_x n else new_x where new_x = 0.5 * (x + n/x) solve n/2 n (1998-04-04) | |
From The Free On-line Dictionary of Computing (15Feb98) [foldoc]: | |
iterative deepening A graph search algorithm. When searching for a path through a graph from a given initial node to a solution node with some desired property, a {depth-first search} may never find a solution if it enters a cycle in the graph. We can either add an explicit check for cycles so that we never extend a path with a node it already contains or we can use iterative deepening where we explore all paths up to length (or "depth") N, starting from N=0 and increasing N until a solution is found. (1995-02-14) | |
From The Free On-line Dictionary of Computing (15Feb98) [foldoc]: | |
iterator from a {list}, {array} or {stream} one at a time. By extension, the term can be used for an object or routine for accesing items from any data structure that can be viewed as a list. For example, a {traverser} is an {iterator} for {tree}-shaped data structures. (2001-10-04) | |
From Easton's 1897 Bible Dictionary [easton]: | |
Ithrite two of David's warriors so designated (2 Sam. 23:38; 1 Chr. 11:40). |