Searched refs:n2 (Results 1 - 25 of 55) sorted by relevance

123

/forgerock/opendj2/src/guitools/org/opends/guitools/controlpanel/datamodel/
H A DBaseDNTableModel.java459 int n2 = desc2.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 DDBEnvironmentMonitoringTableModel.java209 double n2 = ((Number)v2).doubleValue();
210 if (n1 > n2)
214 else if (n1 < n2)
226 long n2 = ((Number)v2).longValue();
227 if (n1 > n2)
231 else if (n1 < n2)
H A DMonitoringTableModel.java483 double n2 = ((Number)v2).doubleValue();
484 if (n1 > n2)
488 else if (n1 < n2)
500 long n2 = ((Number)v2).longValue();
501 if (n1 > n2)
505 else if (n1 < n2)
/forgerock/opendj-b2.6/src/guitools/org/opends/guitools/controlpanel/datamodel/
H A DBaseDNTableModel.java460 int n2 = desc2.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 DDBEnvironmentMonitoringTableModel.java210 double n2 = ((Number)v2).doubleValue();
211 if (n1 > n2)
215 else if (n1 < n2)
227 long n2 = ((Number)v2).longValue();
228 if (n1 > n2)
232 else if (n1 < n2)
H A DMonitoringTableModel.java484 double n2 = ((Number)v2).doubleValue();
485 if (n1 > n2)
489 else if (n1 < n2)
501 long n2 = ((Number)v2).longValue();
502 if (n1 > n2)
506 else if (n1 < n2)
/forgerock/opendj2.6.2/src/guitools/org/opends/guitools/controlpanel/datamodel/
H A DBaseDNTableModel.java460 int n2 = desc2.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 DDBEnvironmentMonitoringTableModel.java210 double n2 = ((Number)v2).doubleValue();
211 if (n1 > n2)
215 else if (n1 < n2)
227 long n2 = ((Number)v2).longValue();
228 if (n1 > n2)
232 else if (n1 < n2)
H A DMonitoringTableModel.java484 double n2 = ((Number)v2).doubleValue();
485 if (n1 > n2)
489 else if (n1 < n2)
501 long n2 = ((Number)v2).longValue();
502 if (n1 > n2)
506 else if (n1 < n2)
/forgerock/opendj2-hg/src/guitools/org/opends/guitools/controlpanel/datamodel/
H A DBaseDNTableModel.java459 int n2 = desc2.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 DDBEnvironmentMonitoringTableModel.java209 double n2 = ((Number)v2).doubleValue();
210 if (n1 > n2)
214 else if (n1 < n2)
226 long n2 = ((Number)v2).longValue();
227 if (n1 > n2)
231 else if (n1 < n2)
H A DMonitoringTableModel.java483 double n2 = ((Number)v2).doubleValue();
484 if (n1 > n2)
488 else if (n1 < n2)
500 long n2 = ((Number)v2).longValue();
501 if (n1 > n2)
505 else if (n1 < n2)
/forgerock/opendj2-jel-hg/src/guitools/org/opends/guitools/controlpanel/datamodel/
H A DBaseDNTableModel.java460 int n2 = desc2.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 DDBEnvironmentMonitoringTableModel.java210 double n2 = ((Number)v2).doubleValue();
211 if (n1 > n2)
215 else if (n1 < n2)
227 long n2 = ((Number)v2).longValue();
228 if (n1 > n2)
232 else if (n1 < n2)
H A DMonitoringTableModel.java484 double n2 = ((Number)v2).doubleValue();
485 if (n1 > n2)
489 else if (n1 < n2)
501 long n2 = ((Number)v2).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 DBaseDNTableModel.java438 int n2 = desc2.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/openam-v13/openam-server-only/src/main/webapp/assets/lib/yui/dragdrop/
H A Ddragdrop-debug.js1269 * @param n2 the other node to swap
1272 swapNode: function(n1, n2) {
1274 n1.swapNode(n2);
1276 var p = n2.parentNode;
1277 var s = n2.nextSibling;
1280 p.insertBefore(n1, n2);
1281 } else if (n2 == n1.nextSibling) {
1282 p.insertBefore(n2, n1);
1284 n1.parentNode.replaceChild(n2, n1);
H A Ddragdrop-min.js61 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,s);}}},getScroll:function(){var t,l,dde=document.documentElement,db=document.body;if(dde&&(dde.scrollTop||dde.scrollLeft)){t=dde.scrollTop;l=dde.scrollLeft;}else if(db){t=db.scrollTop;l=db.scrollLeft;}else{}
H A Ddragdrop.js1233 * @param n2 the other node to swap
1236 swapNode: function(n1, n2) {
1238 n1.swapNode(n2);
1240 var p = n2.parentNode;
1241 var s = n2.nextSibling;
1244 p.insertBefore(n1, n2);
1245 } else if (n2 == n1.nextSibling) {
1246 p.insertBefore(n2, n1);
1248 n1.parentNode.replaceChild(n2, n1);
/forgerock/openidm-v4/openidm-core/src/main/java/org/forgerock/openidm/sync/impl/
H A DCondition.java314 final Double n2 = ((Number) v2).doubleValue();
315 return n1.compareTo(n2);
/forgerock/openam/openam-server-only/src/main/webapp/assets/lib/yui/dragdrop/
H A Ddragdrop-debug.js1269 * @param n2 the other node to swap
1272 swapNode: function(n1, n2) {
1274 n1.swapNode(n2);
1276 var p = n2.parentNode;
1277 var s = n2.nextSibling;
1280 p.insertBefore(n1, n2);
1281 } else if (n2 == n1.nextSibling) {
1282 p.insertBefore(n2, n1);
1284 n1.parentNode.replaceChild(n2, n1);
H A Ddragdrop-min.js61 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,s);}}},getScroll:function(){var t,l,dde=document.documentElement,db=document.body;if(dde&&(dde.scrollTop||dde.scrollLeft)){t=dde.scrollTop;l=dde.scrollLeft;}else if(db){t=db.scrollTop;l=db.scrollLeft;}else{}
H A Ddragdrop.js1233 * @param n2 the other node to swap
1236 swapNode: function(n1, n2) {
1238 n1.swapNode(n2);
1240 var p = n2.parentNode;
1241 var s = n2.nextSibling;
1244 p.insertBefore(n1, n2);
1245 } else if (n2 == n1.nextSibling) {
1246 p.insertBefore(n2, n1);
1248 n1.parentNode.replaceChild(n2, n1);
/forgerock/opendj-v3/opendj-server-legacy/src/main/java/org/opends/guitools/controlpanel/util/
H A DUtilities.java2776 double n2 = ((Number) v2).doubleValue();
2777 if (n1 > n2)
2781 else if (n1 < n2)
2793 long n2 = ((Number) v2).longValue();
2794 if (n1 > n2)
2798 else if (n1 < n2)
/forgerock/openam-v13/openam-server-only/src/main/webapp/assets/lib/yui/utilities/
H A Dutilities.js445 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,s);}}},getScroll:function(){var t,l,dde=document.documentElement,db=document.body;if(dde&&(dde.scrollTop||dde.scrollLeft)){t=dde.scrollTop;l=dde.scrollLeft;}else if(db){t=db.scrollTop;l=db.scrollLeft;}else{}

Completed in 151 milliseconds

123