代码搜索：queue
找到约 10,000 项符合「queue」的源代码
代码结果 10,000
www.eeworm.com/read/237419/13964173
cpp 搜索算法.cpp
#include "stdafx.h"
#include "搜索算法.h"
/////////////////////////////////////////////////////////////////////////////
findpt::findpt(){} //构造函数
findpt::~findpt(){} //析构函数
////////////////////////
www.eeworm.com/read/237419/13964311
cpp 搜索算法.cpp
#include "stdafx.h"
#include "搜索算法.h"
/////////////////////////////////////////////////////////////////////////////
findpt::findpt(){} //构造函数
findpt::~findpt(){} //析构函数
//////////////////////////
www.eeworm.com/read/237086/13978486
tcl ns-default.tcl
#
# Copyright (c) 1996-1997 Regents of the University of California.
# All rights reserved.
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provid
www.eeworm.com/read/237086/13978544
cc circular-q.cc
#include "circular-q.h"
CQueue::CQueue()
//Default constructor
{
MaxQueue = 50; //Default Size
NumItems = 0;
Front = 0;
Rear = MaxQueue - 1;
}
CQueue::CQueue(int QueueSize)
//Default constr
www.eeworm.com/read/236879/13994808
h seqcqueue.h
//队列的线性算法
typedef struct
{
Data queue[MaxSize];
int front;
int rear;
int count;
}SeqCQueue;
void QueueInitiate (SeqCQueue *Q)
{
Q->count=0;
Q->front=0;
www.eeworm.com/read/134244/14000137
h 1.h
#include"iostream.h"
#include"stdlib.h"
#define size 100
class Queue
{
int front,rear,cout;
int Q[size];
public:
Queue(void);
void QInsert(int p);
int QDelete(void);
int Qempty(v
www.eeworm.com/read/134244/14000142
cpp 1.cpp
#include"iostream.h"
#include"1.h"
void main()
{
Queue Q;
int a;
Q.QInsert(30);
a=Q.Qfront();
cout
www.eeworm.com/read/134242/14000160
h 1.h
#include"iostream.h"
#include"stdlib.h"
#define size 100
class Queue
{
int front,rear,court;
public:
int Q[size];
Queue(void);
void QInsert(int p);
int QDelete(void);
int Qemp
www.eeworm.com/read/236649/14005839
cpp main7.cpp
// Section 16.7
// $ CC main7.cpp
/*
< 0 3 6 9 >
< 2 4 6 8 10 >
*/
#include "Queue.h"
#include "Queue.cpp"
using std::cout;
#include
using std::vector;
int main()
{
www.eeworm.com/read/236371/14018403
c process.c
/*
Jianyou Wang
neuwjyou@163.com
http://hi.baidu.com/neuwjyou
2007-4-25
*/
#include
#include
#include
#include
#define W_PROCEEE_ARRAY_LENGTH 15