Is there anyone out there who's had experience with this library? I'm new to these large libraries and I've no idea how to install it so that I can use it in a program. My question is basically how to I add the library to my project so I can use it? Do I have to add a lib file or something? Any help would be much appreciated. Step-by-step instructions would be the best because I am totally lost on this.
Not that I could find, it came with instructions on how to use the make files to create the libs and dll's and move them to the vc6 directories for each type, but that's really it. Maybe that's enough, but I can't figure out how to allow my project to use these files. To I have to add them physically to my project?
I'm using VC6 for this project. Any help on getting this to work would be very appreciated.
This is directly from the documentation:
"Finally when you use regex++ it is only necessary for you to add the <boost> root directory to your list of include directories for that project. It is not necessary for you to manually add a .lib file to the project; the headers will automatically select the correct .lib file for your build mode and tell the linker to include it."
I did this by going to the projects settings and adding it to the list of include files, but when I try a piece of code like:
I get an error that reg_expression is not a valid type.
Your zip should include something like an include and a lib directory. In VC6, click tools/options/directories. On the right is a drop down. Set it to show directories for include files, add your include directory. Do the same for library files and your lib directory. Now in your project, click PRoject-Settings ( or hit Alt-F7 ). On the link tab, in the 'object/library modules' text entry box, type in the name of the lib file/s that contain the code you want to use ( read the docs ). Now you're set, you just need to #include whatever header files you want from that include directory, and they should compile and link OK.
I have drunk the cool-aid and found it wan and bitter. - Chris Maunder
Create a dialog based MFC application and on the dialog right click and choose 'Insert ActiveX object'.
That brigns up a list of the objects registered on your PC.
When do do this you will be prompted to allow Visual C++ to create a class for the object (say yes).
Then go to the class wizzard, go to member variables and create a member variable for the ActiveX object on the dialogue.
Hi, i know this question has probably been asked 1 million times (but i cant seem to find an answer)
How can you read the ID3 tag (track name, artist, etc) from an mp3 file WITHOUT using COM, Media player extensions, etc. ONLY whats in the C++ std lib and the W32 API?.
i figure that this information is probably written in all mp3 files at a fixed position (the start probably?) along with its lenght, if so, i guess it would be realatively easy to just open the file the "raw" mode (via fopen(), CreateFile() or whatever), read the lenght of the info, create a buffer with the proper size, and put the info itself in the buffer. Can anyone point me in the proper direction?
Not sure where this belongs since it is a programming question:
Given a set S of n axis parallel rectangles, defined by their top-left and bottom right points, describe and analysis an efficient algorithm for determining the area of the union of S. Note that since the rectangles my overlap the answer in not simply the sum of the areas of the rectangles. Hint: Imagine sweeping a line over the rectangles and performing operations on a data structure when the line hits either the start or end of a rectangle.
it should be no problem. Sort x coords (starting and ending) of rectangle,
then proceed from left to right. And consider each point as an event. When you come to starting point of rectangle A, add rectangle A to list and test its y coords against all other rectangles in list. When you come to end point of rectangle A, remove rectangle A from the list. This should help you to determine total overlap area.
This algorithm should run in O(N*Log N + K), where N is number of rectangles and K is number of overlap areas. So note, this algorithm is
only good, when there is not great number of overlapping rectangles, because
it gets asymptotically to O(n^2). In such case, it's better to use
brutal force algorithm.
Last Visit: 31-Dec-99 18:00 Last Update: 29-Sep-23 7:02