| slovo | definícia |
mutually
(mass) | mutually
- navzájom |
mutually
(encz) | mutually,navzájem Zdeněk Brož |
mutually
(encz) | mutually,vzájemně adv: Zdeněk Brož |
Mutually
(gcide) | Mutually \Mu"tu*al*ly\, adv.
In a mutual manner.
[1913 Webster] |
mutually
(wn) | mutually
adv 1: in a mutual or shared manner; "the agreement was mutually
satisfactory"; "the goals of the negotiators were not
reciprocally exclusive" [syn: mutually, reciprocally] |
| | podobné slovo | definícia |
mutually beneficial
(encz) | mutually beneficial, adj: |
mutually exclusive
(encz) | mutually exclusive,vzájemně se vylučující [mat.] Martin Marble Beránek |
mutually intelligible languages
(encz) | mutually intelligible languages,sobě podobné jazyky n: pl. jako čeština
a slovenština či srbština, chorvatština a bosenština Jirka Daněk |
mutually ruinous
(encz) | mutually ruinous, adj: |
interdependent mutualist mutually beneficial
(gcide) | Dependent \De*pend"ent\, a. [L. dependens, -entis, p. pr.
dependere. See Depend, and cf. Dependant.]
1. Hanging down; as, a dependent bough or leaf.
[1913 Webster]
2. Relying on, or subject to, something else for support; not
able to exist, or sustain itself, or to perform anything,
without the will, power, or aid of something else; not
self-sustaining; subordinate; -- often with on or upon;
as, dependent on God; dependent upon friends. Opposite of
independent. [Narrower terms: {interdependent,
mutualist, mutually beneficial}; {parasitic, parasitical,
leechlike, bloodsucking}; subordinate; underage;
myrmecophilous; symbiotic] Also See: unfree.
[1913 Webster]
England, long dependent and degraded, was again a
power of the first rank. --Macaulay.
[1913 Webster]
3. conditional; contingent or conditioned. Opposite of
unconditional.
Syn: qualified.
[WordNet 1.5]
4. addicted to drugs.
Syn: addicted, dependent, drug-addicted, hooked, strung-out.
[WordNet 1.5]
Dependent covenant or Dependent contract (Law), one not
binding until some connecting stipulation is performed.
Dependent variable (Math.), a varying quantity whose
changes are arbitrary, but are regarded as produced by
changes in another variable, which is called the
independent variable.
[1913 Webster] |
Intermutually
(gcide) | Intermutual \In`ter*mu"tu*al\ (?; 135), a.
Mutual. [Obs.] --Daniel. -- In`ter*mu"tu*al*ly, adv. [Obs.]
[1913 Webster] |
Mutually
(gcide) | Mutually \Mu"tu*al*ly\, adv.
In a mutual manner.
[1913 Webster] |
Mutually equiangular
(gcide) | Equiangular \E`qui*an"gu*lar\, a. [Equi- + angular. Cf.
Equangular.]
Having equal angles; as, an equiangular figure; a square is
equiangular.
[1913 Webster]
Equiangular spiral. (Math.) See under Spiral, n.
Mutually equiangular, applied to two figures, when every
angle of the one has its equal among the angles of the
other.
[1913 Webster] |
Mutually equilateral
(gcide) | Equilateral \E`qui*lat"er*al\, a. [L. aequilateralis; aequus
equal + latus, lateris, side: cf. F. ['e]quilat['e]ral.]
Having all the sides equal; as, an equilateral triangle; an
equilateral polygon.
[1913 Webster]
Equilateral hyperbola (Geom.), one whose axes are equal.
Equilateral shell (Zo["o]l.), one in which a transverse
line drawn through the apex of the umbo bisects the valve,
or divides it into two equal and symmetrical parts.
Mutually equilateral, applied to two figures, when every
side of the one has its equal among the sides of the
other.
[1913 Webster] |
mutually beneficial
(wn) | mutually beneficial
adj 1: mutually dependent [syn: interdependent, mutualist,
mutually beneficial] |
mutually exclusive
(wn) | mutually exclusive
adj 1: unable to be both true at the same time [syn:
contradictory, mutually exclusive] |
mutually recursive
(foldoc) | recursion
mutually recursive
mutual recursion
recurse
recursive
When a function (or procedure)
calls itself. Such a function is called "recursive". If the
call is via one or more other functions then this group of
functions are called "mutually recursive".
If a function will always call itself, however it is called,
then it will never terminate. Usually however, it first
performs some test on its arguments to check for a "base case"
- a condition under which it can return a value without
calling itself.
The canonical example of a recursive function is
factorial:
factorial 0 = 1
factorial n = n * factorial (n-1)
Functional programming languages rely heavily on recursion,
using it where a procedural language would use iteration.
See also recursion, recursive definition, tail recursion.
[Jargon File]
(1996-05-11)
|
|