/forgerock/opendj2/src/guitools/org/opends/guitools/controlpanel/datamodel/ |
H A D | BaseDNTableModel.java | 458 int n1 = desc1.getEntries(); 460 return compareIntegers(n1, n2); 463 private int compareIntegers(int n1, int n2) argument 465 if (n1 == n2) 469 if (n1 > n2) 476 private int compareLongs(long n1, long n2) argument 478 if (n1 == n2) 482 if (n1 > n2)
|
H A D | DBEnvironmentMonitoringTableModel.java | 208 double n1 = ((Number)v1).doubleValue(); 210 if (n1 > n2) 214 else if (n1 < n2) 225 long n1 = ((Number)v1).longValue(); 227 if (n1 > n2) 231 else if (n1 < n2)
|
H A D | MonitoringTableModel.java | 482 double n1 = ((Number)v1).doubleValue(); 484 if (n1 > n2) 488 else if (n1 < n2) 499 long n1 = ((Number)v1).longValue(); 501 if (n1 > n2) 505 else if (n1 < n2)
|
/forgerock/opendj-b2.6/src/guitools/org/opends/guitools/controlpanel/datamodel/ |
H A D | BaseDNTableModel.java | 459 int n1 = desc1.getEntries(); 461 return compareIntegers(n1, n2); 464 private int compareIntegers(int n1, int n2) argument 466 if (n1 == n2) 470 if (n1 > n2) 477 private int compareLongs(long n1, long n2) argument 479 if (n1 == n2) 483 if (n1 > n2)
|
H A D | DBEnvironmentMonitoringTableModel.java | 209 double n1 = ((Number)v1).doubleValue(); 211 if (n1 > n2) 215 else if (n1 < n2) 226 long n1 = ((Number)v1).longValue(); 228 if (n1 > n2) 232 else if (n1 < n2)
|
H A D | MonitoringTableModel.java | 483 double n1 = ((Number)v1).doubleValue(); 485 if (n1 > n2) 489 else if (n1 < n2) 500 long n1 = ((Number)v1).longValue(); 502 if (n1 > n2) 506 else if (n1 < n2)
|
/forgerock/opendj2.6.2/src/guitools/org/opends/guitools/controlpanel/datamodel/ |
H A D | BaseDNTableModel.java | 459 int n1 = desc1.getEntries(); 461 return compareIntegers(n1, n2); 464 private int compareIntegers(int n1, int n2) argument 466 if (n1 == n2) 470 if (n1 > n2) 477 private int compareLongs(long n1, long n2) argument 479 if (n1 == n2) 483 if (n1 > n2)
|
H A D | DBEnvironmentMonitoringTableModel.java | 209 double n1 = ((Number)v1).doubleValue(); 211 if (n1 > n2) 215 else if (n1 < n2) 226 long n1 = ((Number)v1).longValue(); 228 if (n1 > n2) 232 else if (n1 < n2)
|
H A D | MonitoringTableModel.java | 483 double n1 = ((Number)v1).doubleValue(); 485 if (n1 > n2) 489 else if (n1 < n2) 500 long n1 = ((Number)v1).longValue(); 502 if (n1 > n2) 506 else if (n1 < n2)
|
/forgerock/opendj2-hg/src/guitools/org/opends/guitools/controlpanel/datamodel/ |
H A D | BaseDNTableModel.java | 458 int n1 = desc1.getEntries(); 460 return compareIntegers(n1, n2); 463 private int compareIntegers(int n1, int n2) argument 465 if (n1 == n2) 469 if (n1 > n2) 476 private int compareLongs(long n1, long n2) argument 478 if (n1 == n2) 482 if (n1 > n2)
|
H A D | DBEnvironmentMonitoringTableModel.java | 208 double n1 = ((Number)v1).doubleValue(); 210 if (n1 > n2) 214 else if (n1 < n2) 225 long n1 = ((Number)v1).longValue(); 227 if (n1 > n2) 231 else if (n1 < n2)
|
H A D | MonitoringTableModel.java | 482 double n1 = ((Number)v1).doubleValue(); 484 if (n1 > n2) 488 else if (n1 < n2) 499 long n1 = ((Number)v1).longValue(); 501 if (n1 > n2) 505 else if (n1 < n2)
|
/forgerock/opendj2-jel-hg/src/guitools/org/opends/guitools/controlpanel/datamodel/ |
H A D | BaseDNTableModel.java | 459 int n1 = desc1.getEntries(); 461 return compareIntegers(n1, n2); 464 private int compareIntegers(int n1, int n2) argument 466 if (n1 == n2) 470 if (n1 > n2) 477 private int compareLongs(long n1, long n2) argument 479 if (n1 == n2) 483 if (n1 > n2)
|
H A D | DBEnvironmentMonitoringTableModel.java | 209 double n1 = ((Number)v1).doubleValue(); 211 if (n1 > n2) 215 else if (n1 < n2) 226 long n1 = ((Number)v1).longValue(); 228 if (n1 > n2) 232 else if (n1 < n2)
|
H A D | MonitoringTableModel.java | 483 double n1 = ((Number)v1).doubleValue(); 485 if (n1 > n2) 489 else if (n1 < n2) 500 long n1 = ((Number)v1).longValue(); 502 if (n1 > n2) 506 else if (n1 < n2)
|
/forgerock/opendj-v3/opendj-server-legacy/src/main/java/org/opends/guitools/controlpanel/datamodel/ |
H A D | BaseDNTableModel.java | 437 int n1 = desc1.getEntries(); 439 return compareIntegers(n1, n2); 442 private int compareIntegers(int n1, int n2) argument 444 if (n1 == n2) 448 if (n1 > n2) 455 private int compareLongs(long n1, long n2) argument 457 if (n1 == n2) 461 if (n1 > n2)
|
/forgerock/opendj2/src/server/org/opends/server/backends/jeb/ |
H A D | EntryIDSet.java | 189 long[] n1 = new long[n.length]; 196 last = n1[j++] = n[i]; 199 if (j == n1.length) 202 ret.values = n1; 207 return new EntryIDSet(n1, 0, j);
|
/forgerock/opendj-b2.6/src/server/org/opends/server/backends/jeb/ |
H A D | EntryIDSet.java | 190 long[] n1 = new long[n.length]; 197 last = n1[j++] = n[i]; 200 if (j == n1.length) 203 ret.values = n1; 208 return new EntryIDSet(n1, 0, j);
|
/forgerock/opendj2.6.2/src/server/org/opends/server/backends/jeb/ |
H A D | EntryIDSet.java | 190 long[] n1 = new long[n.length]; 197 last = n1[j++] = n[i]; 200 if (j == n1.length) 203 ret.values = n1; 208 return new EntryIDSet(n1, 0, j);
|
/forgerock/opendj2-hg/src/server/org/opends/server/backends/jeb/ |
H A D | EntryIDSet.java | 189 long[] n1 = new long[n.length]; 196 last = n1[j++] = n[i]; 199 if (j == n1.length) 202 ret.values = n1; 207 return new EntryIDSet(n1, 0, j);
|
/forgerock/opendj2-jel-hg/src/server/org/opends/server/backends/jeb/ |
H A D | EntryIDSet.java | 190 long[] n1 = new long[n.length]; 197 last = n1[j++] = n[i]; 200 if (j == n1.length) 203 ret.values = n1; 208 return new EntryIDSet(n1, 0, j);
|
/forgerock/opendj-v3/opendj-server-legacy/src/main/java/org/opends/server/backends/pluggable/ |
H A D | EntryIDSet.java | 673 long[] n1 = new long[n.length]; 680 last = n1[j++] = l; 683 if (j == n1.length) 685 return newDefinedSet(n1); 687 return newDefinedSet(Arrays.copyOf(n1, j));
|
/forgerock/openam-v13/openam-server-only/src/main/webapp/assets/lib/yui/dragdrop/ |
H A D | dragdrop-debug.js | 1268 * @param n1 the first node to swap 1272 swapNode: function(n1, n2) { 1273 if (n1.swapNode) { 1274 n1.swapNode(n2); 1279 if (s == n1) { 1280 p.insertBefore(n1, n2); 1281 } else if (n2 == n1.nextSibling) { 1282 p.insertBefore(n2, n1); 1284 n1.parentNode.replaceChild(n2, n1); [all...] |
H A D | dragdrop-min.js | 61 return oWrapper;},getElement:function(id){return YAHOO.util.Dom.get(id);},getCss:function(id){var el=YAHOO.util.Dom.get(id);return(el)?el.style:null;},ElementWrapper:function(el){this.el=el||null;this.id=this.el&&el.id;this.css=this.el&&el.style;},getPosX:function(el){return YAHOO.util.Dom.getX(el);},getPosY:function(el){return YAHOO.util.Dom.getY(el);},swapNode:function(n1,n2){if(n1.swapNode){n1.swapNode(n2);}else{var p=n2.parentNode;var s=n2.nextSibling;if(s==n1){p.insertBefore(n1,n2);}else if(n2==n1.nextSibling){p.insertBefore(n2,n1);}else{n1.parentNode.replaceChild(n2,n1);p.insertBefore(n1, [all...] |
H A D | dragdrop.js | 1232 * @param n1 the first node to swap 1236 swapNode: function(n1, n2) { 1237 if (n1.swapNode) { 1238 n1.swapNode(n2); 1243 if (s == n1) { 1244 p.insertBefore(n1, n2); 1245 } else if (n2 == n1.nextSibling) { 1246 p.insertBefore(n2, n1); 1248 n1.parentNode.replaceChild(n2, n1); [all...] |