Mit PLSQL eine komplette Oracle Tabelle in ein Array einlesen:

declare
  type t_emp is table of emp%rowtype;
  a_emp t_emp;
begin
  select * bulk collect into a_emp from emp;
  dbms_output.put_line('emp.count ' || a_emp.count);
  for i in a_emp.first .. a_emp.last loop
    dbms_output.put_line('empno ' || a_emp(i).empno);
  end loop;
end;

Well I just wrote this function and then realised it’s basically redundant. When you write out the contents of an array in PHP using var_dump() it writes it all out on one line. Wouldn’t it be great if it wrote it all out neatly, properly nested and everything? So I wrote a function that does that. Then I realised that if you view the source then var_dump() already does that. Damnit! I even made it handle arrays recursively!

	function writeArrayNicely($array, $depth=1){
		echo 'array(' . sizeof($array) . ') {<br>';
		foreach($array as $key=>$value){
			for ($x=0;$x<$depth;$x++)
				echo '&nbsp;&nbsp;&nbsp;&nbsp;';
			if (gettype($key) == 'string')
				echo '["' . $key . '"] => ';
			else
				echo '[' . $key . '] => ';
			if (gettype($value) == 'array')
				writeArrayNicely($value, ($depth+1));
			else
				echo gettype($value) . ' (' .  sizeof($value) . ') "' . $value . '"';
			echo '<br>';
		}
		for ($x=1;$x<$depth;$x++)
			echo '&nbsp;&nbsp;&nbsp;&nbsp;';
		echo '}';
	}

	$test = array(
		"string"=>"this is a string",
		"integer"=>7,
		"float"=>4.9,
		6 => 42,
		"array"=>array(
			"string1" => "blah1",
			"string2" => "blah2"
		)
	);

writeArrayNicely($test);

Array merupakan kumpulan data dimana setiap elemen memakai nama yang sama dan bertipe sama.  Pada array, setiap elemen diakses dengan membedakan indeksnya.  Contoh Array :

Misal nya ada Variabel array A yang terbagi menjadi  5 bagian   yaitu  :      

     23      15         45        12        14                                      

  A[0]   A[1]    A[2]    A[3]    A[4]

masing-masing nilai di setiap lokasi mempunyai identitas yang sama yaitu A dan nomor indeks yang ditulis di dalam tanda kurung siku ‘[..]‘.  sehingga terlihat bahwa : A[0] terisi nilai 23 atau biasa ditulis A[0]=23, A[1]=15, A[2]=45, A[3]=12, A[4]=14.

Jenis Array

1. Array Dimensi satu

Array dimensi satu adalah suatu variabel yang terbagi atas beberapa baris atau beberapa kolom.  Banyaknya indeks yang menandakan alamat pada variabel array ini hanya satu saja, yaitu yang menandakan baris ke-  atau kolom ke-. 

Deklarasi array :  <type data>   nama_variabel [ukuran]

 dengan Type  menyatakan jenis elemen array (int, char, unsigned dan lain-lain)

                 Ukuran  menyatakan jumlah maksimal elemen array

Contoh :   int   A[10];      –> berarti Varibel A terbagi menjadi 10 baris/kolom dengan type integer

Untuk menginputkan nilai, mengoperasikan dan menampilkan nilai pada variabel array, dapat dideklarasikan satu per satu atau menggunakan fungsi perulangan agar lebih simple dalam penulisan programnya.

Contoh Program :

#include<conio.h>

#include<iostream.h>

main()

{  int  A[10], i;

for(i=0;i<=9;i++)

      A[i]=i+1;

for(i=0;i<=9;i++)

     cout<<A[i]<<”     “;

getch();

}

2. Array Dimensi Dua

Array dimensi dua adalah variabel array yang terbagi berdasarkan baris dan kolom. Banyaknya indeks yang menandakan alamat pada array ini ada dua yaitu menunjuk  (baris, kolom) ke-

Deklarasi Array dimensi dua :   <type>   nama_variabel[ukuran_baris][ukuran_kolom]

dengan                  type    adalah type data pada array

                                 ukuran baris adalah banyaknya pembagian baris pada array

                                ukuran kolom adalah banyaknya pembagian kolom pada array

Contoh array dimensi dua adalah matrik (merupakan susunan angka yang ditulis berdasarkan baris dan kolom)

Program :

#include<conio.h>

#include<iostream.h>

main()

{  int  A[10][10], i,j ;

for(i=0;i<=9;i++)

   { for(j=1;j<=9;j++)

            cin>>A[i][j]; }

for(i=0;i<=9;i++)

   {  {for(j=0;j<=9;j++)

          cout<<A[i][j]<<”      “;

     } cout<<endl;  }

getch();

}

Array

Sourcecode for Getting Pictures to Images-ArrayList

'New Code
 mFolder = "%systemroot%"
 If (Not String.IsNullOrEmpty(mFolder)) Then
 txtImageDirectory.Text = mFolder
 Else
 Return
 End If

 mImageList = New ArrayList()

 Dim Dir As New DirectoryInfo(mFolder)
 Dim f As FileInfo

'loop
 For Each f In Dir.GetFiles("*.*")
   Select Case (f.Extension.ToUpper())
   Case ".JPG"
   mImageList.Add(f.FullName)
   Case ".BMP"
   mImageList.Add(f.FullName)
   Case ".GIF"
   mImageList.Add(f.FullName)
   Case Else
 End Select
 Next
