Search Results

Search found 27521 results on 1101 pages for '2012 memory manager kb'.

Page 140/1101 | < Previous Page | 136 137 138 139 140 141 142 143 144 145 146 147  | Next Page >

• Oracle Partner Day 2012: Neue Geschäftschancen warten auf Sie!

  - by A&C Redaktion

  Wie gut kennen Sie die Neuerungen der Oracle "One Red Stack"-Unternehmensstrategie? In Zukunft werden Sie, als unser Partner, das gesamte Oracle Produktportfolio – Software, Hardware und Applications – verkaufen können! Ihr Profit: die neue Vielfalt. Toppen Sie Ihre Marktpräsenz! Erschließen Sie sich neue Märkte, neue Kundengruppen. Potenzieren Sie Ihren Erfolg in Zukunft! Maximize your Potential – das ist Ihr Stichwort für das Geschäftsjahr und unser Motto für den Oracle Partner Day am 29. Oktober 2012 in der Commerzbank Arena in Frankfurt. Erleben Sie in unseren Breakout Sessions, wo das Vertriebs-Plus für Sie liegt. Was Ihr Kunde wissen muss. Und wo Sie überzeugen können. Alle parallel laufenden Breakout Sessions werden wiederholt, damit Sie in jedem Fall daran teilnehmen können. Konzentriert auf Erfolg: das neue Oracle Alliances & Channel-Konzept Wir liefern Ihnen die entscheidenden Argumente für Kunden, die auf Nachhaltigkeit und Investitionssicherheit setzen. Für Sie, wenn Sie in Zukunft mehr erreichen wollen! Für alle, die Partner Excellence aus einer Hand anbieten können. Erfahren Sie die Produktneuheiten von der Oracle Open World (OOW) in San Francisco (30. September bis 4. Oktober 2012) aus erster Hand. In der Expert- und Partner Service-Zone finden Sie Antworten zu allen Themenschwerpunkten. Nutzen Sie dazu das neue Speed-Dating-Format, um schnell den richtigen Ansprechpartner für Ihre Fragen zu Vertrieb und Produkten zu finden. Machen Sie den Test. Wir zahlen die Testgebühr! Nutzen Sie die Gelegenheit, sich direkt zum OPN Implementation Specialist zu akkreditieren! Melden Sie sich jetzt an zum offiziellen Implementierungstest beim Testcenter Pearson Vue vor Ort beim Oracle Partner Day. Wählen Sie Ihre Fachbereiche Fusion Middleware, Applications, Hardware, Datenbank und gehen Sie als Implementierungsspezialist nach Hause. Kommen Sie zum Oracle Partner Day 2012 – aktives Partner Networking, Management Kontakte und Expertenwissen inklusive! Sichern Sie sich jetzt einen der begehrten Plätze und Ihre Teilnahme – auch am Test! Die Teilnahme ist für Sie als Oracle Partner selbstverständlich kostenfrei. Hier finden Sie weitere Informationen zum Oracle Partner Day und den Link zur Registrierung. Wir freuen uns auf Sie! Ihr Christian Werner Senior Director Alliances & Channels Germany P.S.: Direkt nach dem Oracle Partner Day findet der Oracle Day für Endkunden statt. Sie als Partner können gerne an dieser Veranstaltung gemeinsam mit Ihren Kunden teilnehmen, die Plätze sind limitiert. Hier finden Sie weitere Infos zum Oracle Day.

  Read the article

• Memory read/write access efficiency

  - by wolfPack88

  I've heard conflicting information from different sources, and I'm not really sure which one to believe. As such, I'll post what I understand and ask for corrections. Let's say I want to use a 2D matrix. There are three ways that I can do this (at least that I know of). 1: int i; char **matrix; matrix = malloc(50 * sizeof(char *)); for(i = 0; i < 50; i++) matrix[i] = malloc(50); 2: int i; int rowSize = 50; int pointerSize = 50 * sizeof(char *); int dataSize = 50 * 50; char **matrix; matrix = malloc(dataSize + pointerSize); char *pData = matrix + pointerSize - rowSize; for(i = 0; i < 50; i++) { pData += rowSize; matrix[i] = pData; } 3: //instead of accessing matrix[i][j] here, we would access matrix[i * 50 + j] char *matrix = malloc(50 * 50); In terms of memory usage, my understanding is that 3 is the most efficient, 2 is next, and 1 is least efficient, for the reasons below: 3: There is only one pointer and one allocation, and therefore, minimal overhead. 2: Once again, there is only one allocation, but there are now 51 pointers. This means there is 50 * sizeof(char *) more overhead. 1: There are 51 allocations and 51 pointers, causing the most overhead of all options. In terms of performance, once again my understanding is that 3 is the most efficient, 2 is next, and 1 is least efficient. Reasons being: 3: Only one memory access is needed. We will have to do a multiplication and an addition as opposed to two additions (as in the case of a pointer to a pointer), but memory access is slow enough that this doesn't matter. 2: We need two memory accesses; once to get a char *, and then to the appropriate char. Only two additions are performed here (once to get to the correct char * pointer from the original memory location, and once to get to the correct char variable from wherever the char * points to), so multiplication (which is slower than addition) is not required. However, on modern CPUs, multiplication is faster than memory access, so this point is moot. 1: Same issues as 2, but now the memory isn't contiguous. This causes cache misses and extra page table lookups, making it the least efficient of the lot. First and foremost: Is this correct? Second: Is there an option 4 that I am missing that would be even more efficient?

  Read the article

