java code analysis tools

Java also has a similar Codesmith code generation tool, but open source or a lot of free, the following brief introduction: 1.spring Roo One of the official spring projects. 2.m2spring It looks like a commercial. 3.springside Domestic, author Csdn Jiangnan White 4.rapid-framework It's also homemade. 5. Seam Gen JBoss Seam Code Auto Generation to

Java-language perfect data code analysis, java-language solution code 1. Concepts First, let's understand what is perfect number? Problem description: if a natural number is used, the sum of all its true factors (that is, the approximate number except itself) exactly equals

Java Collection --- HashMap source code analysis, java --- hashmap source code 1. HashMap Overview HashMap is implemented based on the Map interface of the hash table. This implementation provides all optional ing operations and allows the use of null values and null keys. (

Learn Java concurrency programming have to understand java.util.concurrent this package, this package has many of the concurrency tools we often use, such as: Reentrantlock, Countdownlatch, Cyclicbarrier, Semaphore and so on. The underlying implementations of these classes depend on the Abstractqueuedsynchronizer class, which shows the importance of this class. So in the

Java concurrent series of AbstractQueuedSynchronizer source code analysis (summary analysis ), To learn Java concurrent programming, you have to understand the java. util. concurrent package. This package contains many frequently

Label:BuildThe tools used to build the application are collected here.Apache Maven:maven is built with claims and relies on management, preferring to build using conventions rather than configurations. MAVEN is superior to Apache Ant. The latter is configured in a process-based manner, so it is very difficult to maintain.The Gradle:gradle is built incrementally. Gradle is configured with groovy programming instead of traditional XML declarations. Grad

from Destpos to Destpos+length-1. Because it is a native method, it is not visible in the JDK, but you can view the source code in the OPENJDK. The function actually eventually calls the C language's memmove () function, so it can guarantee the correct copying and movement of elements within the same array, which is much more efficient than the general method of replication, and is well suited for batch processing of arrays .

Brief IntroductionJava.exe is the execution program of the Java classfile. An execution shell that loads JVM. dll (in windows, the following uses Windows as an example, Linux and Solaris are actually similar, for: libjvm. So), this dynamic Connection Library is Java The actual operation of the virtual machine. This document describes how the java. exe program fin

expansion of the original twice times.Iteratorsprivate abstract class HashIteratorIn fact, the implementation of the iterator in the collection implementation of the class are similar, as long as you see one on it. This also records the number of changes expectedmodcount, that is, after the iterator is created, it is not possible to iterate during the modecount++ such operations, or appear fail-fastSerialization and deserialization-saving and reading the state of HashMapprivate void WriteObject

. Loadfractor plays the role of a flag bit, which marks the beginning and end of the calculation. About the H + + Entry.hashcode () in the H will overflow problem, above the hash () function has seen each time the hash will be with the 0x7fffffff, that is, the hash is always positive, will not overflowSerialization and deserializationprivate void WriteObject (Java.io.ObjectOutputStream s) throws IOException {entryNote that during deserialization, it does not recreate a hashtable that is exactly

, similar to the string to implement the method itself.equals of JDK1.7 ()public boolean equals (Object anobject) {if (this==anobject) {return true;}if (anobject instanceof String) {String anotherstring = (string) anobject;int n=value.length;if (n==anotherstring.value.length) {Char V1[]=value;Char v2[]=anotherstring. Value;int i=0;while (n--! =0) {if (V1[i]!=v2[i])return false;i++}return true;}}return false;}Note: The code logic for either 1.6 or 1.7,

the data on the server. The specific process is as follows: Client requests a protected resource for the server The server sends a request to the client to request username and password. Client sends user name and password to server The server returns the appropriate data to the client This authentication method is not secure, the client sends the user name and password is Base64 form encrypted text, this situation of the user name and password is exposed, if someone c

The most comprehensive Java byte operations, conversion and hexadecimal conversion tools for processing basic Java data, common tools for streaming media and underlying java development projects, and javabyte tools Conversion and

The main argument for supporting static analysis, including type checking, is that the results apply to all possible runs of the program, while unit tests only guarantee that the tested components (on the platform on which they are tested) apply only to specific inputs to the test component. The main argument for supporting unit testing is that it is easier to handle. You can test many of your programs ' constraints, which go far beyond what static

LinkedHashMap source code analysis of Java Collection series, linkedhashmap source code In this article, we started to analyze the source code of LinkedHashMap. LinkedHashMap inherits HashMap, which means that LinkedHashMap is extended on the basis of HashMap. Therefore, bef

unchanged, the other starts from the lowest bit, until the first 1 is encountered, nothing changes, the bit is reversed by bitwise, I.E. (Recommended) The Original code: ([Sign bit][***][1][n*0]), and its corresponding complement only to the [* *] part of the reverse can be followed. For example, when the total number of encodings is 8:+127 of the original code, anti-

is urgent, give examples to be considered, but suffice to explain the problem. an application needs to access the database and must specify a connection string in order to obtain a connection. For a program, the connection string is generally fixed after it is run. A, set in the construction code block or construction method, then each time you create the object must be set once, repeat, very troublesome. B, in the program to write the connection str

Java language for rabbit problem code analysis, java language for Rabbit 1. Thinking The rabbit problem is a visual representation of the February series. It is a question raised by a mathematician named ononacci in his book. 2. Description The problem with its body surgery is: if one child is not given birth to a chil

Source code analysis of javaslist in Java Collection series, and javaslist source code In the previous article, we analyzed the underlying implementation of ArrayList and learned that the underlying implementation of ArrayList is based on arrays. Therefore, it has the characteristics of fast search modification and slo

;linkedlist,add (e e), because of the existence of node last, O (1), add (int, E), need to traverse the depth of int first, In fact, the increment is the process of re-assignment, not the process of traversal, but also O (1), but actually a round down, also reduced to O (n);Delete: Arraylist,o (n), need to system.arraycopy;linkedlist, only see Delete, O (1), but in any case can not ignore the performance of the search consumption, and eventually reduced to O (n);Change: ArrayList, specify the po