'end loop

 mImagePosition = 0
 SetImages() 'Set Image form array to list []

' End of New code

Objective-C can be quite verbose, especially when handling nested data – there is no simple associative array indexing of the kind found in PHP, Ruby etc.

ObjC : verbose : id value = [map objectForKey:@"key"];

Using atx functions : concise : id value = at(map, @”key”);

This comes in very handy for deeply nested json data trees, where you might want to index a multidimensional array or nested tree – vis :

id pop = at(at(at(stats, @”USA”), @”NewYork”), @”popn”);

Not quite as simple as pop = stats["USA"]["NewYork"]["popn"]; but more readable than several objectForKey’s.  Note, I propagate the nulls up so if an item is not found at any level, it can be checked once at the top level without crashing the app.

The small suite of related functions can be found at google code here, under BSD licence – http://code.google.com/p/xathack/

enjoy.

The research team describes the study as the first to show that cigarettes themselves could be the direct source of exposure to a wide array of potentially pathogenic microbes among smokers and other people exposed to secondhand smoke.

Source:
http://www.sciencedaily.com/releases/2009/11/091119121300.htm

The research team describes the study as the first to show that cigarettes themselves could be the direct source of exposure to a wide array of potentially pathogenic microbes among smokers and other people exposed to secondhand smoke.

Source:
http://www.sciencedaily.com/releases/2009/11/091119121300.htm

How many buzz words can you fit in a title?

Microsoft and other companies often request you to complete some algorithms in their interviewing process. Today I completed an attempt at an ArrayBasedStack to be able to find a palindrome. Something I must admit I have not touched since early college! This is going to be the first of some interview questions I got. Plus it is about time I wrote another blog post.

Using the excellent: Data Structures and Algorithms in Java by G&T to define my stack I created an array based stack similar to what they have posted. Each developer has their own style. I prefer using return size() == 0 rather than their (top < 0), but that is my preference.

Just remember a few things

A palindrome is a word, phrase, number or other sequence of units that can be read the same way in either direction (the adjustment of punctuation and spaces between words is generally permitted) – from wiki

Trim whitespace and lowercase the characters.

Stacks work on last in, first out principle. What? Well this comes in handy for the algorithm. LIFO gives you a reverse effect.

So – here it is, the algorithm. Hope it will help you with your stack based palindromes.

private boolean isPalindrome(String str) {

 Stack<Character> stack = new ArrayBasedStack<Character>(str.length());
 str = str.toLowerCase().trim(); //format the data
 while(stack.size()<(str.length()/2)) {
  //When the stack is less than half the length
  //(even numbers great, odd numbers ignore the middle!
stack.push(str.charAt(stack.size()));
//push the character at the position indexed by the size of the stack

 }

 while(stack.size()>0) { //lets go back

if(stack.top() == str.charAt(str.length() - stack.size())) {
//again use the stack size
//to index the position, minus the length
//so this counts down every time something is popped from the stack.
//You are checking the top of the stack is equal to the character
//in 2nd half of the word. since characters go in first, the characters,
//abba would have b on top and a on the bottom when hitting this loop -
//the first two characters - they are the same as the last two. Get it now? 
stack.pop(); //remove palindromic characters

} else {

return false; //it is not a palindrome -
//you don't want to keep going and be inefficient if it is wasting time!

}

 }

 return true; // if it gets here there can only be on conclusion.

}

Hope this helps and you learn my thinking behind this. Good luck with the interviews.

Well it took about 6 hrs but I finally got my little javascript assignment to work.  What a gong show!  I ended up emailing the code to Courtney to look at because I couldn’t see the problem.  She located the issue and made a suggestion and “ta da!”, my script worked!  It’s great having clever friends!  It’s also good to know that some of this language is starting the sink in. 

Wenn man mit foreach() arbeitet, sollte man vorher prüfen ob das Array überhaupt einen Eintrag hat. Das habe ich nun einfach mit der Funktion count() realisiert.

if(count($arr) >= 1) {
foreach ($arr as $value) {
echo "Value: $value\n";
}
}

Trying to work out the code of the diagram seen on the cover of Casey Reas’ and Ben Fry’s book ‘Processing – A Programming Handbook for Visual Designers and Artist‘. Being relatively new to the processing.org language, this is something of a mouthful for me.

This idea was to try and work with arrays and functions, returning values and using the data within the arrays to continue the development of the script. The optimistic strategy goes as follows;

1. build the ’setup’ (write the layout of the script, involving randomly placed ellipses, and passing all these values in to the array, for later usage),
2. connect specific network elements to each other by evaluating distance between each component,
3. apply noise() to all components, to make them move around, still updating connections between them,
(4. apply rules of movement – thus transforming them in to boids / agents?).

Step 1.

code for step1:

// Network diagram v1
// written 09-11-13, Claus Rytter Bruun de Neergaard
// clausneergaard.wordpress.com

// (comments removed due to limited column width)

// GLOBAL VARIABLES -----------------------
int canvas = 900;
int amount = 400;
int minPtSize = 10;
int maxPtSize = 100;      

int[] ptsX = new int[amount];
int[] ptsY = new int[amount];    