• Google I/O 2012 - Making Google Product Search Work for You Using the Content API for Shopping

  Google I/O 2012 - Making Google Product Search Work for You Using the Content API for Shopping Mayuresh Saoji, Danny Hermes To get the best out of product search, merchants need to provide complete and accurate product information, as well as fresh price and availability data for all products. This session will provide merchants with concrete steps they can take to improve their data quality using the Content API for Shopping. We will provide details on when it makes sense to use the Content API to submit data (as opposed to Feeds), and how to use the API. We will also go into details on how to debug API requests and errors, and talk about general best practices to follow in order to use the API optimally and efficiently. For all I/O 2012 sessions, go to developers.google.com From: GoogleDevelopers Views: 35 1 ratings Time: 43:50 More in Science & Technology

  Read the article

• LabView 2012 disponible, le logiciel permet la création et le déploiement des systèmes de mesure et de contrôle

  LabView 2012 disponible le logiciel permet la création et le déploiement des systèmes de mesure et de contrôle La nouvelle version de l'outil de conception de système LabView 2012 est disponible. LabView est un logiciel de développement d'applications de la société américaine National Instruments. Il est basé sur le langage de programmation graphique G, et permet aux ingénieures et scientifiques de créer et déployer des systèmes de mesure et de contrôle. L'outil permet également de cibler les systèmes embarqués et temps réel en s'ouvrant à la programmation de circuits intégrés. Il est facilement extensible grâce à des toolkits qui sont publiés séparément. La nouvell...

  Read the article

• Google I/O 2012 - So You've Read the Design Guide; Now What?

  Google I/O 2012 - So You've Read the Design Guide; Now What? Daniel Lehmann, Tor Norbye, Richard Ngo The Android Design Guide describes how to design beautiful Android apps, but not how to build them. In this talk we'll give practical tips for how to apply fit & finish as you are implementing your design, we'll show you how to avoid some common pitfalls, we'll describe some useful patterns, and show you how tools can help. For all I/O 2012 sessions, go to developers.google.com From: GoogleDevelopers Views: 38 1 ratings Time: 56:31 More in Science & Technology

  Read the article

• Dell pourrait commercialiser une tablette tournant sous Windows 8 début 2012, révèle la diffusion d'un document interne de la firme

  Dell pourrait commercialiser une tablette tournant sous Windows 8 début 2012, révèle la diffusion d'un document interne de la firme Il y a quelques semaines, Microsoft révélait que la prochaine version de Windows supporterait les processeurs ARM. Une nouvelle qui a ravit tous les accrocs à la mobilité, une tendance sacrément dans l'air du temps. D'après des documents internes à Dell, qui sont sortis de leur cocon pour atterrir sur le Net, le constructeur plancherait sur une tablette basée sur Windows 8. Et cet appareil, répondant au nom de code de "Peju", aurait même déjà une date de sortie, fixée au premier trimestre 2012. La roadmap évoque une mise sur le marché dans les trois premiers moi...

  Read the article

• Google I/O 2012 - YouTube Channels: Get with the Program!

  Google I/O 2012 - YouTube Channels: Get with the Program! Dror Shimshowitz, AJ Crane YouTube allows anyone to distribute videos to 800m web, mobile and TV viewers around the world. Come learn how to leverage this powerful platform to build an audience and market your products. We'll walk you through tips and techniques for building, programming, and promoting your very own YouTube channel. For all I/O 2012 sessions, go to developers.google.com From: GoogleDevelopers Views: 0 0 ratings Time: 53:11 More in Science & Technology

  Read the article

