代码搜索：Operations
找到约 10,000 项符合「Operations」的源代码
代码结果 10,000
www.eeworm.com/read/170790/9790221
h annexb.h
/*!
**************************************************************************************
* \file
* annexb.h
* \brief
* Byte stream operations support
* This code reflects JVT version
www.eeworm.com/read/413044/11168960
c order.c
/* order.c -- precedence in pointer operations */
#include
int data[2] = {100, 200};
int moredata[2] = {300, 400};
int main(void)
{
int * p1, * p2, * p3;
p1 = p2 = data;
www.eeworm.com/read/266733/11213993
c 2562.c
#include
int main()
{
int m,n,tmp,count;
while(scanf("%d%d",&m,&n),m||n)
{
for(count=tmp=0;m||n;m/=10,n/=10)
{
tmp+=m%10+n%10;
if(tmp>9)
count++;
tmp/=10;
www.eeworm.com/read/412049/11216777
smsg roycpld.fit.smsg
Info: *******************************************************************
Info: Running Quartus II Fitter
Info: Version 7.0 Build 33 02/05/2007 SJ Full Version
Info: Processing started: Fri
www.eeworm.com/read/412049/11216842
qmsg roycpld.fit.qmsg
{ "Info" "IQEXE_SEPARATOR" "" "Info: *******************************************************************" { } { } 3 0 "*******************************************************************" 0 0}
{ "I
www.eeworm.com/read/249433/12505919
h onlinesvr.h
/******************************************************************************
* ONLINE SUPPORT VECTOR REGRESSION *
* Copyright 2006
www.eeworm.com/read/249070/12523384
txt c07p357a.txt
// ********************************************************
// Header file QueueL.h for the ADT queue.
// ADT list implementation.
// ********************************************************
#include
www.eeworm.com/read/249070/12523433
txt c06p300.txt
// *********************************************************
// Header file StackL.h for the ADT stack.
// ADT list implementation.
// *********************************************************
#includ
www.eeworm.com/read/249070/12523632
txt c11p609.txt
// ********************************************************
// Header file TableB.h for the ADT table.
// Binary search tree implementation.
// Assumption: A table contains at most one item with a
//