代码搜索：Capacity
找到约 2,190 项符合「Capacity」的源代码
代码结果 2,190
www.eeworm.com/read/272848/10940418
output timelist.output
Best-case times in progress
50000 inserts took 3.95 ms when started with capacity 10
50000 gets took 1.0421 ms
50000 indexOfs took 2282 ms
Worst-case indexOf took 0.0906 ms
50000 erases took 2.00
www.eeworm.com/read/272848/10940504
cpp arraylistnostl.cpp
// test the class arrayListNoSTL
#include
#include "linearList.h"
#include "arrayListNoSTL.h"
using namespace std;
int main()
{
// test constructor
linearList *x =
www.eeworm.com/read/272848/10940619
cpp arraylist.cpp
// test the class arrayList that uses STL algorithms
#include
#include "linearList.h"
#include "arrayList.h"
using namespace std;
int main()
{
// test constructor
linearLis
www.eeworm.com/read/272848/10940884
cpp greedyloading.cpp
// greedy container loading
#include
#include "container.h"
#include "heapSort.h"
using namespace std;
void containerLoading(container* c, int capacity,
i
www.eeworm.com/read/466324/7032850
java stackofintegers.java
public class StackOfIntegers {
private int[] elements;
private int size;
/** Construct a stack with the default capacity 16 */
public StackOfIntegers() {
this(16);
}
/** Construct a
www.eeworm.com/read/466342/7034001
cpp 队列.cpp
template
class Queue
{
public:
Type *H;
int Capacity;
int Size;
int Front;
int Rear;
public:
Queue(int n)
{
H = NULL;
H = new Type[n+1];
Capacity = n
www.eeworm.com/read/464372/7164269
m rheesub.m
% Author: Zukang Shen and Ian C. Wong
% Copyright (C) 2004 Ian C. Wong
%
% This program is free software; you can redistribute it and/or
% modify it under the terms of the GNU General Public
www.eeworm.com/read/459616/7270309
cpp firstfit.cpp
// First fit bin packing
#include
#include "winner.h"
int winner(int a[], int b, int c)
{// For a max winner tree.
if (a[b] >= a[c]) return b;
return c;
}
void FirstFitPack(int s
www.eeworm.com/read/459616/7270464
cpp load.cpp
// greedy container loading
#include
void IndirectSort(int w[], int t[], int n)
{// Cluge to test when weights already in order.
for (int i=1; i