代码搜索：Capacity
找到约 2,190 项符合「Capacity」的源代码
代码结果 2,190
www.eeworm.com/read/445133/7598713
java stackofintegers.java
/**
* @(#)StackOfIntegers.java
*
*
* @author
* @version 1.00 2009/3/18
*/
public class StackOfIntegers {
private int[] elements;
/**这里注意数组下标从0开始,
*而size表示栈(数组)中元素的个数,
*因
www.eeworm.com/read/199139/7885510
java vectortest.java
/*源程序清单6-3*/
package test;
import java.util.*;
import java.awt.*;
public class VectorTest
{
Vector sam=new Vector(15,3);
public VectorTest()
{
System.out.println("The vector
www.eeworm.com/read/197407/7997335
cpp nextfit.cpp
// Next fit bin packing
#include
#include "winner4.h"
int winner(int a[], int b, int c)
{// For a max winner tree.
if (a[b] >= a[c]) return b;
return c;
}
void NextF
www.eeworm.com/read/197117/8028085
java edgeproperties.java
package graph;
import java.io.Serializable;
public class EdgeProperties extends Properties implements Serializable
{
private int capacity;
public EdgeProperties(String label)
{
this(
www.eeworm.com/read/396845/8087729
m waterfilling_alg.m
function [Capacity PowerAllo] = WaterFilling_alg(PtotA,ChA,B,N0);
%
% WaterFilling in Optimising the Capacity
%===============
% Initialization
%===============
ChA = ChA + eps;
NA = length(ChA
www.eeworm.com/read/196477/8089395
java mystack.java
public class MyStack
{
/**
* Creates a new stack that can hold 1000 elements
*
*/
Object[] mystack;
int Capacity = 0;
int max = 1000;
int size;
public MyStack ( )
{
mysta
www.eeworm.com/read/146126/12668279
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/146126/12668432
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/146126/12668616
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/143592/12858539
h d_ksack.h
#ifndef KNAPSACK_PROBLEM
#define KNAPSACK_PROBLEM
#include
#include
#include
#include "d_matrix.h"
using namespace std;
// specifies the size and value of