Comments by Rick York (Top 200 by date)

Have you tried searching for animation? https://www.codeproject.com/search.aspx?q=animation&x=7&y=1&sbo=kw

FWIW, I learned C programming with a very simple, basic book and I worked through all the examples and tweaked a few that I was curious about. Once I had the basics (mostly) then I started on what is still one of my primary interests : computer graphics. I did all kinds of graphically-oriented things and learned a LOT. One of the first things I did was rotating wireframe objects then I moved onto fractals and spirograph shapes. I am not advocating this approach but my point is you will likely learn the most if you pursue something that is of interest to you. The key will be figuring out what that is.

Keep in mind that with TCP/IP there really ISN'T a limit on number of bytes per message. There is a limit on the number of bytes in a normally-sized pack of about 1500 bytes but a TCP/IP message larger than that will be split between multiple packets and the protocol will insure that they are all received in order. Many NICs and switches support what are called "jumbo frames" which can range between 5 and 15KB. All equipment between sender and receiver must support jumbo frames for you to use them. My point is I wouldn't worry too much about the frame size limit unless you are also writing the protocol handling code and have to deal directly with that. A robust socket handling library should be able handle that kind of thing.

If you work with other people then that is not the way to do things. If you worked with me I would be very, very annoyed. I work with dozens and dozens of projects and I never, ever change VC's include or library directories. Those are user and installation-specific settings and should NOT be changed. Setting the include and library directories is something that should be changed in your projects' settings. In order to work well with other users' you should always use relative paths no two users install things the same way and in the same places.

Debugging it is the easiest and fastest way to find out what is wrong with your code.

It would be easier to help you if you provide some code that tests these functions.

I suspect the issue has to do with the <=-1 comparison with an unsigned value. I haven't looked at the assembly code generated to verify though. Regardless, I think this is a compiler bug.

One thing I still find odd about this : I did not have a problem with the [] operators in the iterator class so they do not call the IsValid method.

I agree. I try to avoid all MFC collections and CString. I can't always but in the vast majority of cases I can.

As Mr. Pallini mentioned, std::vector would be a better option. I have used MFC for a long, long time and I still do but I never use the MFC collections or strings. I always use STL classes like vector and string. In my opinion, MFC is good for handling windows, dialogs, and controls but I do not like their collections at all.

Where ever you want to update the edit controls. Usually it's done in OnInitDialog but if those values are changing constantly then you can also do it in OnTimer or when you get a notification that they have changed. That's the point though - do it when ever you need to and where ever it has to be done.

That code looks appropriate to me.

Were you given a target processor for this assembly language program?

Of what significance is the value 20? You have five integer arrays of that size. It is bad practice to use hard-coded values like that.

Was it actually necessary to resurrect a nearly six-year-old thread?

You would have to get into the firmware of DVD drive to see how it handles that and I think that would be a lost cause because it doesn't do imaging per se. It just detects the presence of pits. I doubt it has an actual frame buffer.

If you want an imaging system I think a better option would be one of the many USB microscopes that are available. Here is one example : https://www.amazon.com/Microscope-Magnification-Inspection-Compatible-Smartphone/dp/B07PVMRZQH/ref=sr_1_4?crid=337KLJ1CMJUIC

Of course it will because a function returning void will NOT have a result type. How can it?

Please note that I wrote MyWindowClass. That means you have to implement this handler in a class with a window and a message loop. CDocument classes almost always have a CView-based class and the CView class has methods to access its associated CDocument object.

That's a rather trivial one. Try just changing the % to a /. Then you have a solvable equation that is a bit less trivial : 30=(x+38)/4;

If you analyze the algebraic steps taken to solve the equation you can correlate them to the parsing tree that (most) expression evaluators generate.

There probably is code around that can do this but the point of most homework is to do it yourself. A secondary point of it is to learn how to find what you need for yourself.

Your program should solve them exactly as you would do it yourself. An expression handler would be a good front end to use.

You actually expect us to ask chatGPT what a DP solution so we can help you with a problem?

Guess again because it ain't happening.

It appears to be the number of times an '_' is encountered in ans which should be n times. I think you should try this in a debugger to find out for yourself.

Permutations are the key to the problem. They are essentially just all the ways you can shuffle the letters of a string. That's what you have to do - check each permutation, shift it, and see if it is circular. I don't think that qualifies as a DP solution.

