a124d003cf
Add a mapping function which converts sequential integers to a sequence in which most of the digits change each time, but without significantly increasing the length. Change-Id: I1011a96894fbf0b92d20a96149e68014f53e3c3c
31 lines
966 B
PHP
31 lines
966 B
PHP
<?php
|
|
|
|
namespace MediaWiki\Tests\User\TempUser;
|
|
|
|
use MediaWiki\User\TempUser\ScrambleMapping;
|
|
use PHPUnit\Framework\TestCase;
|
|
|
|
/**
|
|
* @covers \MediaWiki\User\TempUser\ScrambleMapping
|
|
*/
|
|
class ScrambleMappingTest extends TestCase {
|
|
public function testMap() {
|
|
$map = new ScrambleMapping( [] );
|
|
$duplicates = 0;
|
|
// This has been verified up to 1e8 but for CI purposes we will use 200
|
|
$n = 200;
|
|
// Make a bit array for duplicate detection, with enough space for one extra digit
|
|
$bitArray = str_repeat( "\0", $n * 10 / 8 );
|
|
for ( $i = 0; $i < $n; $i++ ) {
|
|
$value = (int)$map->getSerialIdForIndex( $i );
|
|
$minor = $value % 8;
|
|
$major = ( $value - $minor ) / 8;
|
|
$prevBits = ord( $bitArray[$major] );
|
|
$prevStatus = ( $prevBits & ( 1 << $minor ) );
|
|
$duplicates += ( $prevStatus ? 1 : 0 );
|
|
$newBits = $prevBits | ( 1 << $minor );
|
|
$bitArray[$major] = chr( $newBits );
|
|
}
|
|
$this->assertSame( 0, $duplicates, 'duplicate detected' );
|
|
}
|
|
}
|