Skip to content
  • Categories
  • Recent
  • Tags
  • Popular
  • World
  • Users
  • Groups
Skins
  • Light
  • Cerulean
  • Cosmo
  • Flatly
  • Journal
  • Litera
  • Lumen
  • Lux
  • Materia
  • Minty
  • Morph
  • Pulse
  • Sandstone
  • Simplex
  • Sketchy
  • Spacelab
  • United
  • Yeti
  • Zephyr
  • Dark
  • Cyborg
  • Darkly
  • Quartz
  • Slate
  • Solar
  • Superhero
  • Vapor

  • Default (No Skin)
  • No Skin
Collapse
Code Project
U

User 12320037

@User 12320037
About
Posts
5
Topics
2
Shares
0
Groups
0
Followers
0
Following
0

Posts

Recent Best Controversial

  • An example of _tcslwr with BYTE type
    U User 12320037

    Hello, Can somebody please give me an example of _tcslwr function used with BYTE array as input? Thanks in advance.

    C / C++ / MFC data-structures tutorial question

  • Difficulty in getting iterator upon using find algorithm of STL
    U User 12320037

    Hi Jochen, First of all, many thanks for your solution. Although it has solved my operator == overloading question, but I have one more difficulty, may be a strange experience. The find algorithm of STL is not giving the iterator position, even if the item to be searched is located in the BYTE array. Does it have anything to do with the size of the arrays as well? because one BYTE array is of 16 bytes, and the one it is to be compared with is of 33 bytes? In such a case, how can I make the find algorithm give me the correct answer? Please help. Thanks in advance. - Sanjay

    C / C++ / MFC c++ help algorithms graphics data-structures

  • Difficulty in getting iterator upon using find algorithm of STL
    U User 12320037

    Many thanks for this solution, I fully appreciate it. Coincidentally, I had already implemented this, but since this was taking time in checking a database which is huge in size, I was looking for some other algorithm which will give a quicker result. Could you please suggest a better algorithm which will save me from using memcmp?

    C / C++ / MFC c++ help algorithms graphics data-structures

  • Difficulty in getting iterator upon using find algorithm of STL
    U User 12320037

    Here is the relevant code snippet: In the header, typedef struct xyz { BYTE byHex[16]; }XYZ; class CMyApp : public CWinApp { ----- ------ public: vector m_vec; ------- -------- DECLARE_MESSAGE_MAP() }; And in the implementation, in .cpp, BYTE byBuff[16] = {0}; vector ::iterator viter; viter = find(theApp.m_vec.begin(), theApp.m_vec.end(), byBuff); And, here this "find" algorithm is giving me problems.

    C / C++ / MFC c++ help algorithms graphics data-structures

  • Difficulty in getting iterator upon using find algorithm of STL
    U User 12320037

    Hello, Mine is a project in Visual C++, in which I am using STL, and trying to use the "find" algorithm with vectors. But it's giving me the error, error C2678: binary '==' : no operator found which takes a left-hand operand of type 'xyz' (or there is no acceptable conversion), because I have an app class in MFC which has a structure 'xyz' whose only member is a BYTE array. I am trying to get the iterator position by finding a value in a vector of a user-defined type and in return I am getting the above error. Hence a problem. Please help. OR someone can also suggest, which algorithm should I use to get the iterator position of the value I am searching for,from a vector of a user-defined data type (you can suggest that algorithm from the boost library also)? Please help. Thanks in advance. This is urgent. Here is the relevant code snippet to understand the problem: In the header, typedef struct xyz { BYTE byHex[16]; }XYZ; class CMyApp : public CWinApp { ----- ------ public: vector m_vec; ------- -------- DECLARE_MESSAGE_MAP() }; And in the implementation, in .cpp, BYTE byBuff[16] = {0}; vector ::iterator viter; viter = find(theApp.m_vec.begin(), theApp.m_vec.end(), byBuff); And, here this "find" algorithm is giving me problems.

    C / C++ / MFC c++ help algorithms graphics data-structures
  • Login

  • Don't have an account? Register

  • Login or register to search.
  • First post
    Last post
0
  • Categories
  • Recent
  • Tags
  • Popular
  • World
  • Users
  • Groups