代码搜索：Allocation
找到约 5,034 项符合「Allocation」的源代码
代码结果 5,034
www.eeworm.com/read/278099/10570581
h snparray.h
/* +++Date last modified: 05-Jul-1997 */
/*
** Header file for SNIPPETS array allocation functions
*/
#ifndef SNPARRAY__H
#define SNPARRAY__H
/*
** AMALLOC.C
*/
void *amalloc( int e
www.eeworm.com/read/278099/10572030
c strat.c
/* +++Date last modified: 05-Jul-1997 */
/*
** strat.c 10-5-91 Robert Mashlan, public domain
**
** Interface functions to DOS 3.0+ set allocation strategy
** and get allocation strategy
www.eeworm.com/read/159920/10589628
c strat.c
/*
** strat.c 10-5-91 Robert Mashlan, public domain
**
** Interface functions to DOS 3.0+ set allocation strategy
** and get allocation strategy functions via int 21h,
** function 58h.
www.eeworm.com/read/422200/10656828
cpp 8-16.cpp
#include
class aClass
{
static int total;
public:
aClass()
{ total++;}
~aClass()
{ total--;}
int gettotal()
{ return total;}
};
int aClass::total=0;
main()
{
www.eeworm.com/read/422200/10656847
cpp 8-7.cpp
#include
#include
#include
class strclass
{
char *p;
int length;
public:
strclass();
strclass(char *str,int len);
char *getstring(){return p;}
in
www.eeworm.com/read/350641/10723433
cpp cus_newd.cpp
#include
#include
class loc
{
int longitude, latitude;
public:
loc(void) {} // Used to construct temporaries
loc (int lg, int lt)
www.eeworm.com/read/350641/10723994
cpp new_far.cpp
#include
void main(void)
{
char far *pointer;
do
{
pointer = new far char[10000];
if (pointer)
cout
www.eeworm.com/read/350641/10724143
cpp no_free.cpp
#include
void main(void)
{
char *pointer;
do
{
pointer = new char[10000];
if (pointer)
cout
www.eeworm.com/read/348705/10873426
c gtknotebook.c
/* GTK - The GIMP Toolkit
* Copyright (C) 1995-1997 Peter Mattis, Spencer Kimball and Josh MacDonald
*
* This library is free software; you can redistribute it and/or
* modify it under the terms o
www.eeworm.com/read/272195/10966016
txt monkey.txt
#include
#include
typedef struct Node
{
int data;
struct Node *next;
}Node,*LinkList;
void CreatLinkList(LinkList *L,int m)// 创建循环链表 m为猴子总数
{
Node *p, *q;
int i;