Interesting problem. What is a DP solution?

In this situation I would use a va_list and vfprintf. That would also require fopen and fclose to use a FILE object but that's OK.

The code looks OK. If you have it working on one set of machines you have pretty well verified it is OK. Note that on your home network you are likely to have all machines on the same subnet, usually the class C subnet, so that tends to reinforce my hypothesis.

Do you have a question?

Also - your program deals with prices and discounts. What do bugs have to do with it?

One other thing, not all control paths return a value in f. If q is less than N then nothing is returned.

Well keep trying. You will learn nothing if others do this for you.

Here are some hints : you have variables z and o, presumably to count zeros and odds. Add another one to count evens and I am sure you can come up with a name for it.

You seem to be aware of the modulus operator and have snippets for determining if a number is even. Generally speaking, if a number is not even it is odd.

It is now up to you to tie it all together.

Your code is incomplete because the types of variables song1 and song2 are not shown. That is likely to be the problem but we can only guess.

This is probably not the best way to help someone with their homework.

I don't have an answer for you but you might find something useful at this guy's site : https://iquilezles.org/

Yes, this program already uses a function to do it.

Great, I am glad to read that you succeeded.

One detail : ZeroMemory does not free memory - it sets it to all zeros.

For what?

It's defined in wtypes.h, among other places, so at a minimum that file can be included.

If I was doing this I would read all input from a file using fgets. This would make your testing much faster and easier. You can still read input from the console by using stdin as the file pointer if you want or need to.

So that's your project - what's your question?

I do not understand your reply. What you have to do is define a mapping between your application's minimum and maximum values to the slider's position limits and then translate the slider's position back to an appropriate value for your application. That's all there is to it. Handling mouse moves for a slider is NOT the right way to do this. If you want to move the mouse around and have your display respond to that then maybe a slider is not the right way to deal with it. I have done both of these - I have displays that I pan around when the user presses the left button down and then it stops when the button is released and no slider is involved in this. I also have displays that adjust themselves dynamically as a slider is moved. I also have displays that have both of these mechanisms combined but the slider is not affected when the user pans around. You need exactly how you want your display to work because it is not clear from your messages.

Good idea.

You are still recursing on main which results in starting all over again with a new list. You also implemented your specializations but not the basic operations. This not how a linked list should be built.

Step 1 is to find an API that will let you do the job. I believe that will need to come from the manufacturer of the fans or the motherboard since there is no industry standard for that but I am not certain.

Step 1 is to find an API that will let you do the job. I believe those are specific to the manufacturer of the fans since there is no industry standard but I am not certain of this.

I would change get_coins slightly to :

int get_coins( int * pcents, int coin )
{
    int number_of_coins = 0;
    if( * pcents > coin )
    {
        number_of_coins = * pcents / coin;
        *pcents -= number_of_coins * coin;
    }
    return number_of_coins;
}

this will cut down the code a bit :

    int quarters = get_coins( & cents, 25 );
    int dimes = get_coins( & cents, 10 );
    int nickels = get_coins( & cents, 5 );

This does not appear to be the standard STL file format. Is it a proprietary format? The standard is documented at : https://en.wikipedia.org/wiki/STL_(file_format).

Personally, I would make the triangle structure out of vertexes like this :

struct Triangle
{
    Vertex v1;
    Vertex v2;
    Vertex v3;
};

and then I would implement basic math operators for a Vertex, starting with subtraction. The first few lines of the distanceToTriangle function would look like this :

