1. source page :   http://www.iteye.com/topic/196610
   
2. Array.prototype.remove =  function (s) {   
3.      for  ( var  i = 0; i <  this .length; i++) {   
4.          if  (s ==  this [i])   
5.              this .splice(i, 1);   
6.     }   
7. }   
8.   
9. /**  
10.  * Simple Map  
11.  *   
12.  *   
13.  * var m = new Map();  
14.  * m.put('key','value');  
15.  * ...  
16.  * var s = "";  
17.  * m.each(function(key,value,index){  
18.  *      s += index+":"+ key+"="+value+"\n";  
19.  * });  
20.  * alert(s);  
21.  *   
22.  * @author dewitt  
23.  * @date 2008-05-24  
24.  */   
25. function  Map() {   
26.      /** 存放键的数组(遍历用到) */   
27.      this .keys =  new  Array();   
28.      /** 存放数据 */   
29.      this .data =  new  Object();   
30.        
31.      /**  
32.      * 放入一个键值对  
33.      * @param {String} key  
34.      * @param {Object} value  
35.      */   
36.      this .put =  function (key, value) {   
37.          if ( this .data[key] ==  null ){   
38.              this .keys.push(key);   
39.         }   
40.          this .data[key] = value;   
41.     };   
42.        
43.      /**  
44.      * 获取某键对应的值  
45.      * @param {String} key  
46.      * @return {Object} value  
47.      */   
48.      this .get =  function (key) {   
49.          return   this .data[key];   
50.     };   
51.        
52.      /**  
53.      * 删除一个键值对  
54.      * @param {String} key  
55.      */   
56.      this .remove =  function (key) {   
57.          this .keys.remove(key);   
58.          this .data[key] =  null ;   
59.     };   
60.        
61.      /**  
62.      * 遍历Map,执行处理函数  
63.      *   
64.      * @param {Function} 回调函数 function(key,value,index){..}  
65.      */   
66.      this .each =  function (fn){   
67.          if ( typeof  fn !=  'function' ){   
68.              return ;   
69.         }   
70.          var  len =  this .keys.length;   
71.          for ( var  i=0;i<len;i++){   
72.              var  k =  this .keys[i];   
73.             fn(k, this .data[k],i);   
74.         }   
75.     };   
76.        
77.      /**  
78.      * 获取键值数组(类似Java的entrySet())  
79.      * @return 键值对象{key,value}的数组  
80.      */   
81.      this .entrys =  function () {   
82.          var  len =  this .keys.length;   
83.          var  entrys =  new  Array(len);   
84.          for  ( var  i = 0; i < len; i++) {   
85.             entrys[i] = {   
86.                 key :  this .keys[i],   
87.                 value :  this .data[i]   
88.             };   
89.         }   
90.          return  entrys;   
91.     };   
92.        
93.      /**  
94.      * 判断Map是否为空  
95.      */   
96.      this .isEmpty =  function () {   
97.          return   this .keys.length == 0;   
98.     };   
99.        
100.      /**  
101.      * 获取键值对数量  
102.      */   
103.      this .size =  function (){   
104.          return   this .keys.length;   
105.     };   
106.        
107.      /**  
108.      * 重写toString   
109.      */   
110.      this .toString =  function (){   
111.          var  s =  "{" ;   
112.          for ( var  i=0;i< this .keys.length;i++,s+= ',' ){   
113.              var  k =  this .keys[i];   
114.             s += k+ "=" + this .data[k];   
115.         }   
116.         s+= "}" ;   
117.          return  s;   
118.     };   
119. }   
120.   
121.   
122. function  testMap(){   
123.      var  m =  new  Map();   
124.     m.put( 'key1' , 'Comtop' );   
125.     m.put( 'key2' , '南方电网' );   
126.     m.put( 'key3' , '景新花园' );   
127.     alert( "init:" +m);   
128.        
129.     m.put( 'key1' , '康拓普' );   
130.     alert( "set key1:" +m);   
131.        
132.     m.remove( "key2" );   
133.     alert( "remove key2: " +m);   
134.        
135.      var  s = "" ;   
136.     m.each( function (key,value,index){   
137.         s += index+ ":" + key+ "=" +value+ "\n" ;   
138.     });   
139.     alert(s);   
140. }  

