Hey all Just a query on file IO. Im writing code that takes data from a text file that updates the positions of my 3d models on a frame per frame basis(.bvh)....
Hello, If performance is criticle, just leave the file open; open before the loop, read in data, close the file. Don't open and close for every read. Thanks, ...
Tyler Littlefield
tyler@...
Jun 1, 2009 4:38 pm
70687
... If you're reading the same file each time, it is grossly innefficient to constantly close and re-open. When you close a file, the operating system may...
The program ask the user to enter 5 numbers +ve and negative ... and the program will put the positive numbers in a queue named pos and negative numbers in...
... Was that meant to be // instead of /? ... Given the lack of struct on the return type, I presume you're using a C++ compiler. You should not be using a C++...
hello, Reference isn't a "data type." It's just a way of passing something to a function without having to use a pointer, it's as fast as a pointer, but...
Tyler Littlefield
tyler@...
Jun 3, 2009 7:59 pm
70692
... A reference is a pointer, but the syntax is simpler, easier to use, and less confusing. -- John Gaughan http://www.jtgprogramming.org/...
the OP is asking about references. does there need to be an example to ask how they work? Thanks, Tyler Littlefield Web: tysdomain.com email:...
Tyler Littlefield
tyler@...
Jun 4, 2009 3:32 am
70696
... Hmmm. Maybe nothing really was allocated for q->array during the initialization of the queue, that's why accessing q->qarray[q->rear] in your function...
Hi everybody , I have a problem in compiling a chunk of code written for VC++ 6.0 . I am using a ADO Recordset, which, according to the MSDN documentation,...
... I'm going to assume you are NOT using VC++ 6. Ancient compiler. It could be something VC++ 6-specific but later versions are pretty good about migrating...
... BTW, what happened to ODBC? You were using that a while back for some advanced stuff. -- Thomas Hruska CubicleSoft President Ph: 517-803-4197 *NEW*...
In two different ways i wrote a method. one makes use of recursion and the other a infinite loop. Though I personally prefer the infinite loop, but i got to...
... I don't think your case is a good candidate for recursion - I would say it is more logical to use a loop. 'Keep asking for input until input is valid'...
... There are quite valid places for goto, however while you're learning you won't come across any of them. ... Bad, and certainly not efficient compared to...
Hi Thomas , I dropped ODBC since I run into thousands of problems and the documentation wasn't helpful ,since it put me on the wrong path .... Seems the same...
You know If you Send the Address of the Varible that is Accepting the information that would minimize memory usage. NOTE: You will have to write directly to...
why would you send one variable or the pointer? if your sending an int already, there shouldn't be a problem. Thanks, Tyler Littlefield Web: tysdomain.com ...
Tyler Littlefield
tyler@...
Jun 4, 2009 7:16 pm
70707
#include <iostream> #include "Marble.h"  int main() {                        Marble m1; ...
On Thu, Jun 4, 2009 at 7:39 PM, benjamin_cail_scott ... No it wouldn't. You still have the overhead of the function call stored on 'the stack' each iteration. ...
Thanks all for answering. but Paul you wrote You should only use recursion where you have total control of the input, and (by extension) where you can control...
... I agree. Unfortunately, virtually everything is user-input driven on some level of understanding. "User input -> Data scrubbing for bad input -> Assumed...
Hi, I have an application which has been developed using Borland C++ builder (BCB) IDE and uses the Visual Component library(VCL) for windows API and graphics....
Hi, Does noybody know how to create tcl interface for c++ iterators? I tried looking at swig but could not find much. Any help/pointers? Thanks and Regards, ...
Having problems with message search?
Fill out this form to ensure your group is one of the first to be migrated to the new message search system.
