|
From: Peep P. <so...@us...> - 2004-07-23 17:22:16
|
Update of /cvsroot/agd/server/doc/lpc In directory sc8-pr-cvs1.sourceforge.net:/tmp/cvs-serv16586 Modified Files: operators Log Message: Cleanup; bitwise operators Index: operators =================================================================== RCS file: /cvsroot/agd/server/doc/lpc/operators,v retrieving revision 1.6 retrieving revision 1.7 diff -u -d -r1.6 -r1.7 --- operators 1 Apr 2004 19:07:19 -0000 1.6 +++ operators 23 Jul 2004 17:22:07 -0000 1.7 @@ -1,61 +1,60 @@ Operators of the LPC language. -Star (*) marks that it's implemented in AGD. +Star (*) marks that it's NOT implemented in AGD. with side effects: - = binary assign * (F_ASSIGN) - -- unary decrement * (F_POSTDEC, F_PREDEC) - ++ unary increment * (F_POSTINC, F_PREINC) + = binary assign + -- unary decrement + ++ unary increment ('a x= b' is equal to 'a = a x b') - += binary self-increment * - -= binary self-decrement * - /= binary self-division * - *= binary self-multiplication * - %= binary self-modulo * - **= binary self-power * + += binary self-increment + -= binary self-decrement + /= binary self-division + *= binary self-multiplication + %= binary self-modulo + **= binary self-power comparison: - == binary equal * (F_EQ) - > binary greater than * (F_GT) - < binary less than * (F_LT) - <= binary less or equal than * (F_LE) - >= binary greater or equal than * (F_GE) - != binary not equal * (F_NE) + == binary equal + > binary greater than + < binary less than + <= binary less or equal than + >= binary greater or equal than + != binary not equal logic: - && binary AND * - || binary OR * - ! unary NOT * (F_NOT) + && binary AND + || binary OR + ! unary NOT misc: - -> binary call_other * (F_CALL_OTHER) - note: This is different from C's ->. - in LPC it calls a function in an object other than - the current object; i.e. ob->call() would execute - the function call() in object ob. - ?: trinary conditional (if-then-else) * + -> binary call_other + ?: trinary conditional (if-then-else) , binary comma - left and right side are evaluated, - then right side discarded. - [] * (F_SLICE and F_INDEX) + then right side discarded. * + [] arithmetic: - + binary addition * (F_ADD) - - binary substraction *(F_SUB) - - unary negation *(F_NEG) - / binary division *(F_DIV) - * binary multiplication *(F_MUL) - % binary modulo * (F_MOD) - ** binary power * + + binary addition + - binary substraction + - unary negation + / binary division + * binary multiplication + % binary modulo + ** binary power - binary: - & - | - ~ - ^ - << - >> + array operators: + & binary intersection * - &= - |= - ~= - ^= - <<= - >>= + bitwise operators: + & binary AND + | binary OR + ~ binary NOT + ^ binary XOT + << binary shift left + >> binary shift right + + &= binary self-AND + |= binary self-OR + ~= binary self-NOT + ^= binary self-XOR + <<= binary self-shift left + >>= binary self-shift right |