代码搜索:Allocation

找到约 5,034 项符合「Allocation」的源代码

代码结果 5,034
www.eeworm.com/read/465384/7054533

cpp listdialog.cpp

// ListDialog.cpp : implementation file // #include "stdafx.h" #include "Banker.h" #include "ListDialog.h" #include "RsDialog.h" // ListDialog dialog IMPLEMENT_DYNAMIC(ListDialog, CDial
www.eeworm.com/read/465384/7054541

tmp ve-6b.tmp

// ListDialog.cpp : implementation file // #include "stdafx.h" #include "Banker.h" #include "ListDialog.h" #include "RsDialog.h" // ListDialog dialog IMPLEMENT_DYNAMIC(ListDialog, CDial
www.eeworm.com/read/334912/7126729

txt bank.txt

#include #include #include #include #include void main() { srand( (unsigned)time( NULL ) ); int i,j,k,l=0,count=0; int claim[5][9]; for
www.eeworm.com/read/464512/7156875

cpp banker2.cpp

/* James O' Connor 50703338 17/12/02 This is my original work Program to implement safety algorithm and bankers algorithm for process management / resource allocation. It's a bit if a rough hac
www.eeworm.com/read/461544/7225153

cpp 银行家算法.cpp

#include /*********************************************************************** 数据定义与函数原型说明 *****************************************************************
www.eeworm.com/read/461070/7235036

h alloca.h

// allocator.hh // // Given rate/distortion curves for nSets collections of transform // coefficients (contained in CoeffSet objects), performs a // constrained optimization of quantizer resolutio
www.eeworm.com/read/456598/7343978

c 例1-4.c

/* Note:Your choice is C IDE */ #include #include main() { float * p; p=(float * )calloc(100,sizeof(float)); /* 强制转化为float型指针 */ if(p==NULL) printf("\n Allocati
www.eeworm.com/read/456386/7350062

c dynamic.c

# include # include # define NUM 10 int main() { char *str[NUM]; /* 定义一个字符性的指针数组 */ int t; /* 为数组中的每个指针分配内存 */ for(t=0; t
www.eeworm.com/read/450547/7481790

html mem_methods.html

Memory Allocation Routines body { margin: auto; f
www.eeworm.com/read/447650/7548251

txt 银行家.txt

#include #define MAXPROCESS 50 //最大进程数 #define MAXRESOURCE 100 //最大资源种数 int AVAILABLE[MAXRESOURCE]; //可用资源数组 int MAX[MAXPROCESS][MAXRESOURCE]; //最大需求矩阵 int ALLOCATION[MAXPROCESS