Array.prototype.remove = function(s) {
	for (var i = 0; i < this.length; i++) {
		if (s == this[i])
			this.splice(i, 1);
	}
}

/**
 * Simple Map
 * 
 * 
 * var m = new Map();
 * m.put('key','value');
 * ...
 * var s = "";
 * m.each(function(key,value,index){
 * 		s += index+":"+ key+"="+value+"\n";
 * });
 * alert(s);
 * 
 * @author dewitt
 * @date 2008-05-24
 */
function Map() {
	/** 存放键的数组(遍历用到) */
	this.keys = new Array();
	/** 存放数据 */
	this.data = new Object();
	
	/**
	 * 放入一个键值对
	 * @param {String} key
	 * @param {Object} value
	 */
	this.put = function(key, value) {
		if(this.data[key] == null){
			this.keys.push(key);
		}
		this.data[key] = value;
	};
	
	/**
	 * 获取某键对应的值
	 * @param {String} key
	 * @return {Object} value
	 */
	this.get = function(key) {
		return this.data[key];
	};
	
	/**
	 * 删除一个键值对
	 * @param {String} key
	 */
	this.remove = function(key) {
		this.keys.remove(key);
		this.data[key] = null;
	};
	
	/**
	 * 遍历Map,执行处理函数
	 * 
	 * @param {Function} 回调函数 function(key,value,index){..}
	 */
	this.each = function(fn){
		if(typeof fn != 'function'){
			return;
		}
		var len = this.keys.length;
		for(var i=0;i<len;i++){
			var k = this.keys[i];
			fn(k,this.data[k],i);
		}
	};
	
	/**
	 * 获取键值数组(类似Java的entrySet())
	 * @return 键值对象{key,value}的数组
	 */
	this.entrys = function() {
		var len = this.keys.length;
		var entrys = new Array(len);
		for (var i = 0; i < len; i++) {
			entrys[i] = {
				key : this.keys[i],
				value : this.data[i]
			};
		}
		return entrys;
	};
	
	/**
	 * 判断Map是否为空
	 */
	this.isEmpty = function() {
		return this.keys.length == 0;
	};
	
	/**
	 * 获取键值对数量
	 */
	this.size = function(){
		return this.keys.length;
	};
	
	/**
	 * 重写toString 
	 */
	this.toString = function(){
		var s = "{";
		for(var i=0;i<this.keys.length;i++,s+=','){
			var k = this.keys[i];
			s += k+"="+this.data[k];
		}
		s+="}";
		return s;
	};
}


function testMap(){
	var m = new Map();
	m.put('key1','Comtop');
	m.put('key2','南方电网');
	m.put('key3','景新花园');
	alert("init:"+m);
	
	m.put('key1','康拓普');
	alert("set key1:"+m);
	
	m.remove("key2");
	alert("remove key2: "+m);
	
	var s ="";
	m.each(function(key,value,index){
		s += index+":"+ key+"="+value+"\n";
	});
	alert(s);
}

 //testMap.htm

Html代码  

1. < html >   
2. < head >   
3. < title > Test Map </ title >   
4. < script   language = "javascript"   src = "map.js" >   
5. </ script >   
6. </ head >   
7. < body >   
8. < input   type = "button"   value = "test"   onclick = "testMap()" >   
9. </ body >   
10. </ html >  
    

• Page restrictions apply
• Added by Edwin Dawson [Atlassian Technical Writer], last edited by Andrew Myers [Atlassian] on Jun 16, 2010  (view change)
• show comment hide comment

I am getting Out of Memory errors, how can I allocate more memory to FishEye?

Since the default memory setting usually is around 64MB or 128MB, you might have to adjust the settings to run a bigger FishEye instance with sufficient memory.
On this page:

• Out Of Memory Errors
  • OutOfMemoryError: Java Heap Space
  • OutOfMemoryError: PermGen space, or Permanent Generation Size
  • OutOfMemoryError: unable to create new native thread
  • OutOfMemoryError: GC overhead limit exceeded
  • java.lang.OutOfMemoryError: requested 32756 bytes for ChunkPool::allocate. Out of swap space?

Out Of Memory Errors

There are a number of different memory errors that the JVM will throw. The most common are listed as follows.
In the following, you will be required to set your memory settings via your FISHEYE_OPTS Environment Variables.
You will need to restart your server after setting your FISHEYE_OPTS.

After having set the FISHEYE_OPTS and restarting your server, go to Administration > Sys Info/Support > System Info, and check your JVM Input Arguments to ensure that your server is picking up your FISHEYE_OPTS as expected.

OutOfMemoryError: Java Heap Space

If you are running Fisheye/Crucible as a windows service, increasing memory needs to be done in the wrapper.conf file. Refere to the Can Fisheye be run as a Windows Service for instructions.

To solve this error, you will need to add the argument -Xmx1024m to FISHEYE_OPTS, in addition to any argument you use to set the heap size. Often you need to increase the amount of memory allocated to fisheye during the initial scan and period and once this is completed you can reduce back down.

FISHEYE_OPTS="-Xms128m -Xmx1024m -XX:MaxPermSize=256m"

After having set the FISHEYE_OPTS and restarting your server, go to Administration > Sys Info/Support > System Info, and check your JVM Input Arguments to ensure that your server is picking up your FISHEYE_OPTS as expected.

OutOfMemoryError: PermGen space, or Permanent Generation Size

If you get the error message: java.lang.OutOfMemoryError: PermGen space this means that you have exceeded Java's fixed 64MB block for loading class files. You will need to add the argument -XX:MaxPermSize=256m to FISHEYE_OPTS, in addition to any argument you use to set the heap size.

FISHEYE_OPTS="-Xms128m -Xmx512m -XX:MaxPermSize=256m"

After having set the FISHEYE_OPTS and restarting your server, go to Administration > Sys Info/Support > System Info, and check your JVM Input Arguments to ensure that your server is picking up your FISHEYE_OPTS as expected.

OutOfMemoryError: unable to create new native thread

This error occurs when the operating system is unable to create new threads. This is due to the JVM Heap taking up the available RAM.

Big heaps take away from the space that can be allocated for the stack of a new thread

For Linux the maximum heap size of the JVM cannot be greater than 2GB. If you only have 2GB RAM in your server, it is not recommended to set the Max size of the JVM that high.
The size of the stack per thread can also contribute to this problem. The stack size can reduce the number of threads that can be created.

To fix this problem, you should reduce the size of your JVM Heap and also the size of the stack per thread.
The stack size can be changed with the following (example) parameter being added to your FISHEYE_OPTS:

FISHEYE_OPTS="-Xms128m -Xmx1024m -XX:MaxPermSize=256m -Xss512k"

Please refer to this guide as a reference for JVM tuning.

After having set the FISHEYE_OPTS and restarting your server, go to Administration > Sys Info/Support > System Info, and check your JVM Input Arguments to ensure that your server is picking up your FISHEYE_OPTS as expected.

OutOfMemoryError: GC overhead limit exceeded

This error indicates that the JVM took too long to free up memory during its GC process. This error can be thrown from the Parallel or Concurrent collectors.

The parallel collector will throw an OutOfMemoryError if too much time is being spent in garbage collection: if more than 98% of the total time is spent in garbage collection and less than 2% of the heap is recovered, an OutOfMemoryError will be thrown. This feature is designed to prevent applications from running for an extended period of time while making little or no progress because the heap is too small. If necessary, this feature can be disabled by adding the option -XX:-UseGCOverheadLimit to the command line.

This kind of OutOfMemoryError can be caused if your java process is starting to use swapped memory for its heap. This will cause the JVM to take a lot longer than normal to perform normal GC operations. This can eventually cause a timeout to occur and cause this error.

