| slovo | definícia |
mapping
(encz) | mapping,mapující luke |
mapping
(gcide) | mapping \mapping\ n. (Math.)
A function such that for every element of one set there is a
unique element of another set.
Syn: map, correspondence.
[WordNet 1.5] |
Mapping
(gcide) | Map \Map\, v. t. [imp. & p. p. Mapped; p. pr. & vb. n.
Mapping.]
To represent by a map; -- often with out; as, to survey and
map, or map out, a county. Hence, figuratively: To represent
or indicate systematically and clearly; to sketch; to plan;
as, to map, or map out, a journey; to map out business.
[1913 Webster]
I am near to the place where they should meet, if
Pisanio have mapped it truly. --Shak.
[1913 Webster] |
mapping
(wn) | mapping
n 1: (mathematics) a mathematical relation such that each
element of a given set (the domain of the function) is
associated with an element of another set (the range of the
function) [syn: function, mathematical function,
single-valued function, map, mapping]
2: (genetics) the process of locating genes on a chromosome
[syn: mapping, chromosome mapping] |
mapping
(foldoc) | function
mapping
1. (Or "map", "mapping") If D and C are sets
(the domain and codomain) then a function f from D to C,
normally written "f : D -> C" is a subset of D x C such that:
1. For each d in D there exists some c in C such that (d,c) is
an element of f. I.e. the function is defined for every
element of D.
2. For each d in D, c1 and c2 in C, if both (d,c1) and (d,c2)
are elements of f then c1 = c2. I.e. the function is uniquely
defined for every element of D.
See also image, inverse, partial function.
2. Computing usage derives from the mathematical
term but is much less strict. In programming (except in
functional programming), a function may return different
values each time it is called with the same argument values
and may have side effects.
A procedure is a function which returns no value but has
only side-effects. The C language, for example, has no
procedures, only functions. ANSI C even defines a type,
void, for the result of a function that has no result.
(1996-09-01)
|
| | podobné slovo | definícia |
mappings
(mass) | mappings
- mapovanie |
chromosome mapping
(encz) | chromosome mapping, n: |
mapping
(encz) | mapping,mapující luke |
mappings
(encz) | mappings,mapování n: Zdeněk Brož |
defense mapping agency
(czen) | Defense Mapping Agency,DMA[zkr.] [voj.] Zdeněk Brož a automatický
překlad |
mapping
(gcide) | mapping \mapping\ n. (Math.)
A function such that for every element of one set there is a
unique element of another set.
Syn: map, correspondence.
[WordNet 1.5]Map \Map\, v. t. [imp. & p. p. Mapped; p. pr. & vb. n.
Mapping.]
To represent by a map; -- often with out; as, to survey and
map, or map out, a county. Hence, figuratively: To represent
or indicate systematically and clearly; to sketch; to plan;
as, to map, or map out, a journey; to map out business.
[1913 Webster]
I am near to the place where they should meet, if
Pisanio have mapped it truly. --Shak.
[1913 Webster] |
chromosome mapping
(wn) | chromosome mapping
n 1: (genetics) the process of locating genes on a chromosome
[syn: mapping, chromosome mapping] |
mapping
(wn) | mapping
n 1: (mathematics) a mathematical relation such that each
element of a given set (the domain of the function) is
associated with an element of another set (the range of the
function) [syn: function, mathematical function,
single-valued function, map, mapping]
2: (genetics) the process of locating genes on a chromosome
[syn: mapping, chromosome mapping] |
banach inverse mapping theorem
(foldoc) | Banach inverse mapping theorem
In a Banach space the inverse to a
continuous linear mapping is continuous.
(1998-06-25)
|
constant mapping
(foldoc) | constant mapping
A precursor to ARP used by some TCP software in
which the destination Ethernet address is constructed from the
top 24 bits of the source Ethernet address followed by the low
24 bits of the (class A) destination Internet address. For this
scheme the top 24 bits of the Ethernet address must be the same on
all hosts on the network.
(2014-08-06)
|
mapping
(foldoc) | function
mapping
1. (Or "map", "mapping") If D and C are sets
(the domain and codomain) then a function f from D to C,
normally written "f : D -> C" is a subset of D x C such that:
1. For each d in D there exists some c in C such that (d,c) is
an element of f. I.e. the function is defined for every
element of D.
2. For each d in D, c1 and c2 in C, if both (d,c1) and (d,c2)
are elements of f then c1 = c2. I.e. the function is uniquely
defined for every element of D.
See also image, inverse, partial function.
2. Computing usage derives from the mathematical
term but is much less strict. In programming (except in
functional programming), a function may return different
values each time it is called with the same argument values
and may have side effects.
A procedure is a function which returns no value but has
only side-effects. The C language, for example, has no
procedures, only functions. ANSI C even defines a type,
void, for the result of a function that has no result.
(1996-09-01)
|
object relational mapping
(foldoc) | object relational mapping
object relational modelling
(ORM) The software development activity
that defines a correspondence between objects in a program and
rows in a database table. Atomic object properties
correspond to columns in the table, non-atomic data types and
relations between objects are represented as foreign keys
referring to other tables.
An object persistence mechanism is responsible for maintaining
the correspondence between objects and the database contents at
run-time.
(2014-12-03)
|
sector mapping
(foldoc) | sector mapping
In this scheme the memory and cache are divided into blocks
of 2^m bytes (the cache line size). A sector consists of
2^n consecutive blocks.
When a block is cached, it is read into the correct position
in any sector of the cache, given by discarding the bottom m
address bits and taking the next n as the block number within
the sector.
That whole sector is then tagged with the remaining upper
address bits and the other blocks in the sector are marked as
invalid. This scheme takes advantage of locality of reference
to consecutive blocks and needs fewer tags thus reducing the
cost of associative access to the tags.
|
|