Démagogue, fourbe, vicieux, fasciste et couard
J'ai enfin compris la puissance du clavier ce soir
En lisant mon manuel de php :
This function returns a string or an array with all occurrences of search in subject (ignoring case) replaced with the given replace value. If you don't need fancy replacing rules, you should generally use this function instead of eregi_replace() or preg_replace() with the i modifier.
eregi_replace est mon Erégie
This function scans string for matches to pattern, then replaces the matched text with replacement.
The modified string is returned. (Which may mean that the original string is returned if there are no matches to be replaced.)
If pattern contains parenthesized substrings, replacement may contain substrings of the form \\digit, which will be replaced by the text matching the digit'th parenthesized substring; \\0 will produce the entire contents of string. Up to nine substrings may be used. Parentheses may be nested, in which case they are counted by the opening parenthesis.
If no matches are found in string, then string will be returned unchanged.
Je connais les IP de la rébellion : $rebel_ip = $_SERVER['REMOTE_ADDR'];
j'adore les globals, je suis le Zeus de mon monde virtuel,
j'ai mes adeptes, mes sujets, mes chiens de garde.
J'ai TOUT, mais quand vient le soir, ma belle
application
à l'heure de ma masturbation intellectuelle,
je reprends mon manuel de php
et je me prends à détester la fonction immonde
int levenshtein ( string str1, string str2, int cost_ins, int cost_rep, int cost_del)
int levenshtein ( string str1, string str2, function cost)
This function returns the Levenshtein-Distance between the two argument strings or -1, if one of the argument strings is longer than the limit of 255 characters (255 should be more than enough for name or dictionary comparison, and nobody serious would be doing genetic analysis with PHP).
The Levenshtein distance is defined as the minimal number of characters you have to replace, insert or delete to transform str1 into str2. The complexity of the algorithm is O(m*n), where n and m are the length of str1 and str2 (rather good when compared to similar_text(), which is O(max(n,m)**3), but still expensive).
surchargée comme des obsessions et surtout l'infâme :
The optional parameter max_chars_per_line indicates maximum number of characters per line will be output. The function tries to avoid breaking words.
que mon père spirituel d'avant l'info détestait lui aussi,
ah quel dommage que l'on ne puisse tout brûler!
Edited by Кя!z™, 12 August 2006 - 11:55 AM.