// SETUP + DRAW RANDOM ELLIPSES -----------
void setup() {
  size(canvas, canvas);
  smooth();
  background(255);
  noStroke();
  strokeWeight(0.5);
  fill(0, 170, 250, 40);
  noLoop();

  for (int i = 0; i < amount; i++) {
    int x = rdmValue(0, canvas);
    int y = rdmValue(0, canvas);
    ptsX[i] = x;
    ptsY[i] = y;
  }  

  for (int i = 0; i < amount; i++) {
    float r = random(minPtSize, maxPtSize);
    ellipse(ptsX[i], ptsY[i], r, r);
    stroke(0, 100);
    fill(255, 100);
    ellipse(ptsX[i], ptsY[i], 3, 3);
    noStroke();
    fill(0, 170, 250, 40);
  }
}

// DRAW (MAIN FUNCTION) -------------------
void draw() {
  save("export.tif");
}

// FUNCTION RANDOM VALUE ------------------
int rdmValue(float bottom, float top) {
  int f = int(random(bottom, top));
  return f;
}

Step 2.

code for step 2:

// Network diagram v2
// written 09-11-13, Claus Rytter Bruun de Neergaard
// clausneergaard.wordpress.com

// (comments removed due to limited column width)

// GLOBAL VARIABLES --------------------------------------------
int canvasX = 1680;             // canvas size X
int canvasY = 1050;             // canvas size Y
int amount = 4000;              // amount of points on the screen
int minPtSize = 10;             // min size of points/ellipse's
int maxPtSize = 80;             // max size of points/ellipse's

int[] ptsX = new int[amount];   // declare + create new array
int[] ptsY = new int[amount];   // declare + create new array

// SETUP + DRAW RANDOM ELLIPSES --------------------------------
void setup() {
  size(canvasX, canvasY);
  smooth();
  background(0);
  noStroke();
  strokeWeight(0.8);
  fill(0, 170, 250, 40);
  noLoop();

  for (int i = 0; i < amount; i++) {
    int x = rdmValue(10, canvasX-20);
    int y = rdmValue(10, canvasY-20);
    ptsX[i] = x;
    ptsY[i] = y;
  }  

  for (int i = 0; i < amount; i++) {
    float r = random(minPtSize, maxPtSize);
    ellipse(ptsX[i], ptsY[i], r, r);
    stroke(255, 100);
    fill(0);
    ellipse(ptsX[i], ptsY[i], 2, 2);
    noStroke();
    fill(0, 170, 250, 40);
  }
}

// DRAW --------------------------------------------------------
void draw() {
  stroke(255, 40);
  strokeWeight(0.5);  

  for (int i = 0; i < amount - 1; i++) {
    for (int j = i; j < amount; j++) {
      if (dist(ptsX[j], ptsY[j], ptsX[i], ptsY[i]) < 100) {
        line(ptsX[j], ptsY[j], ptsX[i], ptsY[i]);
      }
    }
  }
}

// FUNCTION RANDOM VALUE ---------------------------------------
int rdmValue(float bottom, float top) {
  int f = int(random(bottom, top));
  return f;
}

Step 3.

Okay, so the code for the basic noise()-movement has been created, and acts as shown in the video. Now, the idea is to combine previous network system with the actual movement, while the rules of connection still apply, even though the system is dynamic. The code might need to be restructured to work properly. Still, so far so good.

// 'fly'-boids (noise with array test)
// written 09-11-14, Claus Rytter Bruun de Neergaard

int boids = 200;                       // number of boids
int canvasX = 800;                     // canvas size x-direction
int canvasY = 600;                     // canvas size y-direction
float inc = 0.003;                     // move increasement every loop
float nX, nY;

float[] ptsX = new float[boids];       // declare + create array X
float[] ptsY = new float[boids];       // decalre + create array Y

void setup() {
  size(canvasX, canvasY);
  smooth();
  stroke(0, 170, 250);
  strokeWeight(3);
  background(255);
  for (int i = 0; i < boids; i++) {
    ptsX[i] = random(0, canvasX);      // write pts to array X
    ptsY[i] = random(0, canvasY);      // write pts to array Y
  }
}

void draw() {
  background(0);
  for (int i = 0; i < boids; i++) {
    nX = noise(ptsX[i]) * canvasX;     // add noise value to nX
    nY = noise(ptsY[i]) * canvasY;     // add noise value to nY
    point(nX, nY);                     // insert pt
    ptsX[i] = ptsX[i] + inc;           // increase X with inc
    ptsY[i] = ptsY[i] + inc;           // increase Y with inc
  }
}

Connection written (if dist < 50 then draw connecting line, meaning that each loop this if-statement is evaluated, so that once the boid reaches a distance less than 50, the line will occur, as well as the other way around, of course).

Updated code:

// network studies (perlin noise + array) v2
// written 09-11-15, Claus Rytter Bruun de Neergaard

// comments removed due to limited column width

int boids = 100;       // amount of boids
int canvasX = 700;     // canvas size x-direction
int canvasY = 700;     // canvas size y-direction
float inc = 0.002;     // move increasement every loop

float[] ptsX = new float[boids];
float[] ptsY = new float[boids];
float[] posX = new float[boids];
float[] posY = new float[boids]; 

void setup() {
  size(canvasX, canvasY);
  smooth();
  stroke(0, 170, 250);
  strokeWeight(1);
  background(255);
  ellipseMode(CENTER);

  for (int i = 0; i < boids; i++) {
    ptsX[i] = random(0, canvasX);
    ptsY[i] = random(0, canvasY);
    posX[i] = ptsX[i];
    posY[i] = ptsY[i];
  }
}

