dev-cpp-users Mailing List for Dev-C++ (Page 203)
Open Source C & C++ IDE for Windows
Brought to you by:
claplace
You can subscribe to this list here.
| 2000 |
Jan
|
Feb
|
Mar
|
Apr
|
May
|
Jun
|
Jul
|
Aug
|
Sep
(15) |
Oct
(115) |
Nov
(154) |
Dec
(258) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 2001 |
Jan
(377) |
Feb
(260) |
Mar
(249) |
Apr
(188) |
May
(152) |
Jun
(150) |
Jul
(195) |
Aug
(202) |
Sep
(200) |
Oct
(286) |
Nov
(242) |
Dec
(165) |
| 2002 |
Jan
(245) |
Feb
(241) |
Mar
(239) |
Apr
(346) |
May
(406) |
Jun
(369) |
Jul
(418) |
Aug
(357) |
Sep
(362) |
Oct
(597) |
Nov
(455) |
Dec
(344) |
| 2003 |
Jan
(446) |
Feb
(397) |
Mar
(515) |
Apr
(524) |
May
(377) |
Jun
(387) |
Jul
(532) |
Aug
(364) |
Sep
(294) |
Oct
(352) |
Nov
(295) |
Dec
(327) |
| 2004 |
Jan
(416) |
Feb
(318) |
Mar
(324) |
Apr
(249) |
May
(259) |
Jun
(218) |
Jul
(212) |
Aug
(259) |
Sep
(158) |
Oct
(162) |
Nov
(214) |
Dec
(169) |
| 2005 |
Jan
(111) |
Feb
(165) |
Mar
(199) |
Apr
(147) |
May
(131) |
Jun
(163) |
Jul
(235) |
Aug
(136) |
Sep
(84) |
Oct
(88) |
Nov
(113) |
Dec
(100) |
| 2006 |
Jan
(85) |
Feb
(119) |
Mar
(33) |
Apr
(31) |
May
(56) |
Jun
(68) |
Jul
(18) |
Aug
(62) |
Sep
(33) |
Oct
(55) |
Nov
(19) |
Dec
(40) |
| 2007 |
Jan
(22) |
Feb
(49) |
Mar
(34) |
Apr
(51) |
May
(66) |
Jun
(43) |
Jul
(116) |
Aug
(57) |
Sep
(70) |
Oct
(69) |
Nov
(97) |
Dec
(86) |
| 2008 |
Jan
(32) |
Feb
(47) |
Mar
(106) |
Apr
(67) |
May
(28) |
Jun
(39) |
Jul
(31) |
Aug
(25) |
Sep
(18) |
Oct
(25) |
Nov
(5) |
Dec
(21) |
| 2009 |
Jan
(33) |
Feb
(27) |
Mar
(27) |
Apr
(22) |
May
(22) |
Jun
(10) |
Jul
(17) |
Aug
(9) |
Sep
(21) |
Oct
(13) |
Nov
(4) |
Dec
(11) |
| 2010 |
Jan
(10) |
Feb
(8) |
Mar
(4) |
Apr
(1) |
May
|
Jun
(2) |
Jul
|
Aug
(1) |
Sep
(8) |
Oct
(26) |
Nov
(9) |
Dec
(1) |
| 2011 |
Jan
(21) |
Feb
(16) |
Mar
(4) |
Apr
(19) |
May
(26) |
Jun
(9) |
Jul
(6) |
Aug
|
Sep
(4) |
Oct
(3) |
Nov
(2) |
Dec
(1) |
| 2012 |
Jan
(4) |
Feb
(7) |
Mar
(4) |
Apr
|
May
(1) |
Jun
(10) |
Jul
(1) |
Aug
(1) |
Sep
(18) |
Oct
(3) |
Nov
(1) |
Dec
(1) |
| 2013 |
Jan
(4) |
Feb
(2) |
Mar
(15) |
Apr
(6) |
May
(1) |
Jun
(3) |
Jul
(1) |
Aug
(2) |
Sep
(4) |
Oct
|
Nov
(9) |
Dec
|
| 2014 |
Jan
(4) |
Feb
(1) |
Mar
|
Apr
|
May
|
Jun
|
Jul
(5) |
Aug
(4) |
Sep
|
Oct
(2) |
Nov
(1) |
Dec
(4) |
| 2015 |
Jan
(2) |
Feb
(3) |
Mar
(1) |
Apr
(2) |
May
(1) |
Jun
(2) |
Jul
|
Aug
(1) |
Sep
(2) |
Oct
(9) |
Nov
(35) |
Dec
(6) |
| 2016 |
Jan
(7) |
Feb
(10) |
Mar
(10) |
Apr
(9) |
May
(13) |
Jun
(9) |
Jul
(1) |
Aug
(3) |
Sep
(3) |
Oct
(1) |
Nov
(1) |
Dec
|
| 2017 |
Jan
|
Feb
|
Mar
|
Apr
|
May
|
Jun
(1) |
Jul
|
Aug
|
Sep
|
Oct
|
Nov
|
Dec
|
| 2018 |
Jan
|
Feb
|
Mar
(1) |
Apr
|
May
|
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
|
Dec
|
| 2019 |
Jan
(1) |
Feb
|
Mar
|
Apr
(2) |
May
|
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
|
Dec
|
| 2020 |
Jan
(1) |
Feb
|
Mar
|
Apr
|
May
|
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
|
Dec
|
|
From: Noorez K. <coo...@ho...> - 2004-07-02 21:34:35
|
What is the function that ejects the cd? I tried looking but i couldn't find one. _________________________________________________________________ Add photos to your e-mail with MSN Premium. Get 2 months FREE* http://join.msn.com/?pgmarket=en-ca&page=byoa/prem&xAPID=1994&DI=1034&SU=http://hotmail.com/enca&HL=Market_MSNIS_Taglines |
|
From: Noorez K. <coo...@ho...> - 2004-07-02 18:38:10
|
What include files do you need to use the MCI. I tried searching but i couldn't find it anywhere. -I am using the dev-cpp for my programs. _________________________________________________________________ http://join.msn.com/?pgmarket=en-ca&page=byoa/prem&xAPID=1994&DI=1034&SU=http://hotmail.com/enca&HL=Market_MSNIS_Taglines |
|
From: Jesse H. <jes...@gm...> - 2004-07-02 16:06:47
|
In regards to #1, This may be of assistance: -- http://msdn.microsoft.com/msdnmag/issues/04/01/CQA/default.aspx In regards to #2, See http://autorun.moonvalley.com/autoruninf.htm -- Naturally, only works on Windows On Fri, 02 Jul 2004 10:02:01 -0600, Noorez Kassam <coo...@ho...> wrote: > > 1. Is there anything in C++ that can let you check what drives are valid on > the computer? > > 2. How do you make a program automaticly start up when the cd that contains > it is inserted into the drive? > > _________________________________________________________________ > Add photos to your messages with MSN Premium. Get 2 months FREE* > http://join.msn.com/?pgmarket=en-ca&page=byoa/prem&xAPID=1994&DI=1034&SU=http://hotmail.com/enca&HL=Market_MSNIS_Taglines > > ------------------------------------------------------- > This SF.Net email sponsored by Black Hat Briefings & Training. > Attend Black Hat Briefings & Training, Las Vegas July 24-29 - > digital self defense, top technical experts, no vendor pitches, > unmatched networking opportunities. Visit www.blackhat.com > _______________________________________________ > Dev-cpp-users mailing list > Dev...@li... > TO UNSUBSCRIBE: http://www23.brinkster.com/noicys/devcpp/ub.htm > https://lists.sourceforge.net/lists/listinfo/dev-cpp-users > -- Jesse Hallam University of Waterloo Freshman |
|
From: Noorez K. <coo...@ho...> - 2004-07-02 16:02:12
|
1. Is there anything in C++ that can let you check what drives are valid on the computer? 2. How do you make a program automaticly start up when the cd that contains it is inserted into the drive? _________________________________________________________________ Add photos to your messages with MSN Premium. Get 2 months FREE* http://join.msn.com/?pgmarket=en-ca&page=byoa/prem&xAPID=1994&DI=1034&SU=http://hotmail.com/enca&HL=Market_MSNIS_Taglines |
|
From: <mi...@al...> - 2004-07-02 13:09:57
|
What I do is that: I scan a volume by an octree; to decide if one cube has to be subdivided I look for the values on the vertices of the cube. At last level of detail, I have nodes-cubes and I know their configuration, so with marching cubes I find the triangles that aproximates the surface intersecting the cube-node, and I store the vertices of these triangles in my list. So These triangles form a 3D volume, but the only information I reach about a 3D point-sampled is if this point is inside or outside my volume, so I haven't a scalar value that gives me possibility to interpolate them and so to smooth the volume. (The good think is that the triangles are almost of the same size.) Perhaps the better think could be storing topological information while building the octree. Unfortunately ... I don't know nothing about 'scanline conversion'. Thanks for the suggestion about 'winged edge structures', i will look around for it, 'till now I don't understand how I can know, during my marching c., if two triangles share one edge |
|
From: Jesse H. <jes...@gm...> - 2004-07-02 12:10:43
|
I can confirm that page as well, ISP in Canada. Whois shows: Status: REGISTRAR-LOCK ??? On Fri, 02 Jul 2004 18:46:08 +0800, pErCivaL <pma...@nt...> wrote: > > hi, > > good day to all. > > i have just visited the site (www.bloodshed.net), > but get this one displayed instead. > > www03.powweb.com > 66.152.98.13 > > hmm, is there something wrong with the site?? > > regards, > Pers > > ------------------------------------------------------- > This SF.Net email sponsored by Black Hat Briefings & Training. > Attend Black Hat Briefings & Training, Las Vegas July 24-29 - > digital self defense, top technical experts, no vendor pitches, > unmatched networking opportunities. Visit www.blackhat.com > _______________________________________________ > Dev-cpp-users mailing list > Dev...@li... > TO UNSUBSCRIBE: http://www23.brinkster.com/noicys/devcpp/ub.htm > https://lists.sourceforge.net/lists/listinfo/dev-cpp-users > -- Jesse Hallam University of Waterloo Freshman |
|
From: pErCivaL <pma...@nt...> - 2004-07-02 10:37:07
|
hi, good day to all. i have just visited the site (www.bloodshed.net), but get this one displayed instead. www03.powweb.com 66.152.98.13 hmm, is there something wrong with the site?? regards, Pers |
|
From: <or...@vp...> - 2004-07-02 09:47:33
|
at...@su... wrote: > well, use dev-cpp 4.9.8.10.(gcc version 3.2 (mingw special 20020817-1),= GNU > gdb 5.1.1 (mingw experimental)), > and I can't debugg it anymore, nothing will happen: GDB 5.1.1 is stone-aged. Try 6.0. -- Greetings, Bal=E1zs |
|
From: <at...@su...> - 2004-07-02 08:23:22
|
hi, little prehistory: worked with wx 2.4.2.(devpack), but an error in in wx forced me to build it (2.5.2.) my own. this was kind of amazing (-> http://lists.wxwidgets.org/cgi-bin/ezmlm-cgi?8:sss:62043:200407:idibmoffcimlnechjpko#b), and took me about 3 month, solved it by the linking params: H:\Programme\Debugger\Dev-Cpp\bin\g++.exe -D__DEBUG__ libase.o config.o lb_odbc.o LIBASE_private.res -o "libase.exe" -L"H:/Programme/Debugger/Dev-Cpp/lib" -L"H:/Programme/Debugger/Dev-Cpp/lib/gcc_lib" -mwindows -mthreads -Wl,--subsystem,windows -mwindows -lwxbase25d_odbc -l wxmsw25d_core -lwxbase25d -lwxtiffd -lwxjpegd -lwxpngd -lwxzlibd -lwxregexd -lwxexpatd -lkernel32 -luser32 -lg di32 -lcomdlg32 -lwinspool -lwinmm -lshell32 -lcomctl32 -lole32 -loleaut32 -luuid -lrpcrt4 -ladvapi32 -lwsock32 -l odbc32 -lgmon -pg -g3 -march=i686 -mmmx and cxx: -D__WXDEBUG__ -D__WXMSW__ -D __GNUWIN32__ well, use dev-cpp 4.9.8.10.(gcc version 3.2 (mingw special 20020817-1), GNU gdb 5.1.1 (mingw experimental)), and I can't debugg it anymore, nothing will happen: pre-promt (gdb) promt post_promt Reading symbols from :#path#\libase.exe...done. frames-invalid pre-promt (gdb) promt post_promt pre-promt (gdb) promt with it go's an error wether in wx or my app: 'Can't verify memory struct - all bets are off!', but I can debugg non wx apps, so I guess, the linking might be the problem. any ideas? cheers achim |
|
From: Per W. <pw...@ia...> - 2004-07-01 21:47:58
|
Run the command manually - or edit the make file - but specify *.o instead of listing all object files. I think 4k is the command line limit. /Per W On Thu, 1 Jul 2004, "Axel Buschh=FCter" wrote: > HI, > I whant to compile a dll project called Irrlicht. > It contains 111 file which all compiles right to object files. > But if dllwrap tries to link all object files together it stops with an > "Line Too Long" error !!! > My system is "Win2K-sp4", therefor the command line for dllwrap is to lon= g > for the system... > Even if I rename all files to the shortest possible names, the command li= ne > would be to long... > > How can I solve this problem ??? > Maybe there is a way to increase the length for the command line ??? > Or someone has another solution to this ??? > > CU, Acki > > -- > "Sie haben neue Mails!" - Die GMX Toolbar informiert Sie beim Surfen! > Jetzt aktivieren unter http://www.gmx.net/info > > > > ------------------------------------------------------- > This SF.Net email sponsored by Black Hat Briefings & Training. > Attend Black Hat Briefings & Training, Las Vegas July 24-29 - > digital self defense, top technical experts, no vendor pitches, > unmatched networking opportunities. Visit www.blackhat.com > _______________________________________________ > Dev-cpp-users mailing list > Dev...@li... > TO UNSUBSCRIBE: http://www23.brinkster.com/noicys/devcpp/ub.htm > https://lists.sourceforge.net/lists/listinfo/dev-cpp-users > |
|
From: <A_B...@gm...> - 2004-07-01 15:06:08
|
HI, I whant to compile a dll project called Irrlicht. It contains 111 file which all compiles right to object files. But if dllwrap tries to link all object files together it stops with an "Line Too Long" error !!! My system is "Win2K-sp4", therefor the command line for dllwrap is to long for the system... Even if I rename all files to the shortest possible names, the command line would be to long... How can I solve this problem ??? Maybe there is a way to increase the length for the command line ??? Or someone has another solution to this ??? CU, Acki -- "Sie haben neue Mails!" - Die GMX Toolbar informiert Sie beim Surfen! Jetzt aktivieren unter http://www.gmx.net/info |
|
From: Per W. <pw...@ia...> - 2004-07-01 11:10:00
|
Ah, I missed the info about no holes and request for smoothing.
Do you just want to hide the facettes of the flat triangles, or were you
interested in either replacing the triangles with fewer primitives, or
with primitives of higher orders - such as nurbs or bezier patches?
Anyway, a linked list is not a very good way of storing a triangle
geometry without holes in it. It is very, very expensive to locate
triangles sharing vertices or edges. You might look around for winged edge
structures, i.e. where you store edges and for each triangle keep
track of it's tree edges, and for each edge keep a pointer to
the two triangles sharing the edge. Then it is trivial to walk from
triangle to triangle when evaluating bumpines etc. Also, you will then
only need to store coordinate and normal information once for each
vertice, instead of the list which store everything six times on
average. My storing a vertex only once, it is also simpler to perform
"easing" of the geometry by filtering the vertices to reduce
high-frequency noise from a sampling process.
/Per W
On Thu, 1 Jul 2004 mi...@al... wrote:
> Hi Per,
> I am 'that' Michele that makes some strange questions, unsubscribed for
> a while...
> happy to meet again your attention.
>
> The polygons are triangles stored in a structure like this:
>
>
>
> struct element{
> float vertex[3][3];
> float normal[3][3];
> element *newElement;
> }
>
> in a 'record'.
>
> element *one,*start=NULL;
>
> //If a new triangle comes
> one=new element;
>
> one->vertex[0][0]=...
> ...
> one->element=start;
> start=one;
>
> There aren't holes in the geometry (for now), but I would like to smooth it.
> thanks.
>
>
>
>
> Da: pw...@ia...
> Data: Jul 1, 2004 11:43:20 AM
> A: mi...@al...
> Cc: dev...@li...
> Ogg: Re: [Dev-C++] polygon soup
>
> Might you give us a bit more information about the polygons - are they a
> ordered in a two-dimensional matrix? May they overlap in z order? Are
> there holes in the geometry?
>
>
>
>
|
|
From: Per W. <pw...@ia...> - 2004-07-01 10:57:26
|
In this case you store the triangles in a long list. However, you don't
mention if there are any geometric properties of the loaded trianges. Are
they completely random (in x, in y, in z, in size, in normal directions
etc), or is there some important geometric properties to make use of
when processing them?
What do you expect to get out of your work? A two-dimensional "blanket" of
z-values or are you trying to create the 3-dimensional (convex or
non-conves) of the triangles?
If the triangles are completely random and with not too large size
differences, an easy solution is to just perform ray-tracing - or actually
ray casting - without any perspective transform for the rays, i.e. all
rays parallel. A simple BSP tree - or maybe an octree - would allow quick
intersection tests by reducing number of triangles to test.
Scanline conversion might also be used to process the triangles. However
both scanline conversion and ray-tracing will generate a blanket of fixed
spacing - of course possible to postprocess later.
It is also possible to use space subdivision - such as BSP trees to
directly emit polygonals representing the blanket. If the original "soup"
of triangles have random z coordinates (or maybe "r" coordinates if this
is a problem in polar space) this will require a number of vertical
(radial) polygons to handle steps in the z (r) dimension.
/Per W
On Thu, 1 Jul 2004 mi...@al... wrote:
> Hi Per,
> I am 'that' Michele that makes some strange questions, unsubscribed for
> a while...
> happy to meet again your attention.
>
> The polygons are triangles stored in a structure like this:
>
>
>
> struct element{
> float vertex[3][3];
> float normal[3][3];
> element *newElement;
> }
>
> in a 'record'.
>
> element *one,*start=NULL;
>
> //If a new triangle comes
> one=new element;
>
> one->vertex[0][0]=...
> ...
> one->element=start;
> start=one;
>
> There aren't holes in the geometry (for now), but I would like to smooth it.
> thanks.
>
>
>
>
> Da: pw...@ia...
> Data: Jul 1, 2004 11:43:20 AM
> A: mi...@al...
> Cc: dev...@li...
> Ogg: Re: [Dev-C++] polygon soup
>
> Might you give us a bit more information about the polygons - are they a
> ordered in a two-dimensional matrix? May they overlap in z order? Are
> there holes in the geometry?
>
>
>
>
|
|
From: Andres R. <lo...@ho...> - 2004-07-01 10:42:07
|
Hi!
>
> struct element{
> float vertex[3][3];
> float normal[3][3];
> element *newElement;
> }
>
> in a 'record'.
>
> element *one,*start=NULL;
>
> //If a new triangle comes
> one=new element;
>
> one->vertex[0][0]=...
> ...
> one->element=start;
> start=one;
This is the case of what I call 'One Way Linked List'.
For example:
http://www.faqs.org/docs/thinkjava/chap14.htm
this is a Java, but you might get the idea
http://www.fortunecity.com/skyscraper/false/780/linklist.html
C++ linked list tutorial
http://richardbowles.tripod.com/cpp/linklist/linklist.htm
and another one
> There aren't holes in the geometry (for now), but I would like to smooth it.
Geometry itself does not affect that linked list, because every
element is one entity (independent of others).
Rendering it depends on the engine you use.
HTH, A.
|
|
From: <mi...@al...> - 2004-07-01 10:10:21
|
Hi Per,
I am 'that' Michele that makes some strange questions, unsubscribed for
a while...
happy to meet again your attention.
The polygons are triangles stored in a structure like this:
struct element{
float vertex[3][3];
float normal[3][3];
element *newElement;
}
in a 'record'.
element *one,*start=NULL;
//If a new triangle comes
one=new element;
one->vertex[0][0]=...
...
one->element=start;
start=one;
There aren't holes in the geometry (for now), but I would like to smooth it.
thanks.
Da: pw...@ia...
Data: Jul 1, 2004 11:43:20 AM
A: mi...@al...
Cc: dev...@li...
Ogg: Re: [Dev-C++] polygon soup
Might you give us a bit more information about the polygons - are they a
ordered in a two-dimensional matrix? May they overlap in z order? Are
there holes in the geometry?
|
|
From: Per W. <pw...@ia...> - 2004-07-01 09:43:37
|
Might you give us a bit more information about the polygons - are they a ordered in a two-dimensional matrix? May they overlap in z order? Are there holes in the geometry? /Per W On Thu, 1 Jul 2004 mi...@al... wrote: > Hello all, > I don't know if someone could help me: I'm searching informations about > reconstruction of topological informations from a polygon soup.... > > > Michele > > > ------------------------------------------------------- > This SF.Net email sponsored by Black Hat Briefings & Training. > Attend Black Hat Briefings & Training, Las Vegas July 24-29 - > digital self defense, top technical experts, no vendor pitches, > unmatched networking opportunities. Visit www.blackhat.com > _______________________________________________ > Dev-cpp-users mailing list > Dev...@li... > TO UNSUBSCRIBE: http://www23.brinkster.com/noicys/devcpp/ub.htm > https://lists.sourceforge.net/lists/listinfo/dev-cpp-users > |
|
From: <mi...@al...> - 2004-07-01 09:38:45
|
Hello all, I don't know if someone could help me: I'm searching informations about reconstruction of topological informations from a polygon soup.... Michele |
|
From: Koval V. <vk...@in...> - 2004-06-30 11:22:46
|
On 30 Jun 2004 14:19:59 +0530 "A.Bhuvaneswaran" <bh...@sy...> wrote: > I am new to windows. I am trying to read data from a binary file using > open, lseek & read system calls. But, read returns 0 bytes at certain > point, even though it has not reached the eof. > > For example, if the file size is 400k and if i try to read from 2k to > 300k, 1k at a time, read returns 0 (indicating eof, right ?) after > reading 51k. Past week I see this problem. Set option for open file O_BINARY. |
|
From: A.Bhuvaneswaran <bh...@sy...> - 2004-06-30 08:50:06
|
Hi, I am using win xp home edition. I am new to windows. I am trying to read data from a binary file using open, lseek & read system calls. But, read returns 0 bytes at certain point, even though it has not reached the eof. For example, if the file size is 400k and if i try to read from 2k to 300k, 1k at a time, read returns 0 (indicating eof, right ?) after reading 51k. I have tried the same code on gnu linux and it works perfect. Could you please let me know what am i doing wrong over here ? Googling and search in the archive does not help. TIA. I will be glad to submit repeatable tiny sample code, if required. --=20 Regards, A.Bhuvaneswaran |
|
From: <sud...@ya...> - 2004-06-30 04:05:20
|
Please unsubscribe me from this mailing list Sudhakar --- Nancy Alvarez <nai...@ho...> wrote: --------------------------------- Hi Some can say me why I was unsuscribe the list? I dont it. --------------------------------- MSN Amor Busca tu ½ naranja -------------------------------------------------------This SF.Net email sponsored by Black Hat Briefings & Training.Attend Black Hat Briefings & Training, Las Vegas July 24-29 - digital self defense, top technical experts, no vendor pitches, unmatched networking opportunities. Visit www.blackhat.com_______________________________________________Dev-cpp-users mailing lis...@li... UNSUBSCRIBE: http://www23.brinkster.com/noicys/devcpp/ub.htmhttps://lists.sourceforge.net/lists/listinfo/dev-cpp-users ________________________________________________________________________ Yahoo! India Matrimony: Find your partner online. http://yahoo.shaadi.com/india-matrimony/ |
|
From: <pe...@ti...> - 2004-06-29 13:27:59
|
I am a novice user with c++ can anyone explain how to use the linker corr= ectly after compiling my program thanks Pe...@ti... __________________________________________________ Broadband from an unbeatable =A315.99! http://www.tiscali.co.uk/products/broadband/home.html?code=3DSM-NL-11AM |
|
From: <ae_...@ya...> - 2004-06-29 12:50:17
|
Nancy:
One week ago, I stop to receive e-mails in my Hotmail address from the list. So, I unsubscribe my account and then I tried to subscribe again. But I couldn't.
Then, I subscribed my Yahoo! e-mail address. This work OK.
Greetings
Adrián E. Córdoba
Nancy Alvarez <nai...@ho...> wrote:
Hi
Someone can say me why I am get out of the list?. I don`t unsuscribe.
---------------------------------
Charla con tus amigos en línea mediante MSN Messenger: Haz clic aquí ------------------------------------------------------- This SF.Net email sponsored by Black Hat Briefings & Training. Attend Black Hat Briefings & Training, Las Vegas July 24-29 - digital self defense, top technical experts, no vendor pitches, unmatched networking opportunities. Visit www.blackhat.com _______________________________________________ Dev-cpp-users mailing list Dev...@li... TO UNSUBSCRIBE: http://www23.brinkster.com/noicys/devcpp/ub.htm https://lists.sourceforge.net/lists/listinfo/dev-cpp-users
---------------------------------
Internet gratis ¡y que funciona!
Tres nuevas ciudades con números locales:
Escobar, Zárate, Campana
Yahoo! Conexión
¿Qué esperás para navegar bien y rápido? |
|
From: <A_B...@gm...> - 2004-06-29 09:22:36
|
Please have a look to the examples folder of DevCpp. There should be an example for MySQL... CU, Acki THAMAE <m_t...@ya...> wrote: > Please help me, I have Downloaded and Installed MySQL-Devpack, (and MySQL > server) how do I proceed to make connections from my application to any of > these? > > Thanx in advance. > > Thamae -- +++ Jetzt WLAN-Router für alle DSL-Einsteiger und Wechsler +++ GMX DSL-Powertarife zudem 3 Monate gratis* http://www.gmx.net/dsl |
|
From: <co...@si...> - 2004-06-29 08:51:44
|
Hi! Is it possible add to code completion new feature - to prompt enum type when enum variable is set? Greetings, Collins |
|
From: Jesse H. <jes...@gm...> - 2004-06-29 02:50:28
|
O Jsbr s grr;omh yjsy rmh;odj ,su mpy nr jrt gotdy ;smhishr/// On Mon, 28 Jun 2004 21:11:34 -0400, David McKen <dml...@co...> wrote: > > Is that pig latin? I don't follow your train of thought. > > > Nancy Alvarez wrote: > > > Hi > > > > Someone can say me why I am get out of the list?. I don`t unsuscribe. > > ------------------------------------------------------- > This SF.Net email sponsored by Black Hat Briefings & Training. > Attend Black Hat Briefings & Training, Las Vegas July 24-29 - > digital self defense, top technical experts, no vendor pitches, > unmatched networking opportunities. Visit www.blackhat.com > _______________________________________________ > Dev-cpp-users mailing list > Dev...@li... > TO UNSUBSCRIBE: http://www23.brinkster.com/noicys/devcpp/ub.htm > https://lists.sourceforge.net/lists/listinfo/dev-cpp-users > -- Jesse Hallam University of Waterloo Freshman |