|
I guess it depends on your POV. I use STL and iostreams a lot, and a lot within the one project. I could not live without the facilities it offers me, which CFile/CArray does not. The average programmer seems blissfully unaware that such facilities exist, and so will suffer CFile when on a large scale project, where the 80k or so that gets added would be of real benefit to them.
Christian
I am completely intolerant of stupidity. Stupidity is, of course, anything that doesn't conform to my way of thinking. - Jamie Hale - 29/05/2002
Half the reason people switch away from VB is to find out what actually goes on.. and then like me they find out that they weren't quite as good as they thought - they've been nannied. - Alex, 13 June 2002
|
|
|
|
|
LPTSTR psz = Cbuf .GetBuffer (filelen);
rfile .Read (psz, filelen);
Cbuf .ReleaseBuffer ();
Tim Smith
I know what you're thinking punk, you're thinking did he spell check this document? Well, to tell you the truth I kinda forgot myself in all this excitement. But being this here's CodeProject, the most powerful forums in the world and would blow your head clean off, you've got to ask yourself one question, Do I feel lucky? Well do ya punk?
|
|
|
|
|
thank you.
after reading on stl i really did not want to add that much overhead to my program when i am only reading a file that would be about 5k max.
|
|
|
|
|
How do I get the IP address of the machine running my application within VC++?
Ed
|
|
|
|
|
I got most of my Winsock programming hints from this program though it was designed for Win2K only and uses Winsock 2.0. You do not need Win2K or Winsock 2.0 to do get the IP address and the code below will work. However, here is the link and some of the code from the sample:
http://www.sometips.com/tips/systemmanagement/213.htm
// Here read all IPs of this host
DWORD dwSize = 0 ;
GetIpAddrTable( NULL , &dwSize, FALSE ) ;
PMIB_IPADDRTABLE pIpAddrTable = (PMIB_IPADDRTABLE )new BYTE [ dwSize ] ;
if( pIpAddrTable )
{
if( GetIpAddrTable( (PMIB_IPADDRTABLE)pIpAddrTable, // // buffer for IP table
&dwSize, // size of buffer
FALSE // sort by IP address
) == NO_ERROR )
{
if( pIpAddrTable->dwNumEntries > 2 ) // Second is MS TCP loopback IP ( 127.0.0.1 )
{
m_Multihomed = TRUE ;
char szIP[16];
for( int i = 0 ; i < (int)pIpAddrTable->dwNumEntries ; i++ )
{
in_addr ina ;
ina.S_un.S_addr = pIpAddrTable->table[i].dwAddr ;
char *pIP = inet_ntoa( ina ) ;
strcpy( szIP , pIP ) ;
if( stricmp( szIP , "127.0.0.1" ) )
m_IPArr.Add(pIpAddrTable->table[i].dwAddr) ;
}
}
}
delete [] pIpAddrTable ;
}
|
|
|
|
|
Sorry, here it is with the checkbox on and formatted beter. I got most of my Winsock programming hints from this program though it was designed for Win2K only and uses Winsock 2.0. You do not need Win2K or Winsock 2.0 to do get the IP address and the code below will work. However, here is the link and some of the code from the sample:
http://www.sometips.com/tips/systemmanagement/213.htm
// Here read all IPs of this host
DWORD dwSize = 0 ;
GetIpAddrTable( NULL , &dwSize, FALSE ) ;
PMIB_IPADDRTABLE pIpAddrTable = (PMIB_IPADDRTABLE )new BYTE [ dwSize ] ;
if( pIpAddrTable )
{
if( GetIpAddrTable( (PMIB_IPADDRTABLE)pIpAddrTable, // // buffer for IP table
&dwSize, // size of buffer
FALSE // sort by IP address
) == NO_ERROR )
{
if( pIpAddrTable->dwNumEntries > 2 ) // Second is MS TCP loopback IP ( 127.0.0.1 )
{
m_Multihomed = TRUE ;
char szIP[16];
for( int i = 0 ; i < (int)pIpAddrTable->dwNumEntries ; i++ )
{
in_addr ina ;
ina.S_un.S_addr = pIpAddrTable->table[i].dwAddr ;
char *pIP = inet_ntoa( ina ) ;
strcpy( szIP , pIP ) ;
if( stricmp( szIP , "127.0.0.1" ) )
m_IPArr.Add(pIpAddrTable->table[i].dwAddr) ;
}
}
}
delete [] pIpAddrTable ;
}
|
|
|
|
|
Howdy all,
So I'm trying to decide which STL container would be more appropriate, a multimap or a list. What I need is a storage class which will be holding a lot of objects (maybe 2000?). Each object will have a unique ID. Every time an object is added it's ID will be one larger than the previously added object. Objects will be accessed and removed pretty much at random.
So basically, objects are always added with an incremented ID, but are accessed and removed randomly, in terms of ID.
Now the fact that the object ID is always increasing make me consider a list ordered on ID, so that I could just shove new objects onto the tail without having to look at the storage.
The fact that the objects are random accessed makes me lean towards a multimap<obj_id, object>.
Oh, and it looks like once the storage is initially filled it will stay /fairly/ constant in size, i.e. addition and removals will be fairly even in number.
The main concern here is speed of access, with speed of insertion/removal second, and memory usage a fairly distant third.
Anyone have any insights, suggestions, comments, etc for me 
TIA,
Pete
|
|
|
|
|
Objects will be accessed and removed pretty much at random.
This is a big point here. Straight lists perform very poorly on lookup. The list has to be searched sequentially to find the object.
However, for lists, insertions are very fast. So are removals. But when you compare them to maps, lists insert and removals probably are much faster at all.
IMHO, I see little reason to even bother with a list. Just given that you are doing random lookups, you really need something that is fast.
If available in your STL (i.e. STLPort), you might take a look at a hash map. Since your data set is remaining a constant size, you don't have to worry about the re-hash performance hit. As long as your ID's are well distributed, hash maps should perform very fast.
... IMHO
|
|
|
|
|
>>Since your data set is remaining a constant size, you don't
>>have to worry about the re-hash performance hit.
Is this true, even thought the ID's I'll be hashing on are constantly increasing?
Thinking about it, a list is definately not the way to go. As you rightly say, the lookup times for a random element in a list would /not/ be great, and that's my main priority.
I'm using M$'s STL. I'm not sure about a hash map. Is this similar to a map<obj_id, pObjData>? Forgive my ignorance, I haven't used the STL much.
Thanks,
Pete
|
|
|
|
|
It is hash_map <x,y>. You probably don't have it but no big deal. Map should work just fine.
If you did have have_map, ever increasing IDs wouldn't be a problem since the ID (used as the hash value) would be moduloed by a prime number. Thus as far as the hash is concerned, the values just roll over back to 0. But even that isn't something you have to worry about unless (ID % nHashPrime) is poorly distributed. (Which is probably isn't.)
(FYI: That was my response. Was having cookie problems.)
Tim Smith
I know what you're thinking punk, you're thinking did he spell check this document? Well, to tell you the truth I kinda forgot myself in all this excitement. But being this here's CodeProject, the most powerful forums in the world and would blow your head clean off, you've got to ask yourself one question, Do I feel lucky? Well do ya punk?
|
|
|
|
|
Ok, well I guess I'll use map, but thanks for the info
|
|
|
|
|
Anonymous wrote:
If available in your STL (i.e. STLPort), you might take a look at a hash map.
hash_map is also available in VS.NET. Also, since you are not storing key and values you may consider a set or a hash_set.
Best regards,
Alexandru Savescu
|
|
|
|
|
stl::map will work for you.
example for map with GUID* (128 bit) key type and BSTR value:
implement GUIDless to compare GUID's
struct GUIDless : public std::less<GUID*>
{
bool operator()(const GUID* _X, const GUID* _Y) const
{
if(((__int64*)_X)[0] < ((__int64*)_Y)[0])
return true;
if(((__int64*)_X)[0] == ((__int64*)_Y)[0])
{
if(((__int64*)_X)[1] < ((__int64*)_Y)[1])
return true;
else
return false;
}
return false;
}
};
declaration of map with( GUID*, BSTR) pair
std::map< GUID* ,BSTR ,GUIDless > mapGUID_BSTR;
soptest
|
|
|
|
|
or do i need to do some assembly programmin gto achieve that?
Thanks
|
|
|
|
|
Read on http://codeguru.earthweb.com/system/ReadSector.html
Papa
Murex Co
|
|
|
|
|
Hi,
do you know some MFC or Win32 function that could help to determine whether the given file is text or binary?
Thanks
R.
|
|
|
|
|
A text file and a binary file are the same... what exactly do you mean by binary and text?
|
|
|
|
|
i have to find some info (words, sentences) in files on the local disk which is meaningless eg for pictures, and executables.
That why I wanna to check beforhand whether it is meaningful to search for my data.
|
|
|
|
|
hmm, you could search for null, i don't think there's null in normal text files.
|
|
|
|
|
yeh, but that is not a life insurance.
However your answer implies that there is no such function. That means I have to find another solution like extension checking
Thanx
R.
|
|
|
|
|
there IS no way of telling if a given file is so called 'text' or so called 'binary', therefor you have to guess it.
|
|
|
|
|
You could open in binary mode and read a block, then test for certain characteristics. ASCII doesn't use any bytes larger than 127, and lines are terminated with CRLF. Finding a block of perhaps 1 KB that contains no bytes >127 would be a strong indication that the file is probably text.
Let's Put The Fun Back In Dysfunctional! - My Darts Team T-shirt
|
|
|
|
|
I think you're on your own.
Suggestions:
1) Open the file and read first 1-2K and check for ASCII < 20 and ASCII > 127. (By far the simplest.)
2) Open the file and read first 1-2K and look for SPACES and puntuation (,.!?'";). I would expect the length of words on average to be pretty small (<20 letters).
3) Open the file, check first 1-2K for words in a dictionary. If most words found are not in the dictionary, it's probably binary.
|
|
|
|
|
10x for the excellent ideas
R.
|
|
|
|
|
Open the file. Read the first 1024 bytes. You can bet yourself that if it's a binary file there will be a few bytes within the first 1024 that are not alphanumeric or punctuation.
Nish
p.s. If you have UNICODE text files you have a problem though
Author of the romantic comedy
Summer Love and Some more Cricket [New Win]
Buy it, read it and admire me
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