double distanceToTriangle( const Vertex & pt, const Triangle & triangle )
{
   Vertex u = triangle.v2 - triangle.v1;
   Vertex v = triangle.v3 - triangle.v1;
   Vertex w = point - Triangle.v1;
   // and so on

I did not see any obvious errors. One thing I don't understand is why must requiredItems.size() be 5? You have that in the code twice but there is no mention of it in the description of the problem.

One thing I prefer to do is define a type or a using statement for repeated non-trivial types. Here are some examples :

using pairstrstr  = std::pair< std::string, std::string >;
using vpairstrstr = std::vector< pairstrstr >;
using uosetstr    = std::unordered_set< std::string >;

This is because it simplifies a lot of things in my opinion. Your function prototypes would become :

bool ViolatesConstraints( std::string item1, std::string item2, const vpairstrstr & constraints );
void FindRequiredItems( std::string item, const vpairstrstr & inclusions, uosetstr & requiredItems );

I think that is much easier to read.

That means it is time to learn the debugger. A side-effect of learning the debugger is it encourages you to write code that is more easily debugged. I recommend that you start at the beginning and verify that your data structures all look correct. Then check your first function - ViolatesContstraints. Make sure it works as it is supposed to and then move on to the next one.

"It's not working," is not particularly useful. It is much more useful to note exactly what is happening.

You should read it again because there are a few things mentioned there that you are not doing. One is allocating the buffer for the string.

Every compiler of any worth will tell you the line number where the error is. Do you expect us to guess where it is?

No, you don't have to reinstall. You can just add that to your existing installation.

This might be useful : https://www.microsoft.com/en-us/download/details.aspx?id=56846. It is a reference of windows commands.

Does one have to really get into ZPL or will the windows printer driver take care of all that?

Yes, arrays are the traditional approach. You can either allocate a whole bunch of them to start or implement a re-allocation scheme. Even then, there are more options. You can make your own pseudo-vector things like a free pool to save on re-allocations or re-allocate them one at a time. The function for re-allocation is realloc.

I assumed you could use vectors since you are using strings. Here is some documentation on vector : https://cplusplus.com/reference/vector/vector/. The key function of interest is push_back. When I use a vector I almost always call reserve to pre-allocate about as much memory as I think I will use so I don't thrash the heap too badly with re-allocations.

Your first two sentences are incorrect for windows. They CAN be used between machines and I have done it myself. Here is what Microsoft has to say about them : https://learn.microsoft.com/en-us/dotnet/standard/io/how-to-use-named-pipes-for-network-interprocess-communication. I have no idea about using them with Linux.

This is one of many reasons that using global variables is not recommended.

Are you sure that pipes between Linux and Windows machines are compatible? I am not at all certain they can work together and everything I have read says they can not. I think you would be better off using a socket connection because those CAN work between different operating systems.

What is your question? If it is "will you write this for me?" then the answer is no.

You are opening a file for write access but nothing is written to it so that is unnecessary.

As mentioned, using gotos is not recommended. There are at least two alternatives : use functions or use looping constructs. The keywords continue and break are very useful with loops. The three looping options are do, while, and for. This page : https://cplusplus.com/doc/tutorial/control/ is from a tutorial and it covers flow control mechanisms including loops.

The word is please.

Can the code compile? Does it work? It looks to me like it should.

k is used as an index into the A and B matrices.

There are several optimizations you can do with this. Here is one hint : you do not have to actually compute the factorial since the result you want is the sum of the digits, not the actual factorial value. Think about how factors of ten work - 10, 20, 30, etc...

Why should anyone do YOUR work for you?

See if something was lost in translation. Copy and paste what you had for that line and then change the variable names as I made them and see what happens.

I noticed a potential problem just now. I named a variable 'class' and that could be a problem. You might want to change it to clas with one 's' to be safe.

That does not look like C++.

Google will give you a lot more information far faster than asking questions at this site will.

Do you have a question?

What error does it result in?

Your function is named a bit strangely. It is called GetRegStrValue but it calls the function RegCreateAddSetString. To me, this is a side effect that I would not expect from a function with that name.

Usually a debug assertion failure will also tell you where the assertion occurred. Without that knowledge there is nothing anyone can do to help you.

I recommend that you never, ever have a 'using' statement in a header file. If you want to shorten the expression std::string then consider a type defintion.

A do-while loop will always execute at least once. A while loop may not.

We don't always get what we want.

Your question is unclear. If this is software you have control over and it's for windows then spin buttons have a property that defines their orientation. If you do not have control over this software then there is probably not very much that can be done.

I am not going to guess why. One of the most important skills to learn for a programmer is debugging. This would be a good time to learn how to use a debugger.

Thank you sir.

Sorry, I hadn't seen your solution when I wrote mine which looks rather similar.

Why are any of those variables floating point? None of your math involves fractional values or division so there is no reason they can't be integers.

Thank you sir.

No.

Not exactly but it might work.

Thank you sir.

That is not how the Scrabble game works. Players put down letters onto the board as they play various words. The board has various squares designated for double or triple letter and double or triple word scores. You do need a table of words that are allowed to be played (your dictionary) but that is only used to validate the words that are played.

What you described sounds more like a crossword puzzle.

The word is please.

Help do what? Your code is incomplete.

How can debug mode be right when it fails to invert the matrix?

The fact is we can't help with anything when we can't see your code.

In my opinion, no. As I wrote, I prefer to use fgets because I do not want to ever have to concern myself with flushing the stream. I always write code that accepts input from a file so that's another reason I never use scanf. You might want to have a look at the function sscanf. It is scanf that operates on a string.

We are here to help you solve problems. We are not here to do your work for you.

I really do not what best practice is when it comes to drivers because I do not write drivers at that level. I have written lots and lots of drivers but they were all user-mode. If you do everything you need to do in C then that would probably be best for the driver since it will export C functions. If I am not mistaken, all of those articles discuss DLLs.

The word is PLEASE.

That would be my preference. I never, ever use scanf but then I never acquire input from a console. I rarely call sscanf either. I prefer to tokenize the input and then deal with each token on its own.

For a full-featured CStatic-derived control, have a look at this : https://www.codeproject.com/Articles/215/Extended-Use-of-CStatic-Class-CLabel-1-6

What was changed?

Probably. That would explain the lack of a clue about it.

Do you really not see the problem? It is obvious to me. Hint - it's in the main function.

Then YOU need to write it.

In my opinion, the issue is your answer value is an integer and you are scaling by 100000 which is exactly the precision your problem requires. That means you are within one of it so it could be something as simple as a rounding issue. Try making the scale factor 1,000,000 and see how close you get.

Note how many places you will have to change numbers. That is why things like this scaling factor should be definitions or constants so you only have to change one value.

The only reason I can think of is that doing it without loops would force them to use STL algorithms.

good point. I hadn't even look at that.

It didn't all get posted. Some is missing. Also - remember to add the code tags around it.

After looking around a little, I found there is std::lock_guard that does exactly this. I learned something new today.

Thanks, good idea.

I recommend using the search engine of your choice. I found lots of stuff about the topic so I am certain you can too.

Thank you, sir.

One other thing that just occurred to me - when you access the value from the array and return it in pop, you could also null the slot. It is possible that you are trying to access an object that was already deleted and this is likely to happen when you reach the end of the array and wrap around. It might help to if you check for that condition (null pointer) and catch it when it happens.

I write lots and lots of multithreaded code and it is very tricky to debug. I (nearly) always do it in two phases. If possible, I first thoroughly debug the algorithm. That is not always possible like with a reduction algorithm, for example. Then I debug the locking, when it is used. When possible I avoid locks but your algorithm requires them so I make sure that works correctly. Then it's integration time where the whole is tried together. I would guess you have an array indexing problem. I would add output statements so you see every array index accessed and use a temporary variable for that as I did in the snippet above. Also - output the value returned from pop. That pointer is dereferenced to execute the function queued and it is likely that it is the errant pointer that causes the exception. I would add more output so you can see what values result in the exception. One more thing - you use a default of 4096 for the array size. If you can, try it with much smaller values like 8 or 16 and see if the same things happen. If the behavior is the same then you should see it happen much sooner which will make it easier to debug. Personally, I don't like how you handle the array index. I would never do it that way, but that's just me. I would limit the values and force them to wrap around instead of masking. Again, that's just my personal view.

I have no idea where or what your problem is. I am just pointing out that find is the way to find a value associated with a key so read the documentation so that you understand that. You are already calling it twice in your code. Maybe you should consider using a debugger. I find them invaluable.

For each section there is an array of cages. What I showed you was the array for one section. Next you will need an array of structures for each section. Solution 3 shows how that can be done and similar techniques can be used to allocate those arrays.

I already showed you - find : https://cplusplus.com/reference/map/map/find/

The word is please.

If you are going to implement your own function you should start by making a list of number fragments. This can be done many ways. One is to separate the digits and then build the fragments from the digit list. Once you have a list of the fragments it should be very easy to check their divisibility.

It would be more appropriate to call the function DivisibilityByEleven.

Doesn't this have a diamond problem? https://www.cprogramming.com/tutorial/virtual_inheritance.html

Yes, that's all it is.

Yes.

In my opinion, the easiest way is to not let them be added in the first place.

The code you have to use for this question is code that YOU write. No one here is going to write it for you. I recommend you start by finding out what insertion sort is. Search engines are your friend.

I already gave you one suggestion and it was just an extension of something you had already done yourself. Why are you so resistant to it? That fact is YOU need to do this work. You can not expect anyone to do it for you.

BTW: that was two questions ago.

I made the same suggestion the last time he asked about this. He seems to not like that idea although he had it himself first. Check out the previous C question that he posted.

What is this? You don't like the answers you got before so you post the same code with slightly different questions?

Since the code is the same as last time, my answer is the same as last time.

I took so long writing all that it seems you have a corrected a problem I mentioned.

that looks a lot better.

OK, the code was missing the pre tags and was corrupted when pasted. There are a lot of extraneous '=""' strings in there.

You need to revise your question. Your code should go in the "what I've tried" section and your statement should be asked as the question.

Do you really think someone is going to supply you with an answer? Search engines are much more efficient than forums for acquiring answers and usually you will learn more from them.

one other thing - in your default case there is a break in the middle of some logic and that makes the prompt and input statements unreachable. Also, the final listings should probably happen only after all participants are registered. This means you should rearrange your loop and prompting.

I tried to correct the formatting but there is so much code missing I decided not save what I did.

One recommendation : learn how to write the sorting as a function because that code appears twice.

You have stated your problem. What is your question?

My advice is to use a debugger. We could try to help with that but there is not enough code here to build an executable image.

Good point - 100K loops is not infinite but it's close enough. Especially for a user who might be trapped in that loop.

Because visited is a two dimensional vector - a vector of vectors. That means each row is a vector also so vectors must be pushed into the vector.

That initializes a vector of five integers with a value of 0. There are other cleaner ways to do that.

Either put the prime numbers into an array or determine if a number is prime on the fly. With a decent algorithm, performance should not be an issue.

The only real difference is there is no guarantee of the order of evaluation of the functions with && operators while there is with the nested conditional expressions.

I got it to compile with VS19 but I don't recall actually using it anywhere. The one I always use is a modified version of CReportCtrl by Bin Liu. I changed it to derive from CMFCListCtrl and a custom class by me.

As as I know it would be but I don't use OS-X or SDL. Usually header files do not affect linking unless they have pragmas that define the libraries to link with. This problem is usually caused by not specifying the correct path to the library files.

I think that message means there is problem linking. This is often caused by not correctly telling the linker where the library file is.

They are all acquired via scanf.

We can't find a mistake in code we can't see.

I use Visual Studio and with my code I always use warning level 4 and it would flag this with a warning. I recommend trying that for yourself.

I would be using a debugger to solve this problem. It should show you exactly what is going on.

I showed you how in your previous question.

I showed you how in your previous question.

Yes.

If it's testing creativity then YOU should be the one who creates your idea.

Nope. That's your job.

This is NOT a solution and should not have been posted as one.

Your solution does not satisfy the requirements because it does not override the < or > operator. I gave you two pages to read on that topic if you need information on it.

A console WILL handle a large volume of text. I have done it myself with dozens of process and four or five consoles, each having a buffer with 9999 lines of text and the systems runs non-stop.

Since you are running on a Windows OS, (32-bit FFS), the Windows SDK is your ONLY option if you are going to do something so hair-brained as sending strings to WordPad. Its source code is available so have at it. Who are we to dissuade you from that?

"You assumed that I might want to go from C++ to a crippling almost anti-coding platform like Visual Studio."

That is the most ridiculous statement I have read in a long, long time.

He was exactly right - using an external program in this manner will add in an incredible amount of overhead and is an absurd thing to even attempt.

That looks java but you tagged your question as a C++ problem.

There might be limit for data on the stack but in windows programs the stack usually defaults to 2MB so a limit of 12KB makes little sense. The OP has amended their post to state that WriteProcessMemory has a limit. That was not there originally and I seriously doubt that statement also. The documentation for that function does not state any limit and I think it is because there isn't one. I think the OP hasn't posted enough code for anyone else to make sense of. I know for a fact that what I showed WILL work because I have done it several times.

Have a look at the functions toupper and tolower.

Most prime number checkers start with 2 and then test 3 and then they skip by two. This is because 4 and the rest of the even numbers have already been tested. This means only the odd numbers need to be checked after two is tested.

If you want get fancy with it, you can implement an object factory as a static method of the Shape class. It's purpose would be to create objects of the specified type. That would eliminate all of those ifs in the user code and move it into the factory and they would appear in only one place - where the object is created. Using that would look like this :

cin >> index;
Shape * pobj = Shape::CreateShapeObject( int index );
pobj->PromptAndCompute();
delete pobj;

With virtual methods for all aspects of your requirements, the code to use them could be this simple.

Another tip : see the chain if statements in your main function? Add a method in every class to perform those operations. You could call it PromptAndCompute or something like that. Then you code looks like this :

if( n == 5 )
{
    Sphere obj;
    obj.PromptAndCompute();
}

One tip : consider making the Shape have virtual methods that the derived class all override or provide implementations for in the case of a pure virtual method. The Shape method would be the primary interface to users of the class(es).

No, that's your job.

I prefer to read text from a file into a string using fgets and then I use sscanf or strtok to extract data from the string. That way I know immediately if the end of the file is reached. Generally, I avoid scanf and fscanf.

Please consider learning how to spell the word "please."

Do you have a question? If your question is, "will do my work for me?" The answer is NO!

Someone else asked this same question recently. At least they could spell the word please correctly.

Nope. Ain't doing your homework for you and neither will anyone else here. Homework assignments are not emergencies.

That code is a mess. You should format it properly.

Also, why don't you know what the output is? My guess is because this is your homework and you should do that yourself. You will not learn anything if other people do your homework for you.

Helping people is one thing. Doing their work for them is entirely different. We are here to help you, not to do your work for you.

NO!

I prefer a more generic hash table organization which for this one means id is replaced with a pointer to this person's "List" structure. The members of the structure would be :

typedef struct _HashItem
{
   char * key;
   void * pData;
   struct _HashItem * pNext;
};

hopefully that resembles C syntax. Anyway, it's essentially the same as what you have but it can work with practically any data.

You have used the literal value 27 in many places. That is a very, very bad idea. You have made it a definition like the other constants and you should use it - MDIR.

FWIW, nothing about my algorithm is recursive. It uses a weird counting method I figured out for handling permutations. For this, it uses a vector of twenty-four counters that work with base 6 values. This allows it to use loops without recursing. I am going to see how it does with 16 digits and a target sum of 63 next. That should be interesting.

I tried something a little different. I changed the number of digits to 12 and the sum target to 42, both half of the originals. This gave results that won't take an entire day to evaluate :

tests checked : 2,176,782,336
total matches :   144,840,476
elapsed time  :        12.222

the time is in seconds.

I wrote a program to solve them. It ran for an hour and this is the last one it found : 29,480,000 : 111111111565415656666554. I didn't feel like letting it go for several more hours. There are going to be around 200M solutions in total I think.

Aren't there 6^24 possibilities? That's 4.738E18. Of course, not all will sum to 84.

What is the error message you receive?

Did you read what I wrote? I will repeat it : "You can take at least two approaches to the bitwise algorithm : either shift the data or shift the mask." You shifted the data, this solution shifts the mask. This was solely to present another option.

Performance-wise that is the worst possible option. I avoid bit fields when ever possible.

The question is about determining patterns in the bits. This shows how one can find out what the bits are.

I consider it much better to write :
cout<<"Select an option\n";
cout<<"\n";
cout<<"1.Deposit/withdraw\n";
cout<<"2.Change Account type\n";
cout<<"3\n";
cout<<"4.Change Name\n";
cout<<"5.Display Details\n";

displayMenu does not access any member variables.

Brute force is the appropriate thing to try in my opinion. There appear to be only eight possibilities so it's really not so bad. That is, four columns combined two at a time.

That is a rather low precision value for pi. You can get a better one by including math.h and preceding it by defining _USE_MATH_DEFINES :

#define _USE_MATH_DEFINES
#include <math.h>

const double desired_pi = M_PI;

Partly because you do not have logic to display output for every possible input.

Do a search at the site of your preference for "linked list." You should find several million possibilities including a few at this site. That should tell you how to implement a linked list. This YOUR problem so you need to do the work.

Coding in between what?