Home  >  Article  >  Backend Development  >  Dont stop til you get enough [PHP] Utility function 4

Dont stop til you get enough [PHP] Utility function 4

WBOY
WBOYOriginal
2016-07-29 08:37:11984browse

//Output the information page about PHP and the current request
int phpinfo(void)
//Return the current PHP version number
string phpversion(void)
//Print out the list of people who contributed to this PHP project
string phpcredits (void)
//Convert var to integer type. base is the base of the conversion, the default value is 10. The converted variable var can be any type of variable outside of an array or class
int intval(mixed var,int[base])
//Get the double precision value of the variable
double doubleval(mixed var)
//Get the variable's String value
string strval(mixed var)
//Return the type of variable
string gettype(mixed var)
//Set the type of variable. If the conversion is successful, return true
int settype(string var,string type)
//Sort the array elements
void sort(array array)
//Reverse sort the array elements
void rsort(array array)
/ /Apply the user function to each element of the array
int array_walk(array array,string func)
//Count the number of elements in an array
int count(mixed var)
//Make the internal pointer of the array parameter point to the end An element and returns the element
mixed end(array array)
//Make the internal pointer of the array parameter point to the previous element and return the element
mixed prev(array array)
//Make the internal pointer of the array parameter point to the next element And return the element
mixed next(array array)
//Make the internal pointer of the array parameter point to the first element and return the element
mixed reset(array array)
//Return the element pointed to by the internal pointer of the current array
mixed current (array array)
//Check whether there is the value given by needle in the haystack array, strict means strict matching (default value)
bool in_array(mixed needle,array haystack,[,bool strict])
//Return The index value of the next element in the array
array each(array array)
//Add the element to the end of the array
int array_push(array stack,mixed var[,mixed...])
//Pop from the end of the array An element
mixed array_pop(array stack)
//Pop an element from the beginning of the array
mixed array_shift(array stack)
//Return the element to the beginning of the array
mixed array_unshift(array stack)
//Return to the current UNIX format Timestamp
int time(void)
//Enter the time parameter, and the UNIX format timestamp will be returned
int mktime(int hour, int minute, int second, int month, int day, int year)
//Get the UNIX time Greenwich time in stamp format
int gmmktime(int hour,int minute,int second,int month,int day,int year)
//Format a time or date
string date(string format,int[timestamp])
//Get an array of date/time information
array getdate(int [timestamp])
//Return true if it is a valid date
bool checkdate(int month,int day,int [timestamp])
// Format the time or date expression of the server according to the local setting
string strftime(string format,int [timestamp])
//Convert the string representing date and time into a timestamp. Strings in most typical data formats are accepted. For example, YYYY-MM-DD
and MM/DD/YYYY
int strtotime(string time,int now)
//Get the current time (UNIX timestamp format) millionth of a second value. Return string
string microtime(void)
//Return the current time in array type
array gettimeofday(void)
//Set a random number
void srand(int seed)
//Return a random number, if no random number is specified The maximum and minimum range of numbers, this function will automatically pick a random number from 0 to rand_max
. If there are parameters specifying min and max, take a number from the specified parameters
int rand([int min],[int max])
//Return the maximum allowable value of the random number
int getrandmax(void)
The above has introduced Dont stop til you get enough [PHP] utility function 4, including the content of Dont stop til you get enough. I hope it will be helpful to friends who are interested in PHP tutorials.

Statement:
The content of this article is voluntarily contributed by netizens, and the copyright belongs to the original author. This site does not assume corresponding legal responsibility. If you find any content suspected of plagiarism or infringement, please contact admin@php.cn