代码搜索:Capacity

找到约 2,190 项符合「Capacity」的源代码

代码结果 2,190
www.eeworm.com/read/241991/4556780

java boundedlist.java

package org.jgroups.util; /** * A bounded subclass of List, oldest elements are removed once max capacity is exceeded * @author Bela Ban Nov 20, 2003 * @version $Id: BoundedList.java,v 1.2 2004/0
www.eeworm.com/read/196999/5098695

java roomstruct.java

package com.tianxia.qipai.model.game.gobang; public class RoomStruct { public int roomnum; //房间编号 public int capacity; //房间容量 private int tablecount; //桌子的数量 public int onlinenum;
www.eeworm.com/read/283827/4074921

java roomstruct.java

package com.tianxia.qipai.model.game.gobang; public class RoomStruct { public int roomnum; //房间编号 public int capacity; //房间容量 private int tablecount; //桌子的数量 public int onlinenum;
www.eeworm.com/read/277150/4159111

java myvector.java

import java.util.*; public class MyVector extends Vector{ public MyVector(){ super(1,1); // 指定 capacitycapacityIncrement 的取值 } public void addInt(int i){ addElement(new Integer(i
www.eeworm.com/read/276929/4161329

c 7zbuffer.c

/* 7zBuffer.c */ #include "7zBuffer.h" #include "7zAlloc.h" void SzByteBufferInit(CSzByteBuffer *buffer) { buffer->Capacity = 0; buffer->Items = 0; } int SzByteBufferCreate(CSzByteBuffer *buffe
www.eeworm.com/read/413855/2157485

hh cpuqueue.hh

#ifndef CPUQUEUE_HH #define CPUQUEUE_HH /* * =c * CPUQueue * CPUQueue(CAPACITY) * =s storage * stores packets in FIFO queues. * =d * * Stores incoming packets in a first-in-first-out queue. E
www.eeworm.com/read/413855/2158151

hh frontdropqueue.hh

#ifndef CLICK_FRONTDROPQUEUE_HH #define CLICK_FRONTDROPQUEUE_HH #include "notifierqueue.hh" CLICK_DECLS /* =c FrontDropQueue FrontDropQueue(CAPACITY) =s storage stores packets in drop-from-front F
www.eeworm.com/read/372047/2776642

java roomstruct.java

package com.tianxia.qipai.model.game.gobang; public class RoomStruct { public int roomnum; //房间编号 public int capacity; //房间容量 private int tablecount; //桌子的数量 public int onlinenum;
www.eeworm.com/read/267328/11182442

tcl mhop.tcl

#type of the source traversing oll the hops: reno, westwood or vegas set conn_type [lindex $argv 0] #capacity of the links between consecutive hops set bw [lindex $argv 1] #number of hops set hop [lin
www.eeworm.com/read/412508/11195092

cc mac.cc

#include "h/mac.h" #include Define_Module_Like(SimpleMac,Mac); cBuffer::cBuffer(double size) { capacity = size; used = 0; queue = new cQueue(); } cBuffer::~cBuffer(){} bool cBuffer: