代码搜索：Capacity
找到约 2,190 项符合「Capacity」的源代码
代码结果 2,190
www.eeworm.com/read/146126/12668672
h arraystack.h
// array implementation of a stack
// derives from the ADT stack
#ifndef arrayStack_
#define arrayStack_
#include "stack.h"
#include "myExceptions.h"
#include "changeLength1D.h"
#include
www.eeworm.com/read/146126/12668709
cpp recursivebtloading1.cpp
// first recursive backtracking code to load containers onto 2 ships
// code finds weight of max loading for first ship only
#include
using namespace std;
// global variables
int
www.eeworm.com/read/146126/12668829
cpp recursivebtloading2.cpp
// refined recursive backtracking code for container loading
// onto two ships
// code finds weight of max loading for first ship only
#include
using namespace std;
// global v
www.eeworm.com/read/146126/12668891
cpp iterativebtloading.cpp
// iterative code for container loading by backtracking
#include
#include
using namespace std;
int maxLoading(int *weight, int numberOfContainers, int capacity,
www.eeworm.com/read/333254/12692790
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/246871/12700393
c bag.c
#include
#include
#include
//goods是一个或多个物品的重量和价值
typedef struct goods
{
int weight;
int value;
} goods;
//用来定义一个queryList数组
//数组中的每个元素定义一趟需要记录的数据
www.eeworm.com/read/145189/12746224
txt sample.txt
Microsoft Windows 2000 [Version 5.00.2195]
(C) 版权所有 1985-1998 Microsoft Corp.
D:\>F:\test\EnumPhysicalDrive\Debug\EnumPhysicalDrive.exe
FriendlyName:ST330621A
PhysicalDeviceObjectName:\Device\Id
www.eeworm.com/read/332264/12766329
java 6.14vectortest.java
import java.util.*;
class VectorTest
{
public static void main(String []args)
{
Vector vec =new Vector(3);
System.out.println("old capality is "+vec.capacity());
vec.addElement(new Integer(1));
www.eeworm.com/read/244937/12831072
m ip_08_03.m
% MATLAB script for Illustrative Problem 8.3.
clear
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
www.eeworm.com/read/142539/12940913
c queue.c
#include "queue.h"
#include "fatal.h"
#include
#define MinQueueSize ( 5 )
struct QueueRecord
{
int Capacity;
int Fr