post commit auto deploy

In 4 steps

1. svn commit to the repository
2. the pre-commit hook will check the code with svnlook and will validate the commit message (based on regexp such has bug# …, text minimal size…)
3. the post-commit hook will try to connect to the ITT (Integration Team Testing) if you have the good acronym, I’ll update
4. once connected a script should be launched (and forgot &;) This script should:
   • Do a svn checkout locally so the code could be tested (in /var/www …). This method has several drawback: instability of the site while exporting, destruction of ITT generated file (if any)…
   • Do a svn checkout in a temporary directory (/export/<projectname>) and then use rsync to do a fast compare and copy changes only without deleting the existing, excluding the .svn folders
   • Do a svn export in a temporary directory (/tmp/<projectname>) and then use the same rsync than above but this time you don’t have to exclude the .svn

   The fastest is the second one (svn checkout -> /export/<projectname> + rsync – .svn folders)

Option 2

There is another alternative if you have space and sufficient right on your svn repository: the svn export/svn checkout is done locally and you use rsync to deploy the site on the ITT server.

Option 3

There is a third alternative if you have one more server (a synchro server) that will be used to store the svn export (at least the last one and maybe 2-3 version before) and that will take care of the rsync between one of its local checkout/export and the ITT server.

Conclusion

The last option has the big advantage of being a intermediate repository that can deploy any revision to any server … but that’s another paper.

I used the 3 options, and the first one (the simplest/cheapest) is very easy to maintain and to set up, so it’s a must have for team < 15 … bigger team may think about the other options but will have to put additional resources to design the whole deployment system.

Sometimes it happens…

Solution: locate the .channels/ directory
For ubuntu with Zend-CE 5.2 it’s in /usr/local/zend/share/pear/.channels/

And delete everything in there

sudo rm /usr/local/zend/share/pear/.channels/*

then do a fresh pear update-channels to reconstruct the serialized cache file in .channels/

sudo pear update-channels

if you also want to also install phpunit


cd /usr/local/zend/bin/
sudo ./pear channel-discover pear.phpunit.de
sudo ./pear install phpunit/PHPUnit


After any mysql upgrade run from the terminal:
sudo mysql_upgrade (mac/*nix)
or
mysql_upgrade.exe (windows)

TODAY

• added update load and delete methods
• secured checks
• updated database for thumbnails

TOMORROW

• Thumbnails handling

TOYOTA

• ah bah dis donc, elle bonne celle-là !

Dr. Wave ready to listen

While muting a wave and moving it to the trash folder :-)

I can’t wait to wave :P

1. desactivate the FAN in the BIOS menu
   • Deactivate in the BIOS: Fan Always on while on AC Power
2. desactivate acpi for the ATI card
   • System > Administration > Hardware Drivers > ATI/AMD propietary FGLRX graphic driver: Install but don’t reboot now !!!
   • In a terminal: sudo aticonfig –initial
   • In a terminal: sudo aticonfig –acpi-services=off
   • Now you may reboot, in the terminal: sudo reboot

sources:

• http://gurudelleccelsopicco.wordpress.com/2009/02/24/ubuntu-810-on-hp-elitebook-8530p/trackback/
• http://www.phoronix.com/forums/showthread.php?t=15215
]]> http://blog.sbw.be/2009/06/18/ubuntu-ati-hd-3650-elitebook/feed/ 0 http://blog.sbw.be/2009/06/13/the-last-day-of-epoch-32-toute-une-epoque/ http://blog.sbw.be/2009/06/13/the-last-day-of-epoch-32-toute-une-epoque/#comments Sat, 13 Jun 2009 11:30:08 +0000 Sébastien Barbieri http://blog.sbw.be/?p=261 Is Tue, 19 Jan 2038 04:14:07 +0100.
The next second, we will be back on Fri, 13 Dec 1901 20:55:13 +0009.

And unfortunately, I will not be retired at that time… I’m pretty sure that it will be like in the 80s with every developer thinking that his code will last only few months (years)… when it will actually last much longer.

Most of the liunuix (linux and unix) systems use timestamp stored as an unisgned integer 32 bit starting Thu, 01 Jan 1970 01:00:00 +0100.

The idea was to be able to measure time for a “long” period of time, from now (in the 70s) and in the past.
So they decided to use half of the 2^32 for the past (prior to 1/1/1970) and the other half for the future.

So be it…

Now we are about 40 years later, and we still use the same representation. We already had a party for the unix timestamp 1234567890 (which is quite stupid because it’s in base 10).

And now javascript, Java, PHP and C … use the unix timestamp… which means ajax, web 2.0, comet … which means: most of the online banking system, internet sites and all the smalls scripts that in few line check your credential and your billing to allow you to connect to the Internet… All the logging system, all the monitoring systems… well everything that you don’t see, just under the internet sea you surf on.

So what will be the next party thema?

• the end of the internet as we knew it
• the end of the unix system
• the 0×80000000 seconds since epoch?

Anyway, because of the ongoing ecological breakdown, the human kind will probably collapse before… so after the Y2K38 bug, the world will just be their kingdom. The kingdom of bugs.

Unless we spend time (which is running) in each of our application to think about that right now (and if we spend just about the same amount of time solving the earth ecology problem it will not be useless).

]]> http://blog.sbw.be/2009/06/13/the-last-day-of-epoch-32-toute-une-epoque/feed/ 1 http://blog.sbw.be/2009/06/12/distance-between-cities/ http://blog.sbw.be/2009/06/12/distance-between-cities/#comments Fri, 12 Jun 2009 07:06:45 +0000 Sébastien Barbieri http://blog.sbw.be/?p=256 First of all I need to cite my sources:
• Calculate distance, bearing and more between two Latitude/Longitude points
• Geocoding Belgium Postal Codes

The goal of my project was to find out which cities are nearby (within a user specified distance).
Of course users don’t know their city coordinate, so you will have to find out by yourself. To do so, I used the JEDI trick (Geocoding Belgium Postal Codes) which is:

Downloading the csv of cities and zip code (available on the national mail site for Belgium, I don’t know for other countries)
Writing a small piece of code to parse the csv and retrieve the right latitude and longitude via google geo service

I could have downloaded the file from the JEDI site but I really needed to do it by myself.

So the next thing to do is: finding the cities within an arbitrary distance.

This was based on the documentation I found on the movable-type math site.

All I did is translating the Javascript function to PHP functions:

    private function sphericalDistance($lat1,$lon1,$lat2,$lon2){
        $R = 6371.0; // km
        $d = acos(
                sin(deg2rad($lat1))*sin(deg2rad($lat2))
                + cos(deg2rad($lat1))*cos(deg2rad($lat2))
                * cos(deg2rad($lon2-$lon1))
             )
             * $R;
        return $d;
    }

    private function haversineDistance($lat1,$lon1,$lat2,$lon2){
        $R = 6371.0; // km
        $dLat = deg2rad($lat2-$lat1);
        $dLon = deg2rad($lon2-$lon1);
        $a = sin($dLat/2) * sin($dLat/2)
            + cos(deg2rad($lat1)) * cos(deg2rad($lat2))
            * sin($dLon/2) * sin($dLon/2);
        $c = 2.0 * atan2(sqrt($a), sqrt(1-$a));
        $d = $R * $c;
        return $d;
    }

    private function vincentyDistance($lat1,$lon1,$lat2,$lon2){
        $a = 6378137.0; $b = 6356752.3142;  $f = 1/298.257223563;  // WGS-84 ellipsiod
        $L = deg2rad($lon2-$lon1);
        $U1 = atan((1-$f) * tan(deg2rad($lat1)));
        $U2 = atan((1-$f) * tan(deg2rad($lat2)));
        $sinU1 = sin($U1);
        $cosU1 = cos($U1);
        $sinU2 = sin($U2);
        $cosU2 = cos($U2);
        $lambda = $L;
        $lambdaP = $L;
        $iterLimit = 100;
        do{
            $sinLambda = sin($lambda);
            $cosLambda = cos($lambda);
            $sinSigma = sqrt(($cosU2*$sinLambda) * ($cosU2*$sinLambda) +
                        ($cosU1*$sinU2-$sinU1*$cosU2*$cosLambda) * ($cosU1*$sinU2-$sinU1*$cosU2*$cosLambda));
            if($sinSigma==0) return 0;
            $cosSigma = $sinU1 * $sinU2 + $cosU1*$cosU2*$cosLambda;
            $sigma = atan2($sinSigma, $cosSigma);
            $sinAlpha = $cosU1 * $cosU2 * $sinLambda / $sinSigma;
            $cosSqAlpha = 1 - $sinAlpha*$sinAlpha;
            if($cosSqAlpha!=0){
                $cos2SigmaM = $cosSigma - 2*$sinU1*$sinU2/$cosSqAlpha;
            }else{
                $cos2SigmaM =0;
            }
            $C = $f/16*$cosSqAlpha*(4+$f*(4-3*$cosSqAlpha));
            $lambdaP = $lambda;
            $lambda = $L + (1-$C) * $f * $sinAlpha *
                    ($sigma + $C*$sinSigma*($cos2SigmaM+$C*$cosSigma*(-1+2*$cos2SigmaM*$cos2SigmaM)));
        }while(abs($lambda-$lambdaP) > 1e-12 && --$iterLimit>0);
        if($iterLimit == 0) return false; // formula failed to converge
        $uSq = $cosSqAlpha * ($a*$a - $b*$b) / ($b*$b);
        $A = 1 + $uSq/16384.0*(4096+$uSq*(-768+$uSq*(320-175*$uSq)));
        $B = $uSq/1024.0 * (256+$uSq*(-128+$uSq*(74-47*$uSq)));
        $deltaSigma = $B*$sinSigma*($cos2SigmaM+$B/4*($cosSigma*(-1+2*$cos2SigmaM*$cos2SigmaM)
                    - $B/6*$cos2SigmaM*(-3+4*$sinSigma*$sinSigma)*(-3+4*$cos2SigmaM*$cos2SigmaM)));
        $s = $b*$A*($sigma-$deltaSigma);
        return $s/1000.0;
    }

And that’s it…

So if you want the php serialized cities of Belgium with Zip, cityname, uppercase cityname, longitude,latitude.

I didn’t do a lot at all, just put every source together.

]]> http://blog.sbw.be/2009/06/12/distance-between-cities/feed/ 0