Harvard esp. so :) Charlie Gilley “They who can give up essential liberty to obtain a little temporary safety deserve neither liberty nor safety.” BF, 1759 Has never been more appropriate.

Presumably already clear what the 4/8 block is used in the first place. Googling with following provides some answers. explain strlen himagic lomagic Following line is the key if (((longword - lomagic) & ~longword & himagic) != 0) I tried eye balling that and using examples in my head but still not clear. I believe it is relying on arithmetic overflow. If I wanted to understand that I would write up some test code with examples characters (4 blocks) with zero at the end (position 4, 3, 2, 1). Then have it print the results of each clause in the above if using binary representation (1 and 0) to see how the bits look for each different example and for each part of the clause. Perhaps as a learning experience also copy that code into your own space and then write a test jig to time results via that and using the more straightforward (just by char) code. You should start with a large number of runs like probably at least 100,000.

If you don't want to sort the list, for whatever reason, you could always use a Max Heap structure with a heap size of 100. Iterate over your books and, if the new book has higher sales than a book in the heap, replace the bottom element with the new one. This assumes that no two book sales are going to be the same, so you would have to consider that particular wrinkle. In .NET for instance, you can use the PriorityQueue class to handle max heaps. Advanced TypeScript Programming Projects

mike7411 wrote: time ... define ...

I guess that 95% of those who really need to do assembler coding are writing hardware drivers. You will probably find those in the "Hardware & Devices" forum. (There are those who occasionally dive down to assembler just out of curiosity and to learn a little more about how hardware works. I am one of them. We don't 'need' to do assembler. And then there are those who still believe that through assembler coding they can make their program run to completion in 20 nanoseconds less time (or even more than 20 ns less time) through assembly coding. Unless they are also in the first group, they very rarely 'need' to do assembler.) Even though "Hardware & Devices" sounds like an electronics forum, I am reasonably sure that the visitors of that forum will provide some assistance with assembler related problems. If you problems are related to how to program the use of a specific hardware feature (say the transactional memory features of ARM), it certainly is the right place. If you want to air thoughts about different instruction set architectures, H&D would also be an appropriate forum. Religious freedom is the freedom to say that two plus two make five.

Copy/paste from the answer to the question that was posted before yours; Quote: That means the index is sorted on col1, then col2. Meaning, col1 will be located first, then most rows following with the same col1 will be sorted on col2. Meaning, in a list of users, while random stored in the table, would have an index that orders it as such; Lastname, Firstname Doe, Jane Doe, John Vluggen, Albert Vluggen, Eddy Vluggen, Zack If you search it, you go "where lastname = bla (col1 from index) AND firstname = bla2 (col2 from index)". This way, it will first locate the segment for "Vluggen", and only has to scan until it finds "Eddy" within that segment. That's what the DB is optimized to do. Bastard Programmer from Hell :suss: "If you just follow the bacon Eddy, wherever it leads you, then you won't have to think about politics." -- Some Bell.

jschell wrote: That phrasing is a misstatement about how it works. Please, explain. Please do? Pretty please? Do explain how it works? jschell wrote: A table storage in a database is quite complicated Nope, and quite well documented. jschell wrote: Often, but not always, records (rows) are inserted at the end of the table. Doesn't matter whether indexes exist or not. The reason for doing it that way is because it is faster. Tables are without any inherent order, by design and definition. Indexes aren't in the table, they are entities outside the table that may be updated. jschell wrote: After the insert the index(es) are updated. That involves storing some of the data from the row (columns in the index) and a pointer to the row itself. Hence, the "create index" expects some columns to sort on. jschell wrote: Sorting is not something that is related to the table nor even to indexes If you need not sort, you need no index. So yes, it might be a tad related. The definition in proper schooling talks more about lookups than sorting, as that is more common. jschell wrote: In SQL you can specifically ask for a specific sort order Thanks for explaining that, that's really something new. Bastard Programmer from Hell :suss: "If you just follow the bacon Eddy, wherever it leads you, then you won't have to think about politics." -- Some Bell.

I already stated that he should store a hash value. Nice to hear that you picked that up :thumbsup: Bastard Programmer from Hell :suss: "If you just follow the bacon Eddy, wherever it leads you, then you won't have to think about politics." -- Some Bell.

See Java Tutorials Learning Paths[^] and also Overview (Java SE 18 & JDK 18)[^].

You'd be better off putting just a little effort into your question. Not everyone wants to click an external link for an image of code for instance. People are usually happy to help as long as they aren't being used. That being said, as mentioned, you and the person you're helping should learn to run code and test it yourself. If that's not something you're willing to do, then neither of you two need to be programming. This isn't being mean man; this is saying the industry doesn't need another coder who won't even run own code they're testing. At least run it with passing in zero and then asking _why_ a return value is what it is. Jeremy Falcon

True, but even so I doubt it will make a lot of sense to the OP.

Colour me not impressed! As long as you take the free option, I guess you didn't loose much, except maybe some time. Also there is the question of getting bad programming habits, but those can be fixed over time. These days there are many free online course from very reputable sources like MIT OpenCourseWare | Free Online Course Materials[^]. You might want to take a look at some of them. Mircea

In Windows, there are additional, O/S-level exceptions, that provide this sort of information. Look for "Structured Exception Handling". If you use MSVC, you may use the _set_se_handler function in main() and in the main function of each thread to convert Structured Exceptions to C++ exceptions. There may be similar O/S- and compiler-specific methods in other environments. Freedom is the freedom to say that two plus two make four. If that is granted, all else follows. -- 6079 Smith W.

mike7411 wrote: Can someone help me understand how this line works: the statement: if (!file) means if the variable file equals null then ... But you have already instantiated file with the line: ifstream file; So it is very unlikely that file will be null. The open method sets the failbit status if the open fails, and that is what you need to test. If you use STL classes then you must follow the STL rules, not the old C-style ones. See std::basic_ifstream<CharT,Traits>::open - cppreference.com[^] for full details.

First things first, you're ignoring the return value of _setmode. If it's -1, the call failed, but you'll never know. Second, after reading the documentation on _setmode and associated error links, it appears you cannot use cout with the mode of stdout switched to Unicode. You have to use wprintf instead: #include #include #include using namespace std; int main() { int r; r =\_setmode(\_fileno(stdout), \_O\_U16TEXT); if (r == -1) perror("Cannot set mode"); wprintf(L"\\u0394\\u03AD\\u03BB\\u03C4\\u03B1\\n"); return 0; } CORRECTION: You CAN use COUT, but you must use the wide version of it, but note the L in front of the string being output. It MUST be there: #include #include #include using namespace std; int main() { int r; r =\_setmode(\_fileno(stdout), \_O\_U16TEXT); if (r == -1) perror("Cannot set mode"); wcout << L"\\u0394\\u03AD\\u03BB\\u03C4\\u03B1" << endl; return 0; } Asking questions is a skill CodeProject Forum Guidelines Google: C# How to debug code Seriously, go read these articles. Dave Kreskowiak

jschell wrote: if Stroustrop is the name then I would consider that better. Agreed. :) "the debugger doesn't tell me anything because this code compiles just fine" - random QA comment "Facebook is where you tell lies to your friends. Twitter is where you tell the truth to strangers." - chriselst "I don't drink any more... then again, I don't drink any less." - Mike Mullikins uncle

