mergeable

mergeable
That can be merged.

Wikipedia foundation.

Игры ⚽ Поможем решить контрольную работу

Look at other dictionaries:

  • Top Trees — The Top Tree is a binary tree based data structure for unrooted dynamic trees which is used mainly for carrying out various path related operations, it allows simple Divide and conquer algorithms. It has since been augmented to maintain… …   Wikipedia

  • Сливаемая куча — У этого термина существуют и другие значения, см. Куча (значения). Сливаемая куча (англ. Mergeable heap) структура данных, которая поддерживает следующие пять операций: Создание пустой кучи (англ. Make heap); Вставка узла в кучу… …   Википедия

  • Binomial heap — In computer science, a binomial heap is a heap similar to a binary heap but also supporting the operation of merging two heaps quickly. This is achieved by using a special tree structure. It is important as an implementation of the mergeable heap …   Wikipedia

  • Sound Blaster X-Fi — XtremeGamer Fatal1ty Pro Sound Blaster X Fi is a lineup of sound cards in Creative Labs Sound Blaster series. Contents 1 …   Wikipedia

  • ASTM E 1714 — is a Standard Guide for Properties of a Universal Healthcare Identifier (UHID). This standard was create by the Association for Information and Image Management and ASTM International. It defines thirty characteristics required of a UHID. The… …   Wikipedia

  • TinyLinux — is a project led by Matt Mackall to reduce the size of the Linux kernel, in both memory usage and binary filesize. It is also known as the tiny tree.TinyLinux consists of a set of patches against the Linux kernel which make certain features… …   Wikipedia

  • unmergeable — adjective Not mergeable. Syn: uncombinable …   Wiktionary

  • Wikipedia:Criteria for speedy deletion — For requests to hide the contents of edit summaries, see Wikipedia:Oversight. WP:SPEEDY redirects here. For the guideline discussing when to end deletion debates early as keep , see Wikipedia:Speedy keep. For the list of current candidates for… …   Wikipedia

  • объединенное дерево — сортируемая “куча” Частично упорядоченная структура данных в виде бинарного дерева, допускающего сортировку данных путем вставки и исключения элементов, их объединения, а также нахождения минимального элемента. [Л.М. Невдяев.… …   Справочник технического переводчика

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”