• Google I/O 2012 - What's Next for Chrome Extensions?

  Google I/O 2012 - What's Next for Chrome Extensions? Mike West Chrome's extension system offers developers more opportunities than ever to customize and enhance users' experience on the web. New APIs are landing on a regular basis that provide new functionality and deeper hooks into Chrome itself. Join us for a walk through bleeding edge changes to Chrome's extension framework that increase security, improve performance, and make it easier than ever for users to get up and running with the product of your hard work. For all I/O 2012 sessions, go to developers.google.com From: GoogleDevelopers Views: 1372 29 ratings Time: 51:36 More in Science & Technology

  Read the article

• What are the benefits of Android way of "saving memory" - explicitly passing Context objects everywhere?

  - by Sarge Borsch

  Turned out, this question is not easy to formulate for me, but let's try. In Android, pretty much any UI object depends on a Context, and has defined lifetime. It also can destroy and recreate UI objects and even whole application process at any time, and so on. This makes coding asynchronous operations correctly not straightforward. (and sometimes very cumbersome) But I never have seen a real explanation, why it's done that way? There are other OSes, including mobile OSes (iOS, for example), that don't do such things. So, what are the wins of Android way (Activities & Contexts)? Does that allow Android applications to use much less RAM, or maybe there are other benefits?

  Read the article

• SAPPHIRE 2012 : l'informatique à un tournant majeur ? SAP voit une révolution de l'IT professionnelle avec le Big Data, HANA et le Cloud

  SAPPHIRE 2012 : l'informatique professionnelle à un tournant de son Histoire ? SAP veut révolutionner les usages de l'IT avec le Big Data, HANA et le Cloud Au détour des allées du SAPPHIRE 2012, la grand messe annuelle de SAP qui se tient actuellement à Madrid, deux démonstrations sortent du lot. La première vient de McLaren. Bien connue des amateurs de Formule 1, l'entreprise est une grande utilisateur des solutions de SAP. Pour son « showcase », les équipes du constructeur automobile ont collecté des données de courses de l'épreuve de Monza 2010 et les ont compilées pour reproduire in vivo la course de leurs deux pilotes. Cette simulation sert ensuite de base pour ...

  Read the article

• SQL Server 2012 disponible en RC0, avec des améliorations pour AlwaysOn et Power View, le SGBD se rapproche de la version finale

  SQL Server 2012 disponible en Release Candidate avec des améliorations pour AlwaysOn et Power View, le SGBD se rapproche de la version finale Mise à jour du 18/11/11 SQL Server 2012 passe en release candidate et se rapproche de la version finale. Microsoft vient de publier la RCO (Release Candidate 0) du gestionnaire de base de données, qui marque l'entrée dans la dernière ligne droite du développement de Denali. Cette mouture apporte quelques corrections et améliorations de fonctionnalités de la CTP 3 du SGBD. Parmi celles-ci, on va noter des modifications pour une meilleure prise en charge des applicati...

  Read the article

• Could it be more efficient for systems in general to do away with Stacks and just use Heap for memory management?

  - by Dark Templar

  It seems to me that everything that can be done with a stack can be done with the heap, but not everything that can be done with the heap can be done with the stack. Is that correct? Then for simplicity's sake, and even if we do lose a little amount of performance with certain workloads, couldn't it be better to just go with one standard (ie, the heap)? Think of the trade-off between modularity and performance. I know that isn't the best way to describe this scenario, but in general it seems that simplicity of understanding and design could be a better option even if there is a potential for better performance.

  Read the article

• Visual Studio 2012 : le développement pour desktop réintroduit dans la version Express gratuite, l'EDI s'ouvre à l'open-source

  Visual Studio 2012 : Microsoft réintroduit le développement d'applications desktop dans la version Express Gratuite, et poursuit son ouverture à l'open-source avec son EDI star Microsoft a écouté. Plusieurs décisions qui viennent d'être prises concernant la prochaine version de son EDI star, Visual Studio 2012 (ex-Visual Studio 11), feront certainement plaisir à la communauté. Tout d'abord, l'interface monochrome (ou plus exactement bicolore dans les gris) pourra être remplacée par une UI « à l'ancienne », avec plus de couleurs. C'est ce qu'a montré avant-hier un VP Microsoft sur la scène du TechEd d'Orlando. Deuxième bonne nouvelle, la version Express (gratuite) de Visual ...

  Read the article