PHP is a scripting language, which basically means there is an "exe" somewhere reading the php script every time there is a request. For php that will be Zend Engine.

As you guessed, erase invalidates all iterators on the container. Your problem is known as the Erase–remove idiom[^] There are different ways of solving it: 1. The "manual" way: auto pos = myVector.begin(); size_t i=0; while (pos != myVector.end()) { if (*pos ==3) { myVector.erase(pos); pos = myVector.begin() + i; } else { ++i; ++pos; } } 2. The "semi-automatic" way: auto pos = myVector.begin(); while (pos != myVector.end()) { if (*pos ==3) pos = myVector.erase(pos); //erase returns an iterator pointing to next element else ++pos; } 3. The "old fully automatic way": myVector.erase(std::remove(myVector.begin(), myVector.end(), 3), myVector.end()); 4. The "new fully automatic way" (since C++20): std::erase (myVector, 3); Disclaimer: I didn't compile any of the code above; some errors may/will exist :) Mircea

All of that is true to the extent that it isn't worth spending time on anyways (which I stated in my other post.) Gerry Schmitz wrote: Did you "test" it? Not relevant. If the OP can replicate it and I can't then nothing is proven. If I can replicate it then it still doesn't change the fact that it is not worth spending time on figuring it out. Not for me at least.

See, for instance Array Decay In C - GeeksforGeeks[^]. "In testa che avete, Signor di Ceprano?" -- Rigoletto