void draw() {
  background(0);
  fill(255);
  stroke(255, 100);
  strokeWeight(1);  

  // Update the boids' positions
  for (int i = 0; i < boids; i++) {
    posX[i] = noise(ptsX[i]) * canvasX;
    posY[i] = noise(ptsY[i]) * canvasY;
    ptsX[i] = ptsX[i] + inc;
    ptsY[i] = ptsY[i] + inc;
  }

  // draw the connecting lines
  for (int i = 0; i < boids-1; i++) {
    for (int j = i; j < boids; j++) {
      if (dist(posX[j], posY[j], posX[i], posY[i]) < 50) {
        line(posX[j], posY[j], posX[i], posY[i]);
      }
    }
  }

  // draw the boids (draw them last, so they are not masked by lines)
  for (int i = 0; i < boids; i++) {
    ellipse(posX[i], posY[i], 4, 4);
  }
}

This is a quick multidimensional array. In this example I am just adding some buttons to the stage and then placing a number.

package {

import fl.controls.Button;
import flash.display.*

public class multiArr extends MovieClip {

private var currNum:Number = 1;
private var pieceArray:Array = new Array();
private var i:Number =0;
private var j:Number=0;

public function buildArr() {
for (i = 0; i < 5; i++) {
for (j = 0; j < 5; j++) {
var ta:Button = new Button();
pieceArray.push(ta);
ta.width = 100;
ta.height =100;
addChild(ta);
ta.x = 100*j;
ta.y= 100*i;
ta.label = currNum.toString();
currNum++;
}
}
}
}
}

All you need is a button in the library.

There is probably a better way to accomplish this but this is how I do it. If you have a method you would like to share let me know – post it in a comment.

If anyone is interested I am going to post a revised version of this using XML.

Null should never be returned from a method returning a collection or an array. Instead return a empty array (a static final empty array) or one of the empty collections (e.g. Collections.EMPTY_LIST assuming the client should not be modifying the collection).

(submitted by Rand McNeely)

Ok, obviously you and I both knew that you can turn an array into an object.  You just do a nice and easy for loop around it:

$obj = new stdClass;
foreach ($a as $key => $value) {
	$obj->key = $value;
}

Or maybe you’re sharper than me and already knew there was a much quicker way of doing this.  Congrats.  In my years of PHP development I never came across this, but evidently PHP allows you to cast an array to an object to accomplish the same thing:

$a = array(
	'name' => 'Jimmy',
	'species' => 'Brown-headed Parrot',
	'temperament' => 'vicious but lovable',
	'angry' => 'usually'
);
print_r((object)$a);

// stdClass Object
// (
//     [name] => Jimmy
//     [species] => Brown-headed Parrot
//     [temperament] => vicious but lovable
//     [angry] => usually
// )

Not too shabby, right?

So, what’s Next?

When you’re learning computer programming there is a big wall the day that you get to Classes and objects, specifically when you start to need to work with basic data structures and with dynamic arrays of objects. In my case, i started with particle systems; but again… what sort of particles systems would be useful for me for motion graphics?

For starters i begun with a random walker exercise in the Processing “Processing a programming handbook for visual designers and artists” Book… and started thinking: hey, it’d be nice to have a particle system entirely made of this little thingies, wouldn’t it? so, here it is.

These were some of the first tries.

At that time, my way to manage dynamic arrays was a bit straight-forward… instead of using processing’s ArrayLists, I was using just a normal array of elements and the append() function… which with time proved not to be really fast.

Also i started noticing how you could work on anything that moves either in a cumulative or dynamic way, meaning doing a painting of sorts by never calling background() or doing an animation by completely redrawing every frame. This is also called Aggregate and instantaneous visualizations…

A bit more on that here, at Jared Tarbell’s Complexification.net site. Where you may start noticing that even using such a deterministic media as code, creative expression takes over, and the same tasks assigned to different artists end up with very different results.

Yesterday morning awoke to being cold and the sun rising at 4.30am. Looked out the car window to see amazing cloud formations over the mountainside.

We decided to set up the solar panels.. which was about the time we realised we were one regulator short for our two solar arrays!

So being a gorgeous sunny day we decided to set up with only one and it worked a treat. We had to manually turn the panels to recieve maximum output but luckily we had time to do so.

We then moved some furniture in – just basics, wardrobes, tables, chairs.. It was starting to feel homelier

Then we started chasing suppliers for quotes. So much to be done and so little time… So many recommendations.. and short drives ‘five or six k’s down the road’ that never seemed to materialise!

We headed home after getting our new street number… woohoo.. now we know exactly how many kms to the end of our street from our driveway. Honestly there should be some owners guide to owning rural property!

A quick meal later and we were off to bed (in the car again).

Reading from the keyboard (stdin) in C might be tricky, for various reasons. One very common issue you might go through is that the input buffer might be dirty from stuff that remained there from a previous reading. To make things easier for me, I’ll call the input buffer “IB” from now on. Let’s start with some code:

#include <stdio.h>
#include <stdlib.h>

int main()
{
char readinput1,readinput2;

	printf("\n\n\t Type a character to be stored into \"readinput1\": ");
	readinput1 = getchar();
	printf("\n\n\t Type a character to be stored into \"readinput2\": ");
	readinput2 = getchar();

	printf("\n\n\n\t You've typed: %c (readinput1) and %c (readinput2)", readinput1, readinput2);

	return 0;
}

