代码搜索：Capacity
找到约 2,190 项符合「Capacity」的源代码
代码结果 2,190
www.eeworm.com/read/404076/11492002
c queue.c
#include "queue.h"
#include "fatal.h"
#include
#define MinQueueSize ( 5 )
struct QueueRecord
{
int Capacity;
int Fr
www.eeworm.com/read/403011/11524287
cpp str2.cpp
// str2.cpp -- capacity() and reserve()
#include
#include
int main()
{
using namespace std;
string empty;
string small = "bit";
string larger = "Elephants a
www.eeworm.com/read/403009/11524592
cpp str2.cpp
// str2.cpp -- capacity() and reserve()
#include
#include
int main()
{
using namespace std;
string empty;
string small = "bit";
string larger = "Elephants a
www.eeworm.com/read/400569/11573735
java stringbuffer1.java
//StringBuffer1.java
public class StringBuffer1{
public static void main(String[] args) {
StringBuffer buf1=new StringBuffer(); //创建空字符串变量
StringBuffer buf2=new StringBuffer(10);
www.eeworm.com/read/158463/11613036
m ip_08_03.m
% MATLAB script for Illustrative Problem 3, Chapter 8.
echo on
a_db=[-20:0.2:20];
a=10.^(a_db/10);
for i=1:201
f(i)=quad('il3_8fun',a(i)-5,a(i)+5,1e-3,[],a(i));
g(i)=quad('il3_8fun',-a(i)-5,-a(i)+
www.eeworm.com/read/347088/11700846
java bufferstream.java
package Commen;
import java.nio.ByteBuffer;
public class BufferStream {
private byte[] buffer;
private int readPoint;
private int writePoint;
boolean accuraty;
private int capacity;
www.eeworm.com/read/347088/11701135
java outertaskqueue.java
package Control;
public class OuterTaskQueue {
private static int capacity = 30;
public int number = 0;
private OuterTask[] item = new OuterTask[capacity];
private int head = 0;
p
www.eeworm.com/read/347088/11701162
java bufferstream.java
package Commen;
import java.nio.ByteBuffer;
public class BufferStream {
private byte[] buffer;
private int readPoint;
private int writePoint;
boolean accuraty;
private int ca
www.eeworm.com/read/347088/11701362
java bufferstream.java
package Commen;
import java.nio.ByteBuffer;
public class BufferStream {
private byte[] buffer;
private int readPoint;
private int writePoint;
boolean accuraty;
private int capacity;
www.eeworm.com/read/157453/11703272
cpp bestfit.cpp
// best fit bin packing
#include
#include
#include "dbst.h"
#include "xcept.h"
class BinNode {
friend void BestFitPack(int *, int, int);
friend ostream& operat