视频教程
界面
要领
高级
实用建议
UnigineEditor
界面概述
资产工作流程
设置和首选项
项目开发
调整节点参数
Setting Up Materials
Setting Up Properties
照明
Landscape Tool
Sandworm
使用编辑器工具执行特定任务
Extending Editor Functionality
嵌入式节点类型
Nodes
Objects
Effects
Decals
Light Sources
Geodetics
World Objects
Sound Objects
Pathfinding Objects
Players
编程
基本原理
搭建开发环境
Usage Examples
UnigineScript
C++
C#
UUSL (Unified UNIGINE Shader Language)
File Formats
Rebuilding the Engine Tools
GUI
双精度坐标
应用程序接口
Containers
Controls-Related Classes
Engine-Related Classes
Filesystem Functionality
GUI-Related Classes
Math Functionality
Node-Related Classes
Objects-Related Classes
Networking Functionality
Pathfinding-Related Classes
Physics-Related Classes
Plugins-Related Classes
IG Plugin
CIGIConnector Plugin
Rendering-Related Classes

Unigine::Hash class

Header: #include <UnigineHash.h>

Hash Class

Members


bool is_need_realloc ( ) #

void shrink ( ) #

Data * do_append ( const Key & key ) #

Arguments

  • const Key & key

void rehash ( Counter new_capacity ) #

Arguments

  • Counter new_capacity

Iterator begin ( ) #

ConstIterator end ( ) #

Vector<Key> keys ( ) #

bool remove ( const ConstIterator & it ) #

Arguments

  • const ConstIterator & it

Counter space ( ) #

Data * do_append ( Key && key ) #

Arguments

  • Key && key

bool erase ( const ConstIterator & it ) #

Arguments

  • const ConstIterator & it

bool erase ( const Iterator & it ) #

Arguments

  • const Iterator & it

Counter round_up ( Counter v ) #

Arguments

  • Counter v

void swap ( Hash<Key, Data, HashType, Counter> & hash ) #

Arguments

  • Hash<Key, Data, HashType, Counter> & hash

Data * do_append ( HashType hash, const Key & key ) #

Arguments

  • HashType hash
  • const Key & key

void rehash_data ( Counter index ) #

Arguments

  • Counter index

Counter empty ( ) #

bool contains ( const Key & key ) #

Arguments

  • const Key & key

void clear ( ) #

bool do_remove ( HashType hash, const Key & key ) #

Arguments

  • HashType hash
  • const Key & key

void getKeys ( Vector<Key> & keys ) #

Arguments

void reserve ( Counter size ) #

Arguments

  • Counter size

bool erase ( const Key & key ) #

Arguments

  • const Key & key

Data ** do_find ( const Key & key ) #

Arguments

  • const Key & key

void realloc ( ) #

bool remove ( const Key & key ) #

Arguments

  • const Key & key

bool remove ( const Iterator & it ) #

Arguments

  • const Iterator & it

void destroy ( ) #

Counter size ( ) #

Iterator end ( ) #

ConstIterator begin ( ) #

ConstIterator find ( const Key & key ) #

Arguments

  • const Key & key

Iterator find ( const Key & key ) #

Arguments

  • const Key & key
Last update: 2019-07-18