• Windows Server 2012 : le point complet sur les nouvelles licences avec Microsoft, qui publie un Livre Blanc récapitulatif

  Windows Server 2012 : Microsoft simplifie ses licences L'éditeur publie un Livre Blanc et fait un point complet avec Developpez.com De huit licences différentes pour la version 2008 R2, Windows Server 2012 est passé à quatre. Un travail de simplification nécessaire pour de nombreux observateurs et pour des utilisateurs qui se perdaient souvent dans les méandres de la tarification de la déclinaison de Windows pour serveurs. Sur les quatre nouvelles éditions, deux concernent les grandes entreprises et les hébergeurs (la Standard et la Datacenter). Deux autres - promises pour la fin de l'année ? seront plus spécifiquement adaptées aux PME (Essentials et Foundation).

  Read the article

• Près de 120 millions de tablettes seront commercialisées en 2012 d'après Gartner, contre 60 millions l'an passé

  Près de 120 millions de tablettes seront commercialisées en 2012 Contre 60 millions l'an passé Mise à jour : 11/04/2012 Les prévisions du cabinet d'analyse Gartner sont tombées : la vente de tablette devrait exploser en 2012 pour atteindre le chiffre faramineux de 118,9 millions, contre 60 millions l'an passé, ce qui représente une croissance de 98%. Sans surprise, c'est Apple qui restera en tête des ventes avec 72,9 millions d'iPad vendus, soit 61,4% de part de marché. La vice présidente de la recherche chez Gartner confirme : "Même si les fabricants de PC et de téléphones veulent leur part du gâteau en commercialisant des tablettes, seul ...

  Read the article

• JavaOne 2012 : Oracle sort la Preview de NetBeans 7.3 et dévoile Easel, une extension pour la création des clients RESTful JavaScript

  JavaOne 2012 : Oracle sort la Preview de NetBeans 7.3 et dévoile le projet Easel une extension pour la création des clients RESTful à base de JavaScript JavaOne 2012 bat son plein. Le Masonic Auditorium de San Francisco vibre aux couleurs de l'écosystème Java qui est en train d'être disséqué par les experts de l'industrie. Lors de la session consacrée à NetBeans, l'environnement de développement intégré open source pour Java, PHP, C et C++, Oracle a annoncé la sortie de la preview de NetBeans 7.3, la prochaine mise à jour majeure de l'EDI. [IMG]http://ftp-developpez.com/gordon-fowler/NetBeans%20Logo.png[/IMG] Le futur standard du We...

  Read the article

• Prévisions de croissance à +1 % pour le secteur français de l'informatique en 2012, ralentissement après une année très dynamique

  Prévisions de croissance à +1 % pour le secteur français de l'informatique en 2012 Ralentissement attendu après une année très dynamique Après l'embellie de cette année, prudence pour 2012. Telle est la conjoncture du secteur de l'informatique vu par Syntec Numérique, la chambre professionnelle des SSII, des Éditeurs de Logiciels et des sociétés de Conseil en Technologies. Dans son bilan, Syntec confirme ses prévisions pour 2011. Une année « très dynamique » où le domaine informatique a réalisé une croissance de +3.6 %. Il a été marqué par un boom de sa branche de conseils en technologies (+7 %) et un bilan très positif pour les éditeurs de logiciels : +3.8 ...

  Read the article

• JavaOne 2012 : Oracle dévoile ses plans pour Java, les préversions du JDK 8 et JavaFX Scene Builder 1.1 disponibles

  JavaOne 2012 : Oracle renouvelle son engagement à faire évoluer Java et dévoile ses plans les préversions de JDK 8 et JavaFX Scene Builder 1.1 disponibles JavaOne 2012, la plus grande conférence annuelle autour de la plateforme Java se déroule actuellement à San Francisco. Oracle a profité de l'occasion pour dévoiler sa feuille de route pour Java et renouveler son engagement à faire évoluer le langage afin de rassurer les utilisateurs sceptiques face aux récentes découvertes de failles dans la plateforme. Pendant ces prochains mois, Oracle travaillera essentiellement sur Java SE 8. Au menu : l'éditeur prévoit l'intégration des expressions lambda, du moteur JavaScript Nash...

  Read the article

• Concours Géoportail 2012 : créez une interface de cartographie interactive innovante via l'API Géoportail et recevez des chèques cadeaux

  Concours Géoportail 2012 : créez une interface de cartographie interactive innovante via l'API Géoportail et recevez des chèques cadeaux IGN (Institut national de l'information géographique et forestière) organise deux concours Géoportail pour les développeurs et les étudiants. Le premier concours dont les inscriptions seront closes le 8 novembre 2012, consiste en la mise au point d'une interface de cartographie interactive via l'API Géoportail, qui enrichira votre site ou votre application. Les applications sélectionnées seront soumises au vote du public sur les réseaux sociaux à partir du 16 novembre pour déterminer les gagnants. 4 500 euros de chèques cadeaux sont en jeux.

  Read the article