To overcome this issue, you need to make sure that all processes can't allocate more memory than there is system memory. In practice this is impossible to do for all processes. At a minimum you should make sure that all your jvm's do not have a total maximum memory allocation than your normally available system memory.

Please refer to this guide for more information.

java.lang.OutOfMemoryError: requested 32756 bytes for ChunkPool::allocate. Out of swap space?

Essentially the native objects does not have enough memory to use. This is usually because you have allocated too much memory to your heap reducing the amount available for native objects. See this article.

The solution is to reduce the amount of heap memory you have allocated. For example if you have set -Xmx4096, you should consider reducing this to -Xmx2048m.

Remember if you are using a 32bit JVM you cannot allocate more than -Xmx2048m for linux (and even less for windows). Using a 64 bit JVM can resolve this problem, but is not recommended for fisheye/crucible instances (refer to System Requirements).

Read the Tuning FishEye page for more detail on adjusting resource limits and performance settings in FishEye.

I used to be able to open *.sql files in my Eclipse text editor. For some reason that stopped working this morning:

    Invalid menu handle.

    Problems opening an editor... unable to open external editor.

To fix this behavior for ALL files of a certain extension:

    Window > Preferences -

... and on the Preferences Tree:

    General > Editors > File Associations -

... add your File Type extension, for example *.sql

... and finally add your Associated Editor. I chose "internal editors" - "text editor"

You can also change the behavior "temporarily" for a single file. Right click the file, click "Open With..." and select the editor...

Why is serialization required?

In today's world, a typical enterprise application will have multiple components and will be distributed across various systems and networks. In Java, everything is represented as objects; if two Java components want to communicate with each other, there needs be a mechanism to exchange data. One way to achieve this is to define your own protocol and transfer an object. This means that the receiving end must know the protocol used by the sender to re-create the object, which would make it very difficult to talk to third-party components. Hence, there needs to be a generic and efficient protocol to transfer the object between components. Serialization is defined for this purpose, and Java components use this protocol to transfer objects.

Figure 1 shows a high-level view of client/server communication, where an object is transferred from the client to the server through serialization.

Figure 1. A high-level view of serialization in action (click to enlarge)

How to serialize an object

In order to serialize an object, you need to ensure that the class of the object implements the java.io.Serializable interface, as shown in Listing 1.

Listing 1. Implementing Serializable

				

						import java.io.Serializable;

class TestSerial implements Serializable {
	public byte version = 100;
	public byte count = 0;
}
				
		

In Listing 1, the only thing you had to do differently from creating a normal class is implement the java.io.Serializable interface. The Serializable interface is a marker interface; it declares no methods at all. It tells the serialization mechanism that the class can be serialized.

Now that you have made the class eligible for serialization, the next step is to actually serialize the object. That is done by calling the writeObject() method of the java.io.ObjectOutputStream class, as shown in Listing 2.

Listing 2. Calling writeObject()

				

						public static void main(String args[]) throws IOException {
	FileOutputStream fos = new FileOutputStream("temp.out");
	ObjectOutputStream oos = new ObjectOutputStream(fos);
	TestSerial ts = new TestSerial();
	oos.writeObject(ts);
	oos.flush();
	oos.close();
}
				
		

Listing 2 stores the state of the TestSerial object in a file called temp.out. oos.writeObject(ts); actually kicks off the serialization algorithm, which in turn writes the object to temp.out.

To re-create the object from the persistent file, you would employ the code in Listing 3.

Listing 3. Recreating a serialized object

				

						public static void main(String args[]) throws IOException {
	FileInputStream fis = new FileInputStream("temp.out");
	ObjectInputStream oin = new ObjectInputStream(fis);
	TestSerial ts = (TestSerial) oin.readObject();
	System.out.println("version="+ts.version);
}
				
		

In Listing 3, the object's restoration occurs with the oin.readObject() method call. This method call reads in the raw bytes that we previously persisted and creates a live object that is an exact replica of the original object graph. Because readObject() can read any serializable object, a cast to the correct type is required.

