代码搜索：Bit
找到约 10,000 项符合「Bit」的源代码
代码结果 10,000
www.eeworm.com/read/238313/13896051
c bit_and.c
#include
void main ()
{
printf("0 & 0 is %d\n", 0 & 0);
printf("0 & 1 is %d\n", 0 & 1);
printf("1 & 1 is %d\n", 1 & 1);
printf("1 & 2 is %d\n", 1 & 2);
printf("15 &
www.eeworm.com/read/238313/13896076
c bit_or.c
#include
void main ()
{
printf("0 | 0 is %d\n", 0 | 0);
printf("0 | 1 is %d\n", 0 | 1);
printf("1 | 1 is %d\n", 1 | 1);
printf("1 | 2 is %d\n", 1 | 2);
printf("128 |
www.eeworm.com/read/135720/13907496
java bit.java
// bit.Java
public class bit {
public static void main(String [] args) {
int u = 0xff00 & 0xf0f0;
int v = 0x8000 | 0x80f0;
int y = 0xff00 ^ 0xf0f0;
www.eeworm.com/read/236837/13996846
c bit_and.c
#include
void main ()
{
printf("0 & 0 is %d\n", 0 & 0);
printf("0 & 1 is %d\n", 0 & 1);
printf("1 & 1 is %d\n", 1 & 1);
printf("1 & 2 is %d\n", 1 & 2);
printf("15 &
www.eeworm.com/read/236837/13996871
c bit_or.c
#include
void main ()
{
printf("0 | 0 is %d\n", 0 | 0);
printf("0 | 1 is %d\n", 0 | 1);
printf("1 | 1 is %d\n", 1 | 1);
printf("1 | 2 is %d\n", 1 | 2);
printf("128 |
www.eeworm.com/read/236716/14001719
h bit.h
#ifndef __bit_H__
#define __bit_H__
/**************************************************************************************/
//位操作,另外,可以对字节操作,每一个单元(单位为16位的字)可以分为高八位和低八位操作;
//使用方法:下面的硬件寄存器都定义为了UN
www.eeworm.com/read/236563/14011815
h bit.h
#define maxsize 100
typedef struct bitnode
{
char data;
struct bitree *left,*right;
}bitree;
typedef char sq[maxsize];
void initbitree(bitree &t)
{ bitree *t;
t==NULL;
};
vo
www.eeworm.com/read/236563/14011831
h bit.h
#include "malloc.h"
#include "stdlib.h"
struct bitnode tree[];
typedef struct bitnode
{
char data;
struct bitnode *left;
struct bitnode *right;
}bitree;
bitree *creat(){
bitree *w;
ch
www.eeworm.com/read/133753/14027365
cpp bit_and.cpp
//bit_and.cpp
#include
#include
void main()
{ int a, b;
cout > a >> b;
cout
www.eeworm.com/read/133753/14027379
cpp bit_or.cpp
//bit_xor.cpp
#include
#include
void main()
{ int a,b;
cout > a >>b;
cout