heap

Random Word
ペースメーカー

Other Services | Word Index | Contact Us | About | Links

heap | domain availability

Dictionary and Thesaurus entries for:

Your search results...

heap [n][en]

1)	a car that is old and unreliable; "the fenders had fallen off that old bus"

Synonyms :

bus jalopy ônibus calhambeque montón autobús автобус 巴士 куча cacharro 堆 драндулет バス 버스 ヒープおんぼろ車 macinino tas tacot 힙 고물

See Also:

auto dysphemism

2)	a collection of objects laid on top of each other

Synonyms :

cumulus mound pile montículo pilha montón 帘 куча кучевые 积云堆 pila Курган 桩 고분 적운 더미 積雲ヒープマウンド杭 tumulo mucchio stapel tas 힙

See Also:

accumulate pile jam compost_heap dunghill scrapheap shock slagheap stack funeral_pyre woodpile stockpile

3)	(often followed by `of') a large number or amount or extent; "a batch of letters"; "a deal of trouble"; "a lot of money"; "he made a mint on the stock market"; "it must have cost plenty"

Synonyms :

batch deal flock good_deal great_deal hatful lot mass mess mickle mint muckle peck pile plenty pot quite_a_little raft sight slew spate stack tidy_sum wad whole_lot whole_slew lote massa visão rebanho bom_negócio grande pântano bagunça hortelã pilha muito_pouco jangada vaga soma_arrumada lote_inteiro montão montón 班 пакетный 批处理 мята 一大笔钱 desorden 混乱 куча 锅 rebaño 交易 buena mucho стадо 薄荷 serie 羊群 хорошее_дело многое 大量回转堆 pila много todo_un_poco массовые неразбериха 一连串很多大众米克尔 mató 马克尔弗 пек банка suma_ordenada 啄 очень_мало плот 桩不少小 убил волна стек кругленькая_сумма 堆栈 Уйма 瓦德一大堆全回转 floß batch_- 배치 バッハいかだバット群れ 뭉치 주차장 뗏목 confusione topf 무리 désordre 거래 더미 gregge 썰물 取り決め troupeau herde flut ごたまぜかなりの多大な帽子一杯ヒープ多くのたくさんの質量ミントつつく杭かなりの量の景色スルーレート相次ぐスタックきれい合計札束全体の多くの全体のスルー cappellate mucchio un_bel_po_' zattera uccise ondata tutta_la_uccise viel durcheinander kleinvieh picken stapel ein_ganz_kleines anblick erschlug batzen ganze_menge ganze_reihe tas assez_peu radeau vue tuèrent tidy_somme ensemble_tua 좋은_거래 좋은_계약 힙 냄비 많이 질량 엉망 민트 아주_조금 보기 진창 스택 상당한_액수 훨씬 전체_돌리다

heap [v][en]

1)	fill to overflow; "heap the platter with potatoes"

Synonyms :

montón 堆ヒープ tas 힙

See Also:

fill batch

2)	arrange in stacks; "heap firewood around the fireplace"; "stack your books up on the shelves"

Synonyms :

pile stack pilha montón 堆 pila 桩 стек 堆栈ヒープ杭スタック mucchio stapel tas 힙 스택

See Also:

arrange cumulus heap_up stack stacker rick cord

3)	bestow in large quantities; "He heaped him with work"; "She heaped scorn upon him"

Synonyms :

montón 堆ヒープ tas 힙

See Also:

give batch

From The Free On-line Dictionary of Computing: (http://www.foldoc.org/, Editor Denis Howe)

1. An area of memory used for dynamic memory allocation where blocks of memory are allocated and freed in an arbitrary order and the pattern of allocation and size of blocks is not known until run time. Typically, a program has one heap which it may use for several different purposes.

Heap is required by languages in which functions can return arbitrary data structures or functions with free variables (see closure). In C functions malloc and free provide access to the heap.

Contrast stack. See also dangling pointer.

2. A data structure with its elements partially ordered (sorted) such that finding either the minimum or the maximum (but not both) of the elements is computationally inexpensive (independent of the number of elements), while both adding a new item and finding each subsequent smallest/largest element can be done in O(log n) time, where n is the number of elements.

Formally, a heap is a binary tree with a key in each node, such that all the leaves of the tree are on two adjacent levels; all leaves on the lowest level occur to the left and all levels, except possibly the lowest, are filled; and the key in the root is at least as large as the keys in its children (if any), and the left and right subtrees (if they exist) are again heaps.

Note that the last condition assumes that the goal is finding the minimum quickly.

Heaps are often implemented as one-dimensional arrays. Still assuming that the goal is finding the minimum quickly the invariant is

heap[i] <= heap[2*i] and heap[i] <= heap[2*i+1] for all i,

where heap[i] denotes the i-th element, heap[1] being the first. Heaps can be used to implement priority queues or in sort algorithms.

(1996-02-26)

Your Search History - clear
heap |