首页
学习
活动
专区
工具
TVP
发布
精选内容/技术社群/优惠产品,尽在小程序
立即前往

QuickHashIntSet (class)

Introduction

(PECL quickhash >= Unknown)

This class wraps around a set containing integer numbers.

Sets can also be iterated over with foreach as the Iterator interface is implemented as well. The order of which elements are returned in is not guaranteed.

Class synopsis

QuickHashIntSet {

/* Constants */

const integer CHECK_FOR_DUPES = 1 ;

const integer DO_NOT_USE_ZEND_ALLOC = 2 ;

const integer HASHER_NO_HASH = 256 ;

const integer HASHER_JENKINS1 = 512 ;

const integer HASHER_JENKINS2 = 1024 ;

/* Methods */

代码语言:javascript
复制
public bool add ( int $key )
代码语言:javascript
复制
public __construct ( int $size [, int $options ] )
代码语言:javascript
复制
public bool delete ( int $key )
代码语言:javascript
复制
public bool exists ( int $key )
代码语言:javascript
复制
publicint getSize ( void )
代码语言:javascript
复制
public static QuickHashIntSet loadFromFile ( string $filename [, int $size [, int $options ]] )
代码语言:javascript
复制
public static QuickHashIntSet loadFromString ( string $contents [, int $size [, int $options ]] )
代码语言:javascript
复制
public void saveToFile ( string $filename )
代码语言:javascript
复制
public string saveToString ( void )

}

Predefined Constants

QuickHashIntSet::CHECK_FOR_DUPES

If enabled, adding duplicate elements to a set (through either add() or loadFromFile()) will result in those elements to be dropped from the set. This will take up extra time, so only used when it is required.

QuickHashIntSet::DO_NOT_USE_ZEND_ALLOC

Disables the use of PHP's internal memory manager for internal set structures. With this option enabled, internal allocations will not count towards the memory_limit settings.

QuickHashIntSet::HASHER_NO_HASH

Selects to not use a hashing function, but merely use a modulo to find the bucket list index. This is not faster than normal hashing, and gives more collisions.

QuickHashIntSet::HASHER_JENKINS1

This is the default hashing function to turn the integer hashes into bucket list indexes.

QuickHashIntSet::HASHER_JENKINS2

Selects a variant hashing algorithm.

Table of Contents

  • QuickHashIntSet::add — This method adds a new entry to the set
  • QuickHashIntSet::__construct — Creates a new QuickHashIntSet object
  • QuickHashIntSet::delete — This method deletes an entry from the set
  • QuickHashIntSet::exists — This method checks whether a key is part of the set
  • QuickHashIntSet::getSize — Returns the number of elements in the set
  • QuickHashIntSet::loadFromFile — This factory method creates a set from a file
  • QuickHashIntSet::loadFromString — This factory method creates a set from a string
  • QuickHashIntSet::saveToFile — This method stores an in-memory set to disk
  • QuickHashIntSet::saveToString — This method returns a serialized version of the set

QuickHashIntSet::add →

代码语言:txt
复制
 ? 1997–2017 The PHP Documentation Group

Licensed under the Creative Commons Attribution License v3.0 or later.

扫码关注腾讯云开发者

领取腾讯云代金券

http://www.vxiaotou.com