learning java 4th edition

that wrap certain primitive Types:chara Cter, Byte, short, and Integer. where enum enum types are new additions in JDK1.5, and switch supports string strings after JDK7.When programming using the JDK7 version of the environment, the selection factor of the switch statement is used, and if the specification is not met (such as the float type variable), a hint is generated: cannot switch on a value of type float . Only convertible int values, strings or enum variables is permitted because, Byte,s

Boolean isAlive ()Whether the test thread is active. It is active if the thread has been started and has not been terminated.The name of the thread is public final void SetName (String name)Change the thread name so that it is the same as the number of parameters.The thread's CheckAccess method is called first, with no reference to any of the parameters. This may throw SecurityException.Public final String GetName ()Returns the name of the thread.Public Thread (String name)Assigns a new Thread

Down-Stack (linked list implementation):Import Java.util.iterator;public class LinkedstackFIFO Queue (linked list implementation):Import Java.util.iterator;public class Linkedqueue Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced. Algorithm (fourth edition) Java implementation stack and queue for learning

its elements can be accessed efficiently and randomly, and the disadvantage is that the performance of inserting and removing elements at a specified location is slow. LinkedList is slower in random access, but it is more efficient to insert and remove elements at a specified location. 2. Set has three important implementations, respectively, Hashset,treeset,linkedhashset all implementation classes of the set interface ensure that their elements are not duplicat

of ~2NLGN and constant additional space. Often used in embedded systems or in low-cost mobile devices (systems with very tight space), but many applications of modern systems seldom use it, because it cannot take advantage of caching. Array elements are rarely compared with other adjacent elements, so the number of cache misses is much higher than the algorithm that most comparisons make between adjacent elements, such as quick sort, merge sort, or even hill sort. On the other hand, the heap-im

Merge sort idea: Sort an array into two parts (using recursion), then merge the results together, merging the last two ordered arrays into a larger ordered array.Time complexity o (n) = NlognThe most appealing nature of merge sorting is that it guarantees that the time required to sort an array of any length n is proportional to the nlogn, and the disadvantage is that the extra space required is proportional to n.Merge sort is also divided into top-down sorting and bottom-up sorting methods:The

Down (LIFO) stack: an implementation that dynamically adjusts the size of the arrayImport Java.util.iterator;public class resizingarraystackAdvantages:Almost (but not useless) achieves the best performance for the implementation of any collection class data type:1. The time of each operation is independent of the collection size;2. Space requirements always do not exceed the set size multiplied by a constant.Disadvantages:Some push () and pop () operations adjust the size of the array, which is

Binary search tree: is a binary tree in which each node contains a key and a value associated with it, and each node has a key greater than the key of any node in its left subtree, which is less than the key of any node in its right sub-tree.The principle of each method of binary search tree is explained in detail in the code, the following is the code:/** * * @author seabear * Binary search tree * @param Copyright NOTICE: This article for Bo Master original article, without Bo Master permissio

+ * Reacquire the lock before - */ + Public voidsleep () { ALib.asserttrue (Conditionlock.isheldbycurrentthread ());//determine the current process held the Block at BooleanIntstatus =machine.interrupt (). disable (); - Waitedthreads.add (Kthread.currentthread ()); - conditionlock.release (); - kthread.sleep (); - Conditionlock.acquire (); - machine.interrupt (). Restore (intstatus); in } - to /** + * Wake up at the most one thread sleeping on this condition variable

Select the sort step:1. Locate the subscript of the smallest element in the array that participates in the traversal comparison;2. Swap the minimum element with the first element in the array that participates in the traversal comparison (if the first element is the smallest element, it will also be exchanged);3. If there are elements in the array that need to participate in the traversal comparison, jump to step 1, otherwise the sort ends.All of the sorts given in the fourth version of the algo

UnsupportedOperationException ). If the list is variable size, the programmer must override add(int, E) and remove(int) method differently.Class:arraylist Public class extends Implements ListArrayList is an array-based implementation of the variable size of the list interface. The bottom of the array is implemented in such a way that it has good random access, but it is not efficient for inserting, deleting and so on at the specified location.Each ArrayList instance has a capacity. This capacit

}}Validation ();}@Overridepublic void Run () {Validation ();}}Class Makesnacks extends thread{Private snacks snacks=new snacks ();Public Makesnacks (String name,snacks s) {Super (name);Snacks=s;}@Overridepublic void Run () {while (Snacks.makesnacks ()) {try {Thread.Sleep (3000);} catch (Interruptedexception e) {}}}}public class Thread_synchronized {public static void Main (string[] args) throws Interruptedexception {System.out.println ("Start selling snack!!! ");Snacks Aimsnackshop=new Snacks ()

){ switch(action){ case Action.STOP: out.println("bofangtingzhidonghua"); break; case Action.RIGHT: out.println("bofangxiangyoudonghua"); break; case Action.LEFT: out.println("bofangxiangzuodonghua"); break; case Action.UP: out.println("bofangxiangshangdonghua"); break; case Action.DOWN: out.println("bofangxiangxiadonghua"); break; default: out.println("buzhichicidongzuo");

difference between the inheritance and interface, the book is very vivid examples, fish can swim, sharks are fish, clown fish is fish, so they are inheritance relationship, but people can swim, but people and fish there is no inheritance relationship, but the human and fish between the connection can be expressed by the interface. While this is understood, I cannot relate to how much of a difference these two definitions can have in a particular program. In short, to continue to learn or to fil

errors, in accordance with the error prompts are corrected. But in this week's JDB test encountered some difficulties in this blog to do a related summaryCode Hosting(run result of statistics.sh script)Last week's summary of the wrong quizLearning progress Bar lines of code (new/cumulative) Blog Volume (Add/accumulate) Learning Time (new/cumulative) Important Growth Goal 5000 rows 30

Direct3D to update the entire display (because the function can show only a portion at a time), as shown in the following code:g_pd3ddevice =pre-initialized device objectif (FAILED (g_pd3ddevice->present (null,null, NULL, NULL))) { // Error occurred}That's it! In order to create more realistic scenes, you use a number of different vertex caches to draw a variety of mid-range objects in your world. Another way to improve the authenticity of your graphics is to use texture mapping.============

set ZF to a higher value in your project, if you want to draw objects that are more than 1000.0 units long.After you have constructed the projection matrix, you use the Idirect3ddevice9::settransform function to set the projection transformation matrix, and this time set the state parameter to D3dts_projection:g_pd3ddevice =pre-initialized device Objectd3dxmatrix matproj; Create theprojection Transformation Matrixd3dxmatrixperspectivefovlh (MATPROJ,D3DX_PI/4, 1.0f, 1000.0f,); Set the Projection

of these sections are finally finished. Perhaps the reader is not very clear, especially the meaning of the specific parameters of the function. In fact, you can refer to the SDK documentation, or refer to the second edition of Dragon Book. In addition, the method used here to set the vertex is not used in my updated version of the code, but with the second version of the Dragon book more advanced, more flexible way, so see not very understand also h

Java is based on C + +, but Java is a more purely object-oriented programming language, unlike C + +, Java only supports object-oriented programming, so Java programming style is also pure OOP style, that is, everything is a class, everything is done in the class object.In Java