Showing preview only (201K chars total). Download the full file or copy to clipboard to get everything.
Repository: axhello/vPlayer
Branch: master
Commit: 400cb9e97b79
Files: 15
Total size: 192.3 KB
Directory structure:
gitextract_pk8kirc8/
├── .gitignore
├── README.md
├── api/
│ ├── detail.php
│ ├── lyric.php
│ ├── mp3url.php
│ ├── pages.php
│ ├── search.php
│ └── v2/
│ ├── BigInteger.php
│ └── MusicAPI.php
├── dist/
│ └── fonts/
│ └── themicons.css
├── gulpfile.js
├── index.html
├── package.json
└── src/
├── css/
│ └── vplayer.css
└── js/
└── vplayer.js
================================================
FILE CONTENTS
================================================
================================================
FILE: .gitignore
================================================
#Mac
.DS_Store
#Vscode
.vscode/*
!.vscode/settings.json
!.vscode/tasks.json
!.vscode/launch.json
!.vscode/extensions.json
#nodejs
node_modules
npm-debug.log
# Windows image file caches
Thumbs.db
ehthumbs.db
# Folder config file
Desktop.ini
================================================
FILE: README.md
================================================
# vPlayer
用vuejs写的播放器，API基于网易云, 具体效果请查看Demo！
Demo: http://player.ciyuanai.net
已更新使用网易云新版API，国外ip使用会被屏蔽，请注意！
演示站点环境：Vuejs v2.1.10 + vue-resource v1.0.3 + php7 + nginx
因为api那边用的是网易云新版v2 api，所以推荐使用php5.6以上版本，并开启openssl模块
================================================
FILE: api/detail.php
================================================
<?php
header('Content-Type: application/json');
require dirname(__FILE__) . '/v2/MusicAPI.php';
$api = new MusicAPI();
$id = $_GET['id'];
if (!empty($id)) {
$detail = $api->detail($id);
print_r($detail);
}
================================================
FILE: api/lyric.php
================================================
<?php
header('Content-Type: application/json');
require dirname(__FILE__) . '/v2/MusicAPI.php';
$api = new MusicAPI();
$id = $_GET['id'];
if (!empty($id)) {
$result = $api->lyric($id);
print_r($result);
}
================================================
FILE: api/mp3url.php
================================================
<?php
header('Content-Type: application/json');
require dirname(__FILE__) . '/v2/MusicAPI.php';
$api = new MusicAPI();
$song_id = $_GET['id'];
if (!empty($song_id)) {
$mp3url = $api->mp3url($song_id);
print_r($mp3url);
} else {
return;
}
================================================
FILE: api/pages.php
================================================
<?php
header('Content-Type: application/json');
require dirname(__FILE__) . '/v2/MusicAPI.php';
$api = new MusicAPI();
$p = $_GET['p'];
$s = $_GET['s'];
if (!empty($s) && !empty($p)) {
$result = $api->search($s, 30, $p);
print_r($result);
} elseif ($p == 0 || empty($p)) {
$result = $api->search($s, 30);
print_r($result);
}
================================================
FILE: api/search.php
================================================
<?php
header('Content-Type: application/json');
require dirname(__FILE__) . '/v2/MusicAPI.php';
$api = new MusicAPI();
$s = $_GET['s'];
if (!empty($s)) {
$result = $api->search($s, 30);
print_r($result);
}
================================================
FILE: api/v2/BigInteger.php
================================================
<?php
/**
* Pure-PHP arbitrary precision integer arithmetic library.
*
* Supports base-2, base-10, base-16, and base-256 numbers. Uses the GMP or BCMath extensions, if available,
* and an internal implementation, otherwise.
*
* PHP versions 4 and 5
*
* {@internal (all DocBlock comments regarding implementation - such as the one that follows - refer to the
* {@link MATH_BIGINTEGER_MODE_INTERNAL MATH_BIGINTEGER_MODE_INTERNAL} mode)
*
* Math_BigInteger uses base-2**26 to perform operations such as multiplication and division and
* base-2**52 (ie. two base 2**26 digits) to perform addition and subtraction. Because the largest possible
* value when multiplying two base-2**26 numbers together is a base-2**52 number, double precision floating
* point numbers - numbers that should be supported on most hardware and whose significand is 53 bits - are
* used. As a consequence, bitwise operators such as >> and << cannot be used, nor can the modulo operator %,
* which only supports integers. Although this fact will slow this library down, the fact that such a high
* base is being used should more than compensate.
*
* When PHP version 6 is officially released, we'll be able to use 64-bit integers. This should, once again,
* allow bitwise operators, and will increase the maximum possible base to 2**31 (or 2**62 for addition /
* subtraction).
*
* Numbers are stored in {@link http://en.wikipedia.org/wiki/Endianness little endian} format. ie.
* (new Math_BigInteger(pow(2, 26)))->value = array(0, 1)
*
* Useful resources are as follows:
*
* - {@link http://www.cacr.math.uwaterloo.ca/hac/about/chap14.pdf Handbook of Applied Cryptography (HAC)}
* - {@link http://math.libtomcrypt.com/files/tommath.pdf Multi-Precision Math (MPM)}
* - Java's BigInteger classes. See /j2se/src/share/classes/java/math in jdk-1_5_0-src-jrl.zip
*
* Here's an example of how to use this library:
* <code>
* <?php
* include('Math/BigInteger.php');
*
* $a = new Math_BigInteger(2);
* $b = new Math_BigInteger(3);
*
* $c = $a->add($b);
*
* echo $c->toString(); // outputs 5
* ?>
* </code>
*
* LICENSE: Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
* THE SOFTWARE.
*
* @category Math
* @package Math_BigInteger
* @author Jim Wigginton <terrafrost@php.net>
* @copyright MMVI Jim Wigginton
* @license http://www.opensource.org/licenses/mit-license.html MIT License
* @link http://pear.php.net/package/Math_BigInteger
*/
/**#@+
* Reduction constants
*
* @access private
* @see Math_BigInteger::_reduce()
*/
/**
* @see Math_BigInteger::_montgomery()
* @see Math_BigInteger::_prepMontgomery()
*/
define('MATH_BIGINTEGER_MONTGOMERY', 0);
/**
* @see Math_BigInteger::_barrett()
*/
define('MATH_BIGINTEGER_BARRETT', 1);
/**
* @see Math_BigInteger::_mod2()
*/
define('MATH_BIGINTEGER_POWEROF2', 2);
/**
* @see Math_BigInteger::_remainder()
*/
define('MATH_BIGINTEGER_CLASSIC', 3);
/**
* @see Math_BigInteger::__clone()
*/
define('MATH_BIGINTEGER_NONE', 4);
/**#@-*/
/**#@+
* Array constants
*
* Rather than create a thousands and thousands of new Math_BigInteger objects in repeated function calls to add() and
* multiply() or whatever, we'll just work directly on arrays, taking them in as parameters and returning them.
*
* @access private
*/
/**
* $result[MATH_BIGINTEGER_VALUE] contains the value.
*/
define('MATH_BIGINTEGER_VALUE', 0);
/**
* $result[MATH_BIGINTEGER_SIGN] contains the sign.
*/
define('MATH_BIGINTEGER_SIGN', 1);
/**#@-*/
/**#@+
* @access private
* @see Math_BigInteger::_montgomery()
* @see Math_BigInteger::_barrett()
*/
/**
* Cache constants
*
* $cache[MATH_BIGINTEGER_VARIABLE] tells us whether or not the cached data is still valid.
*/
define('MATH_BIGINTEGER_VARIABLE', 0);
/**
* $cache[MATH_BIGINTEGER_DATA] contains the cached data.
*/
define('MATH_BIGINTEGER_DATA', 1);
/**#@-*/
/**#@+
* Mode constants.
*
* @access private
* @see Math_BigInteger::Math_BigInteger()
*/
/**
* To use the pure-PHP implementation
*/
define('MATH_BIGINTEGER_MODE_INTERNAL', 1);
/**
* To use the BCMath library
*
* (if enabled; otherwise, the internal implementation will be used)
*/
define('MATH_BIGINTEGER_MODE_BCMATH', 2);
/**
* To use the GMP library
*
* (if present; otherwise, either the BCMath or the internal implementation will be used)
*/
define('MATH_BIGINTEGER_MODE_GMP', 3);
/**#@-*/
/**
* Karatsuba Cutoff
*
* At what point do we switch between Karatsuba multiplication and schoolbook long multiplication?
*
* @access private
*/
define('MATH_BIGINTEGER_KARATSUBA_CUTOFF', 25);
/**
* Pure-PHP arbitrary precision integer arithmetic library. Supports base-2, base-10, base-16, and base-256
* numbers.
*
* @package Math_BigInteger
* @author Jim Wigginton <terrafrost@php.net>
* @version 1.0.0RC4
* @access public
*/
class Math_BigInteger
{
/**
* Holds the BigInteger's value.
*
* @var Array
* @access private
*/
var $value;
/**
* Holds the BigInteger's magnitude.
*
* @var Boolean
* @access private
*/
var $is_negative = false;
/**
* Random number generator function
*
* @see setRandomGenerator()
* @access private
*/
var $generator = 'mt_rand';
/**
* Precision
*
* @see setPrecision()
* @access private
*/
var $precision = -1;
/**
* Precision Bitmask
*
* @see setPrecision()
* @access private
*/
var $bitmask = false;
/**
* Mode independent value used for serialization.
*
* If the bcmath or gmp extensions are installed $this->value will be a non-serializable resource, hence the need for
* a variable that'll be serializable regardless of whether or not extensions are being used. Unlike $this->value,
* however, $this->hex is only calculated when $this->__sleep() is called.
*
* @see __sleep()
* @see __wakeup()
* @var String
* @access private
*/
var $hex;
/**
* Converts base-2, base-10, base-16, and binary strings (base-256) to BigIntegers.
*
* If the second parameter - $base - is negative, then it will be assumed that the number's are encoded using
* two's compliment. The sole exception to this is -10, which is treated the same as 10 is.
*
* Here's an example:
* <code>
* <?php
* include('Math/BigInteger.php');
*
* $a = new Math_BigInteger('0x32', 16); // 50 in base-16
*
* echo $a->toString(); // outputs 50
* ?>
* </code>
*
* @param optional $x base-10 number or base-$base number if $base set.
* @param optional integer $base
* @return Math_BigInteger
* @access public
*/
function __construct($x = 0, $base = 10)
{
if ( !defined('MATH_BIGINTEGER_MODE') ) {
switch (true) {
case extension_loaded('gmp'):
define('MATH_BIGINTEGER_MODE', MATH_BIGINTEGER_MODE_GMP);
break;
case extension_loaded('bcmath'):
define('MATH_BIGINTEGER_MODE', MATH_BIGINTEGER_MODE_BCMATH);
break;
default:
define('MATH_BIGINTEGER_MODE', MATH_BIGINTEGER_MODE_INTERNAL);
}
}
if (function_exists('openssl_public_encrypt') && !defined('MATH_BIGINTEGER_OPENSSL_DISABLE') && !defined('MATH_BIGINTEGER_OPENSSL_ENABLED')) {
// some versions of XAMPP have mismatched versions of OpenSSL which causes it not to work
ob_start();
phpinfo();
$content = ob_get_contents();
ob_end_clean();
preg_match_all('#OpenSSL (Header|Library) Version(.*)#im', $content, $matches);
$versions = array();
if (!empty($matches[1])) {
for ($i = 0; $i < count($matches[1]); $i++) {
$versions[$matches[1][$i]] = trim(str_replace('=>', '', strip_tags($matches[2][$i])));
}
}
// it doesn't appear that OpenSSL versions were reported upon until PHP 5.3+
switch (true) {
case !isset($versions['Header']):
case !isset($versions['Library']):
case $versions['Header'] == $versions['Library']:
define('MATH_BIGINTEGER_OPENSSL_ENABLED', true);
break;
default:
define('MATH_BIGINTEGER_OPENSSL_DISABLE', true);
}
}
if (!defined('PHP_INT_SIZE')) {
define('PHP_INT_SIZE', 4);
}
if (!defined('MATH_BIGINTEGER_BASE') && MATH_BIGINTEGER_MODE == MATH_BIGINTEGER_MODE_INTERNAL) {
switch (PHP_INT_SIZE) {
case 8: // use 64-bit integers if int size is 8 bytes
define('MATH_BIGINTEGER_BASE', 31);
define('MATH_BIGINTEGER_BASE_FULL', 0x80000000);
define('MATH_BIGINTEGER_MAX_DIGIT', 0x7FFFFFFF);
define('MATH_BIGINTEGER_MSB', 0x40000000);
// 10**9 is the closest we can get to 2**31 without passing it
define('MATH_BIGINTEGER_MAX10', 1000000000);
define('MATH_BIGINTEGER_MAX10_LEN', 9);
// the largest digit that may be used in addition / subtraction
define('MATH_BIGINTEGER_MAX_DIGIT2', pow(2, 62));
break;
//case 4: // use 64-bit floats if int size is 4 bytes
default:
define('MATH_BIGINTEGER_BASE', 26);
define('MATH_BIGINTEGER_BASE_FULL', 0x4000000);
define('MATH_BIGINTEGER_MAX_DIGIT', 0x3FFFFFF);
define('MATH_BIGINTEGER_MSB', 0x2000000);
// 10**7 is the closest to 2**26 without passing it
define('MATH_BIGINTEGER_MAX10', 10000000);
define('MATH_BIGINTEGER_MAX10_LEN', 7);
// the largest digit that may be used in addition / subtraction
// we do pow(2, 52) instead of using 4503599627370496 directly because some
// PHP installations will truncate 4503599627370496.
define('MATH_BIGINTEGER_MAX_DIGIT2', pow(2, 52));
}
}
switch ( MATH_BIGINTEGER_MODE ) {
case MATH_BIGINTEGER_MODE_GMP:
if (is_resource($x) && get_resource_type($x) == 'GMP integer') {
$this->value = $x;
return;
}
$this->value = gmp_init(0);
break;
case MATH_BIGINTEGER_MODE_BCMATH:
$this->value = '0';
break;
default:
$this->value = array();
}
// '0' counts as empty() but when the base is 256 '0' is equal to ord('0') or 48
// '0' is the only value like this per http://php.net/empty
if (empty($x) && (abs($base) != 256 || $x !== '0')) {
return;
}
switch ($base) {
case -256:
if (ord($x[0]) & 0x80) {
$x = ~$x;
$this->is_negative = true;
}
case 256:
switch ( MATH_BIGINTEGER_MODE ) {
case MATH_BIGINTEGER_MODE_GMP:
$sign = $this->is_negative ? '-' : '';
$this->value = gmp_init($sign . '0x' . bin2hex($x));
break;
case MATH_BIGINTEGER_MODE_BCMATH:
// round $len to the nearest 4 (thanks, DavidMJ!)
$len = (strlen($x) + 3) & 0xFFFFFFFC;
$x = str_pad($x, $len, chr(0), STR_PAD_LEFT);
for ($i = 0; $i < $len; $i+= 4) {
$this->value = bcmul($this->value, '4294967296', 0); // 4294967296 == 2**32
$this->value = bcadd($this->value, 0x1000000 * ord($x[$i]) + ((ord($x[$i + 1]) << 16) | (ord($x[$i + 2]) << 8) | ord($x[$i + 3])), 0);
}
if ($this->is_negative) {
$this->value = '-' . $this->value;
}
break;
// converts a base-2**8 (big endian / msb) number to base-2**26 (little endian / lsb)
default:
while (strlen($x)) {
$this->value[] = $this->_bytes2int($this->_base256_rshift($x, MATH_BIGINTEGER_BASE));
}
}
if ($this->is_negative) {
if (MATH_BIGINTEGER_MODE != MATH_BIGINTEGER_MODE_INTERNAL) {
$this->is_negative = false;
}
$temp = $this->add(new Math_BigInteger('-1'));
$this->value = $temp->value;
}
break;
case 16:
case -16:
if ($base > 0 && $x[0] == '-') {
$this->is_negative = true;
$x = substr($x, 1);
}
$x = preg_replace('#^(?:0x)?([A-Fa-f0-9]*).*#', '$1', $x);
$is_negative = false;
if ($base < 0 && hexdec($x[0]) >= 8) {
$this->is_negative = $is_negative = true;
$x = bin2hex(~pack('H*', $x));
}
switch ( MATH_BIGINTEGER_MODE ) {
case MATH_BIGINTEGER_MODE_GMP:
$temp = $this->is_negative ? '-0x' . $x : '0x' . $x;
$this->value = gmp_init($temp);
$this->is_negative = false;
break;
case MATH_BIGINTEGER_MODE_BCMATH:
$x = ( strlen($x) & 1 ) ? '0' . $x : $x;
$temp = new Math_BigInteger(pack('H*', $x), 256);
$this->value = $this->is_negative ? '-' . $temp->value : $temp->value;
$this->is_negative = false;
break;
default:
$x = ( strlen($x) & 1 ) ? '0' . $x : $x;
$temp = new Math_BigInteger(pack('H*', $x), 256);
$this->value = $temp->value;
}
if ($is_negative) {
$temp = $this->add(new Math_BigInteger('-1'));
$this->value = $temp->value;
}
break;
case 10:
case -10:
// (?<!^)(?:-).*: find any -'s that aren't at the beginning and then any characters that follow that
// (?<=^|-)0*: find any 0's that are preceded by the start of the string or by a - (ie. octals)
// [^-0-9].*: find any non-numeric characters and then any characters that follow that
$x = preg_replace('#(?<!^)(?:-).*|(?<=^|-)0*|[^-0-9].*#', '', $x);
switch ( MATH_BIGINTEGER_MODE ) {
case MATH_BIGINTEGER_MODE_GMP:
$this->value = gmp_init($x);
break;
case MATH_BIGINTEGER_MODE_BCMATH:
// explicitly casting $x to a string is necessary, here, since doing $x[0] on -1 yields different
// results then doing it on '-1' does (modInverse does $x[0])
$this->value = $x === '-' ? '0' : (string) $x;
break;
default:
$temp = new Math_BigInteger();
$multiplier = new Math_BigInteger();
$multiplier->value = array(MATH_BIGINTEGER_MAX10);
if ($x[0] == '-') {
$this->is_negative = true;
$x = substr($x, 1);
}
$x = str_pad($x, strlen($x) + ((MATH_BIGINTEGER_MAX10_LEN - 1) * strlen($x)) % MATH_BIGINTEGER_MAX10_LEN, 0, STR_PAD_LEFT);
while (strlen($x)) {
$temp = $temp->multiply($multiplier);
$temp = $temp->add(new Math_BigInteger($this->_int2bytes(substr($x, 0, MATH_BIGINTEGER_MAX10_LEN)), 256));
$x = substr($x, MATH_BIGINTEGER_MAX10_LEN);
}
$this->value = $temp->value;
}
break;
case 2: // base-2 support originally implemented by Lluis Pamies - thanks!
case -2:
if ($base > 0 && $x[0] == '-') {
$this->is_negative = true;
$x = substr($x, 1);
}
$x = preg_replace('#^([01]*).*#', '$1', $x);
$x = str_pad($x, strlen($x) + (3 * strlen($x)) % 4, 0, STR_PAD_LEFT);
$str = '0x';
while (strlen($x)) {
$part = substr($x, 0, 4);
$str.= dechex(bindec($part));
$x = substr($x, 4);
}
if ($this->is_negative) {
$str = '-' . $str;
}
$temp = new Math_BigInteger($str, 8 * $base); // ie. either -16 or +16
$this->value = $temp->value;
$this->is_negative = $temp->is_negative;
break;
default:
// base not supported, so we'll let $this == 0
}
}
/**
* This function exists to maintain backwards compatibility with older code
*
* @param int $x base-10 number or base-$base number if $base set.
* @param int $base Number base
*/
public function Math_BigInteger($x = 0, $base = 10)
{
self::__construct($x, $base);
}
/**
* Converts a BigInteger to a byte string (eg. base-256).
*
* Negative numbers are saved as positive numbers, unless $twos_compliment is set to true, at which point, they're
* saved as two's compliment.
*
* Here's an example:
* <code>
* <?php
* include('Math/BigInteger.php');
*
* $a = new Math_BigInteger('65');
*
* echo $a->toBytes(); // outputs chr(65)
* ?>
* </code>
*
* @param Boolean $twos_compliment
* @return String
* @access public
* @internal Converts a base-2**26 number to base-2**8
*/
function toBytes($twos_compliment = false)
{
if ($twos_compliment) {
$comparison = $this->compare(new Math_BigInteger());
if ($comparison == 0) {
return $this->precision > 0 ? str_repeat(chr(0), ($this->precision + 1) >> 3) : '';
}
$temp = $comparison < 0 ? $this->add(new Math_BigInteger(1)) : $this->copy();
$bytes = $temp->toBytes();
if (empty($bytes)) { // eg. if the number we're trying to convert is -1
$bytes = chr(0);
}
if (ord($bytes[0]) & 0x80) {
$bytes = chr(0) . $bytes;
}
return $comparison < 0 ? ~$bytes : $bytes;
}
switch ( MATH_BIGINTEGER_MODE ) {
case MATH_BIGINTEGER_MODE_GMP:
if (gmp_cmp($this->value, gmp_init(0)) == 0) {
return $this->precision > 0 ? str_repeat(chr(0), ($this->precision + 1) >> 3) : '';
}
$temp = gmp_strval(gmp_abs($this->value), 16);
$temp = ( strlen($temp) & 1 ) ? '0' . $temp : $temp;
$temp = pack('H*', $temp);
return $this->precision > 0 ?
substr(str_pad($temp, $this->precision >> 3, chr(0), STR_PAD_LEFT), -($this->precision >> 3)) :
ltrim($temp, chr(0));
case MATH_BIGINTEGER_MODE_BCMATH:
if ($this->value === '0') {
return $this->precision > 0 ? str_repeat(chr(0), ($this->precision + 1) >> 3) : '';
}
$value = '';
$current = $this->value;
if ($current[0] == '-') {
$current = substr($current, 1);
}
while (bccomp($current, '0', 0) > 0) {
$temp = bcmod($current, '16777216');
$value = chr($temp >> 16) . chr($temp >> 8) . chr($temp) . $value;
$current = bcdiv($current, '16777216', 0);
}
return $this->precision > 0 ?
substr(str_pad($value, $this->precision >> 3, chr(0), STR_PAD_LEFT), -($this->precision >> 3)) :
ltrim($value, chr(0));
}
if (!count($this->value)) {
return $this->precision > 0 ? str_repeat(chr(0), ($this->precision + 1) >> 3) : '';
}
$result = $this->_int2bytes($this->value[count($this->value) - 1]);
$temp = $this->copy();
for ($i = count($temp->value) - 2; $i >= 0; --$i) {
$temp->_base256_lshift($result, MATH_BIGINTEGER_BASE);
$result = $result | str_pad($temp->_int2bytes($temp->value[$i]), strlen($result), chr(0), STR_PAD_LEFT);
}
return $this->precision > 0 ?
str_pad(substr($result, -(($this->precision + 7) >> 3)), ($this->precision + 7) >> 3, chr(0), STR_PAD_LEFT) :
$result;
}
/**
* Converts a BigInteger to a hex string (eg. base-16)).
*
* Negative numbers are saved as positive numbers, unless $twos_compliment is set to true, at which point, they're
* saved as two's compliment.
*
* Here's an example:
* <code>
* <?php
* include('Math/BigInteger.php');
*
* $a = new Math_BigInteger('65');
*
* echo $a->toHex(); // outputs '41'
* ?>
* </code>
*
* @param Boolean $twos_compliment
* @return String
* @access public
* @internal Converts a base-2**26 number to base-2**8
*/
function toHex($twos_compliment = false)
{
return bin2hex($this->toBytes($twos_compliment));
}
/**
* Converts a BigInteger to a bit string (eg. base-2).
*
* Negative numbers are saved as positive numbers, unless $twos_compliment is set to true, at which point, they're
* saved as two's compliment.
*
* Here's an example:
* <code>
* <?php
* include('Math/BigInteger.php');
*
* $a = new Math_BigInteger('65');
*
* echo $a->toBits(); // outputs '1000001'
* ?>
* </code>
*
* @param Boolean $twos_compliment
* @return String
* @access public
* @internal Converts a base-2**26 number to base-2**2
*/
function toBits($twos_compliment = false)
{
$hex = $this->toHex($twos_compliment);
$bits = '';
for ($i = strlen($hex) - 8, $start = strlen($hex) & 7; $i >= $start; $i-=8) {
$bits = str_pad(decbin(hexdec(substr($hex, $i, 8))), 32, '0', STR_PAD_LEFT) . $bits;
}
if ($start) { // hexdec('') == 0
$bits = str_pad(decbin(hexdec(substr($hex, 0, $start))), 8, '0', STR_PAD_LEFT) . $bits;
}
$result = $this->precision > 0 ? substr($bits, -$this->precision) : ltrim($bits, '0');
if ($twos_compliment && $this->compare(new Math_BigInteger()) > 0 && $this->precision <= 0) {
return '0' . $result;
}
return $result;
}
/**
* Converts a BigInteger to a base-10 number.
*
* Here's an example:
* <code>
* <?php
* include('Math/BigInteger.php');
*
* $a = new Math_BigInteger('50');
*
* echo $a->toString(); // outputs 50
* ?>
* </code>
*
* @return String
* @access public
* @internal Converts a base-2**26 number to base-10**7 (which is pretty much base-10)
*/
function toString()
{
switch ( MATH_BIGINTEGER_MODE ) {
case MATH_BIGINTEGER_MODE_GMP:
return gmp_strval($this->value);
case MATH_BIGINTEGER_MODE_BCMATH:
if ($this->value === '0') {
return '0';
}
return ltrim($this->value, '0');
}
if (!count($this->value)) {
return '0';
}
$temp = $this->copy();
$temp->is_negative = false;
$divisor = new Math_BigInteger();
$divisor->value = array(MATH_BIGINTEGER_MAX10);
$result = '';
while (count($temp->value)) {
list($temp, $mod) = $temp->divide($divisor);
$result = str_pad(isset($mod->value[0]) ? $mod->value[0] : '', MATH_BIGINTEGER_MAX10_LEN, '0', STR_PAD_LEFT) . $result;
}
$result = ltrim($result, '0');
if (empty($result)) {
$result = '0';
}
if ($this->is_negative) {
$result = '-' . $result;
}
return $result;
}
/**
* Copy an object
*
* PHP5 passes objects by reference while PHP4 passes by value. As such, we need a function to guarantee
* that all objects are passed by value, when appropriate. More information can be found here:
*
* {@link http://php.net/language.oop5.basic#51624}
*
* @access public
* @see __clone()
* @return Math_BigInteger
*/
function copy()
{
$temp = new Math_BigInteger();
$temp->value = $this->value;
$temp->is_negative = $this->is_negative;
$temp->generator = $this->generator;
$temp->precision = $this->precision;
$temp->bitmask = $this->bitmask;
return $temp;
}
/**
* __toString() magic method
*
* Will be called, automatically, if you're supporting just PHP5. If you're supporting PHP4, you'll need to call
* toString().
*
* @access public
* @internal Implemented per a suggestion by Techie-Michael - thanks!
*/
function __toString()
{
return $this->toString();
}
/**
* __clone() magic method
*
* Although you can call Math_BigInteger::__toString() directly in PHP5, you cannot call Math_BigInteger::__clone()
* directly in PHP5. You can in PHP4 since it's not a magic method, but in PHP5, you have to call it by using the PHP5
* only syntax of $y = clone $x. As such, if you're trying to write an application that works on both PHP4 and PHP5,
* call Math_BigInteger::copy(), instead.
*
* @access public
* @see copy()
* @return Math_BigInteger
*/
function __clone()
{
return $this->copy();
}
/**
* __sleep() magic method
*
* Will be called, automatically, when serialize() is called on a Math_BigInteger object.
*
* @see __wakeup()
* @access public
*/
function __sleep()
{
$this->hex = $this->toHex(true);
$vars = array('hex');
if ($this->generator != 'mt_rand') {
$vars[] = 'generator';
}
if ($this->precision > 0) {
$vars[] = 'precision';
}
return $vars;
}
/**
* __wakeup() magic method
*
* Will be called, automatically, when unserialize() is called on a Math_BigInteger object.
*
* @see __sleep()
* @access public
*/
function __wakeup()
{
$temp = new Math_BigInteger($this->hex, -16);
$this->value = $temp->value;
$this->is_negative = $temp->is_negative;
$this->setRandomGenerator($this->generator);
if ($this->precision > 0) {
// recalculate $this->bitmask
$this->setPrecision($this->precision);
}
}
/**
* Adds two BigIntegers.
*
* Here's an example:
* <code>
* <?php
* include('Math/BigInteger.php');
*
* $a = new Math_BigInteger('10');
* $b = new Math_BigInteger('20');
*
* $c = $a->add($b);
*
* echo $c->toString(); // outputs 30
* ?>
* </code>
*
* @param Math_BigInteger $y
* @return Math_BigInteger
* @access public
* @internal Performs base-2**52 addition
*/
function add($y)
{
switch ( MATH_BIGINTEGER_MODE ) {
case MATH_BIGINTEGER_MODE_GMP:
$temp = new Math_BigInteger();
$temp->value = gmp_add($this->value, $y->value);
return $this->_normalize($temp);
case MATH_BIGINTEGER_MODE_BCMATH:
$temp = new Math_BigInteger();
$temp->value = bcadd($this->value, $y->value, 0);
return $this->_normalize($temp);
}
$temp = $this->_add($this->value, $this->is_negative, $y->value, $y->is_negative);
$result = new Math_BigInteger();
$result->value = $temp[MATH_BIGINTEGER_VALUE];
$result->is_negative = $temp[MATH_BIGINTEGER_SIGN];
return $this->_normalize($result);
}
/**
* Performs addition.
*
* @param Array $x_value
* @param Boolean $x_negative
* @param Array $y_value
* @param Boolean $y_negative
* @return Array
* @access private
*/
function _add($x_value, $x_negative, $y_value, $y_negative)
{
$x_size = count($x_value);
$y_size = count($y_value);
if ($x_size == 0) {
return array(
MATH_BIGINTEGER_VALUE => $y_value,
MATH_BIGINTEGER_SIGN => $y_negative
);
} else if ($y_size == 0) {
return array(
MATH_BIGINTEGER_VALUE => $x_value,
MATH_BIGINTEGER_SIGN => $x_negative
);
}
// subtract, if appropriate
if ( $x_negative != $y_negative ) {
if ( $x_value == $y_value ) {
return array(
MATH_BIGINTEGER_VALUE => array(),
MATH_BIGINTEGER_SIGN => false
);
}
$temp = $this->_subtract($x_value, false, $y_value, false);
$temp[MATH_BIGINTEGER_SIGN] = $this->_compare($x_value, false, $y_value, false) > 0 ?
$x_negative : $y_negative;
return $temp;
}
if ($x_size < $y_size) {
$size = $x_size;
$value = $y_value;
} else {
$size = $y_size;
$value = $x_value;
}
$value[] = 0; // just in case the carry adds an extra digit
$carry = 0;
for ($i = 0, $j = 1; $j < $size; $i+=2, $j+=2) {
$sum = $x_value[$j] * MATH_BIGINTEGER_BASE_FULL + $x_value[$i] + $y_value[$j] * MATH_BIGINTEGER_BASE_FULL + $y_value[$i] + $carry;
$carry = $sum >= MATH_BIGINTEGER_MAX_DIGIT2; // eg. floor($sum / 2**52); only possible values (in any base) are 0 and 1
$sum = $carry ? $sum - MATH_BIGINTEGER_MAX_DIGIT2 : $sum;
$temp = (int) ($sum / MATH_BIGINTEGER_BASE_FULL);
$value[$i] = (int) ($sum - MATH_BIGINTEGER_BASE_FULL * $temp); // eg. a faster alternative to fmod($sum, 0x4000000)
$value[$j] = $temp;
}
if ($j == $size) { // ie. if $y_size is odd
$sum = $x_value[$i] + $y_value[$i] + $carry;
$carry = $sum >= MATH_BIGINTEGER_BASE_FULL;
$value[$i] = $carry ? $sum - MATH_BIGINTEGER_BASE_FULL : $sum;
++$i; // ie. let $i = $j since we've just done $value[$i]
}
if ($carry) {
for (; $value[$i] == MATH_BIGINTEGER_MAX_DIGIT; ++$i) {
$value[$i] = 0;
}
++$value[$i];
}
return array(
MATH_BIGINTEGER_VALUE => $this->_trim($value),
MATH_BIGINTEGER_SIGN => $x_negative
);
}
/**
* Subtracts two BigIntegers.
*
* Here's an example:
* <code>
* <?php
* include('Math/BigInteger.php');
*
* $a = new Math_BigInteger('10');
* $b = new Math_BigInteger('20');
*
* $c = $a->subtract($b);
*
* echo $c->toString(); // outputs -10
* ?>
* </code>
*
* @param Math_BigInteger $y
* @return Math_BigInteger
* @access public
* @internal Performs base-2**52 subtraction
*/
function subtract($y)
{
switch ( MATH_BIGINTEGER_MODE ) {
case MATH_BIGINTEGER_MODE_GMP:
$temp = new Math_BigInteger();
$temp->value = gmp_sub($this->value, $y->value);
return $this->_normalize($temp);
case MATH_BIGINTEGER_MODE_BCMATH:
$temp = new Math_BigInteger();
$temp->value = bcsub($this->value, $y->value, 0);
return $this->_normalize($temp);
}
$temp = $this->_subtract($this->value, $this->is_negative, $y->value, $y->is_negative);
$result = new Math_BigInteger();
$result->value = $temp[MATH_BIGINTEGER_VALUE];
$result->is_negative = $temp[MATH_BIGINTEGER_SIGN];
return $this->_normalize($result);
}
/**
* Performs subtraction.
*
* @param Array $x_value
* @param Boolean $x_negative
* @param Array $y_value
* @param Boolean $y_negative
* @return Array
* @access private
*/
function _subtract($x_value, $x_negative, $y_value, $y_negative)
{
$x_size = count($x_value);
$y_size = count($y_value);
if ($x_size == 0) {
return array(
MATH_BIGINTEGER_VALUE => $y_value,
MATH_BIGINTEGER_SIGN => !$y_negative
);
} else if ($y_size == 0) {
return array(
MATH_BIGINTEGER_VALUE => $x_value,
MATH_BIGINTEGER_SIGN => $x_negative
);
}
// add, if appropriate (ie. -$x - +$y or +$x - -$y)
if ( $x_negative != $y_negative ) {
$temp = $this->_add($x_value, false, $y_value, false);
$temp[MATH_BIGINTEGER_SIGN] = $x_negative;
return $temp;
}
$diff = $this->_compare($x_value, $x_negative, $y_value, $y_negative);
if ( !$diff ) {
return array(
MATH_BIGINTEGER_VALUE => array(),
MATH_BIGINTEGER_SIGN => false
);
}
// switch $x and $y around, if appropriate.
if ( (!$x_negative && $diff < 0) || ($x_negative && $diff > 0) ) {
$temp = $x_value;
$x_value = $y_value;
$y_value = $temp;
$x_negative = !$x_negative;
$x_size = count($x_value);
$y_size = count($y_value);
}
// at this point, $x_value should be at least as big as - if not bigger than - $y_value
$carry = 0;
for ($i = 0, $j = 1; $j < $y_size; $i+=2, $j+=2) {
$sum = $x_value[$j] * MATH_BIGINTEGER_BASE_FULL + $x_value[$i] - $y_value[$j] * MATH_BIGINTEGER_BASE_FULL - $y_value[$i] - $carry;
$carry = $sum < 0; // eg. floor($sum / 2**52); only possible values (in any base) are 0 and 1
$sum = $carry ? $sum + MATH_BIGINTEGER_MAX_DIGIT2 : $sum;
$temp = (int) ($sum / MATH_BIGINTEGER_BASE_FULL);
$x_value[$i] = (int) ($sum - MATH_BIGINTEGER_BASE_FULL * $temp);
$x_value[$j] = $temp;
}
if ($j == $y_size) { // ie. if $y_size is odd
$sum = $x_value[$i] - $y_value[$i] - $carry;
$carry = $sum < 0;
$x_value[$i] = $carry ? $sum + MATH_BIGINTEGER_BASE_FULL : $sum;
++$i;
}
if ($carry) {
for (; !$x_value[$i]; ++$i) {
$x_value[$i] = MATH_BIGINTEGER_MAX_DIGIT;
}
--$x_value[$i];
}
return array(
MATH_BIGINTEGER_VALUE => $this->_trim($x_value),
MATH_BIGINTEGER_SIGN => $x_negative
);
}
/**
* Multiplies two BigIntegers
*
* Here's an example:
* <code>
* <?php
* include('Math/BigInteger.php');
*
* $a = new Math_BigInteger('10');
* $b = new Math_BigInteger('20');
*
* $c = $a->multiply($b);
*
* echo $c->toString(); // outputs 200
* ?>
* </code>
*
* @param Math_BigInteger $x
* @return Math_BigInteger
* @access public
*/
function multiply($x)
{
switch ( MATH_BIGINTEGER_MODE ) {
case MATH_BIGINTEGER_MODE_GMP:
$temp = new Math_BigInteger();
$temp->value = gmp_mul($this->value, $x->value);
return $this->_normalize($temp);
case MATH_BIGINTEGER_MODE_BCMATH:
$temp = new Math_BigInteger();
$temp->value = bcmul($this->value, $x->value, 0);
return $this->_normalize($temp);
}
$temp = $this->_multiply($this->value, $this->is_negative, $x->value, $x->is_negative);
$product = new Math_BigInteger();
$product->value = $temp[MATH_BIGINTEGER_VALUE];
$product->is_negative = $temp[MATH_BIGINTEGER_SIGN];
return $this->_normalize($product);
}
/**
* Performs multiplication.
*
* @param Array $x_value
* @param Boolean $x_negative
* @param Array $y_value
* @param Boolean $y_negative
* @return Array
* @access private
*/
function _multiply($x_value, $x_negative, $y_value, $y_negative)
{
//if ( $x_value == $y_value ) {
// return array(
// MATH_BIGINTEGER_VALUE => $this->_square($x_value),
// MATH_BIGINTEGER_SIGN => $x_sign != $y_value
// );
//}
$x_length = count($x_value);
$y_length = count($y_value);
if ( !$x_length || !$y_length ) { // a 0 is being multiplied
return array(
MATH_BIGINTEGER_VALUE => array(),
MATH_BIGINTEGER_SIGN => false
);
}
return array(
MATH_BIGINTEGER_VALUE => min($x_length, $y_length) < 2 * MATH_BIGINTEGER_KARATSUBA_CUTOFF ?
$this->_trim($this->_regularMultiply($x_value, $y_value)) :
$this->_trim($this->_karatsuba($x_value, $y_value)),
MATH_BIGINTEGER_SIGN => $x_negative != $y_negative
);
}
/**
* Performs long multiplication on two BigIntegers
*
* Modeled after 'multiply' in MutableBigInteger.java.
*
* @param Array $x_value
* @param Array $y_value
* @return Array
* @access private
*/
function _regularMultiply($x_value, $y_value)
{
$x_length = count($x_value);
$y_length = count($y_value);
if ( !$x_length || !$y_length ) { // a 0 is being multiplied
return array();
}
if ( $x_length < $y_length ) {
$temp = $x_value;
$x_value = $y_value;
$y_value = $temp;
$x_length = count($x_value);
$y_length = count($y_value);
}
$product_value = $this->_array_repeat(0, $x_length + $y_length);
// the following for loop could be removed if the for loop following it
// (the one with nested for loops) initially set $i to 0, but
// doing so would also make the result in one set of unnecessary adds,
// since on the outermost loops first pass, $product->value[$k] is going
// to always be 0
$carry = 0;
for ($j = 0; $j < $x_length; ++$j) { // ie. $i = 0
$temp = $x_value[$j] * $y_value[0] + $carry; // $product_value[$k] == 0
$carry = (int) ($temp / MATH_BIGINTEGER_BASE_FULL);
$product_value[$j] = (int) ($temp - MATH_BIGINTEGER_BASE_FULL * $carry);
}
$product_value[$j] = $carry;
// the above for loop is what the previous comment was talking about. the
// following for loop is the "one with nested for loops"
for ($i = 1; $i < $y_length; ++$i) {
$carry = 0;
for ($j = 0, $k = $i; $j < $x_length; ++$j, ++$k) {
$temp = $product_value[$k] + $x_value[$j] * $y_value[$i] + $carry;
$carry = (int) ($temp / MATH_BIGINTEGER_BASE_FULL);
$product_value[$k] = (int) ($temp - MATH_BIGINTEGER_BASE_FULL * $carry);
}
$product_value[$k] = $carry;
}
return $product_value;
}
/**
* Performs Karatsuba multiplication on two BigIntegers
*
* See {@link http://en.wikipedia.org/wiki/Karatsuba_algorithm Karatsuba algorithm} and
* {@link http://math.libtomcrypt.com/files/tommath.pdf#page=120 MPM 5.2.3}.
*
* @param Array $x_value
* @param Array $y_value
* @return Array
* @access private
*/
function _karatsuba($x_value, $y_value)
{
$m = min(count($x_value) >> 1, count($y_value) >> 1);
if ($m < MATH_BIGINTEGER_KARATSUBA_CUTOFF) {
return $this->_regularMultiply($x_value, $y_value);
}
$x1 = array_slice($x_value, $m);
$x0 = array_slice($x_value, 0, $m);
$y1 = array_slice($y_value, $m);
$y0 = array_slice($y_value, 0, $m);
$z2 = $this->_karatsuba($x1, $y1);
$z0 = $this->_karatsuba($x0, $y0);
$z1 = $this->_add($x1, false, $x0, false);
$temp = $this->_add($y1, false, $y0, false);
$z1 = $this->_karatsuba($z1[MATH_BIGINTEGER_VALUE], $temp[MATH_BIGINTEGER_VALUE]);
$temp = $this->_add($z2, false, $z0, false);
$z1 = $this->_subtract($z1, false, $temp[MATH_BIGINTEGER_VALUE], false);
$z2 = array_merge(array_fill(0, 2 * $m, 0), $z2);
$z1[MATH_BIGINTEGER_VALUE] = array_merge(array_fill(0, $m, 0), $z1[MATH_BIGINTEGER_VALUE]);
$xy = $this->_add($z2, false, $z1[MATH_BIGINTEGER_VALUE], $z1[MATH_BIGINTEGER_SIGN]);
$xy = $this->_add($xy[MATH_BIGINTEGER_VALUE], $xy[MATH_BIGINTEGER_SIGN], $z0, false);
return $xy[MATH_BIGINTEGER_VALUE];
}
/**
* Performs squaring
*
* @param Array $x
* @return Array
* @access private
*/
function _square($x = false)
{
return count($x) < 2 * MATH_BIGINTEGER_KARATSUBA_CUTOFF ?
$this->_trim($this->_baseSquare($x)) :
$this->_trim($this->_karatsubaSquare($x));
}
/**
* Performs traditional squaring on two BigIntegers
*
* Squaring can be done faster than multiplying a number by itself can be. See
* {@link http://www.cacr.math.uwaterloo.ca/hac/about/chap14.pdf#page=7 HAC 14.2.4} /
* {@link http://math.libtomcrypt.com/files/tommath.pdf#page=141 MPM 5.3} for more information.
*
* @param Array $value
* @return Array
* @access private
*/
function _baseSquare($value)
{
if ( empty($value) ) {
return array();
}
$square_value = $this->_array_repeat(0, 2 * count($value));
for ($i = 0, $max_index = count($value) - 1; $i <= $max_index; ++$i) {
$i2 = $i << 1;
$temp = $square_value[$i2] + $value[$i] * $value[$i];
$carry = (int) ($temp / MATH_BIGINTEGER_BASE_FULL);
$square_value[$i2] = (int) ($temp - MATH_BIGINTEGER_BASE_FULL * $carry);
// note how we start from $i+1 instead of 0 as we do in multiplication.
for ($j = $i + 1, $k = $i2 + 1; $j <= $max_index; ++$j, ++$k) {
$temp = $square_value[$k] + 2 * $value[$j] * $value[$i] + $carry;
$carry = (int) ($temp / MATH_BIGINTEGER_BASE_FULL);
$square_value[$k] = (int) ($temp - MATH_BIGINTEGER_BASE_FULL * $carry);
}
// the following line can yield values larger 2**15. at this point, PHP should switch
// over to floats.
$square_value[$i + $max_index + 1] = $carry;
}
return $square_value;
}
/**
* Performs Karatsuba "squaring" on two BigIntegers
*
* See {@link http://en.wikipedia.org/wiki/Karatsuba_algorithm Karatsuba algorithm} and
* {@link http://math.libtomcrypt.com/files/tommath.pdf#page=151 MPM 5.3.4}.
*
* @param Array $value
* @return Array
* @access private
*/
function _karatsubaSquare($value)
{
$m = count($value) >> 1;
if ($m < MATH_BIGINTEGER_KARATSUBA_CUTOFF) {
return $this->_baseSquare($value);
}
$x1 = array_slice($value, $m);
$x0 = array_slice($value, 0, $m);
$z2 = $this->_karatsubaSquare($x1);
$z0 = $this->_karatsubaSquare($x0);
$z1 = $this->_add($x1, false, $x0, false);
$z1 = $this->_karatsubaSquare($z1[MATH_BIGINTEGER_VALUE]);
$temp = $this->_add($z2, false, $z0, false);
$z1 = $this->_subtract($z1, false, $temp[MATH_BIGINTEGER_VALUE], false);
$z2 = array_merge(array_fill(0, 2 * $m, 0), $z2);
$z1[MATH_BIGINTEGER_VALUE] = array_merge(array_fill(0, $m, 0), $z1[MATH_BIGINTEGER_VALUE]);
$xx = $this->_add($z2, false, $z1[MATH_BIGINTEGER_VALUE], $z1[MATH_BIGINTEGER_SIGN]);
$xx = $this->_add($xx[MATH_BIGINTEGER_VALUE], $xx[MATH_BIGINTEGER_SIGN], $z0, false);
return $xx[MATH_BIGINTEGER_VALUE];
}
/**
* Divides two BigIntegers.
*
* Returns an array whose first element contains the quotient and whose second element contains the
* "common residue". If the remainder would be positive, the "common residue" and the remainder are the
* same. If the remainder would be negative, the "common residue" is equal to the sum of the remainder
* and the divisor (basically, the "common residue" is the first positive modulo).
*
* Here's an example:
* <code>
* <?php
* include('Math/BigInteger.php');
*
* $a = new Math_BigInteger('10');
* $b = new Math_BigInteger('20');
*
* list($quotient, $remainder) = $a->divide($b);
*
* echo $quotient->toString(); // outputs 0
* echo "\r\n";
* echo $remainder->toString(); // outputs 10
* ?>
* </code>
*
* @param Math_BigInteger $y
* @return Array
* @access public
* @internal This function is based off of {@link http://www.cacr.math.uwaterloo.ca/hac/about/chap14.pdf#page=9 HAC 14.20}.
*/
function divide($y)
{
switch ( MATH_BIGINTEGER_MODE ) {
case MATH_BIGINTEGER_MODE_GMP:
$quotient = new Math_BigInteger();
$remainder = new Math_BigInteger();
list($quotient->value, $remainder->value) = gmp_div_qr($this->value, $y->value);
if (gmp_sign($remainder->value) < 0) {
$remainder->value = gmp_add($remainder->value, gmp_abs($y->value));
}
return array($this->_normalize($quotient), $this->_normalize($remainder));
case MATH_BIGINTEGER_MODE_BCMATH:
$quotient = new Math_BigInteger();
$remainder = new Math_BigInteger();
$quotient->value = bcdiv($this->value, $y->value, 0);
$remainder->value = bcmod($this->value, $y->value);
if ($remainder->value[0] == '-') {
$remainder->value = bcadd($remainder->value, $y->value[0] == '-' ? substr($y->value, 1) : $y->value, 0);
}
return array($this->_normalize($quotient), $this->_normalize($remainder));
}
if (count($y->value) == 1) {
list($q, $r) = $this->_divide_digit($this->value, $y->value[0]);
$quotient = new Math_BigInteger();
$remainder = new Math_BigInteger();
$quotient->value = $q;
$remainder->value = array($r);
$quotient->is_negative = $this->is_negative != $y->is_negative;
return array($this->_normalize($quotient), $this->_normalize($remainder));
}
static $zero;
if ( !isset($zero) ) {
$zero = new Math_BigInteger();
}
$x = $this->copy();
$y = $y->copy();
$x_sign = $x->is_negative;
$y_sign = $y->is_negative;
$x->is_negative = $y->is_negative = false;
$diff = $x->compare($y);
if ( !$diff ) {
$temp = new Math_BigInteger();
$temp->value = array(1);
$temp->is_negative = $x_sign != $y_sign;
return array($this->_normalize($temp), $this->_normalize(new Math_BigInteger()));
}
if ( $diff < 0 ) {
// if $x is negative, "add" $y.
if ( $x_sign ) {
$x = $y->subtract($x);
}
return array($this->_normalize(new Math_BigInteger()), $this->_normalize($x));
}
// normalize $x and $y as described in HAC 14.23 / 14.24
$msb = $y->value[count($y->value) - 1];
for ($shift = 0; !($msb & MATH_BIGINTEGER_MSB); ++$shift) {
$msb <<= 1;
}
$x->_lshift($shift);
$y->_lshift($shift);
$y_value = &$y->value;
$x_max = count($x->value) - 1;
$y_max = count($y->value) - 1;
$quotient = new Math_BigInteger();
$quotient_value = &$quotient->value;
$quotient_value = $this->_array_repeat(0, $x_max - $y_max + 1);
static $temp, $lhs, $rhs;
if (!isset($temp)) {
$temp = new Math_BigInteger();
$lhs = new Math_BigInteger();
$rhs = new Math_BigInteger();
}
$temp_value = &$temp->value;
$rhs_value = &$rhs->value;
// $temp = $y << ($x_max - $y_max-1) in base 2**26
$temp_value = array_merge($this->_array_repeat(0, $x_max - $y_max), $y_value);
while ( $x->compare($temp) >= 0 ) {
// calculate the "common residue"
++$quotient_value[$x_max - $y_max];
$x = $x->subtract($temp);
$x_max = count($x->value) - 1;
}
for ($i = $x_max; $i >= $y_max + 1; --$i) {
$x_value = &$x->value;
$x_window = array(
isset($x_value[$i]) ? $x_value[$i] : 0,
isset($x_value[$i - 1]) ? $x_value[$i - 1] : 0,
isset($x_value[$i - 2]) ? $x_value[$i - 2] : 0
);
$y_window = array(
$y_value[$y_max],
( $y_max > 0 ) ? $y_value[$y_max - 1] : 0
);
$q_index = $i - $y_max - 1;
if ($x_window[0] == $y_window[0]) {
$quotient_value[$q_index] = MATH_BIGINTEGER_MAX_DIGIT;
} else {
$quotient_value[$q_index] = (int) (
($x_window[0] * MATH_BIGINTEGER_BASE_FULL + $x_window[1])
/
$y_window[0]
);
}
$temp_value = array($y_window[1], $y_window[0]);
$lhs->value = array($quotient_value[$q_index]);
$lhs = $lhs->multiply($temp);
$rhs_value = array($x_window[2], $x_window[1], $x_window[0]);
while ( $lhs->compare($rhs) > 0 ) {
--$quotient_value[$q_index];
$lhs->value = array($quotient_value[$q_index]);
$lhs = $lhs->multiply($temp);
}
$adjust = $this->_array_repeat(0, $q_index);
$temp_value = array($quotient_value[$q_index]);
$temp = $temp->multiply($y);
$temp_value = &$temp->value;
$temp_value = array_merge($adjust, $temp_value);
$x = $x->subtract($temp);
if ($x->compare($zero) < 0) {
$temp_value = array_merge($adjust, $y_value);
$x = $x->add($temp);
--$quotient_value[$q_index];
}
$x_max = count($x_value) - 1;
}
// unnormalize the remainder
$x->_rshift($shift);
$quotient->is_negative = $x_sign != $y_sign;
// calculate the "common residue", if appropriate
if ( $x_sign ) {
$y->_rshift($shift);
$x = $y->subtract($x);
}
return array($this->_normalize($quotient), $this->_normalize($x));
}
/**
* Divides a BigInteger by a regular integer
*
* abc / x = a00 / x + b0 / x + c / x
*
* @param Array $dividend
* @param Array $divisor
* @return Array
* @access private
*/
function _divide_digit($dividend, $divisor)
{
$carry = 0;
$result = array();
for ($i = count($dividend) - 1; $i >= 0; --$i) {
$temp = MATH_BIGINTEGER_BASE_FULL * $carry + $dividend[$i];
$result[$i] = (int) ($temp / $divisor);
$carry = (int) ($temp - $divisor * $result[$i]);
}
return array($result, $carry);
}
/**
* Performs modular exponentiation.
*
* Here's an example:
* <code>
* <?php
* include('Math/BigInteger.php');
*
* $a = new Math_BigInteger('10');
* $b = new Math_BigInteger('20');
* $c = new Math_BigInteger('30');
*
* $c = $a->modPow($b, $c);
*
* echo $c->toString(); // outputs 10
* ?>
* </code>
*
* @param Math_BigInteger $e
* @param Math_BigInteger $n
* @return Math_BigInteger
* @access public
* @internal The most naive approach to modular exponentiation has very unreasonable requirements, and
* and although the approach involving repeated squaring does vastly better, it, too, is impractical
* for our purposes. The reason being that division - by far the most complicated and time-consuming
* of the basic operations (eg. +,-,*,/) - occurs multiple times within it.
*
* Modular reductions resolve this issue. Although an individual modular reduction takes more time
* then an individual division, when performed in succession (with the same modulo), they're a lot faster.
*
* The two most commonly used modular reductions are Barrett and Montgomery reduction. Montgomery reduction,
* although faster, only works when the gcd of the modulo and of the base being used is 1. In RSA, when the
* base is a power of two, the modulo - a product of two primes - is always going to have a gcd of 1 (because
* the product of two odd numbers is odd), but what about when RSA isn't used?
*
* In contrast, Barrett reduction has no such constraint. As such, some bigint implementations perform a
* Barrett reduction after every operation in the modpow function. Others perform Barrett reductions when the
* modulo is even and Montgomery reductions when the modulo is odd. BigInteger.java's modPow method, however,
* uses a trick involving the Chinese Remainder Theorem to factor the even modulo into two numbers - one odd and
* the other, a power of two - and recombine them, later. This is the method that this modPow function uses.
* {@link http://islab.oregonstate.edu/papers/j34monex.pdf Montgomery Reduction with Even Modulus} elaborates.
*/
function modPow($e, $n)
{
$n = $this->bitmask !== false && $this->bitmask->compare($n) < 0 ? $this->bitmask : $n->abs();
if ($e->compare(new Math_BigInteger()) < 0) {
$e = $e->abs();
$temp = $this->modInverse($n);
if ($temp === false) {
return false;
}
return $this->_normalize($temp->modPow($e, $n));
}
if ( MATH_BIGINTEGER_MODE == MATH_BIGINTEGER_MODE_GMP ) {
$temp = new Math_BigInteger();
$temp->value = gmp_powm($this->value, $e->value, $n->value);
return $this->_normalize($temp);
}
if ($this->compare(new Math_BigInteger()) < 0 || $this->compare($n) > 0) {
list(, $temp) = $this->divide($n);
return $temp->modPow($e, $n);
}
if (defined('MATH_BIGINTEGER_OPENSSL_ENABLED')) {
$components = array(
'modulus' => $n->toBytes(true),
'publicExponent' => $e->toBytes(true)
);
$components = array(
'modulus' => pack('Ca*a*', 2, $this->_encodeASN1Length(strlen($components['modulus'])), $components['modulus']),
'publicExponent' => pack('Ca*a*', 2, $this->_encodeASN1Length(strlen($components['publicExponent'])), $components['publicExponent'])
);
$RSAPublicKey = pack('Ca*a*a*',
48, $this->_encodeASN1Length(strlen($components['modulus']) + strlen($components['publicExponent'])),
$components['modulus'], $components['publicExponent']
);
$rsaOID = pack('H*', '300d06092a864886f70d0101010500'); // hex version of MA0GCSqGSIb3DQEBAQUA
$RSAPublicKey = chr(0) . $RSAPublicKey;
$RSAPublicKey = chr(3) . $this->_encodeASN1Length(strlen($RSAPublicKey)) . $RSAPublicKey;
$encapsulated = pack('Ca*a*',
48, $this->_encodeASN1Length(strlen($rsaOID . $RSAPublicKey)), $rsaOID . $RSAPublicKey
);
$RSAPublicKey = "-----BEGIN PUBLIC KEY-----\r\n" .
chunk_split(base64_encode($encapsulated)) .
'-----END PUBLIC KEY-----';
$plaintext = str_pad($this->toBytes(), strlen($n->toBytes(true)) - 1, "\0", STR_PAD_LEFT);
if (openssl_public_encrypt($plaintext, $result, $RSAPublicKey, OPENSSL_NO_PADDING)) {
return new Math_BigInteger($result, 256);
}
}
if ( MATH_BIGINTEGER_MODE == MATH_BIGINTEGER_MODE_BCMATH ) {
$temp = new Math_BigInteger();
$temp->value = bcpowmod($this->value, $e->value, $n->value, 0);
return $this->_normalize($temp);
}
if ( empty($e->value) ) {
$temp = new Math_BigInteger();
$temp->value = array(1);
return $this->_normalize($temp);
}
if ( $e->value == array(1) ) {
list(, $temp) = $this->divide($n);
return $this->_normalize($temp);
}
if ( $e->value == array(2) ) {
$temp = new Math_BigInteger();
$temp->value = $this->_square($this->value);
list(, $temp) = $temp->divide($n);
return $this->_normalize($temp);
}
return $this->_normalize($this->_slidingWindow($e, $n, MATH_BIGINTEGER_BARRETT));
// is the modulo odd?
if ( $n->value[0] & 1 ) {
return $this->_normalize($this->_slidingWindow($e, $n, MATH_BIGINTEGER_MONTGOMERY));
}
// if it's not, it's even
// find the lowest set bit (eg. the max pow of 2 that divides $n)
for ($i = 0; $i < count($n->value); ++$i) {
if ( $n->value[$i] ) {
$temp = decbin($n->value[$i]);
$j = strlen($temp) - strrpos($temp, '1') - 1;
$j+= 26 * $i;
break;
}
}
// at this point, 2^$j * $n/(2^$j) == $n
$mod1 = $n->copy();
$mod1->_rshift($j);
$mod2 = new Math_BigInteger();
$mod2->value = array(1);
$mod2->_lshift($j);
$part1 = ( $mod1->value != array(1) ) ? $this->_slidingWindow($e, $mod1, MATH_BIGINTEGER_MONTGOMERY) : new Math_BigInteger();
$part2 = $this->_slidingWindow($e, $mod2, MATH_BIGINTEGER_POWEROF2);
$y1 = $mod2->modInverse($mod1);
$y2 = $mod1->modInverse($mod2);
$result = $part1->multiply($mod2);
$result = $result->multiply($y1);
$temp = $part2->multiply($mod1);
$temp = $temp->multiply($y2);
$result = $result->add($temp);
list(, $result) = $result->divide($n);
return $this->_normalize($result);
}
/**
* Performs modular exponentiation.
*
* Alias for Math_BigInteger::modPow()
*
* @param Math_BigInteger $e
* @param Math_BigInteger $n
* @return Math_BigInteger
* @access public
*/
function powMod($e, $n)
{
return $this->modPow($e, $n);
}
/**
* Sliding Window k-ary Modular Exponentiation
*
* Based on {@link http://www.cacr.math.uwaterloo.ca/hac/about/chap14.pdf#page=27 HAC 14.85} /
* {@link http://math.libtomcrypt.com/files/tommath.pdf#page=210 MPM 7.7}. In a departure from those algorithims,
* however, this function performs a modular reduction after every multiplication and squaring operation.
* As such, this function has the same preconditions that the reductions being used do.
*
* @param Math_BigInteger $e
* @param Math_BigInteger $n
* @param Integer $mode
* @return Math_BigInteger
* @access private
*/
function _slidingWindow($e, $n, $mode)
{
static $window_ranges = array(7, 25, 81, 241, 673, 1793); // from BigInteger.java's oddModPow function
//static $window_ranges = array(0, 7, 36, 140, 450, 1303, 3529); // from MPM 7.3.1
$e_value = $e->value;
$e_length = count($e_value) - 1;
$e_bits = decbin($e_value[$e_length]);
for ($i = $e_length - 1; $i >= 0; --$i) {
$e_bits.= str_pad(decbin($e_value[$i]), MATH_BIGINTEGER_BASE, '0', STR_PAD_LEFT);
}
$e_length = strlen($e_bits);
// calculate the appropriate window size.
// $window_size == 3 if $window_ranges is between 25 and 81, for example.
for ($i = 0, $window_size = 1; $e_length > $window_ranges[$i] && $i < count($window_ranges); ++$window_size, ++$i);
$n_value = $n->value;
// precompute $this^0 through $this^$window_size
$powers = array();
$powers[1] = $this->_prepareReduce($this->value, $n_value, $mode);
$powers[2] = $this->_squareReduce($powers[1], $n_value, $mode);
// we do every other number since substr($e_bits, $i, $j+1) (see below) is supposed to end
// in a 1. ie. it's supposed to be odd.
$temp = 1 << ($window_size - 1);
for ($i = 1; $i < $temp; ++$i) {
$i2 = $i << 1;
$powers[$i2 + 1] = $this->_multiplyReduce($powers[$i2 - 1], $powers[2], $n_value, $mode);
}
$result = array(1);
$result = $this->_prepareReduce($result, $n_value, $mode);
for ($i = 0; $i < $e_length; ) {
if ( !$e_bits[$i] ) {
$result = $this->_squareReduce($result, $n_value, $mode);
++$i;
} else {
for ($j = $window_size - 1; $j > 0; --$j) {
if ( !empty($e_bits[$i + $j]) ) {
break;
}
}
for ($k = 0; $k <= $j; ++$k) {// eg. the length of substr($e_bits, $i, $j+1)
$result = $this->_squareReduce($result, $n_value, $mode);
}
$result = $this->_multiplyReduce($result, $powers[bindec(substr($e_bits, $i, $j + 1))], $n_value, $mode);
$i+=$j + 1;
}
}
$temp = new Math_BigInteger();
$temp->value = $this->_reduce($result, $n_value, $mode);
return $temp;
}
/**
* Modular reduction
*
* For most $modes this will return the remainder.
*
* @see _slidingWindow()
* @access private
* @param Array $x
* @param Array $n
* @param Integer $mode
* @return Array
*/
function _reduce($x, $n, $mode)
{
switch ($mode) {
case MATH_BIGINTEGER_MONTGOMERY:
return $this->_montgomery($x, $n);
case MATH_BIGINTEGER_BARRETT:
return $this->_barrett($x, $n);
case MATH_BIGINTEGER_POWEROF2:
$lhs = new Math_BigInteger();
$lhs->value = $x;
$rhs = new Math_BigInteger();
$rhs->value = $n;
return $x->_mod2($n);
case MATH_BIGINTEGER_CLASSIC:
$lhs = new Math_BigInteger();
$lhs->value = $x;
$rhs = new Math_BigInteger();
$rhs->value = $n;
list(, $temp) = $lhs->divide($rhs);
return $temp->value;
case MATH_BIGINTEGER_NONE:
return $x;
default:
// an invalid $mode was provided
}
}
/**
* Modular reduction preperation
*
* @see _slidingWindow()
* @access private
* @param Array $x
* @param Array $n
* @param Integer $mode
* @return Array
*/
function _prepareReduce($x, $n, $mode)
{
if ($mode == MATH_BIGINTEGER_MONTGOMERY) {
return $this->_prepMontgomery($x, $n);
}
return $this->_reduce($x, $n, $mode);
}
/**
* Modular multiply
*
* @see _slidingWindow()
* @access private
* @param Array $x
* @param Array $y
* @param Array $n
* @param Integer $mode
* @return Array
*/
function _multiplyReduce($x, $y, $n, $mode)
{
if ($mode == MATH_BIGINTEGER_MONTGOMERY) {
return $this->_montgomeryMultiply($x, $y, $n);
}
$temp = $this->_multiply($x, false, $y, false);
return $this->_reduce($temp[MATH_BIGINTEGER_VALUE], $n, $mode);
}
/**
* Modular square
*
* @see _slidingWindow()
* @access private
* @param Array $x
* @param Array $n
* @param Integer $mode
* @return Array
*/
function _squareReduce($x, $n, $mode)
{
if ($mode == MATH_BIGINTEGER_MONTGOMERY) {
return $this->_montgomeryMultiply($x, $x, $n);
}
return $this->_reduce($this->_square($x), $n, $mode);
}
/**
* Modulos for Powers of Two
*
* Calculates $x%$n, where $n = 2**$e, for some $e. Since this is basically the same as doing $x & ($n-1),
* we'll just use this function as a wrapper for doing that.
*
* @see _slidingWindow()
* @access private
* @param Math_BigInteger
* @return Math_BigInteger
*/
function _mod2($n)
{
$temp = new Math_BigInteger();
$temp->value = array(1);
return $this->bitwise_and($n->subtract($temp));
}
/**
* Barrett Modular Reduction
*
* See {@link http://www.cacr.math.uwaterloo.ca/hac/about/chap14.pdf#page=14 HAC 14.3.3} /
* {@link http://math.libtomcrypt.com/files/tommath.pdf#page=165 MPM 6.2.5} for more information. Modified slightly,
* so as not to require negative numbers (initially, this script didn't support negative numbers).
*
* Employs "folding", as described at
* {@link http://www.cosic.esat.kuleuven.be/publications/thesis-149.pdf#page=66 thesis-149.pdf#page=66}. To quote from
* it, "the idea [behind folding] is to find a value x' such that x (mod m) = x' (mod m), with x' being smaller than x."
*
* Unfortunately, the "Barrett Reduction with Folding" algorithm described in thesis-149.pdf is not, as written, all that
* usable on account of (1) its not using reasonable radix points as discussed in
* {@link http://math.libtomcrypt.com/files/tommath.pdf#page=162 MPM 6.2.2} and (2) the fact that, even with reasonable
* radix points, it only works when there are an even number of digits in the denominator. The reason for (2) is that
* (x >> 1) + (x >> 1) != x / 2 + x / 2. If x is even, they're the same, but if x is odd, they're not. See the in-line
* comments for details.
*
* @see _slidingWindow()
* @access private
* @param Array $n
* @param Array $m
* @return Array
*/
function _barrett($n, $m)
{
static $cache = array(
MATH_BIGINTEGER_VARIABLE => array(),
MATH_BIGINTEGER_DATA => array()
);
$m_length = count($m);
// if ($this->_compare($n, $this->_square($m)) >= 0) {
if (count($n) > 2 * $m_length) {
$lhs = new Math_BigInteger();
$rhs = new Math_BigInteger();
$lhs->value = $n;
$rhs->value = $m;
list(, $temp) = $lhs->divide($rhs);
return $temp->value;
}
// if (m.length >> 1) + 2 <= m.length then m is too small and n can't be reduced
if ($m_length < 5) {
return $this->_regularBarrett($n, $m);
}
// n = 2 * m.length
if ( ($key = array_search($m, $cache[MATH_BIGINTEGER_VARIABLE])) === false ) {
$key = count($cache[MATH_BIGINTEGER_VARIABLE]);
$cache[MATH_BIGINTEGER_VARIABLE][] = $m;
$lhs = new Math_BigInteger();
$lhs_value = &$lhs->value;
$lhs_value = $this->_array_repeat(0, $m_length + ($m_length >> 1));
$lhs_value[] = 1;
$rhs = new Math_BigInteger();
$rhs->value = $m;
list($u, $m1) = $lhs->divide($rhs);
$u = $u->value;
$m1 = $m1->value;
$cache[MATH_BIGINTEGER_DATA][] = array(
'u' => $u, // m.length >> 1 (technically (m.length >> 1) + 1)
'm1'=> $m1 // m.length
);
} else {
extract($cache[MATH_BIGINTEGER_DATA][$key]);
}
$cutoff = $m_length + ($m_length >> 1);
$lsd = array_slice($n, 0, $cutoff); // m.length + (m.length >> 1)
$msd = array_slice($n, $cutoff); // m.length >> 1
$lsd = $this->_trim($lsd);
$temp = $this->_multiply($msd, false, $m1, false);
$n = $this->_add($lsd, false, $temp[MATH_BIGINTEGER_VALUE], false); // m.length + (m.length >> 1) + 1
if ($m_length & 1) {
return $this->_regularBarrett($n[MATH_BIGINTEGER_VALUE], $m);
}
// (m.length + (m.length >> 1) + 1) - (m.length - 1) == (m.length >> 1) + 2
$temp = array_slice($n[MATH_BIGINTEGER_VALUE], $m_length - 1);
// if even: ((m.length >> 1) + 2) + (m.length >> 1) == m.length + 2
// if odd: ((m.length >> 1) + 2) + (m.length >> 1) == (m.length - 1) + 2 == m.length + 1
$temp = $this->_multiply($temp, false, $u, false);
// if even: (m.length + 2) - ((m.length >> 1) + 1) = m.length - (m.length >> 1) + 1
// if odd: (m.length + 1) - ((m.length >> 1) + 1) = m.length - (m.length >> 1)
$temp = array_slice($temp[MATH_BIGINTEGER_VALUE], ($m_length >> 1) + 1);
// if even: (m.length - (m.length >> 1) + 1) + m.length = 2 * m.length - (m.length >> 1) + 1
// if odd: (m.length - (m.length >> 1)) + m.length = 2 * m.length - (m.length >> 1)
$temp = $this->_multiply($temp, false, $m, false);
// at this point, if m had an odd number of digits, we'd be subtracting a 2 * m.length - (m.length >> 1) digit
// number from a m.length + (m.length >> 1) + 1 digit number. ie. there'd be an extra digit and the while loop
// following this comment would loop a lot (hence our calling _regularBarrett() in that situation).
$result = $this->_subtract($n[MATH_BIGINTEGER_VALUE], false, $temp[MATH_BIGINTEGER_VALUE], false);
while ($this->_compare($result[MATH_BIGINTEGER_VALUE], $result[MATH_BIGINTEGER_SIGN], $m, false) >= 0) {
$result = $this->_subtract($result[MATH_BIGINTEGER_VALUE], $result[MATH_BIGINTEGER_SIGN], $m, false);
}
return $result[MATH_BIGINTEGER_VALUE];
}
/**
* (Regular) Barrett Modular Reduction
*
* For numbers with more than four digits Math_BigInteger::_barrett() is faster. The difference between that and this
* is that this function does not fold the denominator into a smaller form.
*
* @see _slidingWindow()
* @access private
* @param Array $x
* @param Array $n
* @return Array
*/
function _regularBarrett($x, $n)
{
static $cache = array(
MATH_BIGINTEGER_VARIABLE => array(),
MATH_BIGINTEGER_DATA => array()
);
$n_length = count($n);
if (count($x) > 2 * $n_length) {
$lhs = new Math_BigInteger();
$rhs = new Math_BigInteger();
$lhs->value = $x;
$rhs->value = $n;
list(, $temp) = $lhs->divide($rhs);
return $temp->value;
}
if ( ($key = array_search($n, $cache[MATH_BIGINTEGER_VARIABLE])) === false ) {
$key = count($cache[MATH_BIGINTEGER_VARIABLE]);
$cache[MATH_BIGINTEGER_VARIABLE][] = $n;
$lhs = new Math_BigInteger();
$lhs_value = &$lhs->value;
$lhs_value = $this->_array_repeat(0, 2 * $n_length);
$lhs_value[] = 1;
$rhs = new Math_BigInteger();
$rhs->value = $n;
list($temp, ) = $lhs->divide($rhs); // m.length
$cache[MATH_BIGINTEGER_DATA][] = $temp->value;
}
// 2 * m.length - (m.length - 1) = m.length + 1
$temp = array_slice($x, $n_length - 1);
// (m.length + 1) + m.length = 2 * m.length + 1
$temp = $this->_multiply($temp, false, $cache[MATH_BIGINTEGER_DATA][$key], false);
// (2 * m.length + 1) - (m.length - 1) = m.length + 2
$temp = array_slice($temp[MATH_BIGINTEGER_VALUE], $n_length + 1);
// m.length + 1
$result = array_slice($x, 0, $n_length + 1);
// m.length + 1
$temp = $this->_multiplyLower($temp, false, $n, false, $n_length + 1);
// $temp == array_slice($temp->_multiply($temp, false, $n, false)->value, 0, $n_length + 1)
if ($this->_compare($result, false, $temp[MATH_BIGINTEGER_VALUE], $temp[MATH_BIGINTEGER_SIGN]) < 0) {
$corrector_value = $this->_array_repeat(0, $n_length + 1);
$corrector_value[] = 1;
$result = $this->_add($result, false, $corrector_value, false);
$result = $result[MATH_BIGINTEGER_VALUE];
}
// at this point, we're subtracting a number with m.length + 1 digits from another number with m.length + 1 digits
$result = $this->_subtract($result, false, $temp[MATH_BIGINTEGER_VALUE], $temp[MATH_BIGINTEGER_SIGN]);
while ($this->_compare($result[MATH_BIGINTEGER_VALUE], $result[MATH_BIGINTEGER_SIGN], $n, false) > 0) {
$result = $this->_subtract($result[MATH_BIGINTEGER_VALUE], $result[MATH_BIGINTEGER_SIGN], $n, false);
}
return $result[MATH_BIGINTEGER_VALUE];
}
/**
* Performs long multiplication up to $stop digits
*
* If you're going to be doing array_slice($product->value, 0, $stop), some cycles can be saved.
*
* @see _regularBarrett()
* @param Array $x_value
* @param Boolean $x_negative
* @param Array $y_value
* @param Boolean $y_negative
* @param Integer $stop
* @return Array
* @access private
*/
function _multiplyLower($x_value, $x_negative, $y_value, $y_negative, $stop)
{
$x_length = count($x_value);
$y_length = count($y_value);
if ( !$x_length || !$y_length ) { // a 0 is being multiplied
return array(
MATH_BIGINTEGER_VALUE => array(),
MATH_BIGINTEGER_SIGN => false
);
}
if ( $x_length < $y_length ) {
$temp = $x_value;
$x_value = $y_value;
$y_value = $temp;
$x_length = count($x_value);
$y_length = count($y_value);
}
$product_value = $this->_array_repeat(0, $x_length + $y_length);
// the following for loop could be removed if the for loop following it
// (the one with nested for loops) initially set $i to 0, but
// doing so would also make the result in one set of unnecessary adds,
// since on the outermost loops first pass, $product->value[$k] is going
// to always be 0
$carry = 0;
for ($j = 0; $j < $x_length; ++$j) { // ie. $i = 0, $k = $i
$temp = $x_value[$j] * $y_value[0] + $carry; // $product_value[$k] == 0
$carry = (int) ($temp / MATH_BIGINTEGER_BASE_FULL);
$product_value[$j] = (int) ($temp - MATH_BIGINTEGER_BASE_FULL * $carry);
}
if ($j < $stop) {
$product_value[$j] = $carry;
}
// the above for loop is what the previous comment was talking about. the
// following for loop is the "one with nested for loops"
for ($i = 1; $i < $y_length; ++$i) {
$carry = 0;
for ($j = 0, $k = $i; $j < $x_length && $k < $stop; ++$j, ++$k) {
$temp = $product_value[$k] + $x_value[$j] * $y_value[$i] + $carry;
$carry = (int) ($temp / MATH_BIGINTEGER_BASE_FULL);
$product_value[$k] = (int) ($temp - MATH_BIGINTEGER_BASE_FULL * $carry);
}
if ($k < $stop) {
$product_value[$k] = $carry;
}
}
return array(
MATH_BIGINTEGER_VALUE => $this->_trim($product_value),
MATH_BIGINTEGER_SIGN => $x_negative != $y_negative
);
}
/**
* Montgomery Modular Reduction
*
* ($x->_prepMontgomery($n))->_montgomery($n) yields $x % $n.
* {@link http://math.libtomcrypt.com/files/tommath.pdf#page=170 MPM 6.3} provides insights on how this can be
* improved upon (basically, by using the comba method). gcd($n, 2) must be equal to one for this function
* to work correctly.
*
* @see _prepMontgomery()
* @see _slidingWindow()
* @access private
* @param Array $x
* @param Array $n
* @return Array
*/
function _montgomery($x, $n)
{
static $cache = array(
MATH_BIGINTEGER_VARIABLE => array(),
MATH_BIGINTEGER_DATA => array()
);
if ( ($key = array_search($n, $cache[MATH_BIGINTEGER_VARIABLE])) === false ) {
$key = count($cache[MATH_BIGINTEGER_VARIABLE]);
$cache[MATH_BIGINTEGER_VARIABLE][] = $x;
$cache[MATH_BIGINTEGER_DATA][] = $this->_modInverse67108864($n);
}
$k = count($n);
$result = array(MATH_BIGINTEGER_VALUE => $x);
for ($i = 0; $i < $k; ++$i) {
$temp = $result[MATH_BIGINTEGER_VALUE][$i] * $cache[MATH_BIGINTEGER_DATA][$key];
$temp = (int) ($temp - MATH_BIGINTEGER_BASE_FULL * ((int) ($temp / MATH_BIGINTEGER_BASE_FULL)));
$temp = $this->_regularMultiply(array($temp), $n);
$temp = array_merge($this->_array_repeat(0, $i), $temp);
$result = $this->_add($result[MATH_BIGINTEGER_VALUE], false, $temp, false);
}
$result[MATH_BIGINTEGER_VALUE] = array_slice($result[MATH_BIGINTEGER_VALUE], $k);
if ($this->_compare($result, false, $n, false) >= 0) {
$result = $this->_subtract($result[MATH_BIGINTEGER_VALUE], false, $n, false);
}
return $result[MATH_BIGINTEGER_VALUE];
}
/**
* Montgomery Multiply
*
* Interleaves the montgomery reduction and long multiplication algorithms together as described in
* {@link http://www.cacr.math.uwaterloo.ca/hac/about/chap14.pdf#page=13 HAC 14.36}
*
* @see _prepMontgomery()
* @see _montgomery()
* @access private
* @param Array $x
* @param Array $y
* @param Array $m
* @return Array
*/
function _montgomeryMultiply($x, $y, $m)
{
$temp = $this->_multiply($x, false, $y, false);
return $this->_montgomery($temp[MATH_BIGINTEGER_VALUE], $m);
static $cache = array(
MATH_BIGINTEGER_VARIABLE => array(),
MATH_BIGINTEGER_DATA => array()
);
if ( ($key = array_search($m, $cache[MATH_BIGINTEGER_VARIABLE])) === false ) {
$key = count($cache[MATH_BIGINTEGER_VARIABLE]);
$cache[MATH_BIGINTEGER_VARIABLE][] = $m;
$cache[MATH_BIGINTEGER_DATA][] = $this->_modInverse67108864($m);
}
$n = max(count($x), count($y), count($m));
$x = array_pad($x, $n, 0);
$y = array_pad($y, $n, 0);
$m = array_pad($m, $n, 0);
$a = array(MATH_BIGINTEGER_VALUE => $this->_array_repeat(0, $n + 1));
for ($i = 0; $i < $n; ++$i) {
$temp = $a[MATH_BIGINTEGER_VALUE][0] + $x[$i] * $y[0];
$temp = (int) ($temp - MATH_BIGINTEGER_BASE_FULL * ((int) ($temp / MATH_BIGINTEGER_BASE_FULL)));
$temp = $temp * $cache[MATH_BIGINTEGER_DATA][$key];
$temp = (int) ($temp - MATH_BIGINTEGER_BASE_FULL * ((int) ($temp / MATH_BIGINTEGER_BASE_FULL)));
$temp = $this->_add($this->_regularMultiply(array($x[$i]), $y), false, $this->_regularMultiply(array($temp), $m), false);
$a = $this->_add($a[MATH_BIGINTEGER_VALUE], false, $temp[MATH_BIGINTEGER_VALUE], false);
$a[MATH_BIGINTEGER_VALUE] = array_slice($a[MATH_BIGINTEGER_VALUE], 1);
}
if ($this->_compare($a[MATH_BIGINTEGER_VALUE], false, $m, false) >= 0) {
$a = $this->_subtract($a[MATH_BIGINTEGER_VALUE], false, $m, false);
}
return $a[MATH_BIGINTEGER_VALUE];
}
/**
* Prepare a number for use in Montgomery Modular Reductions
*
* @see _montgomery()
* @see _slidingWindow()
* @access private
* @param Array $x
* @param Array $n
* @return Array
*/
function _prepMontgomery($x, $n)
{
$lhs = new Math_BigInteger();
$lhs->value = array_merge($this->_array_repeat(0, count($n)), $x);
$rhs = new Math_BigInteger();
$rhs->value = $n;
list(, $temp) = $lhs->divide($rhs);
return $temp->value;
}
/**
* Modular Inverse of a number mod 2**26 (eg. 67108864)
*
* Based off of the bnpInvDigit function implemented and justified in the following URL:
*
* {@link http://www-cs-students.stanford.edu/~tjw/jsbn/jsbn.js}
*
* The following URL provides more info:
*
* {@link http://groups.google.com/group/sci.crypt/msg/7a137205c1be7d85}
*
* As for why we do all the bitmasking... strange things can happen when converting from floats to ints. For
* instance, on some computers, var_dump((int) -4294967297) yields int(-1) and on others, it yields
* int(-2147483648). To avoid problems stemming from this, we use bitmasks to guarantee that ints aren't
* auto-converted to floats. The outermost bitmask is present because without it, there's no guarantee that
* the "residue" returned would be the so-called "common residue". We use fmod, in the last step, because the
* maximum possible $x is 26 bits and the maximum $result is 16 bits. Thus, we have to be able to handle up to
* 40 bits, which only 64-bit floating points will support.
*
* Thanks to Pedro Gimeno Fortea for input!
*
* @see _montgomery()
* @access private
* @param Array $x
* @return Integer
*/
function _modInverse67108864($x) // 2**26 == 67,108,864
{
$x = -$x[0];
$result = $x & 0x3; // x**-1 mod 2**2
$result = ($result * (2 - $x * $result)) & 0xF; // x**-1 mod 2**4
$result = ($result * (2 - ($x & 0xFF) * $result)) & 0xFF; // x**-1 mod 2**8
$result = ($result * ((2 - ($x & 0xFFFF) * $result) & 0xFFFF)) & 0xFFFF; // x**-1 mod 2**16
$result = fmod($result * (2 - fmod($x * $result, MATH_BIGINTEGER_BASE_FULL)), MATH_BIGINTEGER_BASE_FULL); // x**-1 mod 2**26
return $result & MATH_BIGINTEGER_MAX_DIGIT;
}
/**
* Calculates modular inverses.
*
* Say you have (30 mod 17 * x mod 17) mod 17 == 1. x can be found using modular inverses.
*
* Here's an example:
* <code>
* <?php
* include('Math/BigInteger.php');
*
* $a = new Math_BigInteger(30);
* $b = new Math_BigInteger(17);
*
* $c = $a->modInverse($b);
* echo $c->toString(); // outputs 4
*
* echo "\r\n";
*
* $d = $a->multiply($c);
* list(, $d) = $d->divide($b);
* echo $d; // outputs 1 (as per the definition of modular inverse)
* ?>
* </code>
*
* @param Math_BigInteger $n
* @return mixed false, if no modular inverse exists, Math_BigInteger, otherwise.
* @access public
* @internal See {@link http://www.cacr.math.uwaterloo.ca/hac/about/chap14.pdf#page=21 HAC 14.64} for more information.
*/
function modInverse($n)
{
switch ( MATH_BIGINTEGER_MODE ) {
case MATH_BIGINTEGER_MODE_GMP:
$temp = new Math_BigInteger();
$temp->value = gmp_invert($this->value, $n->value);
return ( $temp->value === false ) ? false : $this->_normalize($temp);
}
static $zero, $one;
if (!isset($zero)) {
$zero = new Math_BigInteger();
$one = new Math_BigInteger(1);
}
// $x mod -$n == $x mod $n.
$n = $n->abs();
if ($this->compare($zero) < 0) {
$temp = $this->abs();
$temp = $temp->modInverse($n);
return $this->_normalize($n->subtract($temp));
}
extract($this->extendedGCD($n));
if (!$gcd->equals($one)) {
return false;
}
$x = $x->compare($zero) < 0 ? $x->add($n) : $x;
return $this->compare($zero) < 0 ? $this->_normalize($n->subtract($x)) : $this->_normalize($x);
}
/**
* Calculates the greatest common divisor and Bezout's identity.
*
* Say you have 693 and 609. The GCD is 21. Bezout's identity states that there exist integers x and y such that
* 693*x + 609*y == 21. In point of fact, there are actually an infinite number of x and y combinations and which
* combination is returned is dependant upon which mode is in use. See
* {@link http://en.wikipedia.org/wiki/B%C3%A9zout%27s_identity Bezout's identity - Wikipedia} for more information.
*
* Here's an example:
* <code>
* <?php
* include('Math/BigInteger.php');
*
* $a = new Math_BigInteger(693);
* $b = new Math_BigInteger(609);
*
* extract($a->extendedGCD($b));
*
* echo $gcd->toString() . "\r\n"; // outputs 21
* echo $a->toString() * $x->toString() + $b->toString() * $y->toString(); // outputs 21
* ?>
* </code>
*
* @param Math_BigInteger $n
* @return Math_BigInteger
* @access public
* @internal Calculates the GCD using the binary xGCD algorithim described in
* {@link http://www.cacr.math.uwaterloo.ca/hac/about/chap14.pdf#page=19 HAC 14.61}. As the text above 14.61 notes,
* the more traditional algorithim requires "relatively costly multiple-precision divisions".
*/
function extendedGCD($n)
{
switch ( MATH_BIGINTEGER_MODE ) {
case MATH_BIGINTEGER_MODE_GMP:
extract(gmp_gcdext($this->value, $n->value));
return array(
'gcd' => $this->_normalize(new Math_BigInteger($g)),
'x' => $this->_normalize(new Math_BigInteger($s)),
'y' => $this->_normalize(new Math_BigInteger($t))
);
case MATH_BIGINTEGER_MODE_BCMATH:
// it might be faster to use the binary xGCD algorithim here, as well, but (1) that algorithim works
// best when the base is a power of 2 and (2) i don't think it'd make much difference, anyway. as is,
// the basic extended euclidean algorithim is what we're using.
$u = $this->value;
$v = $n->value;
$a = '1';
$b = '0';
$c = '0';
$d = '1';
while (bccomp($v, '0', 0) != 0) {
$q = bcdiv($u, $v, 0);
$temp = $u;
$u = $v;
$v = bcsub($temp, bcmul($v, $q, 0), 0);
$temp = $a;
$a = $c;
$c = bcsub($temp, bcmul($a, $q, 0), 0);
$temp = $b;
$b = $d;
$d = bcsub($temp, bcmul($b, $q, 0), 0);
}
return array(
'gcd' => $this->_normalize(new Math_BigInteger($u)),
'x' => $this->_normalize(new Math_BigInteger($a)),
'y' => $this->_normalize(new Math_BigInteger($b))
);
}
$y = $n->copy();
$x = $this->copy();
$g = new Math_BigInteger();
$g->value = array(1);
while ( !(($x->value[0] & 1)|| ($y->value[0] & 1)) ) {
$x->_rshift(1);
$y->_rshift(1);
$g->_lshift(1);
}
$u = $x->copy();
$v = $y->copy();
$a = new Math_BigInteger();
$b = new Math_BigInteger();
$c = new Math_BigInteger();
$d = new Math_BigInteger();
$a->value = $d->value = $g->value = array(1);
$b->value = $c->value = array();
while ( !empty($u->value) ) {
while ( !($u->value[0] & 1) ) {
$u->_rshift(1);
if ( (!empty($a->value) && ($a->value[0] & 1)) || (!empty($b->value) && ($b->value[0] & 1)) ) {
$a = $a->add($y);
$b = $b->subtract($x);
}
$a->_rshift(1);
$b->_rshift(1);
}
while ( !($v->value[0] & 1) ) {
$v->_rshift(1);
if ( (!empty($d->value) && ($d->value[0] & 1)) || (!empty($c->value) && ($c->value[0] & 1)) ) {
$c = $c->add($y);
$d = $d->subtract($x);
}
$c->_rshift(1);
$d->_rshift(1);
}
if ($u->compare($v) >= 0) {
$u = $u->subtract($v);
$a = $a->subtract($c);
$b = $b->subtract($d);
} else {
$v = $v->subtract($u);
$c = $c->subtract($a);
$d = $d->subtract($b);
}
}
return array(
'gcd' => $this->_normalize($g->multiply($v)),
'x' => $this->_normalize($c),
'y' => $this->_normalize($d)
);
}
/**
* Calculates the greatest common divisor
*
* Say you have 693 and 609. The GCD is 21.
*
* Here's an example:
* <code>
* <?php
* include('Math/BigInteger.php');
*
* $a = new Math_BigInteger(693);
* $b = new Math_BigInteger(609);
*
* $gcd = a->extendedGCD($b);
*
* echo $gcd->toString() . "\r\n"; // outputs 21
* ?>
* </code>
*
* @param Math_BigInteger $n
* @return Math_BigInteger
* @access public
*/
function gcd($n)
{
extract($this->extendedGCD($n));
return $gcd;
}
/**
* Absolute value.
*
* @return Math_BigInteger
* @access public
*/
function abs()
{
$temp = new Math_BigInteger();
switch ( MATH_BIGINTEGER_MODE ) {
case MATH_BIGINTEGER_MODE_GMP:
$temp->value = gmp_abs($this->value);
break;
case MATH_BIGINTEGER_MODE_BCMATH:
$temp->value = (bccomp($this->value, '0', 0) < 0) ? substr($this->value, 1) : $this->value;
break;
default:
$temp->value = $this->value;
}
return $temp;
}
/**
* Compares two numbers.
*
* Although one might think !$x->compare($y) means $x != $y, it, in fact, means the opposite. The reason for this is
* demonstrated thusly:
*
* $x > $y: $x->compare($y) > 0
* $x < $y: $x->compare($y) < 0
* $x == $y: $x->compare($y) == 0
*
* Note how the same comparison operator is used. If you want to test for equality, use $x->equals($y).
*
* @param Math_BigInteger $y
* @return Integer < 0 if $this is less than $y; > 0 if $this is greater than $y, and 0 if they are equal.
* @access public
* @see equals()
* @internal Could return $this->subtract($x), but that's not as fast as what we do do.
*/
function compare($y)
{
switch ( MATH_BIGINTEGER_MODE ) {
case MATH_BIGINTEGER_MODE_GMP:
return gmp_cmp($this->value, $y->value);
case MATH_BIGINTEGER_MODE_BCMATH:
return bccomp($this->value, $y->value, 0);
}
return $this->_compare($this->value, $this->is_negative, $y->value, $y->is_negative);
}
/**
* Compares two numbers.
*
* @param Array $x_value
* @param Boolean $x_negative
* @param Array $y_value
* @param Boolean $y_negative
* @return Integer
* @see compare()
* @access private
*/
function _compare($x_value, $x_negative, $y_value, $y_negative)
{
if ( $x_negative != $y_negative ) {
return ( !$x_negative && $y_negative ) ? 1 : -1;
}
$result = $x_negative ? -1 : 1;
if ( count($x_value) != count($y_value) ) {
return ( count($x_value) > count($y_value) ) ? $result : -$result;
}
$size = max(count($x_value), count($y_value));
$x_value = array_pad($x_value, $size, 0);
$y_value = array_pad($y_value, $size, 0);
for ($i = count($x_value) - 1; $i >= 0; --$i) {
if ($x_value[$i] != $y_value[$i]) {
return ( $x_value[$i] > $y_value[$i] ) ? $result : -$result;
}
}
return 0;
}
/**
* Tests the equality of two numbers.
*
* If you need to see if one number is greater than or less than another number, use Math_BigInteger::compare()
*
* @param Math_BigInteger $x
* @return Boolean
* @access public
* @see compare()
*/
function equals($x)
{
switch ( MATH_BIGINTEGER_MODE ) {
case MATH_BIGINTEGER_MODE_GMP:
return gmp_cmp($this->value, $x->value) == 0;
default:
return $this->value === $x->value && $this->is_negative == $x->is_negative;
}
}
/**
* Set Precision
*
* Some bitwise operations give different results depending on the precision being used. Examples include left
* shift, not, and rotates.
*
* @param Integer $bits
* @access public
*/
function setPrecision($bits)
{
$this->precision = $bits;
if ( MATH_BIGINTEGER_MODE != MATH_BIGINTEGER_MODE_BCMATH ) {
$this->bitmask = new Math_BigInteger(chr((1 << ($bits & 0x7)) - 1) . str_repeat(chr(0xFF), $bits >> 3), 256);
} else {
$this->bitmask = new Math_BigInteger(bcpow('2', $bits, 0));
}
$temp = $this->_normalize($this);
$this->value = $temp->value;
}
/**
* Logical And
*
* @param Math_BigInteger $x
* @access public
* @internal Implemented per a request by Lluis Pamies i Juarez <lluis _a_ pamies.cat>
* @return Math_BigInteger
*/
function bitwise_and($x)
{
switch ( MATH_BIGINTEGER_MODE ) {
case MATH_BIGINTEGER_MODE_GMP:
$temp = new Math_BigInteger();
$temp->value = gmp_and($this->value, $x->value);
return $this->_normalize($temp);
case MATH_BIGINTEGER_MODE_BCMATH:
$left = $this->toBytes();
$right = $x->toBytes();
$length = max(strlen($left), strlen($right));
$left = str_pad($left, $length, chr(0), STR_PAD_LEFT);
$right = str_pad($right, $length, chr(0), STR_PAD_LEFT);
return $this->_normalize(new Math_BigInteger($left & $right, 256));
}
$result = $this->copy();
$length = min(count($x->value), count($this->value));
$result->value = array_slice($result->value, 0, $length);
for ($i = 0; $i < $length; ++$i) {
$result->value[$i]&= $x->value[$i];
}
return $this->_normalize($result);
}
/**
* Logical Or
*
* @param Math_BigInteger $x
* @access public
* @internal Implemented per a request by Lluis Pamies i Juarez <lluis _a_ pamies.cat>
* @return Math_BigInteger
*/
function bitwise_or($x)
{
switch ( MATH_BIGINTEGER_MODE ) {
case MATH_BIGINTEGER_MODE_GMP:
$temp = new Math_BigInteger();
$temp->value = gmp_or($this->value, $x->value);
return $this->_normalize($temp);
case MATH_BIGINTEGER_MODE_BCMATH:
$left = $this->toBytes();
$right = $x->toBytes();
$length = max(strlen($left), strlen($right));
$left = str_pad($left, $length, chr(0), STR_PAD_LEFT);
$right = str_pad($right, $length, chr(0), STR_PAD_LEFT);
return $this->_normalize(new Math_BigInteger($left | $right, 256));
}
$length = max(count($this->value), count($x->value));
$result = $this->copy();
$result->value = array_pad($result->value, $length, 0);
$x->value = array_pad($x->value, $length, 0);
for ($i = 0; $i < $length; ++$i) {
$result->value[$i]|= $x->value[$i];
}
return $this->_normalize($result);
}
/**
* Logical Exclusive-Or
*
* @param Math_BigInteger $x
* @access public
* @internal Implemented per a request by Lluis Pamies i Juarez <lluis _a_ pamies.cat>
* @return Math_BigInteger
*/
function bitwise_xor($x)
{
switch ( MATH_BIGINTEGER_MODE ) {
case MATH_BIGINTEGER_MODE_GMP:
$temp = new Math_BigInteger();
$temp->value = gmp_xor($this->value, $x->value);
return $this->_normalize($temp);
case MATH_BIGINTEGER_MODE_BCMATH:
$left = $this->toBytes();
$right = $x->toBytes();
$length = max(strlen($left), strlen($right));
$left = str_pad($left, $length, chr(0), STR_PAD_LEFT);
$right = str_pad($right, $length, chr(0), STR_PAD_LEFT);
return $this->_normalize(new Math_BigInteger($left ^ $right, 256));
}
$length = max(count($this->value), count($x->value));
$result = $this->copy();
$result->value = array_pad($result->value, $length, 0);
$x->value = array_pad($x->value, $length, 0);
for ($i = 0; $i < $length; ++$i) {
$result->value[$i]^= $x->value[$i];
}
return $this->_normalize($result);
}
/**
* Logical Not
*
* @access public
* @internal Implemented per a request by Lluis Pamies i Juarez <lluis _a_ pamies.cat>
* @return Math_BigInteger
*/
function bitwise_not()
{
// calculuate "not" without regard to $this->precision
// (will always result in a smaller number. ie. ~1 isn't 1111 1110 - it's 0)
$temp = $this->toBytes();
$pre_msb = decbin(ord($temp[0]));
$temp = ~$temp;
$msb = decbin(ord($temp[0]));
if (strlen($msb) == 8) {
$msb = substr($msb, strpos($msb, '0'));
}
$temp[0] = chr(bindec($msb));
// see if we need to add extra leading 1's
$current_bits = strlen($pre_msb) + 8 * strlen($temp) - 8;
$new_bits = $this->precision - $current_bits;
if ($new_bits <= 0) {
return $this->_normalize(new Math_BigInteger($temp, 256));
}
// generate as many leading 1's as we need to.
$leading_ones = chr((1 << ($new_bits & 0x7)) - 1) . str_repeat(chr(0xFF), $new_bits >> 3);
$this->_base256_lshift($leading_ones, $current_bits);
$temp = str_pad($temp, ceil($this->bits / 8), chr(0), STR_PAD_LEFT);
return $this->_normalize(new Math_BigInteger($leading_ones | $temp, 256));
}
/**
* Logical Right Shift
*
* Shifts BigInteger's by $shift bits, effectively dividing by 2**$shift.
*
* @param Integer $shift
* @return Math_BigInteger
* @access public
* @internal The only version that yields any speed increases is the internal version.
*/
function bitwise_rightShift($shift)
{
$temp = new Math_BigInteger();
switch ( MATH_BIGINTEGER_MODE ) {
case MATH_BIGINTEGER_MODE_GMP:
static $two;
if (!isset($two)) {
$two = gmp_init('2');
}
$temp->value = gmp_div_q($this->value, gmp_pow($two, $shift));
break;
case MATH_BIGINTEGER_MODE_BCMATH:
$temp->value = bcdiv($this->value, bcpow('2', $shift, 0), 0);
break;
default: // could just replace _lshift with this, but then all _lshift() calls would need to be rewritten
// and I don't want to do that...
$temp->value = $this->value;
$temp->_rshift($shift);
}
return $this->_normalize($temp);
}
/**
* Logical Left Shift
*
* Shifts BigInteger's by $shift bits, effectively multiplying by 2**$shift.
*
* @param Integer $shift
* @return Math_BigInteger
* @access public
* @internal The only version that yields any speed increases is the internal version.
*/
function bitwise_leftShift($shift)
{
$temp = new Math_BigInteger();
switch ( MATH_BIGINTEGER_MODE ) {
case MATH_BIGINTEGER_MODE_GMP:
static $two;
if (!isset($two)) {
$two = gmp_init('2');
}
$temp->value = gmp_mul($this->value, gmp_pow($two, $shift));
break;
case MATH_BIGINTEGER_MODE_BCMATH:
$temp->value = bcmul($this->value, bcpow('2', $shift, 0), 0);
break;
default: // could just replace _rshift with this, but then all _lshift() calls would need to be rewritten
// and I don't want to do that...
$temp->value = $this->value;
$temp->_lshift($shift);
}
return $this->_normalize($temp);
}
/**
* Logical Left Rotate
*
* Instead of the top x bits being dropped they're appended to the shifted bit string.
*
* @param Integer $shift
* @return Math_BigInteger
* @access public
*/
function bitwise_leftRotate($shift)
{
$bits = $this->toBytes();
if ($this->precision > 0) {
$precision = $this->precision;
if ( MATH_BIGINTEGER_MODE == MATH_BIGINTEGER_MODE_BCMATH ) {
$mask = $this->bitmask->subtract(new Math_BigInteger(1));
$mask = $mask->toBytes();
} else {
$mask = $this->bitmask->toBytes();
}
} else {
$temp = ord($bits[0]);
for ($i = 0; $temp >> $i; ++$i);
$precision = 8 * strlen($bits) - 8 + $i;
$mask = chr((1 << ($precision & 0x7)) - 1) . str_repeat(chr(0xFF), $precision >> 3);
}
if ($shift < 0) {
$shift+= $precision;
}
$shift%= $precision;
if (!$shift) {
return $this->copy();
}
$left = $this->bitwise_leftShift($shift);
$left = $left->bitwise_and(new Math_BigInteger($mask, 256));
$right = $this->bitwise_rightShift($precision - $shift);
$result = MATH_BIGINTEGER_MODE != MATH_BIGINTEGER_MODE_BCMATH ? $left->bitwise_or($right) : $left->add($right);
return $this->_normalize($result);
}
/**
* Logical Right Rotate
*
* Instead of the bottom x bits being dropped they're prepended to the shifted bit string.
*
* @param Integer $shift
* @return Math_BigInteger
* @access public
*/
function bitwise_rightRotate($shift)
{
return $this->bitwise_leftRotate(-$shift);
}
/**
* Set random number generator function
*
* This function is deprecated.
*
* @param String $generator
* @access public
*/
function setRandomGenerator($generator)
{
}
/**
* Generates a random BigInteger
*
* Byte length is equal to $length. Uses crypt_random if it's loaded and mt_rand if it's not.
*
* @param Integer $length
* @return Math_BigInteger
* @access private
*/
function _random_number_helper($size)
{
$crypt_random = function_exists('crypt_random_string') || (!class_exists('Crypt_Random') && function_exists('crypt_random_string'));
if ($crypt_random) {
$random = crypt_random_string($size);
} else {
$random = '';
if ($size & 1) {
$random.= chr(mt_rand(0, 255));
}
$blocks = $size >> 1;
for ($i = 0; $i < $blocks; ++$i) {
// mt_rand(-2147483648, 0x7FFFFFFF) always produces -2147483648 on some systems
$random.= pack('n', mt_rand(0, 0xFFFF));
}
}
return new Math_BigInteger($random, 256);
}
/**
* Generate a random number
*
* @param optional Integer $min
* @param optional Integer $max
* @return Math_BigInteger
* @access public
*/
function random($min = false, $max = false)
{
if ($min === false) {
$min = new Math_BigInteger(0);
}
if ($max === false) {
$max = new Math_BigInteger(0x7FFFFFFF);
}
$compare = $max->compare($min);
if (!$compare) {
return $this->_normalize($min);
} else if ($compare < 0) {
// if $min is bigger then $max, swap $min and $max
$temp = $max;
$max = $min;
$min = $temp;
}
static $one;
if (!isset($one)) {
$one = new Math_BigInteger(1);
}
$max = $max->subtract($min->subtract($one));
$size = strlen(ltrim($max->toBytes(), chr(0)));
/*
doing $random % $max doesn't work because some numbers will be more likely to occur than others.
eg. if $max is 140 and $random's max is 255 then that'd mean both $random = 5 and $random = 145
would produce 5 whereas the only value of random that could produce 139 would be 139. ie.
not all numbers would be equally likely. some would be more likely than others.
creating a whole new random number until you find one that is within the range doesn't work
because, for sufficiently small ranges, the likelihood that you'd get a number within that range
would be pretty small. eg. with $random's max being 255 and if your $max being 1 the probability
would be pretty high that $random would be greater than $max.
phpseclib works around this using the technique described here:
http://crypto.stackexchange.com/questions/5708/creating-a-small-number-from-a-cryptographically-secure-random-string
*/
$random_max = new Math_BigInteger(chr(1) . str_repeat("\0", $size), 256);
$random = $this->_random_number_helper($size);
list($max_multiple) = $random_max->divide($max);
$max_multiple = $max_multiple->multiply($max);
while ($random->compare($max_multiple) >= 0) {
$random = $random->subtract($max_multiple);
$random_max = $random_max->subtract($max_multiple);
$random = $random->bitwise_leftShift(8);
$random = $random->add($this->_random_number_helper(1));
$random_max = $random_max->bitwise_leftShift(8);
list($max_multiple) = $random_max->divide($max);
$max_multiple = $max_multiple->multiply($max);
}
list(, $random) = $random->divide($max);
return $this->_normalize($random->add($min));
}
/**
* Generate a random prime number.
*
* If there's not a prime within the given range, false will be returned. If more than $timeout seconds have elapsed,
* give up and return false.
*
* @param optional Integer $min
* @param optional Integer $max
* @param optional Integer $timeout
* @return Math_BigInteger
* @access public
* @internal See {@link http://www.cacr.math.uwaterloo.ca/hac/about/chap4.pdf#page=15 HAC 4.44}.
*/
function randomPrime($min = false, $max = false, $timeout = false)
{
if ($min === false) {
$min = new Math_BigInteger(0);
}
if ($max === false) {
$max = new Math_BigInteger(0x7FFFFFFF);
}
$compare = $max->compare($min);
if (!$compare) {
return $min->isPrime() ? $min : false;
} else if ($compare < 0) {
// if $min is bigger then $max, swap $min and $max
$temp = $max;
$max = $min;
$min = $temp;
}
static $one, $two;
if (!isset($one)) {
$one = new Math_BigInteger(1);
$two = new Math_BigInteger(2);
}
$start = time();
$x = $this->random($min, $max);
// gmp_nextprime() requires PHP 5 >= 5.2.0 per <http://php.net/gmp-nextprime>.
if ( MATH_BIGINTEGER_MODE == MATH_BIGINTEGER_MODE_GMP && function_exists('gmp_nextprime') ) {
$p = new Math_BigInteger();
$p->value = gmp_nextprime($x->value);
if ($p->compare($max) <= 0) {
return $p;
}
if (!$min->equals($x)) {
$x = $x->subtract($one);
}
return $x->randomPrime($min, $x);
}
if ($x->equals($two)) {
return $x;
}
$x->_make_odd();
if ($x->compare($max) > 0) {
// if $x > $max then $max is even and if $min == $max then no prime number exists between the specified range
if ($min->equals($max)) {
return false;
}
$x = $min->copy();
$x->_make_odd();
}
$initial_x = $x->copy();
while (true) {
if ($timeout !== false && time() - $start > $timeout) {
return false;
}
if ($x->isPrime()) {
return $x;
}
$x = $x->add($two);
if ($x->compare($max) > 0) {
$x = $min->copy();
if ($x->equals($two)) {
return $x;
}
$x->_make_odd();
}
if ($x->equals($initial_x)) {
return false;
}
}
}
/**
* Make the current number odd
*
* If the current number is odd it'll be unchanged. If it's even, one will be added to it.
*
* @see randomPrime()
* @access private
*/
function _make_odd()
{
switch ( MATH_BIGINTEGER_MODE ) {
case MATH_BIGINTEGER_MODE_GMP:
gmp_setbit($this->value, 0);
break;
case MATH_BIGINTEGER_MODE_BCMATH:
if ($this->value[strlen($this->value) - 1] % 2 == 0) {
$this->value = bcadd($this->value, '1');
}
break;
default:
$this->value[0] |= 1;
}
}
/**
* Checks a numer to see if it's prime
*
* Assuming the $t parameter is not set, this function has an error rate of 2**-80. The main motivation for the
* $t parameter is distributability. Math_BigInteger::randomPrime() can be distributed accross multiple pageloads
* on a website instead of just one.
*
* @param optional Integer $t
* @return Boolean
* @access public
* @internal Uses the
* {@link http://en.wikipedia.org/wiki/Miller%E2%80%93Rabin_primality_test Miller-Rabin primality test}. See
* {@link http://www.cacr.math.uwaterloo.ca/hac/about/chap4.pdf#page=8 HAC 4.24}.
*/
function isPrime($t = false)
{
$length = strlen($this->toBytes());
if (!$t) {
// see HAC 4.49 "Note (controlling the error probability)"
// @codingStandardsIgnoreStart
if ($length >= 163) { $t = 2; } // floor(1300 / 8)
else if ($length >= 106) { $t = 3; } // floor( 850 / 8)
else if ($length >= 81 ) { $t = 4; } // floor( 650 / 8)
else if ($length >= 68 ) { $t = 5; } // floor( 550 / 8)
else if ($length >= 56 ) { $t = 6; } // floor( 450 / 8)
else if ($length >= 50 ) { $t = 7; } // floor( 400 / 8)
else if ($length >= 43 ) { $t = 8; } // floor( 350 / 8)
else if ($length >= 37 ) { $t = 9; } // floor( 300 / 8)
else if ($length >= 31 ) { $t = 12; } // floor( 250 / 8)
else if ($length >= 25 ) { $t = 15; } // floor( 200 / 8)
else if ($length >= 18 ) { $t = 18; } // floor( 150 / 8)
else { $t = 27; }
// @codingStandardsIgnoreEnd
}
// ie. gmp_testbit($this, 0)
// ie. isEven() or !isOdd()
switch ( MATH_BIGINTEGER_MODE ) {
case MATH_BIGINTEGER_MODE_GMP:
return gmp_prob_prime($this->value, $t) != 0;
case MATH_BIGINTEGER_MODE_BCMATH:
if ($this->value === '2') {
return true;
}
if ($this->value[strlen($this->value) - 1] % 2 == 0) {
return false;
}
break;
default:
if ($this->value == array(2)) {
return true;
}
if (~$this->value[0] & 1) {
return false;
}
}
static $primes, $zero, $one, $two;
if (!isset($primes)) {
$primes = array(
3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59,
61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137,
139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227,
229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313,
317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419,
421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509,
521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617,
619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727,
733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829,
839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947,
953, 967, 971, 977, 983, 991, 997
);
if ( MATH_BIGINTEGER_MODE != MATH_BIGINTEGER_MODE_INTERNAL ) {
for ($i = 0; $i < count($primes); ++$i) {
$primes[$i] = new Math_BigInteger($primes[$i]);
}
}
$zero = new Math_BigInteger();
$one = new Math_BigInteger(1);
$two = new Math_BigInteger(2);
}
if ($this->equals($one)) {
return false;
}
// see HAC 4.4.1 "Random search for probable primes"
if ( MATH_BIGINTEGER_MODE != MATH_BIGINTEGER_MODE_INTERNAL ) {
foreach ($primes as $prime) {
list(, $r) = $this->divide($prime);
if ($r->equals($zero)) {
return $this->equals($prime);
}
}
} else {
$value = $this->value;
foreach ($primes as $prime) {
list(, $r) = $this->_divide_digit($value, $prime);
if (!$r) {
return count($value) == 1 && $value[0] == $prime;
}
}
}
$n = $this->copy();
$n_1 = $n->subtract($one);
$n_2 = $n->subtract($two);
$r = $n_1->copy();
$r_value = $r->value;
// ie. $s = gmp_scan1($n, 0) and $r = gmp_div_q($n, gmp_pow(gmp_init('2'), $s));
if ( MATH_BIGINTEGER_MODE == MATH_BIGINTEGER_MODE_BCMATH ) {
$s = 0;
// if $n was 1, $r would be 0 and this would be an infinite loop, hence our $this->equals($one) check earlier
while ($r->value[strlen($r->value) - 1] % 2 == 0) {
$r->value = bcdiv($r->value, '2', 0);
++$s;
}
} else {
for ($i = 0, $r_length = count($r_value); $i < $r_length; ++$i) {
$temp = ~$r_value[$i] & 0xFFFFFF;
for ($j = 1; ($temp >> $j) & 1; ++$j);
if ($j != 25) {
break;
}
}
$s = 26 * $i + $j - 1;
$r->_rshift($s);
}
for ($i = 0; $i < $t; ++$i) {
$a = $this->random($two, $n_2);
$y = $a->modPow($r, $n);
if (!$y->equals($one) && !$y->equals($n_1)) {
for ($j = 1; $j < $s && !$y->equals($n_1); ++$j) {
$y = $y->modPow($two, $n);
if ($y->equals($one)) {
return false;
}
}
if (!$y->equals($n_1)) {
return false;
}
}
}
return true;
}
/**
* Logical Left Shift
*
* Shifts BigInteger's by $shift bits.
*
* @param Integer $shift
* @access private
*/
function _lshift($shift)
{
if ( $shift == 0 ) {
return;
}
$num_digits = (int) ($shift / MATH_BIGINTEGER_BASE);
$shift %= MATH_BIGINTEGER_BASE;
$shift = 1 << $shift;
$carry = 0;
for ($i = 0; $i < count($this->value); ++$i) {
$temp = $this->value[$i] * $shift + $carry;
$carry = (int) ($temp / MATH_BIGINTEGER_BASE_FULL);
$this->value[$i] = (int) ($temp - $carry * MATH_BIGINTEGER_BASE_FULL);
}
if ( $carry ) {
$this->value[] = $carry;
}
while ($num_digits--) {
array_unshift($this->value, 0);
}
}
/**
* Logical Right Shift
*
* Shifts BigInteger's by $shift bits.
*
* @param Integer $shift
* @access private
*/
function _rshift($shift)
{
if ($shift == 0) {
return;
}
$num_digits = (int) ($shift / MATH_BIGINTEGER_BASE);
$shift %= MATH_BIGINTEGER_BASE;
$carry_shift = MATH_BIGINTEGER_BASE - $shift;
$carry_mask = (1 << $shift) - 1;
if ( $num_digits ) {
$this->value = array_slice($this->value, $num_digits);
}
$carry = 0;
for ($i = count($this->value) - 1; $i >= 0; --$i) {
$temp = $this->value[$i] >> $shift | $carry;
$carry = ($this->value[$i] & $carry_mask) << $carry_shift;
$this->value[$i] = $temp;
}
$this->value = $this->_trim($this->value);
}
/**
* Normalize
*
* Removes leading zeros and truncates (if necessary) to maintain the appropriate precision
*
* @param Math_BigInteger
* @return Math_BigInteger
* @see _trim()
* @access private
*/
function _normalize($result)
{
$result->precision = $this->precision;
$result->bitmask = $this->bitmask;
switch ( MATH_BIGINTEGER_MODE ) {
case MATH_BIGINTEGER_MODE_GMP:
if (!empty($result->bitmask->value)) {
$result->value = gmp_and($result->value, $result->bitmask->value);
}
return $result;
case MATH_BIGINTEGER_MODE_BCMATH:
if (!empty($result->bitmask->value)) {
$result->value = bcmod($result->value, $result->bitmask->value);
}
return $result;
}
$value = &$result->value;
if ( !count($value) ) {
return $result;
}
$value = $this->_trim($value);
if (!empty($result->bitmask->value)) {
$length = min(count($value), count($this->bitmask->value));
$value = array_slice($value, 0, $length);
for ($i = 0; $i < $length; ++$i) {
$value[$i] = $value[$i] & $this->bitmask->value[$i];
}
}
return $result;
}
/**
* Trim
*
* Removes leading zeros
*
* @param Array $value
* @return Math_BigInteger
* @access private
*/
function _trim($value)
{
for ($i = count($value) - 1; $i >= 0; --$i) {
if ( $value[$i] ) {
break;
}
unset($value[$i]);
}
return $value;
}
/**
* Array Repeat
*
* @param $input Array
* @param $multiplier mixed
* @return Array
* @access private
*/
function _array_repeat($input, $multiplier)
{
return ($multiplier) ? array_fill(0, $multiplier, $input) : array();
}
/**
* Logical Left Shift
*
* Shifts binary strings $shift bits, essentially multiplying by 2**$shift.
*
* @param $x String
* @param $shift Integer
* @return String
* @access private
*/
function _base256_lshift(&$x, $shift)
{
if ($shift == 0) {
return;
}
$num_bytes = $shift >> 3; // eg. floor($shift/8)
$shift &= 7; // eg. $shift % 8
$carry = 0;
for ($i = strlen($x) - 1; $i >= 0; --$i) {
$temp = ord($x[$i]) << $shift | $carry;
$x[$i] = chr($temp);
$carry = $temp >> 8;
}
$carry = ($carry != 0) ? chr($carry) : '';
$x = $carry . $x . str_repeat(chr(0), $num_bytes);
}
/**
* Logical Right Shift
*
* Shifts binary strings $shift bits, essentially dividing by 2**$shift and returning the remainder.
*
* @param $x String
* @param $shift Integer
* @return String
* @access private
*/
function _base256_rshift(&$x, $shift)
{
if ($shift == 0) {
$x = ltrim($x, chr(0));
return '';
}
$num_bytes = $shift >> 3; // eg. floor($shift/8)
$shift &= 7; // eg. $shift % 8
$remainder = '';
if ($num_bytes) {
$start = $num_bytes > strlen($x) ? -strlen($x) : -$num_bytes;
$remainder = substr($x, $start);
$x = substr($x, 0, -$num_bytes);
}
$carry = 0;
$carry_shift = 8 - $shift;
for ($i = 0; $i < strlen($x); ++$i) {
$temp = (ord($x[$i]) >> $shift) | $carry;
$carry = (ord($x[$i]) << $carry_shift) & 0xFF;
$x[$i] = chr($temp);
}
$x = ltrim($x, chr(0));
$remainder = chr($carry >> $carry_shift) . $remainder;
return ltrim($remainder, chr(0));
}
// one quirk about how the following functions are implemented is that PHP defines N to be an unsigned long
// at 32-bits, while java's longs are 64-bits.
/**
* Converts 32-bit integers to bytes.
*
* @param Integer $x
* @return String
* @access private
*/
function _int2bytes($x)
{
return ltrim(pack('N', $x), chr(0));
}
/**
* Converts bytes to 32-bit integers
*
* @param String $x
* @return Integer
* @access private
*/
function _bytes2int($x)
{
$temp = unpack('Nint', str_pad($x, 4, chr(0), STR_PAD_LEFT));
return $temp['int'];
}
/**
* DER-encode an integer
*
* The ability to DER-encode integers is needed to create RSA public keys for use with OpenSSL
*
* @see modPow()
* @access private
* @param Integer $length
* @return String
*/
function _encodeASN1Length($length)
{
if ($length <= 0x7F) {
return chr($length);
}
$temp = ltrim(pack('N', $length), chr(0));
return pack('Ca*', 0x80 | strlen($temp), $temp);
}
}
================================================
FILE: api/v2/MusicAPI.php
================================================
<?php
/**
* Netease Cloud Music Api
* @Version 2.1.1
* @auther METO, Axhello
* @description 推荐使用php5.5以上
* Released under the MIT license
*/
require dirname(__FILE__) . '/BigInteger.php';
class MusicAPI
{
const MODULUS = '00e0b509f6259df8642dbc35662901477df22677ec152b5ff68ace615bb7b725152b3ab17a876aea8a5aa76d2e417629ec4ee341f56135fccf695280104e0312ecbda92557c93870114af6c9d05c4f7f0c3685b7a46bee255932575cce10b424d813cfe4875d3e82047b97ddef52741d546b8e289dc6935b3ece0462db0a22b8e7';
const NONCE = '0CoJUm6Qyw8W8jud';
const PUBKEY = '010001';
protected $headers = ['Accept: */*', 'Accept-Encoding: gzip,deflate,sdch', 'Accept-Language: zh-CN,zh;q=0.8,gl;q=0.6,zh-TW;q=0.4', 'Connection: keep-alive', 'Content-Type: application/x-www-form-urlencoded', 'Host: music.163.com', 'Referer: http://music.163.com/search/', 'User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10_9_2) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/33.0.1750.152 Safari/537.36'];
protected $secretKey;
public function __construct()
{
$this->secretKey = $this->createSecretKey(16);
}
protected function createSecretKey($length)
{
$str = '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ';
$r = '';
for ($i = 0; $i < $length; $i++) {
$r .= $str[rand(0, strlen($str) - 1)];
}
return $r;
}
protected function prepare($data)
{
$data['params'] = $this->aesEncrypt($data['params'], self::NONCE);
$data['params'] = $this->aesEncrypt($data['params'], $this->secretKey);
$data['encSecKey'] = $this->rsaEncrypt($this->secretKey);
return $data;
}
protected function aesEncrypt($secretData, $secret)
{
return openssl_encrypt($secretData, 'aes-128-cbc', $secret, false, '0102030405060708');
}
/**
* @param $text
* @return string
*/
protected function rsaEncrypt($text)
{
$rtext = strrev(utf8_encode($text));
$keytext = $this->bchexdec($this->strToHex($rtext));
$biText = new Math_BigInteger($keytext);
$biKey = new Math_BigInteger($this->bchexdec(self::PUBKEY));
$biMod = new Math_BigInteger($this->bchexdec(self::MODULUS));
$key = $biText->modPow($biKey, $biMod)->toHex();
return str_pad($key, 256, '0', STR_PAD_LEFT);
}
protected function bchexdec($hex)
{
$dec = 0;
$len = strlen($hex);
for ($i = 0; $i < $len; $i++) {
$dec = bcadd($dec, bcmul(strval(hexdec($hex[$i])), bcpow('16', strval($len - $i - 1))));
}
return $dec;
}
protected function strToHex($str)
{
$hex = '';
for ($i = 0; $i < strlen($str); $i++) {
$hex .= dechex(ord($str[$i]));
}
return $hex;
}
protected function curl($url, $data = null)
{
$curl = curl_init();
curl_setopt($curl, CURLOPT_URL, $url);
if ($data) {
if (is_array($data)) $data = http_build_query($data);
curl_setopt($curl, CURLOPT_POSTFIELDS, $data);
curl_setopt($curl, CURLOPT_POST, 1);
}
curl_setopt($curl, CURLOPT_RETURNTRANSFER, 1);
curl_setopt($curl, CURLOPT_CONNECTTIMEOUT, 10);
curl_setopt($curl, CURLOPT_REFERER, 'http://music.163.com/');
curl_setopt($curl, CURLOPT_HTTPHEADER, $this->headers);
curl_setopt($curl, CURLOPT_ENCODING, 'application/json');
$result = curl_exec($curl);
curl_close($curl);
return $result;
}
/**
* 搜索API
* @param $s 要搜索的内容
* @param $limit 要返回的条数
* @param $offset 设置偏移量 用于分页
* @param $type 类型 [1 单曲] [10 专辑] [100 歌手] [1000 歌单] [1002 用户]
* @return JSON
*/
public function search($s = null, $limit = 30, $offset = 0, $type = 1)
{
$url = 'http://music.163.com/weapi/cloudsearch/get/web?csrf_token=';
$data = ['params' => '{
"s":"' . $s . '",
"type":"' . $type . '",
"limit":"' . $limit . '",
"total":"true",
"offset":"' . $offset . '",
"csrf_token": ""
}'];
return $this->curl($url, $this->prepare($data));
}
/**
* 歌曲详情API，不带MP3链接
* @param $song_id 歌曲id
* @return JSON
*/
public function detail($song_id)
{
$url = 'http://music.163.com/weapi/v1/song/detail';
if (is_array($song_id)) $s = '["' . implode('","', $song_id) . '"]'; else $s = '["' . $song_id . '"]';
$data = ['params' => '{
"ids":' . $s . ',
"csrf_token":""
}'];
return $this->curl($url, $this->prepare($data));
}
/**
* 新版API歌曲链接不包含在歌曲详情API里,通过此API获取
* @param $song_id
* @param int $br
* @return JSON
*/
public function mp3url($song_id, $br = 320000)
{
$url = 'http://music.163.com/weapi/song/enhance/player/url?csrf_token=';
if (is_array($song_id)) $s = '["' . implode('","', $song_id) . '"]'; else $s = '["' . $song_id . '"]';
$data = ['params' => '{
"ids":' . $s . ',
"br":"' . $br . '",
"csrf_token":""
}'];
return $this->curl($url, $this->prepare($data));
}
/**
* 歌词API 增加了几个字段
* @param $song_id
* @return JSON
*/
public function lyric($song_id)
{
$url = 'http://music.163.com/weapi/song/lyric?csrf_token=';
$data = ['params' => '{
"id":"' . $song_id . '",
"os":"pc",
"lv":"-1",
"kv":"-1",
"tv":"-1",
"csrf_token":""
}'];
return $this->curl($url, $this->prepare($data));
}
/**
* 歌单API
* @param $playlist_id
* @return JSON
*/
public function playlist($playlist_id)
{
$url = 'http://music.163.com/weapi/v3/playlist/detail?csrf_token=';
$data = ['params' => '{
"id":"' . $playlist_id . '",
"n":"1000",
"csrf_token":""
}'];
return $this->curl($url, $this->prepare($data));
}
/**
* 根据MVid(如果有)获取MV链接
* @param $mv_id
* @return JSON
*/
public function mv($mv_id)
{
$url = 'http://music.163.com/weapi/mv/detail/';
$data = ['params' => '{
"id":"' . $mv_id . '",
"csrf_token":""
}'];
return $this->curl($url, $this->prepare($data));
}
}
================================================
FILE: dist/fonts/themicons.css
================================================
@font-face {
font-family: "themicons";
src: url("themicons.eot"); /* IE9 */
src: url("themicons.eot?#iefix") format("embedded-opentype"), /* IE6-IE8 */
url("themicons.woff") format("woff"), /* chrome, firefox */
url("themicons.ttf") format("truetype"), /* chrome, firefox, opera, Safari, Android, iOS 4.2+ */
url("themicons.svg#themicons") format("svg"); /* iOS 4.1- */
font-style: normal;
font-weight: normal;
}
================================================
FILE: gulpfile.js
================================================
var gulp = require('gulp'),
minifycss = require('gulp-minify-css'),
concat = require('gulp-concat'),
rename = require('gulp-rename'),
uglify = require('gulp-uglify'),
fontmin = require('gulp-fontmin');
//压缩css
gulp.task('minifycss', function() {
return gulp.src('src/css/*.css') //需要操作的文件
.pipe(rename({ suffix: '.min' })) //rename压缩后的文件名
.pipe(minifycss()) //执行压缩
.pipe(gulp.dest('dist/css')); //输出文件夹
});
//压缩js
gulp.task('scripts', function() {
return gulp.src(['src/js/vue.min.js', 'src/js/vue-resource.min.js', 'src/js/vplayer.js'])
.pipe(concat('app.js'))
.pipe(rename({ suffix: '.min' }))
.pipe(uglify())
.pipe(gulp.dest('dist/js'));
});
//压缩图标字体
gulp.task('fontmin', function () {
return gulp.src('src/fonts/*.ttf')
.pipe(fontmin())
.pipe(gulp.dest('dist/fonts'));
});
//gulp watch
gulp.task('watch', function () {
gulp.watch('src/css/*.css', ['minifycss']);
gulp.watch('src/js/*.js', ['scripts']);
});
================================================
FILE: index.html
================================================
<!DOCTYPE html>
<html lang="zh-cn">
<head>
<meta charset="utf-8">
<meta http-equiv="X-UA-Compatible" content="IE=edge">
<meta name="viewport" content="width=device-width, initial-scale=1">
<meta name="keywords" content="vPlayer,vuejs,播放器,网易云api" />
<meta name="description" content="用vuejs+网易云api写的一款在线播放器">
<meta name="author" content="vPlayer">
<title>vPlayer</title>
<link rel="stylesheet" type="text/css" href="dist/css/vplayer.min.css">
</head>
<body>
<div id="app" class="home page page-template-landing" :class="{'site-player-is-open':listOpen}">
<div id="viewport-panel">
<div id="page" class="hfeed site">
<header class="site-header" :style="{ backgroundImage: 'url('+ playingPic +')' }">
<div id="lyricWrapper" class="site-branding">
<div v-show="lyric.length != 0" id="lyricContainer">
<p v-for="(lrc, index) in lyric" :id="'line-'+index">{{lrc[1]}}</p>
</div>
<div v-text="lyricText" class="lyric-description"></div>
</div>
</header>
<div id="content" class="site-content">
<main id="primary" class="content-area">
<div id="post" class="post page type-page status-publish hentry">
<div class="entry">
<div class="entry-header">
<h1 class="entry-title">New Song!</h1>
</div>
<div class="entry-content">
<p class="content">Enjoy music from NetEaseCloud!</p>
<p class="btn" :class="{'expand': goSearch}">
<a class="button" href="#" @click="goSearch">Let's Go</a>
</p>
</div>
<div class="form-table" :class="{'insearch': goSearch}">
<form action="" @submit.prevent>
<div class="input-group">
<input type="text" @keyup.enter="formSubmit" @blur="formSubmit" class="form-control" name="search" placeholder="试试输入“Tobu”" autocomplete="off" v-model="search">
</div>
</form>
</div>
</div>
<div class="table-example" :class="{'insearch': goSearch}">
<table class="table is-striped">
<thead v-show="isSearch">
<tr>
<th class="jin">#</th>
<th>歌曲名</th>
<th>歌手</th>
<th>专辑</th>
</tr>
</thead>
<tbody>
<tr v-for="list in songLists" @click="playMusic(list.id)">
<td>
<i class="is-playable"></i>
</td>
<td>{{ list.name }}</td>
<td>
<span v-if="list.ar.length >= 1">{{list.ar[0].name}}</span>
<span v-if="list.ar.length >= 2">/ {{list.ar[1].name}}</span>
<span v-if="list.ar.length >= 3">/ {{list.ar[2].name}}</span>
<span v-if="list.ar.length >= 4">/ {{list.ar[3].name}}</span>
<span v-if="list.ar.length >= 5">/ {{list.ar[4].name}}</span>
</td>
<td>{{ '《' +list.al.name+ '》'}}</td>
</tr>
</tbody>
</table>
<nav style="margin-bottom: 3em;">
<ul class="pager">
<li v-show="pages != 0">
<a href="#" @click="prevPage">上一页</a>
</li>
<li v-show="isSearch">
<a href="#" @click="nextPage">下一页</a>
</li>
</ul>
</nav>
</div>
</div>
</main>
</div>
</div>
</div>
<button id="site-player-toggle" class="site-player-toggle" :class="{'is-open':listOpen}" @click="isListOpen">Toggle Player</button>
<div id="site-player-panel" class="site-player-panel">
<div class="site-player tracks-count-8 is-shuffling is-playing">
<div class="controls">
<button class="previous" @click="prevPlay" title="上一首">上一首</button>
<button class="play-pause" @click="setPlay(playingId)" :class="[ isPlay ? 'pause' : 'play']" title="播放/暂停">播放/暂停</button>
<button class="next" @click="nextPlay" title="下一首">下一首</button>
<button class="repeat" :class="{'is-active': isActive}" title="单曲循环" @click="setLoop">单曲循环</button>
<button class="shuffle" title="随机播放" @click="setRandom">随机播放</button>
<div class="progress-bar" @click="clickProgress">
<div class="play-bar" :style="{ width: progress+'%'}"></div>
<div class="play-point"></div>
</div>
<div class="times">
<span class="current-time">{{ showCurrentTime }}</span> /
<span class="duration">{{ showDurationTime }}</span>
</div>
<div class="volume-panel">
<button class="volume-toggle" :class="{'is-muted': isMuted}" @click="setMuted" title="静音">静音</button>
<input v-model="range" @change="setVolume" type="range" min="0" max="1" step="0.1" :value="range">
</div>
</div>
<div class="playlist">
<ol class="tracks-list">
<li class="track" v-for="(paly, index) in playingLists" :class="{'is-current is-playing': currentIndex == index && isPlay}">
<span class="track-status track-cell"></span>
<span class="track-details track-cell" @click="playHistoryList(paly.id, index)">
<span class="track-title">{{ paly.title }}</span>
<span class="track-artist">{{ paly.artists }}</span>
</span>
<span class="track-actions track-cell"></span>
<span @click="removeList(index)" class="track-length track-cell">X</span>
</li>
</ol>
</div>
</div>
</div>
<div class="site-current-track-details">
<span class="title">{{ playingTitle }}</span> -
<span class="artist">{{ playingArtist }}</span>
<div class="times">
<span class="current-time">{{ showCurrentTime }}</span> /
<span class="duration">{{ showDurationTime }}</span>
</div>
</div>
<button class="site-play-pause-button" :class="[ isPlay ? 'pause' : 'play']" @click="setPlay(playingId)" title="播放/暂停">播放/暂停</button>
</div>
<script src="dist/js/app.min.js" charset="utf-8"></script>
</body>
</html>
================================================
FILE: package.json
================================================
{
"name": "vPlayer",
"version": "1.0.0",
"description": "用vuejs写的播放器，API基于网易云, 具体效果请查看Demo",
"main": "index.js",
"scripts": {
"test": "echo \"Error: no test specified\" && exit 1"
},
"repository": {
"type": "git",
"url": "git+https://github.com/axhello/vPlayer.git"
},
"keywords": [],
"author": "Axhello",
"license": "MIT",
"bugs": {
"url": "https://github.com/axhello/vPlayer/issues"
},
"homepage": "https://github.com/axhello/vPlayer#readme",
"devDependencies": {
"gulp": "^3.9.1",
"gulp-concat": "^2.6.0",
"gulp-fontmin": "^0.7.4",
"gulp-iconfont": "^8.0.1",
"gulp-minify-css": "^1.2.4",
"gulp-rename": "^1.2.2",
"gulp-uglify": "^2.0.0"
}
}
================================================
FILE: src/css/vplayer.css
================================================
/**
* normalize.css v3.0.2 | MIT License | git.io/normalize
* -----------------------------------------------------------------------------
*/
html {
-webkit-text-size-adjust: 100%;
-ms-text-size-adjust: 100%;
}
#app {
width: 100%;
height: 100%;
}
@font-face {
font-family: "themicons";
src: url("../fonts/themicons.eot") format("eot"), url("../fonts/themicons.woff") format("woff"), url("../fonts/themicons.ttf") format("truetype");
font-weight: normal;
font-style: normal;
}
.themicon {
display: inline-block;
font-family: "themicons";
font-size: 16px;
font-style: normal;
font-weight: normal;
line-height: 1;
speak: none;
text-decoration: inherit;
text-transform: none;
vertical-align: middle;
-moz-osx-font-smoothing: grayscale;
-webkit-font-smoothing: antialiased;
}
body {
margin: 0;
}
article,
aside,
details,
figcaption,
figure,
footer,
header,
hgroup,
main,
menu,
nav,
section,
summary {
display: block;
}
audio,
canvas,
progress,
video {
display: inline-block;
vertical-align: baseline;
}
audio:not([controls]) {
display: none;
height: 0;
}
[hidden],
template {
display: none;
}
a {
background-color: transparent;
}
a:active,
a:hover {
outline: 0;
}
abbr[title] {
border-bottom: 1px dotted;
}
b,
strong {
font-weight: bold;
}
dfn {
font-style: italic;
}
h1 {
font-size: 2em;
margin: 0.67em 0;
}
mark {
background: #ff0;
color: #000;
}
small {
font-size: 80%;
}
sub,
sup {
font-size: 75%;
line-height: 0;
position: relative;
vertical-align: baseline;
}
sup {
top: -0.5em;
}
sub {
bottom: -0.25em;
}
img {
border: 0;
}
svg:not(:root) {
overflow: hidden;
}
figure {
margin: 1em 40px;
}
hr {
-moz-box-sizing: content-box;
box-sizing: content-box;
height: 0;
}
pre {
overflow: auto;
}
code,
kbd,
pre,
samp {
font-family: monospace, monospace;
font-size: 1em;
}
button,
input,
optgroup,
select,
textarea {
color: inherit;
font: inherit;
margin: 0;
}
button {
overflow: visible;
}
button,
select {
text-transform: none;
}
button,
html input[type="button"],
input[type="reset"],
input[type="submit"] {
cursor: pointer;
-webkit-appearance: button;
}
button[disabled],
html input[disabled] {
cursor: default;
}
button::-moz-focus-inner,
input::-moz-focus-inner {
border: 0;
padding: 0;
}
input {
line-height: normal;
}
input[type="checkbox"],
input[type="radio"] {
-moz-box-sizing: border-box;
box-sizing: border-box;
padding: 0;
}
input[type="number"]::-webkit-inner-spin-button,
input[type="number"]::-webkit-outer-spin-button {
height: auto;
}
input[type="search"] {
-moz-box-sizing: content-box;
box-sizing: content-box;
-webkit-appearance: textfield;
}
input[type="search"]::-webkit-search-cancel-button,
input[type="search"]::-webkit-search-decoration {
-webkit-appearance: none;
}
fieldset {
border: 1px solid #c0c0c0;
margin: 0 2px;
padding: 0.35em 0.625em 0.75em;
}
legend {
border: 0;
padding: 0;
}
textarea {
overflow: auto;
}
optgroup {
font-weight: bold;
}
table {
border-collapse: collapse;
border-spacing: 0;
}
td,
th {
padding: 0;
}
/**
* Typography
* -----------------------------------------------------------------------------
*/
body {
color: #333;
font-family: "Helvetica Neue",Helvetica,Arial,sans-serif;
font-size: 14px;
line-height: 1.42857143;
color: #333;
}
body {
font-family: "Helvetica Neue",Helvetica,Arial,"Hiragino Sans GB","Hiragino Sans GB W3","WenQuanYi Micro Hei",sans-serif;
}
button,
input,
select,
textarea,
.button {
font-family: "Roboto", sans-serif;
}
h1,
h2,
h3,
h4,
h5,
h6 {
clear: both;
color: #333;
font-family: "Noto Serif", serif;
-moz-osx-font-smoothing: grayscale;
font-weight: 700;
margin: 0;
text-rendering: optimizeLegibility;
}
h1 {
font-size: 30px;
font-size: 3rem;
line-height: 1.25;
margin: 0.66666667em 0;
}
h2 {
font-size: 24px;
font-size: 2.4rem;
line-height: 1.25;
margin: 1em 0;
}
h3 {
font-size: 20px;
font-size: 2rem;
line-height: 1.25;
margin: 1.33333333em 0;
}
h4 {
font-size: 15px;
font-size: 1.5rem;
letter-spacing: 0.1em;
line-height: 1.25;
margin: 1.33333333em 0;
text-transform: uppercase;
}
h5 {
font-size: 13px;
font-size: 1.3rem;
letter-spacing: 0.1em;
line-height: 1.25;
margin: 1.33333333em 0;
text-transform: uppercase;
}
h6 {
font-size: 11px;
font-size: 1.1rem;
letter-spacing: 0.1em;
line-height: 1.25;
margin: 1.81818182em 0;
text-transform: uppercase;
}
b,
strong {
font-weight: 700;
}
dfn,
cite,
em,
i {
font-style: italic;
}
blockquote {
background-color: #f7f7f7;
border: solid #dedede;
border-width: 1px 0;
color: #555;
margin-bottom: 1.7em;
margin-left: 0;
margin-right: 0;
padding: 1.33333333em;
}
blockquote blockquote {
border-width: 0;
padding-bottom: 0;
padding-top: 0;
}
blockquote p:last-child {
margin-bottom: 0;
}
blockquote cite,
blockquote small {
color: #333;
font-size: 15px;
font-size: 1.5rem;
}
blockquote cite {
display: block;
margin-top: 0.66666667em;
}
address {
font-style: italic;
margin: 0 0 1.7em;
}
code,
kbd,
tt,
var,
samp,
pre {
font-family: "Menlo", "Monaco", "Consolas", "Courier New", monospace;
-moz-hyphens: none;
-webkit-hyphens: none;
hyphens: none;
-ms-hyphens: none;
}
pre {
background-color: transparent;
background-color: rgba(0, 0, 0, 0.01);
border: 1px solid #dedede;
line-height: 1.2;
margin-bottom: 1.7em;
max-width: 100%;
overflow: auto;
padding: 0.8em;
white-space: pre;
white-space: pre-wrap;
word-wrap: break-word;
}
abbr[title] {
border-bottom: 1px dotted #dedede;
cursor: help;
}
mark,
ins {
background-color: #fff9c0;
text-decoration: none;
}
sup,
sub {
font-size: 75%;
height: 0;
line-height: 0;
position: relative;
vertical-align: baseline;
}
sup {
bottom: 1ex;
}
sub {
top: 0.5ex;
}
small {
font-size: 75%;
}
big {
font-size: 125%;
}
/**
* Elements
* -----------------------------------------------------------------------------
*/
*,
*:before,
*:after {
-moz-box-sizing: inherit;
box-sizing: inherit;
}
html {
-moz-box-sizing: border-box;
box-sizing: border-box;
font-size: 62.5%;
}
body {
background-color: #fff;
}
hr {
background-color: #dedede;
border: 0;
height: 1px;
margin-bottom: 1.7em;
}
p {
margin: 0 0 1.7em;
}
ul,
ol {
margin: 0 0 1.7em;
}
ul {
list-style-type: disc;
}
ol {
list-style-type: decimal;
}
ul ul {
padding-left: 1em;
}
ol ol {
padding-left: 1.3333em;
}
ul ul,
ol ul {
list-style-type: circle;
}
ul ol,
ol ol {
list-style-type: lower-alpha;
}
ol ol ol {
list-style-type: decimal;
}
ul ul,
ul ol,
ol ol,
ol ul {
font-size: inherit;
margin: 0.33333em 0;
}
ul ul,
ol ul {
padding-left: 1em;
}
ul ol,
ol ol {
padding-left: 1.44444em;
}
dl {
margin: 0 0 1.7em;
}
dt {
font-weight: 700;
}
li,
dd {
margin-bottom: 0.19607843em;
}
dd {
margin-left: 0;
}
table {
border-collapse: separate;
border-spacing: 0;
border-width: 0;
margin: 0 0 1.7em;
width: 100%;
}
caption {
color: #333;
font-size: 30px;
font-size: 3rem;
font-weight: 700;
text-align: left;
}
th {
font-weight: 700;
}
td {
font-weight: 400;
}
tr {
cursor: pointer;
}
th,
td {
padding: 10px;
line-height: 1.5;
border-bottom: 1px solid #ddd;
/*text-align: left;*/
}
thead {
color: #333;
font-size: 13px;
font-size: 1.3rem;
text-transform: uppercase;
}
thead th {
padding: 0.53846154em .5em;
}
fieldset {
border-width: 0;
clear: both;
margin: 0 0 3.4em;
padding: 0;
}
fieldset >:last-child {
margin-bottom: 0;
}
legend {
border-bottom: 1px solid #dedede;
color: #333;
font-size: 13px;
font-size: 1.3rem;
font-weight: 700;
line-height: 1.7;
margin-bottom: 1.7em;
padding-bottom: 0.53846154em;
text-transform: uppercase;
width: 100%;
}
img {
border: 0;
height: auto;
-ms-interpolation-mode: bicubic;
max-width: 100%;
vertical-align: middle;
}
figure {
margin: 0;
}
del {
opacity: 0.8;
}
::-webkit-input-placeholder {
color: #ababab;
}
:-moz-placeholder {
color: #ababab;
}
::-moz-placeholder {
color: #ababab;
opacity: 1;
}
:-ms-input-placeholder {
color: #ababab;
}
/**
* Forms
* -----------------------------------------------------------------------------
*/
button,
input,
select,
textarea {
background-color: #fff;
border-radius: 0;
font-size: 13px;
font-size: 1.3rem;
line-height: 1.7;
margin: 0;
max-width: 100%;
vertical-align: baseline;
}
button,
input {
line-height: normal;
}
label {
color: #555;
display: inline-block;
font-weight: 700;
}
input,
textarea {
background-image: -webkit-linear-gradient(rgba(255, 255, 255, 0), rgba(255, 255, 255, 0));
border: 1px solid #dedede;
}
input:focus,
textarea:focus {
color: #333;
outline: 0;
}
button,
input[type="button"],
input[type="reset"],
input[type="submit"],
.button {
background-color: #555;
border: 0;
border-radius: 0;
color: #fff;
cursor: pointer;
display: inline-block;
font-family: "Roboto", sans-serif;
font-size: 11px;
font-size: 1.1rem;
font-weight: 400;
letter-spacing: 0.1em;
line-height: 1.90909091;
margin-bottom: 0.53846154em;
padding: 1.11538462em 1.53846154em;
text-align: center;
text-decoration: none;
text-transform: uppercase;
}
button:focus,
input[type="button"]:focus,
input[type="reset"]:focus,
input[type="submit"]:focus,
.button:focus {
background-color: #333;
color: #fff;
text-decoration: none;
}
.hover button:hover,
.hover input[type="button"]:hover,
.hover input[type="reset"]:hover,
.hover input[type="submit"]:hover,
.hover .button:hover {
background-color: #333;
color: #fff;
text-decoration: none;
}
.button-alt {
background-color: #dedede;
color: #000;
}
input[type="checkbox"],
input[type="radio"] {
padding: 0;
}
input[type="search"] {
-webkit-appearance: textfield;
}
input[type="search"]::-webkit-search-decoration {
-webkit-appearance: none;
}
button::-moz-focus-inner,
input::-moz-focus-inner {
border: 0;
padding: 0;
}
input[type="email"],
input[type="password"],
input[type="search"],
input[type="tel"],
input[type="text"],
input[type="url"],
textarea {
color: #555;
padding: 0.84615385em 1.15384615em;
width: 100%;
}
input[type="email"]:focus,
input[type="password"]:focus,
input[type="search"]:focus,
input[type="tel"]:focus,
input[type="text"]:focus,
input[type="url"]:focus,
textarea:focus {
border-color: #777;
color: #333;
}
input[type="search"] {
-moz-box-sizing: border-box;
box-sizing: border-box;
}
textarea {
overflow: auto;
vertical-align: top;
}
/**
* Accessibility
* -----------------------------------------------------------------------------
*/
.mejs-offscreen,
.screen-reader-text,
#wpstats {
clip: rect(1px, 1px, 1px, 1px);
height: 1px;
overflow: hidden;
position: absolute !important;
width: 1px;
}
.site .skip-link {
background-color: #f1f1f1;
box-shadow: 0 0 1px 1px rgba(0, 0, 0, 0.2);
color: #21759b;
display: block;
font-family: "Roboto", sans-serif;
font-size: 1em;
font-weight: 400;
outline: none;
padding: 1em 2em;
top: -9999em;
left: -9999em;
text-decoration: none;
text-transform: none;
}
.site .skip-link:focus {
clip: auto;
height: auto;
position: fixed !important;
top: 0.5em;
left: 0.5em;
width: auto;
z-index: 100000;
}
.logged-in .site .skip-link {
box-shadow: 0 0 2px 2px rgba(0, 0, 0, 0.6);
font-size: 1em;
font-weight: 400;
}
.input-group {
display: table;
vertical-align: top;
}
.input-group input {
border-radius: 5px;
}
/**
* Clearings
* -----------------------------------------------------------------------------
*/
.clearfix:before,
.content-area:before,
.site:before,
.site-content:before,
.clearfix:after,
.content-area:after,
.site:after,
.site-content:after {
content: " ";
display: table;
}
.clearfix:after,
.content-area:after,
.site:after,
.site-content:after {
clear: both;
}
/**
* Animations
* -----------------------------------------------------------------------------
*/
.fade-in {
-webkit-animation: fade-in 0.4s linear;
animation: fade-in 0.4s linear;
-webkit-backface-visibility: hidden;
backface-visibility: hidden;
-webkit-transform: translatez();
transform: translatez();
}
@-webkit-keyframes fade-in {
0% {
opacity: 0;
}
100% {
opacity: 1;
}
}
@keyframes fade-in {
0% {
opacity: 0;
}
100% {
opacity: 1;
}
}
/**
* Header
* -----------------------------------------------------------------------------
*/
.site-header {
background-position: 50% 50%;
background-repeat: no-repeat;
background-size: cover;
position: relative;
}
.site-header:before {
background-color: #000;
content: "";
opacity: 0.5;
pointer-events: none;
position: absolute;
top: 0;
right: 0;
bottom: 0;
left: 0;
}
.site-branding {
max-width: 100%;
padding: 100px 45px;
position: relative;
text-align: center;
}
.site-description {
color: #fff;
font-family: "Roboto", sans-serif;
font-size: 13px;
font-size: 1.3rem;
font-weight: 400;
letter-spacing: 0.1em;
text-transform: uppercase;
}
.site-title {
color: #fff;
font-family: "Roboto", sans-serif;
font-size: 30px;
font-size: 3rem;
font-weight: 300;
letter-spacing: 0.1em;
line-height: 1;
margin: 20px 0;
text-transform: uppercase;
word-wrap: break-word;
}
.site-title a {
color: #fff;
text-decoration: none;
}
.site-title a:active,
.site-title a:focus {
text-decoration: none;
}
.hover .site-title a:hover {
text-decoration: none;
}
@media screen and (min-width: 768px) {
.site-title {
font-size: 60px;
font-size: 6rem;
}
}
@media screen and (min-width: 1024px) {
.site-header {
display: -webkit-box;
display: -webkit-flex;
display: -moz-box;
display: -ms-flexbox;
display: flex;
position: fixed;
top: 0;
bottom: 0;
left: 0;
width: 50%;
-webkit-align-content: center;
align-content: center;
-webkit-align-items: center;
align-items: center;
-webkit-box-align: center;
-moz-box-align: center;
-webkit-box-pack: center;
-moz-box-pack: center;
-ms-flex-align: center;
-webkit-flex-flow: column no-wrap;
-ms-flex-flow: column no-wrap;
flex-flow: column no-wrap;
-ms-flex-line-pack: center;
-ms-flex-pack: center;
-webkit-justify-content: center;
justify-content: center;
}
.site-branding {
padding: 0 45px;
}
.home #lyricWrapper {
height: 240px;
}
.entry .entry-content .btn {
display: block;
}
.entry-content .content {
margin-bottom: 4em
}
.entry .form-table {
margin: 3.5em auto;
width: 100%;
}
}
/**
* Footer
* -----------------------------------------------------------------------------
*/
.site-footer {
background: #000;
color: #aaa;
font-family: "Roboto", sans-serif;
font-size: 13px;
font-size: 1.3rem;
padding: 30px 15px;
text-align: center;
}
.site-footer .social-navigation {
text-align: center;
}
/**
* Content
* -----------------------------------------------------------------------------
*/
.hentry {
padding-bottom: 2em;
}
.hentry + .hentry,
.infinite-loader + .hentry {
border-top: 1px solid #dedede;
padding-top: 2em;
}
.hentry.block-grid-item {
border-top-width: 0;
padding-bottom: 0;
padding-top: 0;
}
.entry-content {
word-wrap: break-word;
}
.entry-content .btn {
display: none;
}
.entry-content a {
text-decoration: underline;
}
.hover .entry-content a:hover {
opacity: 0.6;
}
.entry-content a.button {
text-decoration: none;
width: 200px;
border-radius: 5px;
}
.entry-content >:last-child {
margin-bottom: 0;
}
.entry-header {
display: -webkit-box;
display: -webkit-flex;
display: -moz-box;
display: -ms-flexbox;
display: flex;
margin-bottom: 1.6em;
-webkit-flex-flow: column nowrap;
-ms-flex-flow: column nowrap;
flex-flow: column nowrap;
}
.entry-header .breadcrumbs {
-webkit-box-ordinal-group: 2;
-moz-box-ordinal-group: 2;
-ms-flex-order: 1;
-webkit-order: 1;
order: 1;
}
.entry-header .entry-title {
-webkit-box-ordinal-group: 6;
-moz-box-ordinal-group: 6;
-ms-flex-order: 5;
-webkit-order: 5;
order: 5;
}
.entry-header .entry-subtitle {
-webkit-box-ordinal-group: 11;
-moz-box-ordinal-group: 11;
-ms-flex-order: 10;
-webkit-order: 10;
order: 10;
}
.entry-header .entry-meta {
-webkit-box-ordinal-group: 16;
-moz-box-ordinal-group: 16;
-ms-flex-order: 15;
-webkit-order: 15;
order: 15;
}
.entry-header .entry-meta {
font-family: "Roboto", sans-serif;
font-size: 11px;
font-size: 1.1rem;
letter-spacing: 0.1em;
margin-bottom: 0;
margin-top: 0.90909091em;
text-transform: uppercase;
}
.entry-header .entry-meta a {
color: #333;
text-decoration: none;
}
.entry-header .entry-meta .entry-comments-link:before {
content: "\2022\00a0";
}
.entry-header .entry-meta time.updated {
display: none;
}
.entry-media {
margin-bottom: 40px;
}
.entry-subtitle {
font-family: "Roboto", sans-serif;
font-size: 24px;
font-size: 2.4rem;
font-weight: 400;
line-height: 1.5;
}
.entry-terms {
font-family: "Roboto", sans-serif;
margin-bottom: 1.33333333em;
}
.entry-terms .term-group {
display: inline-block;
margin-right: 1.33333333em;
}
.entry-terms .term-group a {
color: #555;
}
.entry-terms .term-group:before {
color: #555;
font-size: 24px;
line-height: 1.0625em;
margin-right: 5px;
}
.entry-terms .term-group--category:before {
content: "\f21b";
}
.entry-terms .term-group--post_tag:before {
content: "\f21c";
}
@media screen and (min-width: 1024px) {
body.page .entry-footer,
body.single .entry-footer {
border-top: 1px solid #dedede;
margin-top: 1.33333333em;
padding-top: 1.33333333em;
}
body.page .entry-title,
body.single .entry-title {
font-size: 48px;
font-size: 4.8rem;
}
body.page .entry-title {
margin-bottom: 0;
}
}
/* Responsive */
@media (min-width: 768px) {
}
.page-template-landing .hentry {
margin-bottom: 0;
max-width: 100%;
padding-bottom: 0;
text-align: center;
}
.page-template-landing .entry-content {
font-size: 20px;
font-size: 2rem;
}
@media screen and (min-width: 1024px) {
.page-template-landing .content-area {
display: -webkit-box;
display: -webkit-flex;
display: -moz-box;
display: -ms-flexbox;
display: flex;
flex-direction: row;
width: 100%;
justify-content: center;
-webkit-box-direction: normal;
-moz-box-direction: normal;
-webkit-box-orient: horizontal;
-moz-box-orient: horizontal;
-webkit-flex-direction: row;
-ms-flex-direction: row;
-webkit-flex-wrap: wrap;
-ms-flex-wrap: wrap;
flex-wrap: wrap;
-webkit-transition: all 2s linear;
-o-transition: all 2s linear;
transition: all 2s linear;
}
.page-template-landing .hentry {
display: -webkit-box;
display: -webkit-flex;
display: -moz-box;
display: -ms-flexbox;
display: flex;
max-width: 100%;
text-align: center;
width: 100%;
-webkit-align-content: center;
align-content: center;
-webkit-align-items: center;
align-items: center;
-webkit-box-align: center;
-moz-box-align: center;
-webkit-box-pack: center;
-moz-box-pack: center;
-ms-flex-align: center;
-webkit-flex-flow: column nowrap;
-ms-flex-flow: column nowrap;
flex-flow: column nowrap;
-ms-flex-line-pack: center;
-ms-flex-pack: center;
-webkit-justify-content: center;
justify-content: center;
}
.page-template-landing .entry-title {
font-size: 48px;
font-size: 4.8rem;
}
.page-template-landing .entry-content,
.page-template-landing .entry-title {
max-width: 100%;
text-align: center;
width: 100%;
}
.page-template-landing .comments-area {
max-width: 100%;
width: 100%;
}
}
/* Responsive Galleries */
@media only screen and (min-width: 480px) {
.gallery-size-thumbnail .gallery-item {
max-width: 100%;
}
}
@media only screen and (min-width: 768px) {
.entry .entry-content .content {
margin-bottom: 2em
}
}
.site-content {
-webkit-transition: opacity 0.2s;
transition: opacity 0.2s;
}
.site-content.is-loading {
opacity: 0.05;
-webkit-transition: opacity 0.3s;
transition: opacity 0.3s;
}
.site-player .controls {
display: block;
margin-bottom: 40px;
padding-top: 85px;
position: relative;
z-index: 10;
}
.site-player .controls button {
background: none;
color: #9c9c9c;
}
.site-player button {
cursor: pointer;
display: block;
height: 32px;
margin: 0;
outline: none;
overflow: hidden;
padding: 0;
position: absolute;
top: 0;
left: 50%;
text-indent: 110%;
-webkit-transition: none;
transition: none;
white-space: nowrap;
width: 32px;
}
.site-player button:before {
display: inline-block;
font-family: "themicons";
font-size: 24px;
-moz-osx-font-smoothing: grayscale;
-webkit-font-smoothing: antialiased;
font-style: normal;
font-variant: normal;
font-weight: normal;
letter-spacing: normal;
line-height: 32px;
position: absolute;
top: 0;
right: 0;
bottom: 0;
left: 0;
text-align: center;
text-decoration: inherit;
text-indent: 0;
text-transform: none;
vertical-align: top;
speak: none;
}
.site-player button:active,
.site-player button:focus {
background: none;
box-shadow: 0;
outline: 0;
}
.hover .site-player button:hover {
background: none;
box-shadow: 0;
outline: 0;
}
.site-player button.play-pause {
left: 32px;
}
.site-player button.play-pause:before {
content: "\f152";
}
.site-player button.pause:before {
content: "\f151";
}
.site-player button.next {
left: 64px;
}
.site-player button.next:before {
content: "\f155";
}
.site-player button.previous {
left: 0;
}
.site-player button.previous:before {
content: "\f156";
}
.site-player button.repeat,
.site-player button.shuffle {
top: auto;
right: 0;
bottom: 0;
left: auto;
z-index: 2;
}
.site-player button.repeat.is-active,
.site-player button.shuffle.is-active {
color: #fff;
}
.site-player button.repeat:before {
content: "\f15b";
}
.site-player button.shuffle {
right: 41px;
}
.site-player button.shuffle:before {
content: "\f15c";
}
.site-player button.volume-toggle {
display: block;
left: 0;
}
.site-player button.volume-toggle:before {
content: "\f159";
}
.site-player button.volume-toggle.is-muted:before {
content: "\f158";
}
.site-player .progress-bar {
background: rgba(255, 255, 255, 0.4);
border-radius: 2.5px;
cursor: pointer;
height: 5px;
position: absolute;
top: 40px;
right: 0;
left: 0;
z-index: 2;
display: flex;
}
.site-player .play-bar {
background: #fff;
height: 5px;
width: 0;
}
.site-player .volume-panel {
height: 35px;
position: absolute;
top: 0;
right: 0;
bottom: 0;
width: 165px;
color: #fff;
}
.site-player .volume-panel button {
color: #fff;
}
.site-player .volume-panel:hover .volume-toggle {
color: #fff;
}
.site-player .volume-panel:hover .volume-slider {
display: block;
}
.site-player .times {
position: absolute;
bottom: 0;
left: 0;
}
.site-player .volume-slider {
background-color: #000;
border-color: #000;
border-style: solid;
border-width: 20px 0;
display: none;
height: 150px;
margin-left: -25px;
position: absolute;
top: 32px;
left: 50%;
width: 50px;
}
.site-player .volume-slider:before {
background-color: #fff;
content: "";
cursor: pointer;
display: block;
margin-left: -3px;
position: absolute;
top: 0;
bottom: 0;
left: 50%;
width: 6px;
}
.site-player .volume-slider-handle {
background-color: #fff;
border-radius: 8px;
cursor: pointer;
display: block;
height: 16px;
margin: -8px 0 0 -8px;
position: absolute;
top: 0;
left: 50%;
width: 16px;
}
.site-player .playlist {
padding-bottom: 45px;
text-align: left;
}
.site-player .tracks-list {
border-color: #333;
border-style: solid;
border-width: 1px 0 0;
counter-reset: li;
display: table;
font-size: 13px;
font-size: 1.3rem;
font-weight: 400;
list-style-position: inside;
margin: 0;
padding: 0;
width: 100%;
}
.site-player .track {
border-color: #333;
border-style: solid;
border-width: 0 0 1px;
color: #aaa;
counter-increment: li;
cursor: pointer;
display: block;
margin: 0;
padding: 16px 0;
width: 100%;
/*
&.is-error {
&:before{
display: none;
}
.track-status {
display: table-cell;
&:before {
content: "e";
}
}
}
*/
}
.site-player .track:before {
content: counter(li);
font-size: 13px;
font-size: 1.3rem;
}
.site-player .track .track-artist {
display: block;
}
.site-player .track .track-button {
border-color: rgba(255, 255, 255, 0.3);
color: rgba(255, 255, 255, 0.7);
}
.site-player .track .track-button:focus,
.site-player .track .track-button:hover {
border-color: rgba(255, 255, 255, 0.5);
color: rgba(255, 255, 255, 0.9);
text-decoration: none;
}
.site-player .track .track-length {
width: 50px;
}
.site-player .track .track-status {
display: none;
}
.site-player .track .track-status:before {
content: "\f159";
display: inline-block;
font-family: "themicons";
font-size: 20px;
-moz-osx-font-smoothing: grayscale;
-webkit-font-smoothing: antialiased;
font-style: normal;
font-variant: normal;
font-weight: normal;
letter-spacing: normal;
line-height: 0.75;
text-decoration: inherit;
text-transform: none;
vertical-align: top;
vertical-align: middle;
margin-left: -5px;
speak: none;
}
.site-player .track .track-title {
display: block;
font-size: 15px;
font-size: 1.5rem;
}
.site-player .track.is-current .track-artist,
.site-player .track.is-current .track-title {
color: #fff;
}
.site-player .track-cell,
.site-player .track:before {
display: block;
line-height: 1.3;
}
.site-player .track:before,
.site-player .track-status,
.site-player .track-remove {
max-width: 50px;
min-width: 50px;
padding-left: 0;
padding-right: 0;
text-align: center;
width: 50px;
}
.site-player .track:before,
.site-player .track-actions:empty,
.site-player .track-length {
display: none;
}
.site-player .track-actions {
display: block;
margin-top: 10px;
white-space: nowrap;
}
.site-player .track-details {
padding-left: 0;
padding-right: 0;
width: 100%;
}
.site-player .track-remove {
padding: 0;
text-align: right;
}
.site-player .track-remove button.remove {
background: transparent;
color: #555;
display: inline;
height: auto;
margin: 0;
position: relative;
top: auto;
right: auto;
left: auto;
text-align: right;
vertical-align: middle;
}
.site-player .track-remove button.remove:before {
content: "\f20c";
font-size: 13px;
font-size: 1.3rem;
line-height: 1.3;
}
.site-player .track-remove button.remove:focus {
color: #aaa;
}
.hover .site-player .track-remove button.remove:hover {
color: #aaa;
}
@media screen and (min-width: 480px) {
.site-player .track {
border-width: 0;
display: table-row;
padding: 0;
}
.site-player .track-cell,
.site-player .track:before {
border-color: #333;
border-style: solid;
border-width: 0 0 1px;
display: table-cell;
line-height: 1.3;
padding: 16px 22px;
vertical-align: middle;
}
.site-player .track-actions,
.site-player .track-actions:empty {
display: table-cell;
margin: 0;
padding-right: 0;
text-align: right;
}
}
@media screen and (min-width: 768px) {
.site-player .track:before,
.site-player .track-actions,
.site-player .track.is-playing .track-status {
display: table-cell;
}
.site-player .track-details {
padding-left: 0;
}
.site-player .track-remove {
text-align: center;
}
.site-player .track-remove button.remove {
text-align: center;
}
.site-player .track.is-playing:before {
display: none;
}
}
.site-player {
font-weight: 400;
}
.site-player.is-loading {
display: none;
}
.site-player-panel {
background: #000;
border-width: 0;
clear: both;
color: #aaa;
display: -webkit-box;
display: -webkit-flex;
display: -moz-box;
display: -ms-flexbox;
display: flex;
flex-direction: column;
float: left;
font-size: 13px;
font-size: 1.3rem;
overflow: auto;
padding: 20px;
position: fixed;
top: 0;
right: 0;
bottom: 0;
text-align: left;
-webkit-transform: translate(100%);
transform: translate(100%);
z-index: 50;
-webkit-box-direction: normal;
-moz-box-direction: normal;
-webkit-box-orient: vertical;
-moz-box-orient: vertical;
-webkit-flex-direction: column;
-ms-flex-direction: column;
-webkit-overflow-scrolling: touch;
}
.site-current-track-details {
color: #fff;
display: none;
line-height: 20px;
padding: 0 110px;
position: fixed;
right: 50%;
bottom: 45px;
left: 0;
text-align: center;
}
.site-current-track-details .times {
font-size: 13px;
font-size: 1.3rem;
line-height: 1;
position: absolute;
right: 0;
bottom: -20px;
left: 0;
}
.site-play-pause-button,
.site-player-toggle {
background: transparent;
color: #fff;
cursor: pointer;
display: block;
height: 48px;
line-height: 48px;
margin: 0;
outline: none;
overflow: hidden;
padding: 0;
position: absolute;
text-indent: 110%;
-webkit-transition: none;
transition: none;
white-space: nowrap;
width: 48px;
z-index: 20;
}
.site-play-pause-button:before,
.site-player-toggle:before {
display: inline-block;
font-family: "themicons";
font-size: 24px;
-moz-osx-font-smoothing: grayscale;
-webkit-font-smoothing: antialiased;
font-style: normal;
font-variant: normal;
font-weight: normal;
letter-spacing: normal;
line-height: 48px;
position: absolute;
top: 0;
right: 0;
bottom: 0;
left: 0;
text-align: center;
text-decoration: inherit;
text-indent: 0;
text-transform: none;
vertical-align: top;
speak: none;
}
.site-play-pause-button:active,
.site-player-toggle:active,
.site-play-pause-button:focus,
.site-player-toggle:focus {
background: none;
box-shadow: none;
opacity: 0.7;
outline: 0;
}
.hover .site-play-pause-button:hover,
.hover .site-player-toggle:hover {
background: none;
box-shadow: none;
opacity: 0.7;
outline: 0;
}
.site-play-pause-button {
display: none;
}
.site-play-pause-button:before {
content: "\f152";
}
.site-play-pause-button.pause:before {
content: "\f151";
}
.site-player-toggle {
top: 4px;
right: 1px;
bottom: auto;
left: auto;
}
.site-player-toggle:before {
content: "\f153";
font-size: 24px;
}
.site-player-toggle.is-open {
right: 85%;
left: auto;
}
.site-player-toggle.is-open:before {
content: "\f20c";
}
.site-navigation-is-open .site-current-track-details,
.site-navigation-is-open .site-play-pause-button,
.site-navigation-is-open .site-player-toggle {
display: none;
}
.admin-bar .site-player-toggle,
.admin-bar .site-player-toggle.is-open {
top: 50px;
}
@media screen and (max-width: 1023px) {
.site-player-is-open .site-navigation-toggle {
display: none;
}
}
@media screen and (min-width: 768px) {
.site-player-panel {
padding: 45px;
}
}
@media screen and (min-width: 783px) {
.site-player-toggle.is-open {
right: 70%;
}
.admin-bar .site-player-toggle,
.admin-bar .site-player-toggle.is-open {
top: 36px;
}
}
@media screen and (min-width: 1024px) {
.site-play-pause-button,
.site-player-toggle {
display: block;
position: fixed;
top: auto;
right: auto;
bottom: 31px;
left: auto;
}
.site-play-pause-button {
left: 31px;
}
.site-player-toggle,
.site-player-toggle.is-open,
.admin-bar .site-player-toggle,
.admin-bar .site-player-toggle.is-open {
top: auto;
right: calc(50% + 31px);
}
}
@media screen and (min-height: 500px) and (min-width: 1024px) {
.site-current-track-details {
display: block;
}
}
@-ms-viewport {
width: device-width;
}
@-moz-viewport {
width: device-width;
}
@-o-viewport {
width: device-width;
}
@-webkit-viewport {
width: device-width;
}
@viewport {
width: device-width;
}
/* rtl:ignore */
body.rtl {
direction: rtl;
unicode-bidi: embed;
}
#viewport-panel {
overflow: hidden;
position: relative;
}
.site {
position: relative;
left: 0;
-webkit-transition: left 0.19s;
transition: left 0.19s;
}
.site-content {
padding: 20px 15px;
}
.site-navigation-panel,
.site-player-panel {
-webkit-transition: -webkit-transform 0.2s;
transition: -webkit-transform 0.2s;
transition: transform 0.2s;
transition: transform 0.2s, -webkit-transform 0.2s;
width: 85%;
}
.site-navigation-panel.is-animation-disabled,
.site-player-panel.is-animation-disabled {
-webkit-transition: none;
transition: none;
}
.site-header .panel-body-footer {
display: none;
}
.admin-bar .site-navigation-panel,
.admin-bar .site-player-panel {
top: 46px;
}
.site-navigation-is-open,
.site-player-is-open {
overflow: hidden;
}
.site-navigation-is-open body,
.site-player-is-open body {
overflow: hidden;
}
.site-navigation-is-open .site {
left: 85%;
-webkit-transition: left 0.21s;
transition: left 0.21s;
}
.site-navigation-is-open .site-navigation-panel {
-webkit-transform: translateX(0);
transform: translateX(0);
}
.site-player-is-open .site {
left: -85%;
-webkit-transition: left 0.21s;
transition: left 0.21s;
}
.site-player-is-open .site-player-panel {
-webkit-transform: translateX(0);
transform: translateX(0);
}
@media screen and (min-width: 560px) {
.site-content {
padding: 40px 80px;
}
}
@media screen and (min-width: 783px) {
.site-navigation-panel,
.site-player-panel {
width: 70%;
}
.admin-bar .site-navigation-panel,
.admin-bar .site-player-panel {
top: 32px;
}
.site-navigation-is-open .site {
left: 70%;
}
.site-player-is-open .site {
left: -70%;
}
}
@media screen and (min-width: 1024px) {
.site {
float: right;
min-height: 100vh;
padding-bottom: 20px;
padding-left: 60px;
padding-right: 60px;
padding-top: 60px;
}
.site,
.site-navigation-panel,
.site-player-panel {
width: 50%;
}
.site-content,
.admin-bar .site-content {
padding: 0;
}
.page-template-landing .site {
padding-bottom: 0;
}
.page-template-landing .hentry {
min-height: calc(100vh - 165px);
}
.site-header .panel-body-footer {
display: block;
}
.site-footer,
.site-footer .site-info {
display: none;
}
.admin-bar .site {
min-height: calc(100vh - 32px);
}
.admin-bar .site-header,
.admin-bar .site-navigation-panel,
.admin-bar .site-player-panel {
top: 32px;
}
.admin-bar.page-template-landing .hentry {
min-height: calc(100vh - 60px - 32px);
}
.site-navigation-is-open,
.site-navigation-is-open body {
overflow: auto;
}
.site-navigation-is-open .site,
.site-player-is-open .site {
left: 0;
}
}
input[type=range] {
-webkit-appearance: none;
border: 1px solid #eee;
width: 130px;
position: absolute;
right: 0;
top: 14px;
height: 5px;
border-radius: 5px;
}
input[type=range]::-webkit-slider-runnable-track {
width: auto;
height: 5px;
background: #ddd;
border: none;
border-radius: 5px;
}
input[type=range]::-webkit-slider-thumb {
-webkit-appearance: none;
border: none;
height: 15px;
width: 15px;
border-radius: 50%;
background: #fff;
margin-top: -5px;
}
input[type=range]:focus {
outline: none;
}
input[type=range]:focus::-webkit-slider-runnable-track {
background: #ccc;
}
.form-table {
margin-bottom: 2em;
width: 100%;
}
.input-group {
width: 100%;
}
.table .is-playable:before {
content: "\f152";
cursor: pointer;
display: inline-block;
font-family: "themicons";
font-size: 16px;
-moz-osx-font-smoothing: grayscale;
-webkit-font-smoothing: antialiased;
font-style: normal;
}
/* 必需 */
.expand {
opacity: 0;
visibility: hidden;
margin-top: -8em;
transition: all .3s ease-out;
}
.insearch {
transition: all .3s ease-out;
}
ul li {
list-style: none;
}
.pager li {
display: inline-block;
margin-left: 1em;
}
#lyricWrapper {
display: block;
height: 350px;
overflow: hidden;
position: relative;
top: -20px;
color: #fff;
}
#lyricContainer {
position: relative;
top: 100px;
width: 100%;
font-family: "Microsoft YaHei", Helvetica, Arial, sans-serif;
text-shadow: 1px 0 0 #000, -1px 0 0 #000, 0 1px 0 #000, 0 -1px 0 #000;
}
#lyricContainer p {
margin: 1.1em auto;
width: 100%;
font-size: 16px;
color: #5a5a5a;
text-align: center;
-webkit-transition: color .5s linear;
-moz-transition: color .5s linear;
-o-transition: color .5s linear;
transition: color .5s linear;
}
#lyricContainer .current-line {
color: #fff;
font-size: 18px;
}
.lyric-description {
position: relative;
top: 7em;
}
.play-point {
width: 12px;
height: 12px;
background-color: white;
border-radius: 100%;
box-shadow: 0 0 5px -1px;
margin-top: -4px;
}
/* IE10+ */
@media all and (-ms-high-contrast: none),
(-ms-high-contrast: active) {
#viewport-pane {
overflow: inherit;
}
}
================================================
FILE: src/js/vplayer.js
================================================
var app = new Vue({
el: '#app',
data: {
audio: document.createElement('audio'),
storage: window.localStorage,
range: 0.5,
progress: 0,
playingId: '',
playingTitle: '',
playingArtist: '',
playingPic: '',
showCurrentTime: '0:00',
showDurationTime: '0:00',
currentIndex: 0,
search: '',
lyricText: '',
lyric: [],
songLists: [],
playingLists: [],
pageNumber: 1,
pages: 0,
offset: 30,
isNext: false,
lock: false,
listOpen: false,
isMuted: false,
isPlay: false,
isActive: false,
goSearch: false,
isMove: false,
isSearch: false,
isNull: true
},
created: function () {
this.firstOrCreate();
},
mounted: function () {
setInterval(this.setProgress, 500);
this.audio.addEventListener("timeupdate", this.updateLyric);
this.audio.addEventListener("ended", this.autoNextPlay);
},
methods: {
// 第一次创建（初始化）
firstOrCreate: function () {
this.playingLists = JSON.parse(this.storage.getItem('playerList'));
if (this.playingLists === null || this.playingLists.length === 0) {
this.playingLists = [];
var tmp = {
'id': 35283615,
'title': 'Dreams',
'picUrl': 'http://p3.music.126.net/tbnn45UGaEmkqXQlpD1iVQ==/3445869441930235.jpg',
'artists': 'Tobu'
};
this.playingLists.push(tmp);
this.storage.setItem('playerList', JSON.stringify(this.playingLists));
}
this.audio.volume = 0.5;
this.playingId = this.playingLists[0].id;
this.playingTitle = this.playingLists[0].title;
this.playingArtist = this.playingLists[0].artists;
this.playingPic = this.playingLists[0].picUrl;
this.$http.get('api/mp3url.php', {
params: {
'id': this.playingLists[0].id
}
})
.then(function (response) {
var mp3 = response.body.data[0];
this.audio.src = mp3.url;
}, function (error) {
//error callback
console.log(error);
});
},
// 去搜索
goSearch: function () {
this.goSearch = true;
document.querySelector('input[name="search"]').focus();
},
// 自动播放
setAutoPlay: function () {
this.audio.autoplay = !this.audio.autoplay;
alert(this.audio.autoplay);
},
// 播放歌曲
setPlay: function (id) {
if (this.audio.paused) {
this.audio.play();
this.isPlay = true;
this.getSongLyric(id);
} else {
this.audio.pause();
this.isPlay = false;
}
},
// 调节音量
setVolume: function () {
this.audio.volume = this.range;
if (this.audio.volume === 0) {
this.isMuted = true;
} else {
this.isMuted = false;
this.audio.muted = false;
}
},
// 静音
setMuted: function () {
this.audio.muted = !this.audio.muted;
this.isMuted = this.audio.muted;
},
// 单曲循环
setLoop: function () {
this.audio.loop = !this.audio.loop;
this.isActive = !this.isActive;
console.log(this.audio.loop);
},
// 随机播放
setRandom: function () {
alert('功能暂未实现！');
},
// 打开/关闭歌单列表
isListOpen: function () {
this.listOpen = !this.listOpen;
},
// 播放进度条
setProgress: function () {
var MM, SS, CT, DT,
currentTime = this.audio.currentTime,
duration = this.audio.duration;
MM = parseInt(currentTime / 60);
SS = parseInt(currentTime % 60);
this.showCurrentTime = CT = MM + ':' + (SS < 10 ? '0' + SS : SS);
MM = parseInt(duration / 60);
SS = parseInt(duration % 60);
this.showDurationTime = DT = MM + ':' + (SS < 10 ? '0' + SS : SS);
var value = currentTime / duration * 100;
this.progress = value.toFixed(3);
},
// 搜索歌曲
formSubmit: function () {
this.goSearch = true;
if (this.search === '') {
return false;
}
this.$http.get('api/search.php', {
params: {
's': this.search
}
})
.then(function (response) {
this.songLists = response.body.result.songs;
this.isSearch = true;
}, function (error) {
// error callback
console.log(error);
});
},
// 播放歌曲
playMusic: function (id) {
var lyricContainer = document.querySelector('#lyricContainer');
lyricContainer.style.top = 110 + 'px';
this.getMp3Url(id);
this.$http.get('api/detail.php', {
params: {
'id': id
}
})
.then(function (response) {
var result = response.body.songs[0];
var id = result.id,
title = result.name,
picUrl = result.al.picUrl,
artist = [],
artists;
for (var i = 0; i < result.ar.length; i++) {
artist.push(result.ar[i].name)
}
artists = artist.join('/')
this.playingTitle = title;
this.playingArtist = artists;
this.playingPic = picUrl;
var tempData = {
'id': id,
'title': title,
'picUrl': picUrl,
'artists': artists
};
var obj = JSON.parse(this.storage.getItem('playerList'));
console.log(obj.length);
this.currentIndex = obj.length;
if (obj === null) {
this.playingLists.push(tempData);
this.storage.setItem('playerList', JSON.stringify(this.playingLists));
} else {
for (var i = 0; i < obj.length; i++) {
if (tempData.id == obj[i].id) {
this.lock = true;
break;
} else {
this.lock = false;
}
}
}
if (this.lock === false) {
this.playingLists = obj;
this.playingLists.push(tempData);
this.storage.setItem('playerList', JSON.stringify(this.playingLists));
} else {
alert('歌曲已经存在歌单中');
return false;
}
}, function (error) {
console.log(error);
});
},
// 播放历史歌单
playHistoryList: function (id, index) {
var lyricContainer = document.querySelector('#lyricContainer');
lyricContainer.style.top = 110 + 'px';
this.currentIndex = index;
this.getMp3Url(id);
var music = JSON.parse(this.storage.getItem('playerList'));
this.playingTitle = music[index].title;
this.playingArtist = music[index].artists;
this.playingPic = music[index].picUrl;
},
// 播放下一首
nextPlay: function () {
var next = JSON.parse(this.storage.getItem('playerList'));
if ((this.currentIndex + 1) == next.length) {
this.currentIndex = 0;
} else {
this.currentIndex = ++this.currentIndex;
}
this.playingTitle = next[this.currentIndex].title;
this.playingArtist = next[this.currentIndex].artists;
this.playingPic = next[this.currentIndex].picUrl;
this.getMp3Url(next[this.currentIndex].id);
},
// 播放上一首
prevPlay: function () {
var prev = JSON.parse(this.storage.getItem('playerList'));
if (this.currentIndex === 0) {
alert('这已经是第一首了');
return false;
} else {
this.currentIndex = --this.currentIndex;
}
this.playingTitle = prev[this.currentIndex].title;
this.playingArtist = prev[this.currentIndex].artists;
this.playingPic = prev[this.currentIndex].picUrl;
this.getMp3Url(prev[this.currentIndex].id);
},
// 列表循环播放
autoNextPlay: function () {
var lyricContainer = document.querySelector('#lyricContainer');
lyricContainer.style.top = 110 + 'px';
var obj = JSON.parse(this.storage.getItem('playerList'));
if ((this.currentIndex + 1) == obj.length) {
this.currentIndex = 0;
} else {
this.currentIndex = ++this.currentIndex;
}
if (!this.audio.loop) {
this.playingTitle = obj[this.currentIndex].title;
this.playingArtist = obj[this.currentIndex].artists;
this.playingPic = obj[this.currentIndex].picUrl;
this.getMp3Url(obj[this.currentIndex].id);
}
},
// 获取MP3链接
getMp3Url: function (id) {
this.$http.get('api/mp3url.php', {
params: {
'id': id
}
})
.then(function (response) {
var mp3 = response.body.data[0];
switch (mp3.code) {
case 404:
alert('因版权问题，歌曲已被下架！');
break;
case -110:
alert('此歌曲需要付费！无法播放！');
break;
default:
this.getSongLyric(id);
this.audio.src = mp3.url;
this.audio.play();
this.isPlay = true;
}
}, function (error) {
console.log(error);
});
},
// 获取歌词
getSongLyric: function (id) {
this.$http.get('api/lyric.php', {
params: {
'id': id
}
})
.then(function (response) {
var lrc = response.body;
if (lrc.nolyric === true) {
this.lyricText = '纯音乐 无歌词';
this.lyric = [];
return false;
} else if (lrc.uncollected === true) {
this.lyricText = '未收录歌词';
this.lyric = [];
return false;
}
if (!lrc.qfy && !lrc.sfy) {
this.lyricText = '';
this.parseLyric(lrc.lrc.lyric);
}
}, function (error) {
// error callback
console.log(error);
});
},
// 格式歌词
parseLyric: function (text) {
var lyric = text.split('\n'), // 先按行分割
pattern = /\[(\d{2}):(\d{2})\.(\d{2,3})]/g,
result = [],
offset = this.getOffset(text); // 调用歌词偏移
while (!pattern.test(lyric[0])) {
lyric = lyric.slice(1);
}
lyric[lyric.length - 1].length === 0 && lyric.pop();
lyric.forEach(function (v, i, a) {
var time = v.match(pattern),
value = v.replace(pattern, '');
time.forEach(function (v1, i1, a1) {
var t = v1.slice(1, -1).split(':');
result.push([parseInt(t[0], 10) * 60 + parseFloat(t[1]) + parseInt(offset) / 1000, value]);
});
});
result.sort(function (a, b) {
return a[0] - b[0];
});
this.lyric = result; // 赋值给data里面的lyric用于显示歌词
},
// 滚动歌词实现
updateLyric: function () {
if (this.lyric.length === 0 || '') return false;
var lyricContainer = document.querySelector('#lyricContainer');
for (var i = 0, l = this.lyric.length; i < l; i++) {
if (this.audio.currentTime > this.lyric[i][0] - 0.50) {
var line = document.getElementById('line-' + i),
prevLine = document.getElementById('line-' + (i > 0 ? i - 1 : i));
prevLine.className = '';
line.className = 'current-line';
lyricContainer.style.top = 110 - line.offsetTop + 'px';
}
}
},
// 歌词偏移
getOffset: function (text) {
var offset = 0;
try {
var offsetPattern = /\[offset:\-?\+?\d+\]/g,
offset_line = text.match(offsetPattern)[0],
offset_str = offset_line.split(':')[1];
offset = parseInt(offset_str);
} catch (err) {
offset = 0;
}
return offset;
},
// 上一页
prevPage: function () {
this.pages = this.pages - this.offset;
this.pageNumber--;
this.$http.get('api/pages.php', {
params: {
's': this.search,
'p': this.pages
}
})
.then(function (response) {
this.songLists = response.body.result.songs;
}, function (error) {
// error callback
console.log(error);
});
},
// 下一页
nextPage: function () {
pn = this.pageNumber++;
this.pages = pn * this.offset;
this.$http.get('api/pages.php', {
params: {
's': this.search,
'p': this.pages
}
})
.then(function (response) {
this.songLists = response.body.result.songs;
}, function (error) {
// error callback
console.log(error);
});
},
// 删除历史歌单歌曲
removeList: function (index) {
var lists = JSON.parse(this.storage.getItem('playerList')),
changeList = lists.slice(0, index).concat(lists.slice(parseInt(index, 10) + 1));
this.storage.setItem('playerList', JSON.stringify(changeList));
var tempList = JSON.parse(this.storage.getItem('playerList'));
this.playingLists = tempList;
console.log('歌曲已从播放历史歌单中删除!');
},
// 点击进度条快进
clickProgress: function (e) {
// console.log(e);
var percent = e.offsetX / e.target.offsetWidth,
value = percent * this.audio.duration;
this.audio.currentTime = value.toFixed(3);
}
}
});
gitextract_pk8kirc8/
├── .gitignore
├── README.md
├── api/
│ ├── detail.php
│ ├── lyric.php
│ ├── mp3url.php
│ ├── pages.php
│ ├── search.php
│ └── v2/
│ ├── BigInteger.php
│ └── MusicAPI.php
├── dist/
│ └── fonts/
│ └── themicons.css
├── gulpfile.js
├── index.html
├── package.json
└── src/
├── css/
│ └── vplayer.css
└── js/
└── vplayer.js
SYMBOL INDEX (87 symbols across 2 files)
FILE: api/v2/BigInteger.php
class Math_BigInteger (line 181) | class Math_BigInteger
method __construct (line 259) | function __construct($x = 0, $base = 10)
method Math_BigInteger (line 511) | public function Math_BigInteger($x = 0, $base = 10)
method toBytes (line 538) | function toBytes($twos_compliment = false)
method toHex (line 635) | function toHex($twos_compliment = false)
method toBits (line 662) | function toBits($twos_compliment = false)
method toString (line 699) | function toString()
method copy (line 750) | function copy()
method __toString (line 770) | function __toString()
method __clone (line 787) | function __clone()
method __sleep (line 800) | function __sleep()
method __wakeup (line 822) | function __wakeup()
method add (line 856) | function add($y)
method _add (line 890) | function _add($x_value, $x_negative, $y_value, $y_negative)
method subtract (line 987) | function subtract($y)
method _subtract (line 1021) | function _subtract($x_value, $x_negative, $y_value, $y_negative)
method multiply (line 1122) | function multiply($x)
method _multiply (line 1156) | function _multiply($x_value, $x_negative, $y_value, $y_negative)
method _regularMultiply (line 1193) | function _regularMultiply($x_value, $y_value)
method _karatsuba (line 1257) | function _karatsuba($x_value, $y_value)
method _square (line 1295) | function _square($x = false)
method _baseSquare (line 1313) | function _baseSquare($value)
method _karatsubaSquare (line 1352) | function _karatsubaSquare($value)
method divide (line 1409) | function divide($y)
method _divide_digit (line 1591) | function _divide_digit($dividend, $divisor)
method modPow (line 1647) | function modPow($e, $n)
method powMod (line 1787) | function powMod($e, $n)
method _slidingWindow (line 1806) | function _slidingWindow($e, $n, $mode)
method _reduce (line 1881) | function _reduce($x, $n, $mode)
method _prepareReduce (line 1918) | function _prepareReduce($x, $n, $mode)
method _multiplyReduce (line 1937) | function _multiplyReduce($x, $y, $n, $mode)
method _squareReduce (line 1956) | function _squareReduce($x, $n, $mode)
method _mod2 (line 1975) | function _mod2($n)
method _barrett (line 2006) | function _barrett($n, $m)
method _regularBarrett (line 2103) | function _regularBarrett($x, $n)
method _multiplyLower (line 2177) | function _multiplyLower($x_value, $x_negative, $y_value, $y_negative, ...
method _montgomery (line 2256) | function _montgomery($x, $n)
method _montgomeryMultiply (line 2304) | function _montgomeryMultiply($x, $y, $m)
method _prepMontgomery (line 2350) | function _prepMontgomery($x, $n)
method _modInverse67108864 (line 2387) | function _modInverse67108864($x) // 2**26 == 67,108,864
method modInverse (line 2427) | function modInverse($n)
method extendedGCD (line 2493) | function extendedGCD($n)
method gcd (line 2624) | function gcd($n)
method abs (line 2636) | function abs()
method compare (line 2672) | function compare($y)
method _compare (line 2695) | function _compare($x_value, $x_negative, $y_value, $y_negative)
method equals (line 2730) | function equals($x)
method setPrecision (line 2749) | function setPrecision($bits)
method bitwise_and (line 2770) | function bitwise_and($x)
method bitwise_or (line 2811) | function bitwise_or($x)
method bitwise_xor (line 2851) | function bitwise_xor($x)
method bitwise_not (line 2890) | function bitwise_not()
method bitwise_rightShift (line 2929) | function bitwise_rightShift($shift)
method bitwise_leftShift (line 2967) | function bitwise_leftShift($shift)
method bitwise_leftRotate (line 3004) | function bitwise_leftRotate($shift)
method bitwise_rightRotate (line 3048) | function bitwise_rightRotate($shift)
method setRandomGenerator (line 3061) | function setRandomGenerator($generator)
method _random_number_helper (line 3074) | function _random_number_helper($size)
method random (line 3104) | function random($min = false, $max = false)
method randomPrime (line 3181) | function randomPrime($min = false, $max = false, $timeout = false)
method _make_odd (line 3277) | function _make_odd()
method isPrime (line 3307) | function isPrime($t = false)
method _lshift (line 3455) | function _lshift($shift)
method _rshift (line 3490) | function _rshift($shift)
method _normalize (line 3526) | function _normalize($result)
method _trim (line 3575) | function _trim($value)
method _array_repeat (line 3595) | function _array_repeat($input, $multiplier)
method _base256_lshift (line 3610) | function _base256_lshift(&$x, $shift)
method _base256_rshift (line 3639) | function _base256_rshift(&$x, $shift)
method _int2bytes (line 3680) | function _int2bytes($x)
method _bytes2int (line 3692) | function _bytes2int($x)
method _encodeASN1Length (line 3708) | function _encodeASN1Length($length)
FILE: api/v2/MusicAPI.php
class MusicAPI (line 13) | class MusicAPI
method __construct (line 21) | public function __construct()
method createSecretKey (line 26) | protected function createSecretKey($length)
method prepare (line 36) | protected function prepare($data)
method aesEncrypt (line 44) | protected function aesEncrypt($secretData, $secret)
method rsaEncrypt (line 53) | protected function rsaEncrypt($text)
method bchexdec (line 64) | protected function bchexdec($hex)
method strToHex (line 74) | protected function strToHex($str)
method curl (line 83) | protected function curl($url, $data = null)
method search (line 110) | public function search($s = null, $limit = 30, $offset = 0, $type = 1)
method detail (line 129) | public function detail($song_id)
method mp3url (line 146) | public function mp3url($song_id, $br = 320000)
method lyric (line 163) | public function lyric($song_id)
method playlist (line 182) | public function playlist($playlist_id)
method mv (line 198) | public function mv($mv_id)
Condensed preview — 15 files, each showing path, character count, and a content snippet. Download the .json file or copy for the full structured content (206K chars).
[
{
"path": ".gitignore",
"chars": 240,
"preview": "#Mac\n.DS_Store\n#Vscode\n.vscode/*\n!.vscode/settings.json\n!.vscode/tasks.json\n!.vscode/launch.json\n!.vscode/extensions.jso"
},
{
"path": "README.md",
"chars": 223,
"preview": "# vPlayer\n\n用vuejs写的播放器，API基于网易云, 具体效果请查看Demo！\n\nDemo: http://player.ciyuanai.net\n\n已更新使用网易云新版API，国外ip使用会被屏蔽，请注意！\n\n演示站点环境：V"
},
{
"path": "api/detail.php",
"chars": 213,
"preview": "<?php\nheader('Content-Type: application/json');\n\nrequire dirname(__FILE__) . '/v2/MusicAPI.php';\n\n$api = new MusicAPI();"
},
{
"path": "api/lyric.php",
"chars": 210,
"preview": "<?php\nheader('Content-Type: application/json');\n\nrequire dirname(__FILE__) . '/v2/MusicAPI.php';\n\n$api = new MusicAPI();"
},
{
"path": "api/mp3url.php",
"chars": 246,
"preview": "<?php\nheader('Content-Type: application/json');\n\nrequire dirname(__FILE__) . '/v2/MusicAPI.php';\n\n$api = new MusicAPI();"
},
{
"path": "api/pages.php",
"chars": 336,
"preview": "<?php\nheader('Content-Type: application/json');\n\nrequire dirname(__FILE__) . '/v2/MusicAPI.php';\n\n$api = new MusicAPI();"
},
{
"path": "api/search.php",
"chars": 214,
"preview": "<?php\nheader('Content-Type: application/json');\n\nrequire dirname(__FILE__) . '/v2/MusicAPI.php';\n\n$api = new MusicAPI();"
},
{
"path": "api/v2/BigInteger.php",
"chars": 126733,
"preview": "<?php\n\n/**\n * Pure-PHP arbitrary precision integer arithmetic library.\n *\n * Supports base-2, base-10, base-16, and base"
},
{
"path": "api/v2/MusicAPI.php",
"chars": 6574,
"preview": "<?php\n\n/**\n * Netease Cloud Music Api\n * @Version 2.1.1\n * @auther METO, Axhello\n * @description 推荐使用php5.5以上\n * Release"
},
{
"path": "dist/fonts/themicons.css",
"chars": 447,
"preview": "@font-face {\n font-family: \"themicons\";\n src: url(\"themicons.eot\"); /* IE9 */\n src: url(\"themicons.eot?#iefix\")"
},
{
"path": "gulpfile.js",
"chars": 1033,
"preview": "var gulp = require('gulp'),\n minifycss = require('gulp-minify-css'),\n concat = require('gulp-concat'),\n rename "
},
{
"path": "index.html",
"chars": 6645,
"preview": "<!DOCTYPE html>\n<html lang=\"zh-cn\">\n\n<head>\n <meta charset=\"utf-8\">\n <meta http-equiv=\"X-UA-Compatible\" content=\"IE=ed"
},
{
"path": "package.json",
"chars": 720,
"preview": "{\n \"name\": \"vPlayer\",\n \"version\": \"1.0.0\",\n \"description\": \"用vuejs写的播放器，API基于网易云, 具体效果请查看Demo\",\n \"main\": \"index.js\","
},
{
"path": "src/css/vplayer.css",
"chars": 40078,
"preview": "/**\n * normalize.css v3.0.2 | MIT License | git.io/normalize\n * --------------------------------------------------------"
},
{
"path": "src/js/vplayer.js",
"chars": 12995,
"preview": "var app = new Vue({\n el: '#app',\n data: {\n audio: document.createElement('audio'),\n storage: window.localStorage"
}
]
About this extraction
This page contains the full source code of the axhello/vPlayer GitHub repository, extracted and formatted as plain text for AI agents and large language models (LLMs). The extraction includes 15 files (192.3 KB), approximately 55.7k tokens, and a symbol index with 87 extracted functions, classes, methods, constants, and types. Use this with OpenClaw, Claude, ChatGPT, Cursor, Windsurf, or any other AI tool that accepts text input. You can copy the full output to your clipboard or download it as a .txt file.
Extracted by GitExtract — free GitHub repo to text converter for AI. Built by Nikandr Surkov.