• Need help with memory leaks in RSS Reader

  - by Stilton

  I'm trying to write a simple RSS reader for the iPhone, and it appeared to be working fine, until I started working with Instruments, and discovered my App is leaking massive amounts of memory. I'm using the NSXMLParser class to parse an RSS feed. My memory leaks appear to be originating from the overridden delegate methods: - (void)parser:(NSXMLParser *)parser foundCharacters:(NSString *)string and - (void)parser:(NSXMLParser *)parser didEndElement:(NSString *)elementName namespaceURI:(NSString *)namespaceURI qualifiedName:(NSString *)qName I'm also suspicious of the code that populates the cells from my parsed data, I've included the code from those methods and a few other key ones, any insights would be greatly appreciated. - (void)parser:(NSXMLParser *)parser foundCharacters:(NSString *)string { if ([self.currentElement isEqualToString:@"title"]) { [self.currentTitle appendString:string]; } else if ([self.currentElement isEqualToString:@"link"]) { [self.currentURL appendString:string]; } else if ([self.currentElement isEqualToString:@"description"]) { [self.currentSummary appendString:string]; } } - (void)parser:(NSXMLParser *)parser didEndElement:(NSString *)elementName namespaceURI:(NSString *)namespaceURI qualifiedName:(NSString *)qName { if ([elementName isEqualToString:@"item"]) { //asdf NSMutableDictionary *item = [[NSMutableDictionary alloc] init]; [item setObject:currentTitle forKey:@"title"]; [item setObject:currentURL forKey:@"URL"]; [item setObject:currentSummary forKey:@"summary"]; [self.currentTitle release]; [self.currentURL release]; [self.currentSummary release]; [self.stories addObject:item]; [item release]; } } // Customize the appearance of table view cells. - (UITableViewCell *)tableView:(UITableView *)tableView cellForRowAtIndexPath:(NSIndexPath *)indexPath { static NSString *CellIdentifier = @"Cell"; UITableViewCell *cell = [tableView dequeueReusableCellWithIdentifier:CellIdentifier]; if (cell == nil) { cell = [[[UITableViewCell alloc] initWithStyle:UITableViewCellStyleDefault reuseIdentifier:CellIdentifier] autorelease]; } // Configure the cell. // Set up the cell int index = [indexPath indexAtPosition: [indexPath length] - 1]; CGRect contentRect = CGRectMake(8.0, 4.0, 260, 20); UILabel *textLabel = [[UILabel alloc] initWithFrame:contentRect]; if (self.currentLevel == 0) { textLabel.text = [self.categories objectAtIndex: index]; } else { textLabel.text = [[self.stories objectAtIndex: index] objectForKey:@"title"]; } textLabel.textColor = [UIColor blackColor]; textLabel.font = [UIFont boldSystemFontOfSize:14]; [[cell contentView] addSubview: textLabel]; //[cell setText:[[stories objectAtIndex: storyIndex] objectForKey: @"title"]]; [textLabel autorelease]; return cell; } - (void)parser:(NSXMLParser *)parser didStartElement:(NSString *)elementName namespaceURI:(NSString *)namespaceURI qualifiedName:(NSString *)qName attributes:(NSDictionary *)attributeDict { if ([elementName isEqualToString:@"item"]) { self.currentTitle = [[NSMutableString alloc] init]; self.currentURL = [[NSMutableString alloc] init]; self.currentSummary = [[NSMutableString alloc] init]; } if (currentElement != nil) { [self.currentElement release]; } self.currentElement = [elementName copy]; } - (void)dealloc { [currentElement release]; [currentTitle release]; [currentURL release]; [currentSummary release]; [currentDate release]; [stories release]; [rssParser release]; [storyTable release]; [super dealloc]; } // Override to support row selection in the table view. - (void)tableView:(UITableView *)tableView didSelectRowAtIndexPath:(NSIndexPath *)indexPath { // Navigation logic may go here -- for example, create and push another view controller. // AnotherViewController *anotherViewController = [[AnotherViewController alloc] initWithNibName:@"AnotherView" bundle:nil]; int index = [indexPath indexAtPosition: [indexPath length] - 1]; if (currentLevel == 1) { StoryViewController *storyViewController = [[StoryViewController alloc] initWithURL:[[stories objectAtIndex: index] objectForKey:@"URL"] nibName:@"StoryViewController" bundle:nil]; [self.navigationController pushViewController:storyViewController animated:YES]; [storyViewController release]; } else { RootViewController *rvController = [[RootViewController alloc] initWithNibName:@"RootViewController" bundle:nil]; rvController.currentLevel = currentLevel + 1; rvController.rssIndex = index; [self.navigationController pushViewController:rvController animated:YES]; [rvController release]; } }

  Read the article

• Need help with a possible memory management problem(leak) regarding NSMutableArray

  - by user309030

  Hi, I'm a beginner level programmer trying to make a game app for the iphone and I've encountered a possible issue with the memory management (exc_bad_access) of my program so far. I've searched and read dozens of articles regarding memory management (including apple's docs) but I still can't figure out what exactly is wrong with my codes. So I would really appreciate it if someone can help clear up the mess I made for myself. - (void)viewDidLoad { [super viewDidLoad]; self.gameState = gameStatePaused; fencePoleArray = [[NSMutableArray alloc] init]; fencePoleImageArray = [[NSMutableArray alloc] init]; fenceImageArray = [[NSMutableArray alloc] init]; mainField = CGRectMake(10, 35, 310, 340); .......... [NSTimer scheduledTimerWithTimeInterval:0.05 target:self selector:@selector(gameLoop) userInfo:nil repeats:YES]; } So basically, the player touches the screen to set up the fences/poles -(void)touchesBegan:(NSSet *)touches withEvent:(UIEvent *)event { if(.......) { ....... } else { UITouch *touch = [[event allTouches] anyObject]; currentTapLoc = [touch locationInView:touch.view]; NSLog(@"%i, %i", (int)currentTapLoc.x, (int)currentTapLoc.y); if(CGRectContainsPoint(mainField, currentTapLoc)) { if([self checkFence]) { onFencePole++; //this 3 set functions adds their respective objects into the 3 NSMutableArrays using addObject: [self setFencePole]; [self setFenceImage]; [self setFencePoleImage]; ....... } } else { ....... } } } } The setFence function (setFenceImage and setFencePoleImage is similar to this) -(void)setFencePole { Fence *fencePole; if (!elecFence) { fencePole = [[Fence alloc] initFence:onFencePole fenceType:1 fencePos:currentTapLoc]; } else { fencePole = [[Fence alloc] initFence:onFencePole fenceType:2 fencePos:currentTapLoc]; } [fencePoleArray addObject:fencePole]; [fencePole release]; and whenever I press a button in the game, endOpenState is called to clear away all the extra images(fence/poles) on the screen and also to remove all existing objects in the 3 NSMutableArray -(void)endOpenState { ........ int xMax = [fencePoleArray count]; int yMax = [fenceImageArray count]; for (int x = 0; x < xMax; x++) { [[fencePoleImageArray objectAtIndex:x] removeFromSuperview]; } for (int y = 0; y < yMax; y++) { [[fenceImageArray objectAtIndex:y] removeFromSuperview]; } [fencePoleArray removeAllObjects]; [fencePoleImageArray removeAllObjects]; [fenceImageArray removeAllObjects]; ........ } The crash happens here at the checkFence function. -(BOOL)checkFence { if (onFencePole == 0) { return YES; } else if (onFencePole >= 1 && onFencePole < currentMaxFencePole - 1) { CGPoint tempPoint1 = currentTapLoc; CGPoint tempPoint2 = [[fencePoleArray objectAtIndex:onFencePole-1] returnPos]; // the crash happens at this line if ([self checkDistance:tempPoint1 point2:tempPoint2]) { return YES; } else { return NO; } } else if (onFencePole == currentMaxFencePole - 1) { ...... } else { return NO; } } What I'm thinking of is that fencePoleArray got messed up when I used [fencePoleArray removeAllObjects] because it doesn't crash when I comment it out. It would really be great if someone can explain to me what went wrong. And thanks in advance.

  Read the article

• Need help with a memory management problem in my game model

  - by user309030

  Hi, I'm a beginner level programmer trying to make a game app for the iphone and I've encountered a possible issue with the memory management (exc_bad_access) of my program so far. I've searched and read dozens of articles regarding memory management (including apple's docs) but I still can't figure out what exactly is wrong with my codes. So I would really appreciate it if someone can help clear up the mess I made for myself. //in the .h file @property(nonatomic,retain) NSMutableArray *fencePoleArray; @property(nonatomic,retain) NSMutableArray *fencePoleImageArray; @property(nonatomic,retain) NSMutableArray *fenceImageArray; //in the .m file - (void)viewDidLoad { [super viewDidLoad]; self.gameState = gameStatePaused; fencePoleArray = [[NSMutableArray alloc] init]; fencePoleImageArray = [[NSMutableArray alloc] init]; fenceImageArray = [[NSMutableArray alloc] init]; mainField = CGRectMake(10, 35, 310, 340); .......... [NSTimer scheduledTimerWithTimeInterval:0.05 target:self selector:@selector(gameLoop) userInfo:nil repeats:YES]; } So basically, the player touches the screen to set up the fences/poles -(void)touchesBegan:(NSSet *)touches withEvent:(UIEvent *)event { if(.......) { ....... } else { UITouch *touch = [[event allTouches] anyObject]; currentTapLoc = [touch locationInView:touch.view]; NSLog(@"%i, %i", (int)currentTapLoc.x, (int)currentTapLoc.y); if(CGRectContainsPoint(mainField, currentTapLoc)) { if([self checkFence]) { onFencePole++; //this 3 set functions adds their respective objects into the 3 NSMutableArrays using addObject: [self setFencePole]; [self setFenceImage]; [self setFencePoleImage]; ....... } } else { ....... } } } } The setFence function (setFenceImage and setFencePoleImage is similar to this) -(void)setFencePole { Fence *fencePole; if (!elecFence) { fencePole = [[Fence alloc] initFence:onFencePole fenceType:1 fencePos:currentTapLoc]; } else { fencePole = [[Fence alloc] initFence:onFencePole fenceType:2 fencePos:currentTapLoc]; } [fencePoleArray addObject:fencePole]; [fencePole release]; and whenever I press a button in the game, endOpenState is called to clear away all the extra images(fence/poles) on the screen and also to remove all existing objects in the 3 NSMutableArray. Point is to remove all the objects in the NSMutableArrays but keep the array itself so it can be reused later. -(void)endOpenState { ........ int xMax = [fencePoleArray count]; int yMax = [fenceImageArray count]; for (int x = 0; x < xMax; x++) { [[fencePoleImageArray objectAtIndex:x] removeFromSuperview]; } for (int y = 0; y < yMax; y++) { [[fenceImageArray objectAtIndex:y] removeFromSuperview]; } [fencePoleArray removeAllObjects]; [fencePoleImageArray removeAllObjects]; [fenceImageArray removeAllObjects]; ........ } The crash happens here at the checkFence function. -(BOOL)checkFence { if (onFencePole == 0) { return YES; } else if (onFencePole >= 1 && onFencePole < currentMaxFencePole - 1) { CGPoint tempPoint1 = currentTapLoc; CGPoint tempPoint2 = [[fencePoleArray objectAtIndex:onFencePole-1] returnPos]; // the crash happens at this line if ([self checkDistance:tempPoint1 point2:tempPoint2]) { return YES; } else { return NO; } } else if (onFencePole == currentMaxFencePole - 1) { ...... } else { return NO; } } So the problem here is, everything works fine until checkFence is called the 2nd time after endOpenState is called. So its like tap_screen - tap_screen - press_button_to_call_endOpenState - tap screen - tap_screen - crash What I'm thinking of is that fencePoleArray got messed up when I used [fencePoleArray removeAllObjects] because it doesn't crash when I comment it out. It would really be great if someone can explain to me what went wrong. And thanks in advance.

  Read the article

