publicbooleanoffer(E e) {
checkNotNull(e);//检查传入元素是否为空final Node newNode = new Node(e);//将元素封装成一个节点for (Node t = tail, p = t;;) {
Node q = p.next;
if (q == null) {
// p is last nodeif (p.casNext(null, newNode)) {
// Successful CAS is the linearization point// for e to become an element of this queue,// and for newNode to become "live".if (p != t) // hop two nodes at a time
casTail(t, newNode); // Failure is OK.returntrue;
}
// Lost CAS race to another thread; re-read next
}
elseif (p == q)
// We have fallen off list. If tail is unchanged, it// will also be off-list, in which case we need to// jump to head, from which all live nodes are always// reachable. Else the new tail is a better bet.
p = (t != (t = tail)) ? t : head;
else// Check for tail updates after two hops.
p = (p != t && t != (t = tail)) ? t : q;
}
}
//判断boolean casNext(Node cmp, Node val) {
return UNSAFE.compareAndSwapObject(this, nextOffset, cmp, val);
}
java的多态性是指main方法在调用属性的时候类可以对这一属性做出反应的情况
//package 1;
class A{
public void test(){
System.out.println("A");
}
}
class D extends A{
public void test(){
S
参考了网上的思路,写了个Java版的:
public class Fibonacci {
final static int[] A={1,1,1,0};
public static void main(String[] args) {
int n=7;
for(int i=0;i<=n;i++){
int f=fibonac
1、查看系统客户端,数据库,连接层的编码
查看方法: http://daizj.iteye.com/blog/2174993
进入mysql,通过如下命令查看数据库编码方式: mysql> show variables like 'character_set_%'; +--------------------------+------
public class MyQueue {
private long[] arr;
private int front;
private int end;
// 有效数据的大小
private int elements;
public MyQueue() {
arr = new long[10];
elements = 0;
front
A binary search tree (BST) is a binary tree where each node has a Comparable key (and an associated value) and satisfies the restriction that the key in any node is larger than the keys in all