-
1 der Einsatz
- {application} sự gắn vào, sự áp vào, sự ghép vào, sự đính vào, sự đắp vào, sự tra vào appliance), vật gắn, vật áp, vật ghép, vật đính, vật đắp, vật tra, sự dùng, sự áp dụng, sự ứng dụng, sự chuyên cần - sự chuyên tâm, lời xin, lời thỉnh cầu, đơn xin - {commitment} committal, trát bắt giam, sự phạm, sự đưa đi đánh - {cue} vĩ bạch, sự gợi ý, sự ra hiệu, lời nói bóng, lời ám chỉ, ám hiệu, lời chú thích, tín hiệu, vai tuồng, cách xử lý thích hợp, hành động thích hơn, tâm trạng, gậy chơi bi-a, tóc đuôi sam - {dedication} sự cống hiến, sự hiến dâng, lời đề tặng - {encouragement} sự làm can đảm, sự làm mạnh dạn, sự khuyến khích, sự cổ vũ, sự động viên, sự giúp đỡ, sự ủng hộ - {pool} vũng, ao, bể bơi, vực, tiền góp, hộp đựng tiền góp, trò đánh cá góp tiền, tiền góp đánh cá, vốn chung, vốn góp, Pun, khối thị trường chung, trò chơi pun - {risk} sự liều, sự mạo hiểm, sự rủi ro, sự nguy hiểm - {service} cây thanh lương trà service-tree), sự phục vụ, sự hầu hạ, ban, vụ, sở, cục, ngành phục vụ, sự có ích, sự giúp ích, sự chỉ dẫn bảo quản, sự giúp đỡ bảo quản, chỗ làm, việc làm, chức vụ - tàu xe phục vụ trên một tuyến đường, bộ, sự tế lễ, buổi lễ, sự giao bóng, lượt giao bóng, cú giao bóng, cách giao bóng, sự tống đạt, sự gửi - {wager} sự đánh cuộc = der Einsatz (Kleid) {insertion; inset}+ = der Einsatz (Musik) {attack; entry}+ = der Einsatz (Pfand) {pledge}+ = der Einsatz (Spiel) {stake}+ = der Einsatz (Technik) {insert}+ = der Einsatz (Militär) {action; operation}+ = ohne Einsatz spielen {to play for love}+ = der westenartige Einsatz {vest}+ = den Einsatz verpassen {to miss one's entry}+
См. также в других словарях:
Hilbert R-tree — Hilbert R tree, an R tree variant, is an index for multidimensional objects like lines, regions, 3 D objects, or high dimensional feature based parametric objects. It can be thought of as an extension to B+ tree for multidimensional objects.The… … Wikipedia
B-tree — In computer science, a B tree is a tree data structure that keeps data sorted and allows searches, insertions, and deletions in logarithmic amortized time. It is most commonly used in databases and filesystems. In B trees, internal (non leaf)… … Wikipedia
AA tree — In computer science, AA trees (Arne Andersson trees) are a form of balanced trees used for storing and retrieving ordereddata efficiently.Unlike red black trees, red nodes on an AA tree can only be added as a right subchild. In other words, no… … Wikipedia
2-3-4 tree — A 2 3 4 tree (also called a 2 4 tree), in computer science, is a self balancing data structure that is commonly used to implement dictionaries. 2 3 4 trees are B trees of order 4; like B trees in general, they can search, insert and delete in… … Wikipedia
Binary search tree — In computer science, a binary search tree (BST) is a binary tree data structurewhich has the following properties: *each node (item in the tree) has a value; *a total order (linear order) is defined on these values; *the left subtree of a node… … Wikipedia
Red-black tree — A red black tree is a type of self balancing binary search tree, a data structure used in computer science, typically used to implement associative arrays. The original structure was invented in 1972 by Rudolf Bayer who called them symmetric… … Wikipedia
T-tree — In computer science a T tree is a type of binary tree data structure that is used by main memory databases, such as DataBlitz, e X treme DB, MySQL Cluster, Oracle TimesTen and [http://www.kairosdbms.com Kairos] [http://www.emware.co.kr… … Wikipedia
B+ tree — In computer science, a B+ tree is a type of tree which represents sorted data in a way that allows for efficient insertion, retrieval and removal of records, each of which is identified by a key . It is a dynamic, multilevel index, with maximum… … Wikipedia
Cover tree — The cover tree is a type of data structure in computer science that is specifically designed to facilitate the speed up of a nearest neighbor search. It is a refinement of the Navigating Net data structure, and related to a variety of other data… … Wikipedia
R-tree — R trees are tree data structures that are similar to B trees, but are used for spatial access methods i.e., for indexing multi dimensional information; for example, the (X, Y) coordinates of geographical data. A common real world usage for an R… … Wikipedia
Segment tree — In computer science, a segment tree is a tree data structure for storing intervals, or segments. It allows querying which of the stored segments contain a given point. It is, in principle, a static structure; that is, its content cannot be… … Wikipedia