Ok, so what this code apparently does is ask the user to type in one character twice, storing each of them into a different variable of the appropriate type. In fact, though, when you run this code and test it, you’ll see that readinput2 ends up with the newline character (‘\n’). That’s there because when the user presses the “enter” key (carriage return) to finalize the typing, two character codes are sent to the OS: ‘\r’ (carriage return) and ‘\n’ (“enter” is the same key used whenever you wanna add a new line on text input).

What happens then is the \n stays in the IB, and then when we call getchar() again, it will do just what it’s supposed to, which is to take one character from the IB and return it. That’s how readinput2 gets messed up.

On a more interesting example:

#include <stdio.h>
#include <stdlib.h>

int main()
{
char readinput1[10],readinput2[10];

	printf("\n\n\t Type 9 characters to be stored into \"readinput1\": ");
	fgets(readinput1, sizeof(readinput1), stdin);
	printf("\n\n\t Type 9 characters to be stored into \"readinput2\": ");
	fgets(readinput2, sizeof(readinput2), stdin);

	printf("\n\n\n\t You've typed: %s (readinput1) and %s (readinput2)", readinput1, readinput2);

	return 0;
}

Notice this code isn’t vulnerable to buffer overflows on readinput1 and readinput2, because we’ve specified we want to read up to and no more than sizeof(readinput1) and sizeof(readinput2) into each one, but here’s how we’re gonna do this: run the code, then type in “12345678901234567″ when it asks for the first input. Press ENTER and watch what happens. Here it is:

So what happened there? Well, we threw 18 bytes into the IB, and it looks like this: 12345678901234567\n. The first call to fgets() takes 9 bytes from it, throws into readinput1 (indeces 0..8), then finalizes readinput1 with the null byte character (”). Then there’s a second call to fgets(), but at this point the IB looks like this: 01234567\n, and look, there’s a \n at the end of it. fgets() will stop reading whenever it reaches a newline character, and that’s why the user doesn’t even get a chance to type anything. readinput2 then ends up with 01234567\n, as shown in the screen shot.

All right, so how do we solve this?

Well, if you think about it, we have functions in C that will pop characters off the IB, and that’s really all we need. In the first example, as you could have guessed, you could add a getchar(); after the first reading so as to get rid of the \n that’s left in stdin, but that’s hardly an efficient solution, because, as we’ve just demonstrated, we may have any amount of bytes left there, depending on what the user types. But coming up with a solution is simple enough, all we need to do is keep popping characters off stdin until we reach a \n or a nullbyte

So here’s my code for that:

void clearib()
{
    int c;
    for(; c != EOF && c != '\n'; c = getc(stdin));
}

So all you need to do is, whenever you think there might be trash left out there, call this function before reading anything in. So our example could be fixed like this:

#include <stdio.h>
#include <stdlib.h>

void clearib()
{
    int c;
    for(; c != EOF && c != '\n'; c = getc(stdin));
}

int main()
{
char readinput1[10],readinput2[10];

	printf("\n\n\t Type 10 characters to be stored into \"readinput1\": ");
	fgets(readinput1, sizeof(readinput1), stdin);
	clearib();

	printf("\n\n\t Type 10 characters to be stored into \"readinput2\": ");
	fgets(readinput2, sizeof(readinput2), stdin);
	clearib();

	printf("\n\n\n\t You've typed: %s (readinput1) and %s (readinput2)", readinput1, readinput2);

	return 0;
}

Sure enough, if you give the same input you did for readinput1 the first time, you’ll see it’s fixed. Here I typed in “12345678901234567″ again, pressed enter, and got asked to type in the input for readinput2. I gave it “aaaaaaaaaa” (10 times ‘a’), and both strings contained what they were supposed to at the end. Notice how I called clearib() after the second fgets(), so even though there is one ‘a’ left in stdin after this (because fgets() reads 9 bytes + terminates the string with the null byte), the buffer is cleared with the given function and all is well. Here’s the output:

And that’s that. If anyone has any ideas/thoughts/comments/better solutions, please speak up. Otherwhise, enjoy

Program ini akan merubah / mengkonversi angka yang dimasukkan  oleh user  ke dalam suatu huruf / kata  yang mewakili angka yang dimasukkan tersebut.

Algoritma

Masukkan nilai dan diinisialkan sebagai n.

Buat deklarasi array huruf dengan value dari { “ ” …. “ sebelas ” }.

Cek nilai n :

1. Jika kurang dari 12, maka kembalikan value dengan memanggil variabel huruf dengan indeks array n dan langsung ke langkah 3.9. Jika tidak lanjut ke langkah 3.2. Hasilnya simpan di dalam satu variabel misalnya v.
2. Jika kurang dari 20, kembalikan value dengan n – 10 diimbuhi kata belas dan hasil ditambahkan ke value v dan langsung ke langkah 3.9. Jika tidak < 20, lanjut ke langkah 3.3.
3. Jika kurang dari 100, untuk mendapatkan kata pertama maka ulang ke mulai langkah 3 dengan n sejumlah n / 10. Lalu langsung ke c dengan kata selanjutnya ulang langkah 3 dengan n senilai n modulus 10 dan hasil ditambahkan ke value v dan langsung ke langkah 3.9. Jika tidak kurang dari 100, lanjut ke langkah 3.4.
4. Jika kurang dari 200, kata pertama diberi “seratus” kata selanjutnya ulang langkah 3 dengan n senilai n – 100 dan hasil ditambahkan ke value v dan langsung ke langkah 3.9. Jika tidak kurang dari 200, lanjut ke langkah 3.5.
5. Jika < 1000 kembali ke langkah 3 dengan n senilai n / 100, dan valuenya diimbuhi kata “ratus” kemudian untuk kata selanjutnya masukkan nilai n dengan n modulus 100 dan hasil ditambahkan ke value v dan langsung ke langkah 3.9. Jika tidak < 1000 lanjut ke langkah 3.6.
6. Jika < 2000 masukkan kata “seribu” dan kembali ke langkah 3 dengan n senilai n – 1000 dan hasil ditambahkan ke value v dan langsung ke langkah 3.9. Jika tidak < 2000 lanjut ke langkah 3.7.
7. Jika < 1000000, kembali ke langkah 3 dengan n senilai n / 1000. Dan imbuhi hasilnya dengan kata “ribu”. Lalu untuk kata selanjutnya kembali ke langkah 3 dengan n senilai n modulus 1000 dan hasil ditambahkan ke value v dan langsung ke langkah 3.9. Jika tidak < 1000000 lanjut ke langkah 3.8.
8. Kumpulkan value v.

Cetak nilai v.

Selesai.

Flowchart

Code

import javax.swing.JOptionPane;
public class Number_Word{
public String konversi (int angka){
String [] bilangan ={“”,”satu”,”dua”,”tiga”,”empat”,”lima”,”enam”,”tujuh”,”delapan”,”sembilan”,”sepuluh”,”sebelas”};
String temp=” “;
if (angka<12){
temp = ” ” + bilangan[angka];
}
else if(angka<20){
temp = konversi(angka-10) + ” belas”;
}
else if(angka<100){
temp = konversi(angka/10) + ” puluh” + konversi(angka%10);
}
else if(angka<200){
temp = “seratus” + konversi(angka-100);
}
else if(angka<1000){
temp = konversi(angka/100) + ” ratus” + konversi(angka%100);
}
else if(angka<2000){
temp = “seribu”+ konversi(angka-1000);
}
else if(angka<1000000){
temp = konversi(angka/1000) + ” ribu” + konversi (angka%1000);
}
return temp;
}
public static void main (String args[]){
do{
try {
Number_Word num = new Number_Word();
int konvert = Integer.parseInt(JOptionPane.showInputDialog(“Masukkan Nilai”));

if (konvert < 0 || konvert >999999) {
JOptionPane.showMessageDialog(null,”Angka di luar range!!!”,”WARNING”,JOptionPane.ERROR_MESSAGE);
}
else {
JOptionPane.showMessageDialog(null,”Hasil = \n ” + konvert + ” = ” + num.konversi(konvert),”RESULT”,JOptionPane.INFORMATION_MESSAGE);
}
}
catch(Exception e){
JOptionPane.showMessageDialog(null,”ERROR”,”WARNING”,JOptionPane.ERROR_MESSAGE);
}
}
while(JOptionPane.showConfirmDialog(null,”Ingin Mengulang??”,”OPTION”,JOptionPane.ERROR_MESSAGE)==JOptionPane.YES_NO_OPTION);
}
}

Keterangan :

ขอบ่นก่อนเลย วันนี้มันไฟดับที่ห้องทำงานเราห้องเดี๋ยว อ่ะทั้งตึก งานก้อไม่ได้ทำ แล้ว zomdo ของเราจะมีความคืบหน้าได้ยังไง (ก้อไม่มีไง) งั้นผมจะมาพูดถึงวิธ๊การการเซฟรูปลงเซิฟเวอร์กันดีกว่านะครับ

code php

<?php
$data = explode(“,”, $_POST['img']);
$width = $_POST['width'];
$height = $_POST['height'];
$image=imagecreatetruecolor( $width ,$height );
$background = imagecolorallocate( $image ,0 , 0 , 0 );
//Copy pixels
$i = 0;
for($x=0; $x<=$width; $x++){
for($y=0; $y<=$height; $y++){
$int = hexdec($data[$i++]);
$color = imagecolorallocate ($image, 0xFF & ($int >> 0×10), 0xFF & ($int >> 0×8), 0xFF & $int);
imagesetpixel ( $image , $x , $y , $color );
}
}
//Output image and clean
header( “Content-type: image/jpeg” );
imagegif ($image, “temp.jpeg” );
imagedestroy( $image );
?>

คำอธิบายคับ

จากค่าที่ไฟล์ Flash ส่งมาให้จะส่งมา 3 ค่า มีชื่อว่า

• img เก็บค่าอาเรย์ เป็นแบบนี้ 220d04,28130a,271109,210c03,200801,210a02,210400,230200,… เป็นเลขฐาน 16 นะจำนวนก้อเท่ากับขนาดของ width*height ครับ (เลขแต่ละค่าจะเป็นค่าสีในแต่ละพิกเซลของภาพนั้น นั่นเอง)
• width และ height ค่าความกว้าง และสูงของรูป คับ (ก้อรู้ๆ กันอยู่เนอะ)

เนี่ยหละ พอ Flash ส่งมายัง PHP … PHP ก้อจะรับค่าตัวแปรนั้นด้วยคำสั่ง $_POST['img'] (ก้อคำสั่งรับค่า argument แบบ post เดิมๆคับ) แต่จะใช่ตัวแปรเก็บแบบ อาเรย์เอาไว้ (ไม่รู้นะว่า PHP ประกาศอาเรย์ไม่มี [ ] ..ผมอยู่ในระดับกำลังศึกษาคับ PHP อ่ะ) ใช้คำสั่ง explode แยกค่าตัวหนังสือออกจากตัวที่เรา explode (เราใช้ , แบ่งตัวหนังสือคับ) มันจะเหมือน string.split ใน จาวาอ่ะ ส่วนค่า width และ height ก้อเอาเก็บไว้ในตัวแปรเหมือนกัน

