Posted
by skydoor
on Stack Overflow
See other posts from Stack Overflow
or by skydoor
Published on 2010-03-31T02:05:13Z
Indexed on
2010/03/31
2:13 UTC
Read the original article
Hit count: 319
if this is a bad idea, how to allocate memory in the function?
© Stack Overflow or respective owner
as seen on Stack Overflow
- Search for 'Stack Overflow'
I'm currently helping a friend debug a program of his, which includes linked lists. His list structure is pretty simple:
typedef struct nodo{
int cantUnos;
char* numBin;
struct nodo* sig;
}Nodo;
We've got the following code snippet:
void insNodo(Nodo** lista, char* auxBin, int auxCantUnos){
…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Hello,
I am playing around with multidimensional array of unequal second dimension size.
Lets assume that I need the following data structure:
[&ptr0]-[0][1][2][3][4][5][6][7][8][9]
[&ptr1]-[0][1][2]
[&ptr2]-[0][1][2][3][4]
int main()
{
int *a[3];
int *b;
int i;
a[0] = (int *)malloc(10…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
I trying to allocate memory for 10 bytes
BYTE* tmp;
tmp = new BYTE[10];
//or tmp = (BYTE*)malloc(10*sizeof(BYTE));
But after new or malloc operation length of *tmp more than 10 (i.e. '\0' char not in 10 position in tmp array)
Why?
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Hi all,
I just started out with C and have very little knowledge about performance issues with malloc() and free(). My question is as such: if I were to call malloc() followed by free() in a while-loop that loops for, say, 20 times, would it run slower compared to if I were to call free() outside…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
I am a beginner in C. While reading git's source code, I found this wrapper function around malloc.
void *xmalloc(size_t size)
{
void *ret = malloc(size);
if (!ret && !size)
ret = malloc(1);
if (!ret) {
release_pack_memory(size, -1);
ret = malloc(size);
…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
I have this code in one of my classes:
- (void) processArray
{
NSMutableArray* array = [self getArray];
. . .
[array release];
array = nil;
}
- (NSMutableArray*) getArray
{
//NO 1:
NSMutableArray* array = [[NSMutableArray alloc]init];
//NO 2:
NSMutableArray* array = [NSMutableArray…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Hi
I am working on an application for android and we since we have lots of graphics, we use a lot of memory.
I monitor the memory heap size and its about 3-4 Mb , and peeks of 5Mb when I do something that requires more memory (and then goes back to 3). This is not a big deal, but some other stuff…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Coming from C++ it is hard grained into my mind that everytime I call new I call delete. In javascript I find myself calling new occasionally in my code but (hoping) the garbage collection functionality in the browser will take care of the mess for me.
I don't like this - is there a 'delete' method…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Hi,
I have question in memory management (objective C). There are two ideal scenario.
============================= scenario 1 ========================================
(void) funcA
{
MyObj *c = [otherObj getMyObject];
[c release];
}
-(MyObj *) getMyObject //(this method is available in…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Do I have this right ...
// Reactor.h
@property(nonatomic, retain) NSMutableArray *reactorCore;
// Reactor.m
[self setReactorCore:[NSKeyedUnarchiver unarchiveObjectWithFile:[self dataFilePath]]];
...
-(void)dealloc {
[reactorCore release];
[super dealloc];
}
I am pretty sure I am doing…
>>> More
