bxt

Since there's a lots of phpdoc-like php documentors and the like projects on the webs, and they are all named similar if not equal, I wanted to write a little overview:

phpdoctor of 02/2011

Currently using this, namespace support plus UML stuff.

phpdoctor of 01/2011

Didn't test it, looks good.

bxt

<?php
class Foo {
	public static function bar() {
		echo "calling public static bar() in an ".(isset($this)?"object (".get_class($this).")":"static")." context. \n";
	}
	public function baum() {
		echo "calling public baum in an ".(isset($this)?"object (".get_class($this).")":"static")." context. \n";
	}
}

bxt

jQuery.fn.fullscreenCanvas = function() {
  var els=this;
  $(window).resize(function() {
    els
      .css({position:"fixed",left:0,top:0})
      .attr("width",$(window).width())
      .attr("height",$(window).height())
    ;
  });
  return this;

bxt

<?php

class Trojan {
        private $priv;
        function __construct($priv) {
                $this->priv=$priv;
        }
        function horse(Trojan $t) {
                return $t->priv;
        }

bxt

<?php

/*
I wanted to know if it pays off to refactor some recursive code, and 
if or not PHP does tail call optimization and i found this post:
http://commonphp.blogspot.com/2010/12/tail-call-optimization-in-php-53.html
A good place to check how much faster an itarative solution would be. 
I started with executing the functions.
Result: PHP does not do TCO. 
*/

bxt

import java.util.Date;
public class Nullcast {
    private static void foo(String bar) {
        System.out.println("Not here...\n");
    }
    private static void foo(Date bar) {
        System.out.println("Indeed here, even");
        System.out.println((bar instanceof Date?"with Date":"without Date!"));
    }
    public static void main(String[] args) {

bxt

<?php
namespace bxt\Util;

class ArrayObject implements \ArrayAccess, \Iterator, \Countable {
	private $object;
	private $iterator=0;
	private $offsetMethodMap=array();
	private $offsetMethodMapSetters=array();
	public function __construct($obj) {
		$this->object=$obj;

bxt

for i in {1..61}; do echo rframe $i; time blender -b rotation1-mats.blend -f $i -o //rotation1_####.png -F PNG; done
# render frames 1 to 61, echo time for each frame and save them with specified filename

bxt

var tableRows=$("tr").detach();
Array.prototype.sort.call(tableRows,function(a,b){
	// Compare two table rows by the numeric value of their first <td>
	return a.firstChild.firstChild.nodeValue*1 < b.firstChild.firstChild.nodeValue*1
});
$("table").append(tableRows);


// Tested in Firefox 4

bxt

int barWidth=50;
GradientI[] grads=new GradientI[4];

void setup() {
  size(1600, 300);
  colorMode(HSB, 360, 100, 1.0);
  noStroke();
  background(0);
  grads[0]=new LiearGradient();    /*  lin     */
  grads[1]=new LiearGradient(1.1); /*  clip_a  */