Sign in or Join FriendFeed
FriendFeed is the easiest way to share online. Learn more »
Développer des plugins sur Minecraft - http://www.oni-ecchi.info/blog...
How to Animate Sprites in cocos2d - http://getsetgames.com/2010...
jquery.asuggest - open source javascript autocomplete library - http://imankulov.github.com/asugges...
HTML5 Support in Internet Explorer 9 - http://www.impressivewebs.com/html5-s...
CSS - Feuille de style - Cours CSS - Cascading Style Sheets - http://www.cssdebutant.com/
Quick Tips: Adjusting Your Website for Different Screen Sizes with CSS3 | phosphorus - http://phosphorus.co/2010...
Introduction à Titanium - Damien MATHIEU - http://dmathieu.com/fr...
[PHP] Coefficient de Dice - http://tonyarchambeau.com/blog...
<?php // Calcul du coefficient de Dice // Inspiration: http://en.wikibooks.org/wiki... // Licence: Libre de droit function dice($str1='', $str2='') { $str1_length = strlen($str1); $str2_length = strlen($str2); // Length of the string must not be equal to zero if ( ($str1_length==0) OR ($str2_length==0) ) return 0; $ar1 = array(); $ar2 = array(); $intersection = 0; // find the pair of characters for ($i=0 ; $i<($str1_length-1) ; $i++) $ar1[] = substr($str1, $i, 2); for ($i=0 ; $i<($str2_length-1) ; $i++) $ar2[] = substr($str2, $i, 2); // find the intersection between the two sets foreach ($ar1 as $pair1) { foreach ($ar2 as $pair2) { if ($pair1 == $pair2) $intersection++; } } $count_set = count($ar1) + count($ar2); $dice = (2 * $intersection) / $count_set; return $dice; } - guillaume chave
[PHP] Coefficient de Dice - http://tonyarchambeau.com/blog...
<?php // Calcul du coefficient de Dice // Inspiration: http://en.wikibooks.org/wiki... // Licence: Libre de droit function dice($str1='', $str2='') { $str1_length = strlen($str1); $str2_length = strlen($str2); // Length of the string must not be equal to zero if ( ($str1_length==0) OR ($str2_length==0) ) return 0; $ar1 = array(); $ar2 = array(); $intersection = 0; // find the pair of characters for ($i=0 ; $i<($str1_length-1) ; $i++) $ar1[] = substr($str1, $i, 2); for ($i=0 ; $i<($str2_length-1) ; $i++) $ar2[] = substr($str2, $i, 2); // find the intersection between the two sets foreach ($ar1 as $pair1) { foreach ($ar2 as $pair2) { if ($pair1 == $pair2) $intersection++; } } $count_set = count($ar1) + count($ar2); $dice = (2 * $intersection) / $count_set; return $dice; } - guillaume chave
ShareKit : Drop-in Share Features for all iOS Apps - http://www.getsharekit.com/
ShareKit : Drop-in Share Features for all iOS Apps - http://www.getsharekit.com/
simple-iphone-image-processing - Project Hosting on Google Code - http://code.google.com/p...
simple-iphone-image-processing - Project Hosting on Google Code - http://code.google.com/p...
CocoaChina Wiki - - Category:Simon Maurice iPhone OpenGL ES - http://www.cocoachina.com/wiki...
CocoaChina Wiki - - Category:Simon Maurice iPhone OpenGL ES - http://www.cocoachina.com/wiki...
cocos2d-iphone - Project Hosting on Google Code - http://code.google.com/p...
cocos2d-iphone - Project Hosting on Google Code - http://code.google.com/p...
8 Great Resources For Learning Iphone OpenGL ES | iPhone iOS 4 iPad SDK Development Tutorials, Programming Tips, News - http://maniacdev.com/2009...
8 Great Resources For Learning Iphone OpenGL ES | iPhone iOS 4 iPad SDK Development Tutorials, Programming Tips, News - http://maniacdev.com/2009...
jqtouch - Project Hosting on Google Code - http://code.google.com/p...
Other ways to read this feed:Feed readerFacebook