Executing this code will print version=100 on the standard output.

The serialized format of an object

What does the serialized version of the object look like? Remember, the sample code in the previous section saved the serialized version of the TestSerial object into the file temp.out. Listing 4 shows the contents of temp.out, displayed in hexadecimal. (You need a hexadecimal editor to see the output in hexadecimal format.)

Listing 4. Hexadecimal form of TestSerial

				

						AC ED 00 05 73 72 00 0A 53 65 72 69 61 6C 54 65
73 74 A0 0C 34 00 FE B1 DD F9 02 00 02 42 00 05
63 6F 75 6E 74 42 00 07 76 65 72 73 69 6F 6E 78
70 00 64
				
		

If you look again at the actual TestSerial object, you'll see that it has only two byte members, as shown in Listing 5.

Listing 5. TestSerial's byte members

				

							public byte version = 100;
	public byte count = 0;
				
		

The size of a byte variable is one byte, and hence the total size of the object (without the header) is two bytes. But if you look at the size of the serialized object in Listing 4, you'll see 51 bytes. Surprise! Where did the extra bytes come from, and what is their significance? They are introduced by the serialization algorithm, and are required in order to to re-create the object. In the next section, you'll explore this algorithm in detail.

Java's serialization algorithm

By now, you should have a pretty good knowledge of how to serialize an object. But how does the process work under the hood? In general the serialization algorithm does the following:

• It writes out the metadata of the class associated with an instance.
• It recursively writes out the description of the superclass until it finds java.lang.object.
• Once it finishes writing the metadata information, it then starts with the actual data associated with the instance. But this time, it starts from the topmost superclass.
• It recursively writes the data associated with the instance, starting from the least superclass to the most-derived class.

I've written a different example object for this section that will cover all possible cases. The new sample object to be serialized is shown in Listing 6.

Listing 6. Sample serialized object

				

						class parent implements Serializable {
	int parentVersion = 10;
}

class contain implements Serializable{
	int containVersion = 11;
}
public class SerialTest extends parent implements Serializable {
	int version = 66;
	contain con = new contain();

	public int getVersion() {
		return version;
	}
	public static void main(String args[]) throws IOException {
		FileOutputStream fos = new FileOutputStream("temp.out");
		ObjectOutputStream oos = new ObjectOutputStream(fos);
		SerialTest st = new SerialTest();
		oos.writeObject(st);
		oos.flush();
		oos.close();
	}
}
				
		

This example is a straightforward one. It serializes an object of type SerialTest, which is derived from parent and has a container object, contain. The serialized format of this object is shown in Listing 7.

Listing 7. Serialized form of sample object

				

						AC ED 00 05 73 72 00 0A 53 65 72 69 61 6C 54 65
73 74 05 52 81 5A AC 66 02 F6 02 00 02 49 00 07
76 65 72 73 69 6F 6E 4C 00 03 63 6F 6E 74 00 09
4C 63 6F 6E 74 61 69 6E 3B 78 72 00 06 70 61 72
65 6E 74 0E DB D2 BD 85 EE 63 7A 02 00 01 49 00
0D 70 61 72 65 6E 74 56 65 72 73 69 6F 6E 78 70
00 00 00 0A 00 00 00 42 73 72 00 07 63 6F 6E 74
61 69 6E FC BB E6 0E FB CB 60 C7 02 00 01 49 00
0E 63 6F 6E 74 61 69 6E 56 65 72 73 69 6F 6E 78
70 00 00 00 0B
				
		

Figure 2 offers a high-level look at the serialization algorithm for this scenario.

Figure 2. An outline of the serialization algorithm

Let's go through the serialized format of the object in detail and see what each byte represents. Begin with the serialization protocol information:

• AC ED: STREAM_MAGIC. Specifies that this is a serialization protocol.
• 00 05: STREAM_VERSION. The serialization version.
• 0x73: TC_OBJECT. Specifies that this is a new Object.

