2 进制:

1

10

100

1000

10000

var a=23;

a必须为2的n次方中数字每个一次加起来的数。

&的数必须为2的n次方,形式为1000...

必然唯一,2的n次方组合加起来可为a,才返回&的数

(a&1)=1;

a&2=2;

100&2=0;

1&2=0;

66*2=2;  64+2

可用来判断几种可能情况的N种组合情况下用到了哪几个情况。减少算法复杂性

return=16+4+...

  if (returnVal == 16) {
                        //
                        setFullScreen(true);
                    } else {
                        //
                        setFullScreen(false);
                    }
                    if ((returnVal & 4) == 4) {
                      vod.getWtr();
                      vod.showWtr("wtrT1");
                        showArgs[showArgs.length] = "wtrT1";
                    }
                    if ((returnVal & 1) == 1) {
                      vod.getSocket();
                        showArgs[showArgs.length] = "socketT1";
                        showArgs[showArgs.length] = "socketT2";
                    }
                    if ((returnVal & 2) == 2) {
                      vod.getRate();
                      vod.showRate("rateT1");
                        showArgs[showArgs.length] = "rateT1";
                    }
                    if ((returnVal & 8) == 8) {

                    }

                    $('#contentSpan').html(data[1][1]);

                    vod.wtrFlag = false;

 

posted on 2011-03-06 17:55  LcKey  阅读(182)  评论(0编辑  收藏  举报