dynamic link - определение. Что такое dynamic link
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

Что (кто) такое dynamic link - определение

DATA STRUCTURE FOR REPRESENTING A FOREST, A SET OF ROOTED TREES
Link-cut tree; Link cut tree; Dynamic tree; Dynamic trees
  • Demonstrating how nodes are stored by depth in the link-cut tree
  • During an access old preferred paths are broken and replaced with path-parent pointers, while the accessed node is splayed to the root of the tree
  • Showing how a link cut tree transforms preferred paths into a forest of trees.

dynamic link      
<compiler> A pointer from an activation record to the activation record for the scope from which the current scope was called at run time. This is used in a {statically scoped} language to restore the environment pointer on exit from a scope. To access a non-local variable in a dynamically scoped language, dynamic links are followed until a binding for the given variable name is found. (1995-03-07)
dynamic link library         
MICROSOFT'S IMPLEMENTATION OF THE SHARED LIBRARY CONCEPT IN WINDOWS AND OS/2
Dynamically linked library; Dynamic link library; .dll; Dynamically Linked Library; Dll files; Dynamic-Link Libraries; Declspec; Dllimport; Dllexport; Dynamic-Link Library; Dynamic Link Library; Dynamic Link Libraries; Microsoft Dynamic Link Library; Dynamic-link libraries; DLL file; DLL spoofing; DLL hijacking; .drv; Dynamically linked; RUNDLL.EXE; RUNDLL32.EXE; Rundll32.exe; Rundll.exe; Rundll; RUNDLL; RUNDLL32; Rundll32
Dynamically Linked Library         
MICROSOFT'S IMPLEMENTATION OF THE SHARED LIBRARY CONCEPT IN WINDOWS AND OS/2
Dynamically linked library; Dynamic link library; .dll; Dynamically Linked Library; Dll files; Dynamic-Link Libraries; Declspec; Dllimport; Dllexport; Dynamic-Link Library; Dynamic Link Library; Dynamic Link Libraries; Microsoft Dynamic Link Library; Dynamic-link libraries; DLL file; DLL spoofing; DLL hijacking; .drv; Dynamically linked; RUNDLL.EXE; RUNDLL32.EXE; Rundll32.exe; Rundll.exe; Rundll; RUNDLL; RUNDLL32; Rundll32
<library> (DLL) A library which is linked to {application programs} when they are loaded or run rather than as the final phase of compilation. This means that the same block of library code can be shared between several tasks rather than each task containing copies of the routines it uses. The executable is compiled with a library of "stubs" which allow link errors to be detected at compile-time. Then, at {run time}, either the system loader or the task's entry code must arrange for library calls to be patched with the addresses of the real shared library routines, possibly via a jump table. The alternative is to make library calls part of the operating system kernel and enter them via some kind of trap instruction. This is generally less efficient than an ordinary subroutine call. It is important to ensure that the version of a dynamically linked library is compatible with what the executable expects. Examples of operating systems using dynamic linking are SunOS (.so - shared object files), Microsoft Windows (.dll) and RISC OS on the Acorn Archimedes (relocatable modules). (1995-12-12)

Википедия

Link/cut tree


A link/cut tree is a data structure for representing a forest, a set of rooted trees, and offers the following operations:

  • Add a tree consisting of a single node to the forest.
  • Given a node in one of the trees, disconnect it (and its subtree) from the tree of which it is part.
  • Attach a node to another node as its child.
  • Given a node, find the root of the tree to which it belongs. By doing this operation on two distinct nodes, one can check whether they belong to the same tree.

The represented forest may consist of very deep trees, so if we represent the forest as a plain collection of parent pointer trees, it might take us a long time to find the root of a given node. However, if we represent each tree in the forest as a link/cut tree, we can find which tree an element belongs to in O(log(n)) amortized time. Moreover, we can quickly adjust the collection of link/cut trees to changes in the represented forest. In particular, we can adjust it to merge (link) and split (cut) in O(log(n)) amortized time.

Link/cut trees divide each tree in the represented forest into vertex-disjoint paths, where each path is represented by an auxiliary data structure (often splay trees, though the original paper predates splay trees and thus uses biased binary search trees). The nodes in the auxiliary data structure are ordered by their depth in the corresponding represented tree. In one variation, Naive Partitioning, the paths are determined by the most recently accessed paths and nodes, similar to Tango Trees. In Partitioning by Size paths are determined by the heaviest child (child with the most children) of the given node. This gives a more complicated structure, but reduces the cost of the operations from amortized O(log n) to worst case O(log n). It has uses in solving a variety of network flow problems and to jive data sets.

In the original publication, Sleator and Tarjan referred to link/cut trees as "dynamic trees", or "dynamic dyno trees".