1. เราเริ่มตัวตัว สร้าง image เป็นภาพที่มีขนาดตามที่เราส่งค่ามานะครับ ด้วยคำสั่ง
$image=imagecreatetruecolor( $width ,$height );

2. การสร้างค่าสีในภาพ ด้วยคำสั่ง imagecolorallocate( $image ,0 , 0 , 0 );

3. ต่อไปเป็นการ ก้อปปี้ ค่าพิกเซล ทุกพิเซลนะครับ (ระวังด้วย หากภาพนั้นใหญ่เกินไปจะทำให้โปรแกรมวนลูป …ช้ามากๆ) ทำด้วยการวนลูปครับ for 2 อันซ้อนกัน วน width height

4. implement ข้างในลูปที่ 2 จากข้อ 3
$int = hexdec($data[$i++]); //อ่านค่าตัวหนังสือ string เนี่ยให้เป็นค่าเลขฐาน 16 เพราะตัวหนังสือนั้นที่ส่งมาเป็นเลขฐาน 16 อยู่แล้วนะ
$color = imagecolorallocate ($image, 0xFF & ($int >> 0×10), 0xFF & ($int >> 0×8), 0xFF & $int);//imagecolorallocate การกำหนดสีให้กับภาพครับ พารามิตเตอร์ได้แก่ objectภาพ สีแดง สีเขียว สีน้ำเงิน ทำไมมันชิปบิต??? ก้อเพราะค่าที่ส่งมาเป็นเลขฐาน 16 ไง… เช่น 0×5d88f2 เนี่ยนะครับมันประกอบด้วยค่าสีแดงเขียวน้ำเงิน ดังนั้นเราต้องชิปบิตด้วยนะเพื่อเอาค่าสีนั้นมาใส่ในพารามิตเตอร์ให้ถูกต้อง … *0*
imagesetpixel ( $image , $x , $y , $color ); //ตามชื่อฟังก์ชั่นนั้นหละ เปลี่ยนสีรูปภาพตามตำแหน่ง x y ของรูปภาพ ที่กำหนด

5. เมื่อได้ภาพที่เราส่งมาจาก Flash ถึง PHP แล้วเราก้อจะเซฟลงเซิฟเวอร์นะบัดนี้
header( “Content-type: image/jpeg” );//กำหนดเฮดเดอร์ครับ ให้เป็นชนิดรูปภาพ ตามนามสกุล jpg, jpeg, gif, png เป็นต้น
imagejpeg ($image, “temp.jpeg” );//ใช้ฟังก์ชั่นให้ตรงกับ นามสกุลของรูปที่เราตั้งด้วยนะ ฟังก์ชั่นนี้จะสร้างรูปเซฟลงไปที่เซิฟเวอร์ครับ ใครอยากให้มันเซฟลงที่ โฟลเดอร์ไหนก้อปรับแต่งได้ในพารามิตเตอร์ตัวที่ 2 นะ
imagedestroy( $image );//เคลียเมมโมรี่ครับ เพราะเราจะไม่ได้ใช้มันแล้ว เป็นประหยัดทรัพยากรเครื่องด้วยนะ

OK หมดหละเป็นวิธีที่จะทำให้ท่านส่งรูปจากโปรแกรม Flash ไปยังเซิฟเวอร์ได้อย่างถูกต้องและรวดเร็ว (มั่ง) … ผมน่าจะอธิบายละเอียดนะ บางฟังก์ชั่นเป็นฟังก์ชั่นพื้นฐานครับ แต่สำหรับผมใหม่หมดทุกฟังก์ชั่นเลย เพราะพึ่งเรื่มศึกษาก้อเจองานหินซะแล้ว แต่ยังดียังมีโค้ดบนเน็ตอยู่ทำให้ศึกษาได้เร็วขี้น…

วันนี้ zomdo player ไม่มีอะไรคืบหน้าเพราะไฟดับ ไม่ได้ทำงานเลยมาเขียนบล็อคนี้แทนคับ เป็นอันว่าจบดีกว่า …บะบายนะ

Root page: Heuristics exposed

Parent Page: Number Boundary Testing

Number Boundary Testing -  Complex data boundaries 

Complex data types are created by composition of basic data types. Compositions of data of the same type are formed as arrays. Compositions of data of different type are formed as records.

There are internal (technical) rules defining how complex data type is managed. The rules are platform and programming language specific. 

Arrays 

For the each dimension it has an array has minimal and maximal index boundaries defined as numbers. In some programming languages array index begins with 0, in some other – with 1. That leads to lots of confuses based on:

• First element should be accessed as Array(0),
• Last element should be accessed as Array(Number_of_elements minus one) 

When reported to the screen indexes should be converted to 1-based notations. When an input is received it should be converted to 0-based index before addressing an array element. 

To overcome that issue programmers use various approaches. For example, I have seen the code below on a few projects and in different companies:

Months = Array (“Zerourary”, “January”, “February”, “March”, “April”, “May”, “June”, “July”, “August”, “September”, “October”, “November”, “December”)

“Zerourary” month is defined to occupy the first slot which has index 0. 