• Do classes which have a vector has a member have memory issues

  - by user263766

  I am just starting out C++, so sorry if this is a dumb question. I have a class Braid whose members are vectors. I have not written an assignment operator. When I do a lot of assignments to an object of the type Braid, I run into memory issues :- 0 0xb7daff89 in _int_malloc () from /lib/libc.so.6 #1 0xb7db2583 in malloc () from /lib/libc.so.6 #2 0xb7f8ac59 in operator new(unsigned int) () from /usr/lib/libstdc++.so.6 #3 0x0804d05e in __gnu_cxx::new_allocator<int>::allocate (this=0xbf800204, __n=1) at /usr/lib/gcc/i686-pc-linux-gnu/4.4.3/../../../../include/c++/4.4.3/ext/new_allocator.h:89 #4 0x0804cb0e in std::_Vector_base<int, std::allocator<int> >::_M_allocate (this=0xbf800204, __n=1) at /usr/lib/gcc/i686-pc-linux-gnu/4.4.3/../../../../include/c++/4.4.3/bits/stl_vector.h:140 #5 0x0804c086 in _Vector_base (this=0xbf800204, __n=1, __a=...) at /usr/lib/gcc/i686-pc-linux-gnu/4.4.3/../../../../include/c++/4.4.3/bits/stl_vector.h:113 #6 0x0804b4b7 in vector (this=0xbf800204, __x=...) at /usr/lib/gcc/i686-pc-linux-gnu/4.4.3/../../../../include/c++/4.4.3/bits/stl_vector.h:242 #7 0x0804b234 in Braid (this=0xbf800204) at braid.h:13 #8 0x080495ed in Braid::cycleBraid (this=0xbf8001b4) at braid.cpp:191 #9 0x080497c6 in Braid::score (this=0xbf800298, b=...) at braid.cpp:251 #10 0x08049c46 in Braid::evaluateMove (this=0xbf800468, move=1, pos=0, depth=2, b=...) I suspect that these memory issues are because the vectors are getting resized. What I want to know is whether objects of type Braid automatically expand when its members expand? he code I am writing is really long so I will post the section which is causing the problems. Here is the relevant section of the code :- class Braid { private : vector<int> braid; //Stores the braid. int strands; vector < vector<bool> > history; vector < vector<bool> > CM; public : Braid () : strands(0) {} Braid operator * (Braid); Braid* inputBraid(int,vector<int>); int printBraid(); int printBraid(vector<vector<int>::iterator>); vector<int>::size_type size() const; ..... ..... } Here is the function which causes the issue :- int Braid::evaluateMove(int move,int pos,int depth,Braid b) { int netscore = 0; Braid curr(*this); curr = curr.move(move,pos); netscore += curr.score(b); while(depth > 1) { netscore += curr.evaluateMove(1,0,depth,b); netscore += curr.evaluateMove(2,0,depth,b); for(int i = 0; i < braid.size();++i) { netscore += curr.evaluateMove(3,i,depth,b); netscore += curr.evaluateMove(4,i,depth,b); netscore += curr.evaluateMove(5,i,depth,b); curr = curr.cycleBraid(); netscore += curr.evaluateMove(6,0,depth,b); } --depth; } return netscore; }

  Read the article