The first step of the serialization algorithm is to write the description of the class associated with an instance. The example serializes an object of type SerialTest, so the algorithm starts by writing the description of the SerialTest class.

• 0x72: TC_CLASSDESC. Specifies that this is a new class.
• 00 0A: Length of the class name.
• 53 65 72 69 61 6c 54 65 73 74: SerialTest, the name of the class.
• 05 52 81 5A AC 66 02 F6: SerialVersionUID, the serial version identifier of this class.
• 0x02: Various flags. This particular flag says that the object supports serialization.
• 00 02: Number of fields in this class.

Next, the algorithm writes the field int version = 66;.

• 0x49: Field type code. 49 represents "I", which stands for Int.
• 00 07: Length of the field name.
• 76 65 72 73 69 6F 6E: version, the name of the field.

And then the algorithm writes the next field, contain con = new contain();. This is an object, so it will write the canonical JVM signature of this field.

• 0x74: TC_STRING. Represents a new string.
• 00 09: Length of the string.
• 4C 63 6F 6E 74 61 69 6E 3B: Lcontain;, the canonical JVM signature.
• 0x78: TC_ENDBLOCKDATA, the end of the optional block data for an object.

The next step of the algorithm is to write the description of the parent class, which is the immediate superclass of SerialTest.

• 0x72: TC_CLASSDESC. Specifies that this is a new class.
• 00 06: Length of the class name.
• 70 61 72 65 6E 74: SerialTest, the name of the class
• 0E DB D2 BD 85 EE 63 7A: SerialVersionUID, the serial version identifier of this class.
• 0x02: Various flags. This flag notes that the object supports serialization.
• 00 01: Number of fields in this class.

Now the algorithm will write the field description for the parent class. parent has one field, int parentVersion = 100;.

• 0x49: Field type code. 49 represents "I", which stands for Int.
• 00 0D: Length of the field name.
• 70 61 72 65 6E 74 56 65 72 73 69 6F 6E: parentVersion, the name of the field.
• 0x78: TC_ENDBLOCKDATA, the end of block data for this object.
• 0x70: TC_NULL, which represents the fact that there are no more superclasses because we have reached the top of the class hierarchy.

So far, the serialization algorithm has written the description of the class associated with the instance and all its superclasses. Next, it will write the actual data associated with the instance. It writes the parent class members first:

• 00 00 00 0A: 10, the value of parentVersion.

Then it moves on to SerialTest.

• 00 00 00 42: 66, the value of version.

The next few bytes are interesting. The algorithm needs to write the information about the contain object, shown in Listing 8.

Listing 8. The contain object

				

						contain con = new contain();
				
		

Remember, the serialization algorithm hasn't written the class description for the contain class yet. This is the opportunity to write this description.

• 0x73: TC_OBJECT, designating a new object.
• 0x72: TC_CLASSDESC.
• 00 07: Length of the class name.
• 63 6F 6E 74 61 69 6E: contain, the name of the class.
• FC BB E6 0E FB CB 60 C7: SerialVersionUID, the serial version identifier of this class.
• 0x02: Various flags. This flag indicates that this class supports serialization.
• 00 01: Number of fields in this class.

Next, the algorithm must write the description for contain's only field, int containVersion = 11;.

• 0x49: Field type code. 49 represents "I", which stands for Int.
• 00 0E: Length of the field name.
• 63 6F 6E 74 61 69 6E 56 65 72 73 69 6F 6E: containVersion, the name of the field.
• 0x78: TC_ENDBLOCKDATA.

Next, the serialization algorithm checks to see if contain has any parent classes. If it did, the algorithm would start writing that class; but in this case there is no superclass for contain, so the algorithm writes TC_NULL.

• 0x70: TC_NULL.

Finally, the algorithm writes the actual data associated with contain.

• 00 00 00 0B: 11, the value of containVersion.

Conclusion

In this tip, you have seen how to serialize an object, and learned how the serialization algorithm works in detail. I hope this article gives you more detail on what happens when you actually serialize an object.

From  ： http://www.javaworld.com/community/node/2915