8889909192939495969798
int nvalue; double ovalue2; double ovalue = arg0.getNumber(); while (loops) { nvalue = ((int) ovalue) & n; ovalue2 = arg0.compareAndSwap_number(ovalue, nvalue); loops = ovalue2 != ovalue; ovalue = ovalue2; } } else //{
7475767778798081828384
double nvalue; double ovalue2; double ovalue=arg0.getNumber(); while(loops){ nvalue = -ovalue; ovalue2 = arg0.compareAndSwap_number(ovalue, nvalue); loops = ovalue2!=ovalue; ovalue = ovalue2; } return new Node(ovalue);
9596979899100101102103104105
double nvalue; double ovalue2; double ovalue=arg0.getNumber(); while(loops){ nvalue = ovalue + tnum; ovalue2 = arg0.compareAndSwap_number(ovalue, nvalue); loops = ovalue2!=ovalue; ovalue = ovalue2; } return new Node(ovalue);