代码搜索：QueueNode
找到约 295 项符合「QueueNode」的源代码
代码结果 295
www.eeworm.com/read/371889/2778331
java queue.java
package com.util;
import java.lang.*;
public class Queue //动态链表队列类
{
class QueueNode //链表节点类
{
private Object tData;
private QueueNode next;
public QueueNode(Object tData,QueueNode n
www.eeworm.com/read/376580/9313412
c main.c
/* EightPuzzles problem
本程序采用 blind breadth search, 不允许出现重复的布局，否则会很容易出现memory overflow.
chenyong 2008.11.16
借鉴了 http://blog.csdn.net/tiaotiaoyly/archive/2008/01/01/2008233.aspx 中
www.eeworm.com/read/217335/14968826
h shm.h
/***************************************************
recieve.h: shared memory header file
zhoushijie
2000/3/4
****************************************************/
#include
www.eeworm.com/read/258647/11848146
h class.h
#ifndef PCB_H
#define PCB_H
#include
#include
#include
#include
#include "time.h"
#include
using namespace std;
enum STATUS{RUN,READY,WAIT,FIN
www.eeworm.com/read/258196/11877266
h class.h
#ifndef PCB_H
#define PCB_H
#include
#include
#include
#include
#include "time.h"
#include
using namespace std;
enum STATUS{RUN,READY,WAIT,FIN
www.eeworm.com/read/110923/15522891
pas linkedqu.pas
program Linked_QueueAdt (input,output);
type
elemtp = integer;
queueptr = ^queuenode;
queuenode = record
data:elemtp;
next:queueptr
www.eeworm.com/read/482089/6626225
cpp testavltree.cpp
#include "avlTree.h"
#include
using namespace std;
void AVLTreePrint(avlTreeNode** tree)
{
int printChoice;
queueNode* queueNodeTempPoint = new queueNode;
queue* qu;
www.eeworm.com/read/465738/7044621
cpp tree.cpp
#include
typedef struct BiTNode
{
char ch;
int nNum;
struct BiTNode *lChild,*rChild;
}BiTNode,BTree,*BiTree;
typedef struct QueueNode
{
BiTree data;
struct QueueNode *n
www.eeworm.com/read/100514/15872981
cpp queue.cpp
#include
#include
#include "item.h"
#include "queue.h"
typedef struct QUEUEnode* link;
struct QUEUEnode { Item item; link next; };
struct queue { link head; link tail; }
www.eeworm.com/read/482287/1289185
java queue.java
package org.ictclas4j.bean;
import java.util.ArrayList;
/**
* 队列
*
* @author sinboy
*
*/
public class Queue {
private int curIndex;// 当前位置
private ArrayList queue;