String is an array consisting of characters. Some programming languages reserve 256 elements for a string type and store the actual number of characters at index 0 element. So the string may have up to 255 characters total. Depending on the programming language and compiler directives, when the actual number of characters is exceeded the string is silently truncated or an automatic exception is thrown. 

Enumerations and lists define possible values that could be taken. In addition to index boundaries there are could be additional rules as in the following examples:

• an array must contain same or less number of items as in the enumeration (e.g. reporting week days in timesheet)
• an array may not contain duplicated items from the enumeration (e.g. week days should not be duplicated in the example above)
• some items may not be duplicated and some could be (e.g. one can have multiple brothers, sisters, sons, daughters but only one mother and father. To make it more complicated: some countries allow having multiple spouses) 

Records 

Records may represent closely related values, like year, month, and day for the date; or somewhat related only business-wise, for example last name and SIN. Often values stored in a record require transformation before output to the screen. These transformation rules are subject to change depending on regional settings and customization settings in the program. 

A code operating records is oriented to the specific format. Code modules that pass in and back data records should either follow the same convention with a format or have bridging functions that perform the conversion. That applies both to back-end and front-end functions. 

Testing the boundaries 

The approach 

While defects with these types of boundaries usually impose a high severity issues they can be relatively easy caught at very early stages of development. Implementation of automated Unit Tests is better investment here rather than implementation of automated functional tests.

However there are a few good functional test sets that allow quickly check the most common scenarios. Since complex data type boundaries are internal the main trick here is to make a code make a mistake. 

Examples. 

• Strings. Although GUI may not allow user to input strings exceeding the boundaries tester may try to make an application to produce a string of an inappropriate length. For example, if full name is constructed by an application as a combination like “last name comma first name” based on the manual input of first and last name.
• Arrays and enumerations. Tries to make a code assigning a wrong value work very well with combo boxes (leave black, try multi-select, try typing value not presented in the list), list boxes (select none, select all), radio groups (select none) and combinations of those, for example, try input two mothers. 

The challenges 

The challenges in identifying and proving a defect are similar to the ones described in data container boundary testing.

1. No immediate visible reaction

An application might accept an (invalid) input and still be alright. Causing it to output the value or use the value in some operations might help revealing a problem.

Boundary testing for a single value might require a whole scenario: post transaction – run processing – verify account balance.

 2. Internal messing

A single value might “travel” a pretty complicated path while being passed from one function to another inside the program. If somewhere within that chain the value won’t fit the memory cell the end-result will be wrong despite of the application accepted input. Or value could be properly stored in memory but will be messed up during saving into file or database record.

Test scenarios might be required to reveal those defects.

Let’s start with a quote from ‘Learning Perl‘:

What Is a Hash?

A hash is a data structure, not unlike an array in that it can hold any number of values and retrieve them at will. But instead of indexing the values by number, as we did with arrays, we’ll look up the values by name. That is, the indices (here, we’ll call them keys ) aren’t numbers, but instead they are arbitrary unique strings

Our goal: We want to store an array as a value in the hash instead of saving a single value.

Let’s write some code:

#!/usr/bin/perl
use strict;
use warnings;

my %hash = ();
my @array = (1, 2, 3, 4, 5);
my $aref = \@array;
$hash{"Testing"} = $aref;
push(@{$hash{"Testing"}},6);
print join " ",@{$hash{"Testing"}};

This piece of Perl code stores an array as a value in a hash and adds a new element to the array.

Now let’s analyze the code.

First we create an empty hash and we create an array and initialize it.

my %hash = ();
my @array = (1, 2, 3, 4, 5);

Now we need a reference of our array (so that we can store it as a value in the hash):

my $aref = \@array;

In the next step below we actually do what we wanted. Storing an array into a hash value. We create a key in our hash called "Testing" and store the reference of our array in the value field.

$hash{"Testing"} = $aref;

We can see that the reference of our array ($aref) is pointing to our array so we can access the array in our hash.

This code adds a new element with value '6' to our array:
push(@{$hash{"Testing"}},6);


Explanation: 
# Gives the value of key Testing, it's the reference to the array
$hash{"Testing"}

# Dereference it with {} to access the array (that's why we have an @ at the begin)
@{$hash{"Testing"}}

I hope that helped  

Dentro de nuestros programas siempre habrá algun pedazo de código donde utilicemos arreglos.
Mientras implementaba unos métodos para insertar y eliminar registros de una clase, noté que en algunos había utilizado Arrays y en otros Lists. Por ello decidí buscar que es lo que recomendaban otros programadores al respecto, fue así como encontré este artículo.

Finalmente quede convencido de utilizar Lists debido a la flexibilidad que ofrecen.

Ejemplo:

public static void insert(List<Dato> datos) {
  //... configuracion de conexion
  for(Dato dato:datos){
	db.executeUpdate("insert into datos(desc,cantidad) values(:desc,:cantidad)",
	new Object[]{dato.getDescripcion(),dato.getCantidad()});
  }
}

VS.

public static void insert(Dato[] datos) {
  //... configuracion de conexion
  for(Dato dato:datos){
	db.executeUpdate("insert into datos(desc,cantidad) values(:desc,:cantidad)",
	new Object[]{dato.getDescripcion(),dato.getCantidad()});
  }
}

Como puedes observar, es prácticamente lo mismo, la diferencia es que al invocar el primer método puedes pasar como párametro un ArrayList, LinkedList, Vector o tu propia clase que implemente la interfaz List .

byte!