• allocating extra memory for a container class.

  - by sil3nt

  Hey there, I'm writing a template container class and for the past few hours have been trying to allocate new memory for extra data that comes into the container (...hit a brick wall..:| ) template <typename T> void Container<T>::insert(T item, int index){ if ( index < 0){ cout<<"Invalid location to insert " << index << endl; return; } if (index < sizeC){ //copying original array so that when an item is //placed in the middleeverything else is shifted forward T *arryCpy = 0; int tmpSize = 0; tmpSize = size(); arryCpy = new T[tmpSize]; int i = 0, j = 0; for ( i = 0; i < tmpSize; i++){ for ( j = index; j < tmpSize; j++){ arryCpy[i] = elements[j]; } } //overwriting and placing item and location index elements[index] = item; //copying back everything else after the location at index int k = 0, l = 0; for ( k =(index+1), l=0; k < sizeC || l < (sizeC-index); k++,l++){ elements[k] = arryCpy[l]; } delete[] arryCpy; arryCpy = 0; } //seeing if the location is more than the current capacity //and hence allocating more memory if (index+1 > capacityC){ int new_capacity = 0; int current_size = size(); new_capacity = ((index+1)-capacityC)+capacityC; //variable for new capacity T *tmparry2 = 0; tmparry2 = new T[new_capacity]; int n = 0; for (n = 0; n < current_size;n++){ tmparry2[n] = elements[n]; } delete[] elements; elements = 0; //copying back what we had before elements = new T[new_capacity]; int m = 0; for (m = 0; m < current_size; m++){ elements[m] = tmparry2[m]; } //placing item elements[index] = item; } else{ elements[index] = item; } //increasing the current count sizeC++; my testing condition is Container cnt4(3); and as soon as i hit the fourth element (when I use for egsomething.insert("random",3);) it crashes and the above doesnt work. where have I gone wrong?

  Read the article

• virt-manager can't open the display

  - by MacUsers

  My virt-manager was working just fine and all of a sudden stopped working, throwing in error: RuntimeError: could not open display root@rakcal ~]# echo $DISPLAY localhost:10.0 [root@rakcal ~]# virt-manager Traceback (most recent call last): File "/usr/share/virt-manager/virt-manager.py", line 383, in <module> main() File "/usr/share/virt-manager/virt-manager.py", line 286, in main raise gtk_error RuntimeError: could not open display Has anyone seen this before? the same thing happen to "virt-viewer" as well: [root@rakcal ~]# virt-viewer winxp1 Cannot open display: Run 'virt-viewer --help' to see a full list of available command line options Does anyone know what might be the problem or if I'm missing anything? Reinstalling "virt-manager" didn't bring any good. Any help would be appreciated. Cheers!!

  Read the article

< Previous Page | 136 137 138 139 140 141 142 143 144 145 146 147  | Next Page >