JEKIPEDIA - a glance into my world

baru2 ini lg ketagihan jajal skill ngoding di wonderfl.net! disini bener2 website yg pure buat flash coder.. soalny tools graphic ga bs dipake disini jadi klo mo bikin garis aja musti pake sebaris kode.. disini gw liat ternyata banyak programmer dari jepang yg nguasain papervision, trus ada beberapa libraries yg gw baru tau sama sekali kayak libspark (www.libspark.org/)  cuma sayang documentationnya bahasa jepang.. kira2 kursus brp taun ya baru bs ngerti haha.!

krn disini tool2 grafis ditiadakan banyak jg yg pake component2 kayak bit101.  trus ada jg physical computing dimana mereka gabungin sensor2 external selain keyboard,mouse ato webcam bs diliat disini http://physical.wonderfl.net/

buat programmer java,css/html 5 bs jg main2 ke sini http://jsdo.it/

dan semuanya diintip source codenya!!

Just porting john neumann merge-sort method for vector type data into as3 dunno if it’s faster than native sorting method.. let me know

package

{

/**

* …

* @author Jacky Riawan

*/

public class mergesort

{

private var mySort:Vector.<Number>

public function mergesort(myData:Vector.<Number>) {

merge_sort(myData)

}

private function merge_sort(myData:Vector.<Number>) {

if (myData.length <=1) {

return myData

}

var left:Vector.<Number> = new Vector.<Number>()

var right:Vector.<Number> = new Vector.<Number>()

var result:Vector.<Number> = new Vector.<Number>()

var middleNumber:int = Math.round(myData.length / 2)

for (var i:int = 0; i < myData.length; i++) {

if (i < middleNumber) {

left.push(myData[i])

}else {

right.push(myData[i])

}

}

left = merge_sort(left)

right = merge_sort(right)

result = merge(left, right)

mySort=result

return result

}

public function getSort() {

return mySort

}

protected function getSortData() {

}

private function merge(left:Vector.<Number>,right:Vector.<Number>):Vector.<Number>

{

var result:Vector.<Number> = new Vector.<Number>()

while (left.length > 0 && right.length > 0) {

if (left[0] <= right[0]) {

result.push(left[0])

left.splice(0,1)

}else {

result.push(right[0])

right.splice(0,1)

}

}

if (left.length > 0) {

result=result.concat(left)

}else{

result=result.concat(right)

}

return result

}

}

}

Merge sort is an O(n log n) comparison-based sorting algorithm. In most implementations it is stable, meaning that it preserves the input order of equal elements in the sorted output. It is an example of the divide and conquer algorithmic paradigm. It was invented by John von Neumann in 1945.

http://en.wikipedia.org/wiki/Merge_sort

to remove event listener when a display object is not displayed on stage. i think this way is more secure than use weak reference.

addEventListener(Event.REMOVED_FROM_STAGE, removeAllListener)

private function removeAllListener(e:Event):void

{

// your custom function here

removeEventListener(Event.REMOVED_FROM_STAGE, removeAllListener);

}

here’s quick fix when a display objects overlap buttons

mouseEnabled=false

mouseoverlap

here’s my first music created with fruity loop it has 8 bit feels in it… enjoy!

created from mixing sample tracks from NES, GBA and atari also couple of drums from fruity loops and scratches from soundsnap

http://kakutogi.deviantart.com/art/pixels-over-burst-176409735