Mercurial > hg > Applications > TreeVNC

comparison src/main/java/jp/ac/u_ryukyu/treevnc/TreeManagement.java @ 427:ed15f0bd8dfa

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Remove shareScrrenNumber for ScreenChangeRequest Message
author Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
date Mon, 01 Feb 2016 04:39:53 +0900
parents ffe01c959cdd
children b5459c7c8e4d
comparison
equal deleted inserted replaced
426:3a97a014d7ee 427:ed15f0bd8dfa
112 } 112 }
113 TreeVNCNode deadChild; 113 TreeVNCNode deadChild;
114 fixLostChild1(lostChildNodeNum); 114 fixLostChild1(lostChildNodeNum);
115 } 115 }
116 116
117 public void fixLostChild1(int nodeNum) {
118 TreeVNCNode deadNode;
119 try {
120 deadNode = nodeList.get(nodeNum);
121 } catch (IndexOutOfBoundsException e) {
122 // this node became new node instead of deathChild.
123 deadNode = null;
124 }
125 if (deadNode != null) {
126 moveLastNodeToLostNodePosition(deadNode.getTreeNum());
127 lostNodeConnection(deadNode);
128 }
129 if (showTreeNode) {
130 showTreeNode();
131 }
132 }
133
117 /** 134 /**
118 * send reconnect to all children 135 * send reconnect to all children
119 * @param deadNode 136 * @param deadNode
120 */ 137 */
121 public void lostNodeConnection(TreeVNCNode deadNode) { 138 public void lostNodeConnection(TreeVNCNode deadNode) {
249 for(int i=0; i < netmask.length; i++) { 266 for(int i=0; i < netmask.length; i++) {
250 if ((netmask[i] & byteadr[i])!=netaddress[i]) return false; 267 if ((netmask[i] & byteadr[i])!=netaddress[i]) return false;
251 } 268 }
252 return true; 269 return true;
253 } 270 }
254
255 public void fixLostChild1(int nodeNum) {
256 TreeVNCNode deadNode;
257 try {
258 deadNode = nodeList.get(nodeNum);
259 } catch (IndexOutOfBoundsException e) {
260 // this node became new node instead of deathChild.
261 deadNode = null;
262 }
263 if (deadNode != null) {
264 moveLastNodeToLostNodePosition(deadNode.getTreeNum());
265 lostNodeConnection(deadNode);
266 }
267 if (showTreeNode) {
268 showTreeNode();
269 }
270 }
271 } 271 }