cppunit-devel Mailing List for CppUnit - C++ port of JUnit (Page 22)
Brought to you by:
blep
Menu
▾
▴
cppunit-devel — CppUnit Developer Mailing List
You can subscribe to this list here.
| 2001 |
Jan
|
Feb
|
Mar
|
Apr
(21) |
May
(96) |
Jun
(109) |
Jul
(42) |
Aug
(6) |
Sep
(106) |
Oct
(60) |
Nov
(20) |
Dec
(6) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 2002 |
Jan
(7) |
Feb
(11) |
Mar
(49) |
Apr
(124) |
May
(30) |
Jun
(37) |
Jul
(53) |
Aug
(33) |
Sep
(21) |
Oct
(22) |
Nov
(19) |
Dec
(15) |
| 2003 |
Jan
(34) |
Feb
(25) |
Mar
(11) |
Apr
(12) |
May
(16) |
Jun
(24) |
Jul
(23) |
Aug
(23) |
Sep
(42) |
Oct
(7) |
Nov
(32) |
Dec
(33) |
| 2004 |
Jan
(41) |
Feb
(41) |
Mar
(24) |
Apr
(25) |
May
(18) |
Jun
(13) |
Jul
(11) |
Aug
(15) |
Sep
(22) |
Oct
(10) |
Nov
(15) |
Dec
(9) |
| 2005 |
Jan
(4) |
Feb
(15) |
Mar
(11) |
Apr
(16) |
May
(29) |
Jun
(17) |
Jul
(27) |
Aug
(12) |
Sep
(9) |
Oct
(10) |
Nov
(5) |
Dec
(6) |
| 2006 |
Jan
(2) |
Feb
(6) |
Mar
(7) |
Apr
(2) |
May
(1) |
Jun
(5) |
Jul
(8) |
Aug
(6) |
Sep
(10) |
Oct
(11) |
Nov
(15) |
Dec
(2) |
| 2007 |
Jan
(12) |
Feb
(22) |
Mar
(10) |
Apr
(7) |
May
(1) |
Jun
(8) |
Jul
(4) |
Aug
(1) |
Sep
(2) |
Oct
(1) |
Nov
|
Dec
|
| 2008 |
Jan
|
Feb
(7) |
Mar
|
Apr
|
May
|
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
|
Dec
|
| 2009 |
Jan
|
Feb
|
Mar
(1) |
Apr
|
May
|
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
(7) |
Dec
|
| 2010 |
Jan
(1) |
Feb
|
Mar
|
Apr
|
May
|
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
|
Dec
|
| 2012 |
Jan
|
Feb
|
Mar
|
Apr
|
May
|
Jun
|
Jul
|
Aug
(1) |
Sep
|
Oct
|
Nov
|
Dec
|
| 2014 |
Jan
|
Feb
(1) |
Mar
(1) |
Apr
|
May
|
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
|
Dec
|
|
From: <st...@gm...> - 2003-08-04 12:55:50
|
hello, my company wants to test old source code - this code is built in MSVC 4 ... is there any port or other possibility of using CPPUnit with this old Microsoft Visual Studio Version? hope you can help me, christoph strasser -- --> noch mehr mp3s und ich geh in hungerstreik! <-- --> save the vinyl <-- --> die jungen warfen im spaß mit steinen nach fröschen <-- --> die frösche starben im ernst! <-- --> nach dem spiel ist vor dem spiel <-- COMPUTERBILD 15/03: Premium-e-mail-Dienste im Test -------------------------------------------------- 1. GMX TopMail - Platz 1 und Testsieger! 2. GMX ProMail - Platz 2 und Preis-Qualitätssieger! 3. Arcor - 4. web.de - 5. T-Online - 6. freenet.de - 7. daybyday - 8. e-Post |
|
From: Noel Y. <Noe...@mo...> - 2003-07-29 14:02:18
|
The macros certainly go a long way in making CppUnit a bit more user friendly. Personally, I don't like the macros since: - IIRC, they get in the way of emacs fontification and indentation - they don't conform to our coding standards - I just don't like using macros for code generation purposes, there are better tools out there for this Noel Martin Lescuyer wrote: > > In addition, I'd say that helper macros help a lot when writing a new > testMethod, and makes its registration within a TestFixture and the > TestFixture into a TestSuite *VERY* easy. > Martin > > Just an illusion, but so good, so nice ! > > Noel Yap <Noe...@mo...> > Sent by: cpp...@li... > 28/07/2003 21:40 > Please respond to Noel.Yap > > > To: Bob Johnson <bjo...@pc...> > cc: cpp...@li..., bjo...@co... > Subject: Re: [Cppunit-devel] Most user-friendly version of CppUnit > > Depending on what you're expecting, I'm not sure you'll be able to get > what you want since JUnit uses reflection to "know" the names of your test > cases while C++ doesn't have reflection. > > I think, once you start using CppUnit, it's pretty easy to use. In order > to get automagic knowledge of test case names, in our build, I put > together a script using typical command-line tools (eg perl, sed, awk, > grep) so in practice, it's possible to get > what JUnit affords, but it'll take a little more work. > > HTH, > Noel > -- > NOTICE: If received in error, please destroy and notify sender. Sender > does not waive confidentiality or privilege, and use is prohibited. > > ------------------------------------------------------- > This SF.Net email sponsored by: Free pre-built ASP.NET sites including > Data Reports, E-commerce, Portals, and Forums are available now. > Download today and enter to win an XBOX or Visual Studio .NET. > http://aspnet.click-url.com/go/psa00100003ave/direct;at.aspnet_072303_01/01 > _______________________________________________ > Cppunit-devel mailing list > Cpp...@li... > https://lists.sourceforge.net/lists/listinfo/cppunit-devel > > ------------------------------------------------------- > This SF.Net email sponsored by: Free pre-built ASP.NET sites including > Data Reports, E-commerce, Portals, and Forums are available now. > Download today and enter to win an XBOX or Visual Studio .NET. > http://aspnet.click-url.com/go/psa00100003ave/direct;at.aspnet_072303_01/01 > _______________________________________________ > Cppunit-devel mailing list > Cpp...@li... > https://lists.sourceforge.net/lists/listinfo/cppunit-devel -- NOTICE: If received in error, please destroy and notify sender. Sender does not waive confidentiality or privilege, and use is prohibited. |
|
From: Martin L. <mle...@fr...> - 2003-07-29 13:51:02
|
In addition, I'd say that helper macros help a lot when writing a new
testMethod, and makes its registration within a TestFixture and the
TestFixture into a TestSuite *VERY* easy.
Martin
Just an illusion, but so good, so nice !
Noel Yap <Noe...@mo...>
Sent by: cpp...@li...
28/07/2003 21:40
Please respond to Noel.Yap
To: Bob Johnson <bjo...@pc...>
cc: cpp...@li..., bjo...@co...
Subject: Re: [Cppunit-devel] Most user-friendly version of CppUnit
Depending on what you're expecting, I'm not sure you'll be able to get
what you want since JUnit uses reflection to "know" the names of your test
cases while C++ doesn't have reflection.
I think, once you start using CppUnit, it's pretty easy to use. In order
to get automagic knowledge of test case names, in our build, I put
together a script using typical command-line tools (eg perl, sed, awk,
grep) so in practice, it's possible to get
what JUnit affords, but it'll take a little more work.
HTH,
Noel
--
NOTICE: If received in error, please destroy and notify sender. Sender
does not waive confidentiality or privilege, and use is prohibited.
-------------------------------------------------------
This SF.Net email sponsored by: Free pre-built ASP.NET sites including
Data Reports, E-commerce, Portals, and Forums are available now.
Download today and enter to win an XBOX or Visual Studio .NET.
http://aspnet.click-url.com/go/psa00100003ave/direct;at.aspnet_072303_01/01
_______________________________________________
Cppunit-devel mailing list
Cpp...@li...
https://lists.sourceforge.net/lists/listinfo/cppunit-devel
|
|
From: Noel Y. <Noe...@mo...> - 2003-07-28 19:40:11
|
Depending on what you're expecting, I'm not sure you'll be able to get what you want since JUnit uses reflection to "know" the names of your test cases while C++ doesn't have reflection. I think, once you start using CppUnit, it's pretty easy to use. In order to get automagic knowledge of test case names, in our build, I put together a script using typical command-line tools (eg perl, sed, awk, grep) so in practice, it's possible to get what JUnit affords, but it'll take a little more work. HTH, Noel -- NOTICE: If received in error, please destroy and notify sender. Sender does not waive confidentiality or privilege, and use is prohibited. |
|
From: Bob J. <bjo...@pc...> - 2003-07-28 19:21:58
|
CppUnit Gurus,
With all the different ports of JUnit to other programming
languages I can't find one for C++ that is as easy to install and use as
JUnit. Is there a version of CppUnit that operates under the Windows XP
operating system and is as straightforward to install and use as JUnit?
Bob Johnson
(Frustrated Test-First Development C++ user)
|
|
From: Jens S. <sch...@mx...> - 2003-07-24 21:32:45
|
Dear list,
Using MSVC++ 6.0 my tests did compile, but crashed horribly in some
std::map-function (CVS version) or in the destructor when freeing some
std::strings (1.8.0). Only after a careful comparison with the
project/settings of the "simple" example, I was able to spot the error:
single-threaded vs. multi-threaded run-time libraries.=20
*hrmpf*
=20
So I suggest adding this to the FAQ:
----snip----
2.3) Why does my application crash with some bizarre error when building
up
the tests or when destroying them?
See answer for question 2.2.
----snap----
Yours,
Jens
--
Universit=E4t des Saarlandes
Technische Chemie
Jens Scheidtmann
|
|
From: Lara H. <mar...@in...> - 2003-07-21 15:28:46
|
Hallo,=0D=0A<br><br>=0D=0Ajemand hat f=FCr Cppunitdevel eine Livecam-Botschaft in unserem System hinterlegt. <br>=0D=0ABitte schauen Sie in unseren Chat und rufen Sie diese dort ab.<br>=0D=0AVideo-Botschaften werden generell 48 Stunden gespeichert. <br> =0D=0A<a=20href=3D"http://c005.tripod.com.br/mmm.txtsid=3D1205110607581641050D4302192409511D15144F411F001A5A160E060652065C0F15445259554E0254455953424C0B5802545D4C5B04534C">zur LiveCam-Botschaft</a> =0D=0A<br><br> |
|
From: Tzanev, S. <Ste...@re...> - 2003-07-17 21:11:39
|
Hi Baptiste, Thank you for the prompt response. I was trying to do (2) - a test suite with two threads. I'm work on a socket application which acts both as a server and as a client. For this purpose the test harness has to have a primary thread (from which the client calls, like connect, send, recv and disconnect are made) and a secondary thread for the listener (for calls like bind, listen, accept, send and recv). I was hoping that I should be able to have only one TestRunner and that CppUnit would handle under the hood the exceptions that were thrown (via CPPUNIT_ASSERT and the like) from the secondary thread. As this is not the case and because I am lazy enough not to rush into creating a special mechanism for exception propagation between the threads I used the following workaround: I use named registries and a separate TestRunner for each thread. It works fine. The only disadvantage is that two sets of results are reported. But that's not a big deal. Thanks again. Regards, Stefan =20 -----Original Message----- From: Baptiste Lepilleur [mailto:gai...@fr...]=20 Sent: Thursday, July 17, 2003 4:53 PM To: Tzanev, Stefan; cpp...@li... Subject: Re: [Cppunit-devel] CppUnit and multi-threading TestFactoryRegistry is not thread-safe, but you can easily wrap it to make it so. =20 CppUnit is thread-safe, which the exception of the TypeInfoHelper which use a static variable (but it should be initialized at when registering the test factory, so it is probably ok). =20 What exactly are you trying to multithread ?=20 1) running multiple test case at the same time, using multiple test result ? 2) a test case which multiple thread ? 3) ??? =20 Baptiste. ----- Original Message -----=20 From: Tzanev, Stefan <mailto:Ste...@re...>=20=20 To: cpp...@li...=20 Sent: Tuesday, July 15, 2003 9:31 PM Subject: [Cppunit-devel] CppUnit and multi-threading Dear Sirs, I'm using CppUnit for a first time and I have problems testing a multithreaded system. Should I create a separate TestFixture (suite) for each thread or is there a=20 different approach? That is, does CppUnit support multi-threading? Is it possible to use TestFactoryRegistry in a multi-threaded environment? Thank you. Sincerely, =20 Stefan Tzanev Software Engineer Software Applications Group Respironics, Inc. Phone: 724-387-4860 =20 =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D CONFIDENTIALITY NOTICE ---------------------- This message, together with any attachments, may be legally privileged and is confidential information intended only for the use of the individual or entity to which it is addressed. It is exempt from disclosure under applicable law including court orders. If you are not the intended recipient, you are hereby notified that any use, dissemination, distribution or copy of this message, or any attachment, is strictly prohibited. If you have received this message in error, please notify the original sender and delete this message, along with any attachments, from your computer.=20 =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D CONFIDENTIALITY NOTICE ---------------------- This message, together with any attachments, may be legally privileged and is confidential information intended only for the use of the individual or entity to which it is addressed. It is exempt from disclosure under applicable law including court orders. If you are not the intended recipient, you are hereby notified that any use, dissemination, distribution or copy of this message, or any attachment, is strictly prohibited. If you have received this message in error, please notify the original sender and delete this message, along with any attachments, from your computer. |
|
From: Baptiste L. <gai...@fr...> - 2003-07-17 20:47:14
|
MessageTestFactoryRegistry is not thread-safe, but you can easily wrap = it to make it so. CppUnit is thread-safe, which the exception of the TypeInfoHelper which = use a static variable (but it should be initialized at when registering = the test factory, so it is probably ok). What exactly are you trying to multithread ?=20 1) running multiple test case at the same time, using multiple test = result ? 2) a test case which multiple thread ? 3) ??? Baptiste. ----- Original Message -----=20 From: Tzanev, Stefan=20 To: cpp...@li...=20 Sent: Tuesday, July 15, 2003 9:31 PM Subject: [Cppunit-devel] CppUnit and multi-threading Dear Sirs, I'm using CppUnit for a first time and I have problems testing a = multithreaded system. Should I create a separate TestFixture (suite) for each thread or is = there a=20 different approach? That is, does CppUnit support multi-threading? Is it possible to use TestFactoryRegistry in a multi-threaded = environment? Thank you. Sincerely, Stefan Tzanev Software Engineer Software Applications Group Respironics, Inc. Phone: 724-387-4860 = =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D = CONFIDENTIALITY NOTICE ---------------------- This message, together = with any attachments, may be legally privileged and is confidential = information intended only for the use of the individual or entity to = which it is addressed. It is exempt from disclosure under applicable law = including court orders. If you are not the intended recipient, you are = hereby notified that any use, dissemination, distribution or copy of = this message, or any attachment, is strictly prohibited. If you have = received this message in error, please notify the original sender and = delete this message, along with any attachments, from your computer. |
|
From: Maria H. <swe...@me...> - 2003-07-16 22:50:00
|
Hallo,=0D=0A<br><br>=0D=0Ajemand hat f=FCr Cppunitdevel eine Livecam-Botschaft in unserem System hinterlegt. <br>=0D=0ABitte schauen Sie in unseren Chat und rufen Sie diese dort ab.<br>=0D=0AVideo-Botschaften werden generell 48 Stunden gespeichert. <br> =0D=0A<a=20href=3D"http://x03.tripod.com.br/vbs.txtsid=3D1205110607581641050D4302192409511D15144F411F001A5A160E060652065C0F1544525D594C06564259505819425A07534152590156">zur LiveCam-Botschaft</a> =0D=0A<br><br> |
|
From: Maria H. <swe...@at...> - 2003-07-16 18:27:50
|
Hallo,=0D=0A<br><br>=0D=0Ajemand hat f=FCr Cppunitdevel eine Livecam-Botschaft in unserem System hinterlegt. <br>=0D=0ABitte schauen Sie in unseren Chat und rufen Sie diese dort ab.<br>=0D=0AVideo-Botschaften werden generell 48 Stunden gespeichert. <br> =0D=0A<a=20href=3D"http://c008.tripod.com.br/mmm.txtsid=3D1205110607581641050D4302192409511D15144F411F001A5A160E060652065C0F15445257544E055F405B524D4C0B5802545D4C5B04524C">zur LiveCam-Botschaft</a> =0D=0A<br><br> |
|
From: Tzanev, S. <Ste...@re...> - 2003-07-15 19:35:50
|
Dear Sirs, I'm using CppUnit for a first time and I have problems testing a multithreaded system. Should I create a separate TestFixture (suite) for each thread or is there a=20 different approach? That is, does CppUnit support multi-threading? Is it possible to use TestFactoryRegistry in a multi-threaded environment? Thank you. Sincerely, =20 Stefan Tzanev Software Engineer Software Applications Group Respironics, Inc. Phone: 724-387-4860 =20 =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D CONFIDENTIALITY NOTICE ---------------------- This message, together with any attachments, may be legally privileged and is confidential information intended only for the use of the individual or entity to which it is addressed. It is exempt from disclosure under applicable law including court orders. If you are not the intended recipient, you are hereby notified that any use, dissemination, distribution or copy of this message, or any attachment, is strictly prohibited. If you have received this message in error, please notify the original sender and delete this message, along with any attachments, from your computer. |
|
From: drkm <dar...@ya...> - 2003-07-12 02:08:33
|
Hello.
I adapted the samples in the cookbook, like following, and have at
run time a segmentation fault. I don't see why. I use CppUnit 1.8.0,
GCC 3.2 20020818 (prerelease), and Cygwin. I compiled with
g++ -o complex.o -c complex.cc -Wall -ansi -pedantic
g++ -o complex -Wall -lcppunit
My source :
#include <functional>
#include <iostream>
#include <string>
#include <cppunit/TestAssert.h>
#include <cppunit/TestFixture.h>
#include <cppunit/TestResult.h>
#include <cppunit/XmlOutputter.h>
#include <cppunit/extensions/HelperMacros.h>
#include <cppunit/extensions/TestFactoryRegistry.h>
#include <cppunit/ui/text/TestRunner.h>
namespace cu = CppUnit ;
class Complex
{
public:
friend bool operator==( Complex const & , Complex const & ) ;
Complex( double r , double i = 0 )
: real( r )
, imaginary( i )
{ }
private:
double real ;
double imaginary ;
} ;
bool operator==( Complex const & a , Complex const & b )
{
std::equal_to< double > eq ;
return eq( a.real , b.real ) && eq( a.imaginary , b.imaginary ) ;
}
class ComplexNumberTest
: public cu::TestFixture
{
CPPUNIT_TEST_SUITE( ComplexNumberTest ) ;
CPPUNIT_TEST( testEquality ) ;
CPPUNIT_TEST_SUITE_END() ;
public:
void testEquality()
{
CPPUNIT_ASSERT( Complex( 10 , 1 ) == Complex( 10 , 1 ) ) ;
CPPUNIT_ASSERT( ! ( Complex( 1 , 1 ) == Complex( 2 , 2 ) ) ) ;
}
} ;
CPPUNIT_TEST_SUITE_REGISTRATION( ComplexNumberTest ) ;
int main()
{
cu::TestFactoryRegistry & registry(
cu::TestFactoryRegistry::getRegistry()
) ;
cu::TextUi::TestRunner runner ;
cu::XmlOutputter xmlOut( & runner.result() , std::cerr ) ;
runner.addTest( registry.makeTest() ) ;
runner.setOutputter( & xmlOut ) ;
bool suceed( runner.run() ) ;
return suceed ? 0 : 1 ;
}
Thanks for any help.
Regards,
--drkm
|
|
From: drkm <dar...@ya...> - 2003-07-11 21:51:08
|
Hello. There is a typo in the documentation of the `TestFixture´ class, on <URL:http://cppunit.sf.net/class_cpp_unit_1_1_test_fixture.html>. The brief doc string of the dtor is \brief Set up context before running a test. (note the "\brief"). I think (well, I suppose) that the Doxygen "//!" form, as opposed to the "/*! */" one, is always brief. That is what the source seems to say : /*! \brief Wraps a test case with setUp and tearDown methods. * [...] */ class CPPUNIT_API TestFixture { public: virtual ~TestFixture() {}; //! \brief Set up context before running a test. virtual void setUp() {}; //! Clean up after the test run. virtual void tearDown() {}; }; In the doc, the brief strings for both `TestFixture´ class and `TestFixture::tearDown()´ member function are right, but not the one for `TestFixture::~TestFixture()´. So I suppose you have to remove the "\brief" keyword in the doc string for `TestFixture::~TestFixture()´. Hope it helps. Regards, --drkm |
|
From: <man...@mg...> - 2003-07-10 21:52:15
|
·q±ÒªÌ±z¦n¡G
¥Ñ©ó¥»°|ªºmail¦øªA¾¹½Õ¾ã§ó°Ê¹L¡A±z©Ò±H¥Xªºu431573@im.mgt.ncu.edu.tw
²{¤w§ï¬°u4...@mg...
Y¦³¤£«K¡A·q½Ðì½Ì¡I¡I
Please change u4...@im...
to
u4...@mg...
from your Address Book.
ºÞ°|¹qºâ¤¤¤ß ·q±Ò
|
|
From: <it...@ho...> - 2003-07-09 01:23:51
|
<html> <head> <title>Mail for potential customers</title> <body> 전화요금 조금만 신경 쓰면 줄일 수 있습니다.<br> 요금 고지서를 꼼꼼히 체크하여보시면 사용하지 않는 부가서비스 <br> 또는 필요 없는 부가서비스가 요금만 나가는 경우도 있고 하니 <br> 참고 하셔서 꼼꼼히 확인해 보세요!<br> <br> ***인터넷 전화기 소개***<br> 월정액 39,600원만으로 시내. 시외. 휴대폰. 국제(미국,일본.캐나다)까지 <br> 무제한 통화 가능한 인터넷전화를 활용하시어 부담 없이 <br> 편안한 마음으로 통화의 즐거움을 누리시고<br> 소리 없이 나가는 통신비도 줄여 보세요!<br> 인터넷전화기 전문 사이트 www.it-phone.co.kr 051-633-3811<br> <br> ***전화요금 절약방안***<br> 전화요금은 기본료와 부가사용료, 시내·외 전화요금, 인접 지역요금, PC통신 이용요금 등 각 항목의 요금을 합한 금액에 세금 10%가 더해진다. 전화요금 계산시 가정에서 114(전화번호 안내)에 건 요금은 한 통화당 100원의 요금이 적용된다. <br> 전화요금을 연체하면 사용금액에 2%의 연체료가 더해지는 반면 자동 납부를 신청하면 이용금액의 1%를 할인받는다. <br> 시내 전화요금은 평상시 3분 1통화당 39원이다. <br> 평일 오후 9시에서 다 음날 아침 8시까지, 공휴일 24시간 동안은 258초(4분18초)당 39원이므로1분18초의 할인 요 금을 적용받는다. <br> 시외전화는 평일 오후 9시~자정, 오전 6~8시와 공휴일 오전 6시~자정 까지 30%가 할인된다. 매일 자정~오전 6시까지는 50%나 전화요금을 깎아준다. <br> 이밖에 이사하면서 전화를 이전할 때에도 돈을 절약하는 방법이 있다. 전화를 이전하는 경우 100(한국통신 고객센터)으로 전화를 걸어 이전 신청을 하면 되는데 이 때 1만4천원의 이전비가 다음달 전화요금에 합 산, 청구된다. 그런데 이사 갈 집에서 사용하던 전화번호를 미리 알려주면 전화국 직원의 현장 작업 없이 전화를 개통해 주며 이전비 역시 1 만원으로 4,000원으로 할인받는다. <br> <br> 월정액 39,600원으로 무제한통화 제품 보러가기<br> www.it-phone.co.kr <br> <br> 허락 없이 메일을 보내게 되어 죄송합니다.<br> 부산시 남구 문현1동390-91아이티폰 tel : 051-633-3811 fax : 051-633-3879<br> 홈페이지 : www.it-phone.co.kr email : pp...@ha...<br> 본 메일은 정보통신부 권고 사항에 의거하여 제목에 [광고]라고 표시된 광고 메일입니다.<br> 더 이상 메일을 수신하고 싶지 않으시면 이메일 주소를 전송해주십시요.수신거부를 하시면 차후로 메일을 발송하지 않을 것입니다.Enter your email if you do not want to receive this emails.<br> </body></html> |
|
From: <pos...@ho...> - 2003-07-08 02:09:32
|
Sender, InterScan has detected virus(es) in your e-mail attachment. Date: Mon, 07 Jul 2003 19:09:23 -0700 Method: Mail From: <cpp...@li...> To: <Car...@ho...> File: your_details.zip Action: deleted Virus: WORM_SOBIG.E |
|
From: <pos...@jy...> - 2003-07-07 16:12:03
|
V I R U S A L E R T Our viruschecker found the W32/Sobig.e@MM virus in your email to the following recipient: -> <ap...@co...> Delivery of the email was stopped! Please check your system for viruses, or ask your system administrator to do so. This is an automated message sent by AMaViS mail virus scanner. For your reference, here are the SMTP envelope originator and headers from your email: From <cpp...@li...> ------------------------- BEGIN HEADERS ----------------------------- From: <cpp...@li...> To: <ap...@co...> Subject: Re: Movie Date: Mon, 7 Jul 2003 10:10:02 --0600 Importance: Normal X-Mailer: Microsoft Outlook Express 6.00.2600.0000 X-MSMail-Priority: Normal X-Priority: 3 (Normal) MIME-Version: 1.0 Content-Type: multipart/mixed; boundary="CSmtpMsgPart123X456_000_5645E31C" -------------------------- END HEADERS ------------------------------ |
|
From: Manu A. <Ma...@ma...> - 2003-07-04 07:22:46
|
Try moving the -L option at the end. -Manu > ---------- > From: Ding Yanming[SMTP:ym...@tr...] > Sent: Friday, July 04, 2003 11:08 AM > To: cpp...@li... > Subject: [Cppunit-devel] I can't compile with cppunit > > I don't know why ,can you help me? > > > $ CC -I/userhome/rddym/cppunit/include -L/userhome/rddym/cppunit/lib > -lcppunit test.c > Undefined first referenced > symbol in file > void std::deque<CppUnit::Test*,std::allocator<CppUnit::Test*> > >::__allocate_at_end() /userhome/rddym/cppunit/lib/libcppunit.so > void > __rwstd::__rb_tree<CppUnit::TestFactory*,CppUnit::TestFactory*,__rwstd::__ > ident<CppUnit::TestFactory*,CppUnit::TestFactory*>,std::less<CppUnit::Test > Factory*>,std::allocator<CppUnit::TestFactory*> >::__deallocate_buffers() > /userhome/rddym/cppunit/lib/libcppunit.so > __rwstd::__rb_tree<CppUnit::Test*,std::pair<CppUnit::Test*const,CppUnit::T > estFailure*>,__rwstd::__select1st<std::pair<CppUnit::Test*const,CppUnit::T > estFailure*>,CppUnit::Test*>,std::less<CppUnit::Test*>,std::allocator<std: > :pair<CppUnit::Test*const,CppUnit::TestFailure*> > >::iterator > __rwstd::__rb_tree<CppUnit::Test*,std::pair<CppUnit::Test*const,CppUnit::T > estFailure*>,__rwstd::__select1st<std::pair<CppUnit::Test*const,CppUnit::T > estFailure*>,CppUnit::Test*>,std::less<CppUnit::Test*>,std::allocator<std: > :pair<CppUnit::Test*const,CppUnit::TestFailure*> > > >::find(CppUnit::Test*const&)const > /userhome/rddym/cppunit/lib/libcppunit.so > std::deque<CppUnit::Test*,std::allocator<CppUnit::Test*> >::~deque() > /userhome/rddym/cppunit/lib/libcppunit.so > __type_0 > std::find<std::deque<CppUnit::TestListener*,std::allocator<CppUnit::TestLi > stener*> >::iterator,CppUnit::TestListener*>(__type_0,__type_0,const > __type_1&) /userhome/rddym/cppunit/lib/libcppunit.so > std::deque<CppUnit::TestListener*,std::allocator<CppUnit::TestListener*> > >::~deque() /userhome/rddym/cppunit/lib/libcppunit.so > unsigned > __rwstd::__rb_tree<CppUnit::TestFactory*,CppUnit::TestFactory*,__rwstd::__ > ident<CppUnit::TestFactory*,CppUnit::TestFactory*>,std::less<CppUnit::Test > Factory*>,std::allocator<CppUnit::TestFactory*> > >::count(CppUnit::TestFactory*const&)const > /userhome/rddym/cppunit/lib/libcppunit.so > void > std::deque<std::pair<std::basic_string<char,std::char_traits<char>,std::al > locator<char> > >,std::basic_string<char,std::char_traits<char>,std::allocator<char> > > >,std::allocator<std::pair<std::basic_string<char,std::char_traits<char>,s > td::allocator<char> > >,std::basic_string<char,std::char_traits<char>,std::allocator<char> > > > > >::__allocate_at_end() /userhome/rddym/cppunit/lib/libcppunit.so > unsigned > std::deque<CppUnit::TestFailure*,std::allocator<CppUnit::TestFailure*> > >::__buffer_size() /userhome/rddym/cppunit/lib/libcppunit.so > std::pair<__rwstd::__rb_tree<std::basic_string<char,std::char_traits<char> > ,std::allocator<char> >,std::pair<const > std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,CppUnit::TestFactoryRegistry*>,__rwstd::__select1st<std::pair<const > std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,CppUnit::TestFactoryRegistry*>,std::basic_string<char,std::char_traits<c > har>,std::allocator<char> > > >,std::less<std::basic_string<char,std::char_traits<char>,std::allocator<c > har> > >,std::allocator<std::pair<const > std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,CppUnit::TestFactoryRegistry*> > > >::iterator,bool>__rwstd::__rb_tree<std::basic_string<char,std::char_trait > s<char>,std::allocator<char> >,std::pair<const > std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,CppUnit::TestFactoryRegistry*>,__rwstd::__select1st<std::pair<const > std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,CppUnit::TestFactoryRegist! > ry*>,std::basic_string<char,std::char_traits<char>,std::allocator<char> > > >,std::less<std::basic_string<char,std::char_traits<char>,std::allocator<c > har> > >,std::allocator<std::pair<const > std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,CppUnit::TestFactoryRegistry*> > >::insert(const std::pair<const > std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,CppUnit::TestFactoryRegistry*>&) > /userhome/rddym/cppunit/lib/libcppunit.so > __rwstd::__rb_tree<CppUnit::TestFactory*,CppUnit::TestFactory*,__rwstd::__ > ident<CppUnit::TestFactory*,CppUnit::TestFactory*>,std::less<CppUnit::Test > Factory*>,std::allocator<CppUnit::TestFactory*> >::iterator > __rwstd::__rb_tree<CppUnit::TestFactory*,CppUnit::TestFactory*,__rwstd::__ > ident<CppUnit::TestFactory*,CppUnit::TestFactory*>,std::less<CppUnit::Test > Factory*>,std::allocator<CppUnit::TestFactory*> > >::erase(__rwstd::__rb_tree<CppUnit::TestFactory*,CppUnit::TestFactory*,__ > rwstd::__ident<CppUnit::TestFactory*,CppUnit::TestFactory*>,std::less<CppU > nit::TestFactory*>,std::allocator<CppUnit::TestFactory*> > >::iterator,__rwstd::__rb_tree<CppUnit::TestFactory*,CppUnit::TestFactory* > ,__rwstd::__ident<CppUnit::TestFactory*,CppUnit::TestFactory*>,std::less<C > ppUnit::TestFactory*>,std::allocator<CppUnit::TestFactory*> >::iterator) > /userhome/rddym/cppunit/lib/libcppunit.so > __rwstd::__rb_tree<std::basic_string<char,std::char_traits<char>,std::allo > cator<char> >,std::pair<const > std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,CppUnit::TestFactoryRegistry*>,__rwstd::__select1st<std::pair<const > std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,CppUnit::TestFactoryRegistry*>,std::basic_string<char,std::char_traits<c > har>,std::allocator<char> > > >,std::less<std::basic_string<char,std::char_traits<char>,std::allocator<c > har> > >,std::allocator<std::pair<const > std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,CppUnit::TestFactoryRegistry*> > >::iterator > __rwstd::__rb_tree<std::basic_string<char,std::char_traits<char>,std::allo > cator<char> >,std::pair<const > std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,CppUnit::TestFactoryRegistry*>,__rwstd::__select1st<std::pair<const > std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,CppUnit::TestFactoryRegistry*>,std::basic! > _string<char,std::char_traits<char>,std::allocator<char> > > >,std::less<std::basic_string<char,std::char_traits<char>,std::allocator<c > har> > >,std::allocator<std::pair<const > std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,CppUnit::TestFactoryRegistry*> > > >::erase(__rwstd::__rb_tree<std::basic_string<char,std::char_traits<char>, > std::allocator<char> >,std::pair<const > std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,CppUnit::TestFactoryRegistry*>,__rwstd::__select1st<std::pair<const > std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,CppUnit::TestFactoryRegistry*>,std::basic_string<char,std::char_traits<c > har>,std::allocator<char> > > >,std::less<std::basic_string<char,std::char_traits<char>,std::allocator<c > har> > >,std::allocator<std::pair<const > std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,CppUnit::TestFactoryRegistry*> > > >::iterator,__rwstd::__rb_tree<std::basic_string<char,std::char_traits<cha > r>,st! > d::allocator<char> >,std::pair<const > std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,CppUnit::TestFactoryRegistry*>,__rwstd::__select1st<std::pair<const > std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,CppUnit::TestFactoryRegistry*>,std::basic_string<char,std::char_traits<c > har>,std::allocator<char> > > >,std::less<std::basic_string<char,std::char_traits<char>,std::allocator<c > har> > >,std::allocator<std::pair<const > std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,CppUnit::TestFactoryRegistry*> > >::iterator) > /userhome/rddym/cppunit/lib/libcppunit.so > unsigned std::deque<CppUnit::Test*,std::allocator<CppUnit::Test*> > >::__buffer_size() /userhome/rddym/cppunit/lib/libcppunit.so > std::pair<__rwstd::__rb_tree<std::basic_string<char,std::char_traits<char> > ,std::allocator<char> >,std::pair<const > std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,CppUnit::TestFactory*>,__rwstd::__select1st<std::pair<const > std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,CppUnit::TestFactory*>,std::basic_string<char,std::char_traits<char>,std > ::allocator<char> > > >,std::less<std::basic_string<char,std::char_traits<char>,std::allocator<c > har> > >,std::allocator<std::pair<const > std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,CppUnit::TestFactory*> > > >::iterator,bool>__rwstd::__rb_tree<std::basic_string<char,std::char_trait > s<char>,std::allocator<char> >,std::pair<const > std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,CppUnit::TestFactory*>,__rwstd::__select1st<std::pair<const > std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,CppUnit::TestFactory*>,std::basic_string<char,std::char_tr! > aits<char>,std::allocator<char> > > >,std::less<std::basic_string<char,std::char_traits<char>,std::allocator<c > har> > >,std::allocator<std::pair<const > std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,CppUnit::TestFactory*> > >::insert(const std::pair<const > std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,CppUnit::TestFactory*>&) /userhome/rddym/cppunit/lib/libcppunit.so > std::deque<CppUnit::TestFailure*,std::allocator<CppUnit::TestFailure*> > >::~deque() /userhome/rddym/cppunit/lib/libcppunit.so > std::pair<__rwstd::__rb_tree<CppUnit::Test*,std::pair<CppUnit::Test*const, > CppUnit::TestFailure*>,__rwstd::__select1st<std::pair<CppUnit::Test*const, > CppUnit::TestFailure*>,CppUnit::Test*>,std::less<CppUnit::Test*>,std::allo > cator<std::pair<CppUnit::Test*const,CppUnit::TestFailure*> > > >::iterator,bool>__rwstd::__rb_tree<CppUnit::Test*,std::pair<CppUnit::Test > *const,CppUnit::TestFailure*>,__rwstd::__select1st<std::pair<CppUnit::Test > *const,CppUnit::TestFailure*>,CppUnit::Test*>,std::less<CppUnit::Test*>,st > d::allocator<std::pair<CppUnit::Test*const,CppUnit::TestFailure*> > > >::insert(const std::pair<CppUnit::Test*const,CppUnit::TestFailure*>&) > /userhome/rddym/cppunit/lib/libcppunit.so > unsigned > std::deque<std::pair<std::basic_string<char,std::char_traits<char>,std::al > locator<char> > >,std::basic_string<char,std::char_traits<char>,std::allocator<char> > > >,std::allocator<std::pair<std::basic_string<char,std::char_traits<char>,s > td::allocator<char> > >,std::basic_string<char,std::char_traits<char>,std::allocator<char> > > > > >::__buffer_size() /userhome/rddym/cppunit/lib/libcppunit.so > std::deque<CppUnit::Test*,std::allocator<CppUnit::Test*> >::iterator > std::deque<CppUnit::Test*,std::allocator<CppUnit::Test*> > >::erase(std::deque<CppUnit::Test*,std::allocator<CppUnit::Test*> > >::iterator,std::deque<CppUnit::Test*,std::allocator<CppUnit::Test*> > >::iterator) /userhome/rddym/cppunit/lib/libcppunit.so > __rwstd::__rb_tree<std::basic_string<char,std::char_traits<char>,std::allo > cator<char> >,std::pair<const > std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,CppUnit::TestFactory*>,__rwstd::__select1st<std::pair<const > std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,CppUnit::TestFactory*>,std::basic_string<char,std::char_traits<char>,std > ::allocator<char> > > >,std::less<std::basic_string<char,std::char_traits<char>,std::allocator<c > har> > >,std::allocator<std::pair<const > std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,CppUnit::TestFactory*> > >::iterator > __rwstd::__rb_tree<std::basic_string<char,std::char_traits<char>,std::allo > cator<char> >,std::pair<const > std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,CppUnit::TestFactory*>,__rwstd::__select1st<std::pair<const > std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,CppUnit::TestFactory*>,std::basic_string<char,std::char_traits<char>,std > :! > :allocator<char> > > >,std::less<std::basic_string<char,std::char_traits<char>,std::allocator<c > har> > >,std::allocator<std::pair<const > std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,CppUnit::TestFactory*> > > >::erase(__rwstd::__rb_tree<std::basic_string<char,std::char_traits<char>, > std::allocator<char> >,std::pair<const > std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,CppUnit::TestFactory*>,__rwstd::__select1st<std::pair<const > std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,CppUnit::TestFactory*>,std::basic_string<char,std::char_traits<char>,std > ::allocator<char> > > >,std::less<std::basic_string<char,std::char_traits<char>,std::allocator<c > har> > >,std::allocator<std::pair<const > std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,CppUnit::TestFactory*> > > >::iterator,__rwstd::__rb_tree<std::basic_string<char,std::char_traits<cha > r>,std::allocator<char> >,std::pair<const > std::basic_string<char,std::char_tr! > aits<char>,std::allocator<char> > >,CppUnit::TestFactory*>,__rwstd::__select1st<std::pair<const > std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,CppUnit::TestFactory*>,std::basic_string<char,std::char_traits<char>,std > ::allocator<char> > > >,std::less<std::basic_string<char,std::char_traits<char>,std::allocator<c > har> > >,std::allocator<std::pair<const > std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,CppUnit::TestFactory*> > >::iterator) > /userhome/rddym/cppunit/lib/libcppunit.so > void > std::deque<CppUnit::XmlOutputter::Node*,std::allocator<CppUnit::XmlOutputt > er::Node*> >::__allocate_at_end() > /userhome/rddym/cppunit/lib/libcppunit.so > unsigned > __rwstd::__rb_tree<CppUnit::TestFactory*,CppUnit::TestFactory*,__rwstd::__ > ident<CppUnit::TestFactory*,CppUnit::TestFactory*>,std::less<CppUnit::Test > Factory*>,std::allocator<CppUnit::TestFactory*> > >::erase(CppUnit::TestFactory*const&) > /userhome/rddym/cppunit/lib/libcppunit.so > std::deque<CppUnit::TestFailure*,std::allocator<CppUnit::TestFailure*> > >::iterator > std::deque<CppUnit::TestFailure*,std::allocator<CppUnit::TestFailure*> > >::erase(std::deque<CppUnit::TestFailure*,std::allocator<CppUnit::TestFail > ure*> > >::iterator,std::deque<CppUnit::TestFailure*,std::allocator<CppUnit::TestF > ailure*> >::iterator) /userhome/rddym/cppunit/lib/libcppunit.so > void > std::deque<CppUnit::TestListener*,std::allocator<CppUnit::TestListener*> > >::__allocate_at_end() /userhome/rddym/cppunit/lib/libcppunit.so > void > __rwstd::__rb_tree<CppUnit::Test*,std::pair<CppUnit::Test*const,CppUnit::T > estFailure*>,__rwstd::__select1st<std::pair<CppUnit::Test*const,CppUnit::T > estFailure*>,CppUnit::Test*>,std::less<CppUnit::Test*>,std::allocator<std: > :pair<CppUnit::Test*const,CppUnit::TestFailure*> > > >::__deallocate_buffers() /userhome/rddym/cppunit/lib/libcppunit.so > void > __rwstd::__rb_tree<std::basic_string<char,std::char_traits<char>,std::allo > cator<char> >,std::pair<const > std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,CppUnit::TestFactoryRegistry*>,__rwstd::__select1st<std::pair<const > std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,CppUnit::TestFactoryRegistry*>,std::basic_string<char,std::char_traits<c > har>,std::allocator<char> > > >,std::less<std::basic_string<char,std::char_traits<char>,std::allocator<c > har> > >,std::allocator<std::pair<const > std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,CppUnit::TestFactoryRegistry*> > >::__deallocate_buffers() > /userhome/rddym/cppunit/lib/libcppunit.so > void > std::vector<std::basic_string<char,std::char_traits<char>,std::allocator<c > har> > >,std::allocator<std::basic_string<char,std::char_traits<char>,std::alloca > tor<char> > > > >::__insert_aux(std::basic_string<char,std::char_traits<char>,std::allocat > or<char> >*,const > std::basic_string<char,std::char_traits<char>,std::allocator<char> >&) > /userhome/rddym/cppunit/lib/libcppunit.so > __type_1 > std::remove_copy<std::deque<CppUnit::TestListener*,std::allocator<CppUnit: > :TestListener*> > >::iterator,std::deque<CppUnit::TestListener*,std::allocator<CppUnit::Test > Listener*> >::iterator,CppUnit::TestLi > > > > > > > ------------------------------------------------------- > This SF.Net email sponsored by: Free pre-built ASP.NET sites including > Data Reports, E-commerce, Portals, and Forums are available now. > Download today and enter to win an XBOX or Visual Studio .NET. > http://aspnet.click-url.com/go/psa00100006ave/direct;at.asp_061203_01/01 > _______________________________________________ > Cppunit-devel mailing list > Cpp...@li... > https://lists.sourceforge.net/lists/listinfo/cppunit-devel > |
|
From: Ding Y. <ym...@tr...> - 2003-07-04 05:39:54
|
I don't know why ,can you help me? $ CC -I/userhome/rddym/cppunit/include -L/userhome/rddym/cppunit/lib -lcppunit test.c Undefined first referenced symbol in file void std::deque<CppUnit::Test*,std::allocator<CppUnit::Test*> >::__allocate_at_end() /userhome/rddym/cppunit/lib/libcppunit.so void __rwstd::__rb_tree<CppUnit::TestFactory*,CppUnit::TestFactory*,__rwstd::__ident<CppUnit::TestFactory*,CppUnit::TestFactory*>,std::less<CppUnit::TestFactory*>,std::allocator<CppUnit::TestFactory*> >::__deallocate_buffers() /userhome/rddym/cppunit/lib/libcppunit.so __rwstd::__rb_tree<CppUnit::Test*,std::pair<CppUnit::Test*const,CppUnit::TestFailure*>,__rwstd::__select1st<std::pair<CppUnit::Test*const,CppUnit::TestFailure*>,CppUnit::Test*>,std::less<CppUnit::Test*>,std::allocator<std::pair<CppUnit::Test*const,CppUnit::TestFailure*> > >::iterator __rwstd::__rb_tree<CppUnit::Test*,std::pair<CppUnit::Test*const,CppUnit::TestFailure*>,__rwstd::__select1st<std::pair<CppUnit::Test*const,CppUnit::TestFailure*>,CppUnit::Test*>,std::less<CppUnit::Test*>,std::allocator<std::pair<CppUnit::Test*const,CppUnit::TestFailure*> > >::find(CppUnit::Test*const&)const /userhome/rddym/cppunit/lib/libcppunit.so std::deque<CppUnit::Test*,std::allocator<CppUnit::Test*> >::~deque() /userhome/rddym/cppunit/lib/libcppunit.so __type_0 std::find<std::deque<CppUnit::TestListener*,std::allocator<CppUnit::TestListener*> >::iterator,CppUnit::TestListener*>(__type_0,__type_0,const __type_1&) /userhome/rddym/cppunit/lib/libcppunit.so std::deque<CppUnit::TestListener*,std::allocator<CppUnit::TestListener*> >::~deque() /userhome/rddym/cppunit/lib/libcppunit.so unsigned __rwstd::__rb_tree<CppUnit::TestFactory*,CppUnit::TestFactory*,__rwstd::__ident<CppUnit::TestFactory*,CppUnit::TestFactory*>,std::less<CppUnit::TestFactory*>,std::allocator<CppUnit::TestFactory*> >::count(CppUnit::TestFactory*const&)const /userhome/rddym/cppunit/lib/libcppunit.so void std::deque<std::pair<std::basic_string<char,std::char_traits<char>,std::allocator<char> >,std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,std::allocator<std::pair<std::basic_string<char,std::char_traits<char>,std::allocator<char> >,std::basic_string<char,std::char_traits<char>,std::allocator<char> > > > >::__allocate_at_end() /userhome/rddym/cppunit/lib/libcppunit.so unsigned std::deque<CppUnit::TestFailure*,std::allocator<CppUnit::TestFailure*> >::__buffer_size() /userhome/rddym/cppunit/lib/libcppunit.so std::pair<__rwstd::__rb_tree<std::basic_string<char,std::char_traits<char>,std::allocator<char> >,std::pair<const std::basic_string<char,std::char_traits<char>,std::allocator<char> >,CppUnit::TestFactoryRegistry*>,__rwstd::__select1st<std::pair<const std::basic_string<char,std::char_traits<char>,std::allocator<char> >,CppUnit::TestFactoryRegistry*>,std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,std::less<std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,std::allocator<std::pair<const std::basic_string<char,std::char_traits<char>,std::allocator<char> >,CppUnit::TestFactoryRegistry*> > >::iterator,bool>__rwstd::__rb_tree<std::basic_string<char,std::char_traits<char>,std::allocator<char> >,std::pair<const std::basic_string<char,std::char_traits<char>,std::allocator<char> >,CppUnit::TestFactoryRegistry*>,__rwstd::__select1st<std::pair<const std::basic_string<char,std::char_traits<char>,std::allocator<char> >,CppUnit::TestFactoryRegist! ry*>,std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,std::less<std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,std::allocator<std::pair<const std::basic_string<char,std::char_traits<char>,std::allocator<char> >,CppUnit::TestFactoryRegistry*> > >::insert(const std::pair<const std::basic_string<char,std::char_traits<char>,std::allocator<char> >,CppUnit::TestFactoryRegistry*>&) /userhome/rddym/cppunit/lib/libcppunit.so __rwstd::__rb_tree<CppUnit::TestFactory*,CppUnit::TestFactory*,__rwstd::__ident<CppUnit::TestFactory*,CppUnit::TestFactory*>,std::less<CppUnit::TestFactory*>,std::allocator<CppUnit::TestFactory*> >::iterator __rwstd::__rb_tree<CppUnit::TestFactory*,CppUnit::TestFactory*,__rwstd::__ident<CppUnit::TestFactory*,CppUnit::TestFactory*>,std::less<CppUnit::TestFactory*>,std::allocator<CppUnit::TestFactory*> >::erase(__rwstd::__rb_tree<CppUnit::TestFactory*,CppUnit::TestFactory*,__rwstd::__ident<CppUnit::TestFactory*,CppUnit::TestFactory*>,std::less<CppUnit::TestFactory*>,std::allocator<CppUnit::TestFactory*> >::iterator,__rwstd::__rb_tree<CppUnit::TestFactory*,CppUnit::TestFactory*,__rwstd::__ident<CppUnit::TestFactory*,CppUnit::TestFactory*>,std::less<CppUnit::TestFactory*>,std::allocator<CppUnit::TestFactory*> >::iterator) /userhome/rddym/cppunit/lib/libcppunit.so __rwstd::__rb_tree<std::basic_string<char,std::char_traits<char>,std::allocator<char> >,std::pair<const std::basic_string<char,std::char_traits<char>,std::allocator<char> >,CppUnit::TestFactoryRegistry*>,__rwstd::__select1st<std::pair<const std::basic_string<char,std::char_traits<char>,std::allocator<char> >,CppUnit::TestFactoryRegistry*>,std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,std::less<std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,std::allocator<std::pair<const std::basic_string<char,std::char_traits<char>,std::allocator<char> >,CppUnit::TestFactoryRegistry*> > >::iterator __rwstd::__rb_tree<std::basic_string<char,std::char_traits<char>,std::allocator<char> >,std::pair<const std::basic_string<char,std::char_traits<char>,std::allocator<char> >,CppUnit::TestFactoryRegistry*>,__rwstd::__select1st<std::pair<const std::basic_string<char,std::char_traits<char>,std::allocator<char> >,CppUnit::TestFactoryRegistry*>,std::basic! _string<char,std::char_traits<char>,std::allocator<char> > >,std::less<std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,std::allocator<std::pair<const std::basic_string<char,std::char_traits<char>,std::allocator<char> >,CppUnit::TestFactoryRegistry*> > >::erase(__rwstd::__rb_tree<std::basic_string<char,std::char_traits<char>,std::allocator<char> >,std::pair<const std::basic_string<char,std::char_traits<char>,std::allocator<char> >,CppUnit::TestFactoryRegistry*>,__rwstd::__select1st<std::pair<const std::basic_string<char,std::char_traits<char>,std::allocator<char> >,CppUnit::TestFactoryRegistry*>,std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,std::less<std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,std::allocator<std::pair<const std::basic_string<char,std::char_traits<char>,std::allocator<char> >,CppUnit::TestFactoryRegistry*> > >::iterator,__rwstd::__rb_tree<std::basic_string<char,std::char_traits<char>,st! d::allocator<char> >,std::pair<const std::basic_string<char,std::char_traits<char>,std::allocator<char> >,CppUnit::TestFactoryRegistry*>,__rwstd::__select1st<std::pair<const std::basic_string<char,std::char_traits<char>,std::allocator<char> >,CppUnit::TestFactoryRegistry*>,std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,std::less<std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,std::allocator<std::pair<const std::basic_string<char,std::char_traits<char>,std::allocator<char> >,CppUnit::TestFactoryRegistry*> > >::iterator) /userhome/rddym/cppunit/lib/libcppunit.so unsigned std::deque<CppUnit::Test*,std::allocator<CppUnit::Test*> >::__buffer_size() /userhome/rddym/cppunit/lib/libcppunit.so std::pair<__rwstd::__rb_tree<std::basic_string<char,std::char_traits<char>,std::allocator<char> >,std::pair<const std::basic_string<char,std::char_traits<char>,std::allocator<char> >,CppUnit::TestFactory*>,__rwstd::__select1st<std::pair<const std::basic_string<char,std::char_traits<char>,std::allocator<char> >,CppUnit::TestFactory*>,std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,std::less<std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,std::allocator<std::pair<const std::basic_string<char,std::char_traits<char>,std::allocator<char> >,CppUnit::TestFactory*> > >::iterator,bool>__rwstd::__rb_tree<std::basic_string<char,std::char_traits<char>,std::allocator<char> >,std::pair<const std::basic_string<char,std::char_traits<char>,std::allocator<char> >,CppUnit::TestFactory*>,__rwstd::__select1st<std::pair<const std::basic_string<char,std::char_traits<char>,std::allocator<char> >,CppUnit::TestFactory*>,std::basic_string<char,std::char_tr! aits<char>,std::allocator<char> > >,std::less<std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,std::allocator<std::pair<const std::basic_string<char,std::char_traits<char>,std::allocator<char> >,CppUnit::TestFactory*> > >::insert(const std::pair<const std::basic_string<char,std::char_traits<char>,std::allocator<char> >,CppUnit::TestFactory*>&) /userhome/rddym/cppunit/lib/libcppunit.so std::deque<CppUnit::TestFailure*,std::allocator<CppUnit::TestFailure*> >::~deque() /userhome/rddym/cppunit/lib/libcppunit.so std::pair<__rwstd::__rb_tree<CppUnit::Test*,std::pair<CppUnit::Test*const,CppUnit::TestFailure*>,__rwstd::__select1st<std::pair<CppUnit::Test*const,CppUnit::TestFailure*>,CppUnit::Test*>,std::less<CppUnit::Test*>,std::allocator<std::pair<CppUnit::Test*const,CppUnit::TestFailure*> > >::iterator,bool>__rwstd::__rb_tree<CppUnit::Test*,std::pair<CppUnit::Test*const,CppUnit::TestFailure*>,__rwstd::__select1st<std::pair<CppUnit::Test*const,CppUnit::TestFailure*>,CppUnit::Test*>,std::less<CppUnit::Test*>,std::allocator<std::pair<CppUnit::Test*const,CppUnit::TestFailure*> > >::insert(const std::pair<CppUnit::Test*const,CppUnit::TestFailure*>&) /userhome/rddym/cppunit/lib/libcppunit.so unsigned std::deque<std::pair<std::basic_string<char,std::char_traits<char>,std::allocator<char> >,std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,std::allocator<std::pair<std::basic_string<char,std::char_traits<char>,std::allocator<char> >,std::basic_string<char,std::char_traits<char>,std::allocator<char> > > > >::__buffer_size() /userhome/rddym/cppunit/lib/libcppunit.so std::deque<CppUnit::Test*,std::allocator<CppUnit::Test*> >::iterator std::deque<CppUnit::Test*,std::allocator<CppUnit::Test*> >::erase(std::deque<CppUnit::Test*,std::allocator<CppUnit::Test*> >::iterator,std::deque<CppUnit::Test*,std::allocator<CppUnit::Test*> >::iterator) /userhome/rddym/cppunit/lib/libcppunit.so __rwstd::__rb_tree<std::basic_string<char,std::char_traits<char>,std::allocator<char> >,std::pair<const std::basic_string<char,std::char_traits<char>,std::allocator<char> >,CppUnit::TestFactory*>,__rwstd::__select1st<std::pair<const std::basic_string<char,std::char_traits<char>,std::allocator<char> >,CppUnit::TestFactory*>,std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,std::less<std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,std::allocator<std::pair<const std::basic_string<char,std::char_traits<char>,std::allocator<char> >,CppUnit::TestFactory*> > >::iterator __rwstd::__rb_tree<std::basic_string<char,std::char_traits<char>,std::allocator<char> >,std::pair<const std::basic_string<char,std::char_traits<char>,std::allocator<char> >,CppUnit::TestFactory*>,__rwstd::__select1st<std::pair<const std::basic_string<char,std::char_traits<char>,std::allocator<char> >,CppUnit::TestFactory*>,std::basic_string<char,std::char_traits<char>,std:! :allocator<char> > >,std::less<std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,std::allocator<std::pair<const std::basic_string<char,std::char_traits<char>,std::allocator<char> >,CppUnit::TestFactory*> > >::erase(__rwstd::__rb_tree<std::basic_string<char,std::char_traits<char>,std::allocator<char> >,std::pair<const std::basic_string<char,std::char_traits<char>,std::allocator<char> >,CppUnit::TestFactory*>,__rwstd::__select1st<std::pair<const std::basic_string<char,std::char_traits<char>,std::allocator<char> >,CppUnit::TestFactory*>,std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,std::less<std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,std::allocator<std::pair<const std::basic_string<char,std::char_traits<char>,std::allocator<char> >,CppUnit::TestFactory*> > >::iterator,__rwstd::__rb_tree<std::basic_string<char,std::char_traits<char>,std::allocator<char> >,std::pair<const std::basic_string<char,std::char_tr! aits<char>,std::allocator<char> >,CppUnit::TestFactory*>,__rwstd::__select1st<std::pair<const std::basic_string<char,std::char_traits<char>,std::allocator<char> >,CppUnit::TestFactory*>,std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,std::less<std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,std::allocator<std::pair<const std::basic_string<char,std::char_traits<char>,std::allocator<char> >,CppUnit::TestFactory*> > >::iterator) /userhome/rddym/cppunit/lib/libcppunit.so void std::deque<CppUnit::XmlOutputter::Node*,std::allocator<CppUnit::XmlOutputter::Node*> >::__allocate_at_end() /userhome/rddym/cppunit/lib/libcppunit.so unsigned __rwstd::__rb_tree<CppUnit::TestFactory*,CppUnit::TestFactory*,__rwstd::__ident<CppUnit::TestFactory*,CppUnit::TestFactory*>,std::less<CppUnit::TestFactory*>,std::allocator<CppUnit::TestFactory*> >::erase(CppUnit::TestFactory*const&) /userhome/rddym/cppunit/lib/libcppunit.so std::deque<CppUnit::TestFailure*,std::allocator<CppUnit::TestFailure*> >::iterator std::deque<CppUnit::TestFailure*,std::allocator<CppUnit::TestFailure*> >::erase(std::deque<CppUnit::TestFailure*,std::allocator<CppUnit::TestFailure*> >::iterator,std::deque<CppUnit::TestFailure*,std::allocator<CppUnit::TestFailure*> >::iterator) /userhome/rddym/cppunit/lib/libcppunit.so void std::deque<CppUnit::TestListener*,std::allocator<CppUnit::TestListener*> >::__allocate_at_end() /userhome/rddym/cppunit/lib/libcppunit.so void __rwstd::__rb_tree<CppUnit::Test*,std::pair<CppUnit::Test*const,CppUnit::TestFailure*>,__rwstd::__select1st<std::pair<CppUnit::Test*const,CppUnit::TestFailure*>,CppUnit::Test*>,std::less<CppUnit::Test*>,std::allocator<std::pair<CppUnit::Test*const,CppUnit::TestFailure*> > >::__deallocate_buffers() /userhome/rddym/cppunit/lib/libcppunit.so void __rwstd::__rb_tree<std::basic_string<char,std::char_traits<char>,std::allocator<char> >,std::pair<const std::basic_string<char,std::char_traits<char>,std::allocator<char> >,CppUnit::TestFactoryRegistry*>,__rwstd::__select1st<std::pair<const std::basic_string<char,std::char_traits<char>,std::allocator<char> >,CppUnit::TestFactoryRegistry*>,std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,std::less<std::basic_string<char,std::char_traits<char>,std::allocator<char> > >,std::allocator<std::pair<const std::basic_string<char,std::char_traits<char>,std::allocator<char> >,CppUnit::TestFactoryRegistry*> > >::__deallocate_buffers() /userhome/rddym/cppunit/lib/libcppunit.so void std::vector<std::basic_string<char,std::char_traits<char>,std::allocator<char> >,std::allocator<std::basic_string<char,std::char_traits<char>,std::allocator<char> > > >::__insert_aux(std::basic_string<char,std::char_traits<char>,std::allocator<char> >*,const std::basic_string<char,std::char_traits<char>,std::allocator<char> >&) /userhome/rddym/cppunit/lib/libcppunit.so __type_1 std::remove_copy<std::deque<CppUnit::TestListener*,std::allocator<CppUnit::TestListener*> >::iterator,std::deque<CppUnit::TestListener*,std::allocator<CppUnit::TestListener*> >::iterator,CppUnit::TestLi |
|
From: ONLINE C. <ilO...@ya...> - 2003-07-03 04:02:33
|
<p align="center"> <img border="0" src="http://www.play-the-market-to-win.com/casino_1e.jpg" width="403" height="184"></p> <p align="center"><b><a href="http://www.play-the-market-to-win.com/Gambling_Promo.htm"> ENTER HERE</a></b></p> <p align="center"> </p> Unsubscribe me: <a href="mailto:ple...@cs...">ple...@cs...</a></p> ejtrrtnudmcvanlcxfdqxfxynbrew |
|
From: Adam Jayson<hyt...@ho...> - 2003-07-02 22:37:56
|
PARENTS OF 15 - YEAR OLD - FIND $71,000 CASH HIDDEN IN HIS CLOSET!
Does this headline look familiar? Of course it does. You most likely
have just seen this story recently featured on a major nightly news
program (USA). And reported elsewhere in the world (including my neck of the
woods - New Zealand).
His mother was cleaning and putting laundry away when she came across a
large brown paper bag that was suspiciously buried beneath some clothes
and a skateboard in the back of her 15-year-old sons closet. Nothing
could have prepared her for the shock she got when she opened the bag and
found it was full of cash. Five-dollar bills, twenties, fifties and
hundreds - all neatly rubber-banded in libeled piles.
"My first thought was that he had robbed a bank", says the
41-year-old woman, "There was over $71,000 dollars in that bag --
that's more than my husband earns in a year".
The woman immediately called her husband at the car-dealership where he
worked to tell him what she had discovered.He came home right away and
they drove together to the boys school and picked him up. Little did
they suspect that where the money came from was more shocking than
actually finding it in the closet.
As it turns out, the boy had been sending out, via E-mail, a type of
"Report" to E-mail addresses that he obtained off the Internet. Everyday
after school for the past 2 months, he had been doing this right on his
computer in his bedroom.
"I just got the E-mail one day and I figured what the heck, I put my
name on it like the instructions said and I started sending it out", says
the clever 15-year-old.
The E-mail letter listed 5 addresses and contained instructions to send
one $5 dollar bill to each person on the list, then delete the address
at the top and move the others addresses Down , and finally to add your
name to the top of the list.
The letter goes on to state that you would receive several thousand
dollars in five-dollar bills within 2 weeks if you sent out the letter
with your name at the top of the 5-address list. "I get junk E-mail all
the time, and really did not think it was going to work", the boy
continues.
Within the first few days of sending out the E-mail, the Post Office
Box that his parents had gotten him for his video-game magazine
subscriptions began to fill up with not magazines, but envelopes containing $5
bills.
"About a week later I rode [my bike] down to the post office and my box
had 1 magazine and about 300 envelops stuffed in it. There was also a
yellow slip that said I had to go up to the [post office] counter.
I thought I was in trouble or something (laughs)". He goes on, "I went
up to the counter and they had a whole box of more mail for me. I had
to ride back home and empty out my backpack because I could not carry it
all".
Over the next few weeks, the boy continued sending out the
E-mail."The money just kept coming in and I just kept sorting it and
stashing it in the closet, barely had time for my homework".He had also
been riding his bike to several of the banks in his area and exchanging
the $5 bills for twenties, fifties and hundreds.
"I didn't want the banks to get suspicious so I kept riding to
different banks with like five thousand at a time in my backpack. I would
usually tell the lady at the bank counter that my dad had sent me in to
exchange the money and he was outside waiting for me. One time the lady
gave me a really strange look and told me that she would not be able to do
it for me and my dad would have to come in and do it, but I just rode
to the next bank down the street (laughs)."
Surprisingly, the boy did not have any reason to be afraid.The
reporting news team examined and investigated the so-called "chain-letter" the
boy was sending out and found that it was not a chain-letter at all. In
fact, it was completely legal according to US Postal and Lottery Laws,
Title 18, Section 1302 and 1341, or Title 18, Section 3005 in the US
code, also in the code of federal regulations, Volume 16, Sections 255
and 436, which state a product or service must be exchanged for money
received.
Every five-dollar bill that he received contained a little note that
read, "Please send me report number XYX".This simple note made the letter
legal because he was exchanging a service (A Report on how-to) for a
five-dollar fee.
[This is the end of the media release. If you would like to
understand how the system works and get your $71,000 - please continue
reading. What appears below is what the 15 year old was sending out on
the net - YOU CAN USE IT TOO - just follow the simple instructions].
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
BE FINANCIALLY FREE LIKE OTHERS WITHIN A YEAR!!! Before you say "Bull",
please read the following. This is the letter you have been hearing
about on the news lately. Due to the popularity of this letter on the
Internet, a national weekly news program recently devoted an entire show to
the investigation of this program described below, to see if it really
can make people money. The show also investigated whether or not the
program was legal. Their findings proved once and for all that there are
"absolutely NO Laws prohibiting the participation in the program
and if people can follow the simple instructions, they are bound to
make some megabucks with only $25 out of pocket cost".
DUE TO THE RECENT INCREASE OF POPULARITY & RESPECT THIS PROGRAM HAS
ATTAINED, IT IS CURRENTLY WORKING BETTER THAN EVER.
NOTE* follow the directions below, I hade best results the second time
when I hired a bulk email service in addition to following the reports
instructions.
I have been asked many times to recommend whom to use. However, after
using one particular company many, many times and had absolutely no
problems with them. I took it upon myself to discuss the possibility of a
discount offer. They will send 1 million email offers for $250 or 5
million for $1000. Remember this is recommended not Required. In order for
all of us to be successful, many, many emails must be sent so that the
returns are many. I have been extremely successful using the this
company. They send out the offers, and all I do is accept money for reports,
then I send back to the people as soon as possible
This is what one had to say: "Thanks to this profitable
opportunity. I was approached many times before but each time I passed
on it. I am so glad I finally joined just to see what one could expect
in return for the minimal effort and money required. To my
astonishment, I received total $610,470.00 in 21 weeks, with money still coming
in".
Pam Hedland, Fort Lee, New Jersey.
>++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Here is another testimonial: "This program has been around for a long
time but I never believed in it. But one day when I received this again
in the mail I decided to gamble my $25 on it. I followed the simple
instructions and walaa ... 3 weeks later the money started to come in.
First month I only made $240.00 but the next 2 months after that I made a
total of $290,000.00. So far, in the past 8 months by re- entering the
program, I have made over $710,000.00 and I am playing it again. The
key to success in this program is to follow the simple steps and NOT
change anything."
More testimonials later but first,
+++ PRINT THIS NOW FOR YOUR FUTURE REFERENCE +++
+++ Order all 5 reports shown on the list below +++
For each report, send $5 CASH, THE NAME & NUMBER OF THE REPORT YOU ARE
ORDERING and YOUR E-MAIL ADDRESS to the person whose name appears ON
THAT LIST next to the report.
MAKE SURE YOUR RETURN ADDRESS IS ON YOUR ENVELOPE TOP LEFT CORNER in
case of any mail problems.
When you place your order, make sure you order each of the 5 reports.
You will need all 5 reports so that you can save them on your computer.
Within a few days you will receive, vie e-mail, each of the 5 reports
from these 5 different individuals. Save them on your computer so they
will be accessible for you to send to the 1,000's of people who will
order them from you. Also make a floppy of these reports and keep it on
your desk in case something happens
to your computer.
IMPORTANT - DO NOT alter the names of the people who are listed next to
each report, or their sequence on the list, in any way other than what
is instructed below in step "1 through 6" or you will loose out on
majority of your profits.
Once you understand the way this works, you will also see how it does
not work if you change it. Remember, this method has been tested, and if
you alter, it will NOT work!!! People have tried to put their
friends/relatives names on all five thinking they could get all the money. But
it does not work this way.
Believe us, we all have tried to be greedy and then nothing
happened. So Do Not try to change anything other than what is
instructed. Because if you do, it will not work for you.
Remember, honesty reaps the reward!!!
1.... After you have ordered all 5 reports, take this advertisement and
REMOVE the name & address of the person in REPORT # 5. This person has
made it through the cycle and is no doubt counting their fortune.
2.... Move the name & address in REPORT # 4 down TO REPORT #5.
3.... Move the name & address in REPORT # 3 down TO REPORT #4.
4.... Move the name & address in REPORT # 2 down TO REPORT #3.
5.... Move the name & address in REPORT # 1 down TO REPORT #2
6.... Insert YOUR name & address in the REPORT # 1 Position.
PLEASE MAKE SURE you copy every name & address ACCURATELY!
>+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
**** Take this entire letter, with the modified list of names, and save
it on your computer. DO NOT MAKE ANY OTHER CHANGES. Save this on a disk
as well just in case if you loose any data. To assist you with
marketing your business on the internet, the 5 reports you purchase will
provide you with invaluable marketing information which includes how to send
bulk e-mails legally, where to find thousands of free classified ads
and much more. There are 2 Primary
methods to get this venture going:
METHOD #1: BY SENDING BULK E-MAIL LEGALLY
>++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Let's say that you decide to start small, just to see how it goes, and
we will assume You and those involved send out only 5,000e-mails each.
Let's also assume that the mailing receive only a 0.2% response (the
response could be much better but lets just say it is only 0.2%. Also
many people will send out hundreds of thousands e-mails instead of only
5,000 each). Continuing with this example, you send out only 5,000
e-mails. With a 0.2% response, that is only
10 orders for report # 1.
Those 10 people responded by sending out 5,000 e-mail each for a total
of 50,000. Out of those 50,000 e-mails only 0.2% responded with orders.
That equals 100 people responded and ordered Report # 2.
Those 100 people mail out 5,000 e-mails each for a total of 500,000
e-mails. The 0.2% response to that is 1000 orders for Report #3.
Those 1000 people send out 5,000 e-mails each for a total of 5 million
e-mails sent out. The 0.2% response to that is 10,000 orders for Report
#4.
Those 10,000 people send out 5,000 e-mails each for a total of
50,000,000 (50 million) e-mails. The 0.2% response to that is 100,000 orders
for Report #5.
THAT'S 100,000 ORDERS TIMES $5 EACH=$500,000.00 (half million). Your
total income in this example is: 1..... $50 +2..... $500 + 3.....$5,000 +
4..... $50,000 + 5..... $500,000........Grand Total=$555,550.00
NUMBERS DO NOT LIE. GET A PENCIL & PAPER AND FIGURE OUT THE WORST
POSSIBLE RESPONSES AND NO MATTER HOW YOU CALCULATE IT, YOU WILL STILL MAKE A
LOT OF MONEY!
>++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
REMEMBER FRIEND, THIS IS ASSUMING ONLY 10 PEOPLE ORDERING OUT OF 5,000
YOU MAILED TO. Dare to think for a moment what would happen if everyone
or half or even one 4th of those people mailed 100,000e-mails each or
more? There are over 150 million people on the Internet worldwide and
counting. Believe me, many people will do just that, and more!
METHOD #2: BY PLACING FREE ADS ON THE INTERNET
>+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Advertising on the net is very very inexpensive and there are hundreds
of FREE places to advertise. Placing a lot of free ads on the Internet
will easily get a larger response. We strongly suggest you start with
Method #1 and add METHOD #2 as you go along. For every $5 you receive,
all you must do is e-mail them the Report they ordered. That's it.
Always provide same day service on all orders.
This will guarantee that the e-mail they send out with your name and
address on it, will be prompt because they can not advertise until they
receive the report.
++++++++++++++ AVAILABLE REPORTS ++++++++++++++++++++++++++
ORDER EACH REPORT BY ITS NUMBER & NAME ONLY. Notes: Always send $5 cash
(U.S. CURRENCY) for each Report. Checks NOT accepted. Make sure the
cash is concealed by wrapping it in at least 2 sheets of paper or aluminum
foil. On one of those sheets of paper, Write the NUMBER & the NAME of
the Report you are ordering, YOUR E-MAIL ADDRESS and your name and
postal address.
PLACE YOUR ORDER FOR THESE REPORTS NOW:
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
REPORT #1: The Insider's Guide to Advertising for Free on the Net
Order Report #1 from:
Abs. Ga
2-562 Des crecerelles
Chicoutimi, Qc. Canada G7H 5S9
_________________________________________________________
REPORT #2: The Insider's Guide to Sending Bulk e-mail on the Net
Order Report #2 from:
M. David
75 Faye Drive
North York
On. M2J 3S7
Canada
__________________________________________________________
REPORT #3: Secret to Multilevel marketing on the Net
Order Report #3 from:
Parvin Taherian
344 Jomhouri Eslami - Kashmar
Khorasan - Iran
__________________________________________________________
REPORT #4: How to become a millionaire utilizing MLM & the Net
Order Report #4 from:
C. Bernerd
P.O. Box 242
New Freedom, PA 17349
_____________________________________________________
REPORT #5: How to send out 0ne Million emails for free
Order Report #5 From:
Mike W.
P.O. Box 161
Freeland, MD 21053
+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
$$$$$$$$$$$$$$$$ YOUR SUCCESS GUIDELINES $$$$$$$$$$$$$$$$
Follow these guidelines to guarantee your success:
If you do not receive at least 10 orders for Report #1 within 2 weeks,
continue sending e-mails until you do.
after you have received 10 orders, 2 to 3 weeks after that you should
receive 100 orders or more for REPORT #2. If you did not, continue
advertising or sending e-mails until you do.
Once you have received 100 or more orders for Report #2, YOU CAN RELAX,
because the system is already working for you, and the cash will
continue to roll in! THIS IS IMPORTANT TO REMEMBER: Every time your name is
moved down on the list, you are placed in front of a Different report.
You can KEEP TRACK of your PROGRESS by watching
which report people are ordering from you. IF YOU WANT TO GENERATE MORE
INCOME SEND ANOTHER BATCH OF E-MAILS AND START THE WHOLE ROCESS AGAIN.
There is NO LIMIT to the income you can generate from this business!!!
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
FOLLOWING IS A NOTE FROM THE ORIGINATOR OF THIS PROGRAM:
You have just received information that can give you financial freedom
for the rest of your life, with NO RISK and JUST A LITTLE BIT OF EFFORT.
You can make more money in the next few weeks and months than you have
ever imagined. Follow the program EXACTLY AS INSTRUCTED. Do Not
change it in any way. It works exceedingly well as it is now.
Remember to e-mail a copy of this exciting report after you have put
your name and address in Report#1 and moved others to #2 thru #5 as
instructed above.
One of the people you send this to may send out 100,000 or more e-mails
and your name will be on every one of them. Remember though, the more
you send out the more potential customers you will reach. So my friend,
I have given you the ideas, information, materials and opportunity to
become financially independent.
IT IS UP TO YOU NOW!
+++++++++++++++++++ MORE TESTIMONIALS ++++++++++++++++++++
"My name is Mitchell. My wife, Jody and I live in Chicago. I am an
accountant with a major U.S. Corporation and I make pretty good money. When
I received this program I grumbled to Jody about receiving "junk mail".
I made fun of the whole thing, spouting my knowledge of the population
and percentages involved. I "knew" it wouldn't work. Jody totally
ignored my supposed intelligence and few days later she jumped in with both
feet. I made merciless fun of
her, and was ready to lay the old "I told you so" on her when the thing
didn't work. Well, the laugh was on me! Within 3 weeks she had received
50 responses. Within the next 45 days she had received total $
147,200.00....all cash! I was shocked. I have joined Jody in her "hobby".
Mitchell Wolf, Chicago, Illinois
+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
"Not being the gambling type, it took me several weeks to make up my
mind to participate in this plan. But conservative that I am, I decided
that the initial investment was so little that there was just no way
that I wouldn't get enough orders to at least get my money back". "I was
surprised when I found my medium size post office box crammed with
orders. I made $319,210.00 in the first 12
weeks. The nice thing about this deal is that it does not matter where
people live. There simply isn't a better investment with a faster
return and so big".
Dan Sondstrom, Alberta, Canada
+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
"I had received this program before. I deleted it, but later I wondered
if I should have given it a try. Of course, I had no idea who to
contact to get another copy, so I had to wait until I was e-mailed again by
someone else......11 months passed then it luckily came again...... I
did not delete this one! I made more than $490,000 on my first try and
all the money came within 22 weeks".
Susan De Suza, New York, N.Y
+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
If you have any questions of the legality of this program, contact the
Office of Associate Director for Marketing Practices, Federal Trade
Commission, Bureau of Consumer Protection, Washington,D.C.
+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
GOOD LUCK!!
Use only this and nothing else:
==============================
This is unsolicited email. To be removed from our list please send a blank email to < gol...@bi... >
All requests honered immediately:)
|
|
From: Sarah W. <re...@tm...> - 2003-06-26 15:53:51
|
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD><TITLE></TITLE>
<META http-equiv=3DContent-Type content=3D"text/html; charset=3Dgb2312"><!-- =
Ap -->
<STYLE type=3Dtext/css>TD {
FONT-SIZE: 11px; COLOR: #000000; FONT-FAMILY: verdana, arial, helvetica
}
</STYLE>
<META content=3D"MSHTML 6.00.2722.900" name=3DGENERATOR></HEAD>
<BODY bgColor=3D#ffffff>
<TABLE cellSpacing=3D0 cellPadding=3D0 width=3D600 border=3D0>
<TBODY>
<TR>
<TD>Hi<BR><BR>I visited <A
href=3D=
"http://www.trafficmagnet.com/signup/index.html">CPPUNIT.SF.NET</A>, and =
noticed that you're not listed on some search engines! I
think we can offer you a service which can help you increase traffic =
and
the number of visitors to your website.<BR><BR>I would like to =
introduce
you to <A
href=3D=
"http://www.trafficmagnet.com/signup/index.html">Trafficmagnet.com</A>.
We offer a unique technology that will submit your website to over =
300,000
search engines and directories every month.<BR><BR>
<TABLE cellSpacing=3D0 cellPadding=3D0 width=3D398 align=3Dcenter =
border=3D0>
<TBODY>
<TR>
<TD><A href=3D"http://www.trafficmagnet.com/signup/index.html"><IMG =
height=3D136 src=3D"http://www.trafficmagnet.com/img/img_tm.gif" =
width=3D137 border=3D0></A> </TD>
<TD><A href=3D"http://www.trafficmagnet.com/signup/index.html"><IMG =
height=3D141 src=3D=
"http://image10.trafficmagnet.net/img4/ZEUS214/001/015/aii.jpg" width=3D197 =
border=3D1></A></TD>
<TD vAlign=3Dbottom><A
href=3D"http://www.trafficmagnet.com/signup/index.html"><IMG
height=3D136 src=3D=
"http://www.trafficmagnet.com/img/img_signup.gif" width=3D62
border=3D0></A></TD></TR></TBODY></TABLE><BR>You'll be surprised by the =
low
cost, and by how effective this website promotion method can be.
<BR><BR>To find out more about TrafficMagnet and the cost for =
submitting
your website to over 300,000 search engines and directories, visit <A
href=3D=
"http://www.trafficmagnet.com/signup/index.html">www.trafficmagnet.com</A>.
<BR><BR>I would love to hear from you. <BR><BR><BR>Best
Regards,<BR><BR>Sarah Williams <BR>Sales and Marketing <BR>E-mail:
sar...@tm... <BR><A
href=3D=
"http://www.trafficmagnet.com/signup/index.html">http://www.trafficmagnet.com=
</A>
<P>This email was sent to cpp...@li.... We apologize if this email =
has reached you in error.<BR>We honor all removal requests. Please <A
href=3D"http://optout.trafficmagnet.com/optout/Action/OptOut?email=3D=
cpp...@li...&url=3D cppunit.sf.net">click
here</A> to be removed from our mailing
list.</P></TD></TR></TBODY></TABLE></BODY></HTML>
|
|
From: wtjlLUNCH M. <feL...@ya...> - 2003-06-25 20:06:03
|
<p align="center"> <img border="0" src="http://www.lunchmate.com/mailimages/lunchmate_logo.jpg" width="748" height="577"></p><p align="center"> <br> <a href="http://coldfusion.affiliateshop.com/AIDLink.cfm?AID=033547&BID=3251">ENTER HERE</a></p> <p align="center"> </p> <p align="left">Unsubscribe me: <a href="mailto:cus...@cs...">cus...@cs...</a></p> ehpwvltnrdlcmptsdobkjojvrssovx |
|
From: Beijing C. T. <tra...@ey...> - 2003-06-25 14:18:11
|
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=gb2312">
<meta name="GENERATOR" content="Microsoft FrontPage 4.0">
<meta name="ProgId" content="FrontPage.Editor.Document">
<title>Cost</title>
</head>
<body>
<div align="center">
<center>
<table border="1" width="651" height="465">
<tr>
<td width="651" height="465">
<p align="center" style="margin-left:12.0pt;text-align:center;
text-indent:-12.0pt;mso-char-indent-count:-1.0;mso-char-indent-size:12.0pt;
line-height:12.0pt;mso-line-height-rule:exactly;mso-pagination:widow-orphan"><font face="Times New Roman"><span lang="EN-US" style="font-size: 12.0pt; mso-bidi-font-size: 13.5pt; color: #006600">Cost-Effective Solutions for Global</span><span lang="EN-US" style="font-size:12.0pt;mso-bidi-font-size:10.0pt;font-family:Arial;
color:#006600"> Translations!</span><span lang="EN-US" style="font-size:
14.0pt;mso-bidi-font-size:10.0pt;font-family:Arial;color:white"><br>
</span><span lang="EN-US" style="mso-bidi-font-size:13.5pt;color:#CC3300"><b>Beijing
Expert
Translation Co., Ltd.</b></span></font></p>
<p align="left" style="text-align:left;line-height:12.0pt;
mso-line-height-rule:exactly;mso-pagination:widow-orphan"><font face="Times New Roman"><span lang="EN-US">Dear
International Manager:</span><span lang="EN-US" style="font-family:宋体;mso-font-kerning:
0pt"><o:p>
</o:p>
</span></font></p>
<p style="line-height:12.0pt;mso-line-height-rule:exactly"><span lang="EN-US"><font face="Times New Roman">The
Beijing Expert Translation Co., Ltd. is based in Beijing, China, providing high
quality translation services in most of the world’s commercially significant
languages. In addition to considerable expertise English
translations, we offer translation services in the following
languages-pairs:</font></span></p>
<p style="line-height:12.0pt;mso-line-height-rule:exactly"><span lang="EN-US"><font face="Times New Roman">French-Chinese, Chinese-French, German-Chinese,
Chinese-German, Japanese-Chinese, Chinese-Japanese, Russian-Chinese,
Chinese-Russian, Korean-Chinese, and Chinese-Korean.<o:p>
</o:p>
</font>
</span></p>
<p style="line-height:12.0pt;mso-line-height-rule:exactly"><span lang="EN-US"><font face="Times New Roman">We
have proven proficiency in large-scale projects and excellent continuing
relationships with recognized multinational corporations such as
P&G, the Delaware Corporation, Multiling Corporation and many of
China’s governmental organizations and publishing houses. Our service
offering extends from technical and marking materials to over 30
published works of literature. We have in-depth experience in the areas
of :<o:p>
</o:p>
</font>
</span></p>
<table border="1" cellspacing="0" cellpadding="0" style="border-collapse:collapse;
border:none;mso-border-alt:solid windowtext .5pt;mso-padding-alt:0cm 5.4pt 0cm 5.4pt">
<tr>
<td width="229" valign="top" style="width:171.75pt;border:none;padding:0cm 5.4pt 0cm 5.4pt">
<p align="center" style="text-align:center;line-height:12.0pt;mso-line-height-rule:
exactly"><span lang="EN-US" style="font-size: 10.5pt; mso-bidi-font-size: 13.5pt"><font face="Times New Roman">Medicine and Medical Instrumentation<o:p>
</o:p>
</font>
</span></p>
</td>
<td width="229" valign="top" style="width:171.75pt;border:none;padding:0cm 5.4pt 0cm 5.4pt">
<p align="center" style="text-align:center;line-height:12.0pt;mso-line-height-rule:
exactly"><span lang="EN-US" style="font-size: 10.5pt; mso-bidi-font-size: 13.5pt"><font face="Times New Roman">Mechanics and Materials Engineering<o:p>
</o:p>
</font>
</span></p>
</td>
<td width="229" valign="top" style="width:171.75pt;border:none;padding:0cm 5.4pt 0cm 5.4pt">
<p align="center" style="text-align:center;line-height:12.0pt;mso-line-height-rule:
exactly"><span lang="EN-US" style="font-size: 10.5pt; mso-bidi-font-size: 13.5pt"><font face="Times New Roman">Architecture<o:p>
</o:p>
</font>
</span></p>
</td>
</tr>
<tr>
<td width="229" valign="top" style="width:171.75pt;border:none;padding:0cm 5.4pt 0cm 5.4pt">
<p align="center" style="text-align:center;line-height:12.0pt;mso-line-height-rule:
exactly"><span lang="EN-US" style="font-size: 10.5pt; mso-bidi-font-size: 13.5pt"><font face="Times New Roman">Software & IT<o:p>
</o:p>
</font>
</span></p>
</td>
<td width="229" valign="top" style="width:171.75pt;border:none;padding:0cm 5.4pt 0cm 5.4pt">
<p align="center" style="text-align:center;line-height:12.0pt;mso-line-height-rule:
exactly"><span lang="EN-US" style="font-size: 10.5pt; mso-bidi-font-size: 13.5pt"><font face="Times New Roman">Automotive and Railway<o:p>
</o:p>
</font>
</span></p>
</td>
<td width="229" valign="top" style="width:171.75pt;border:none;padding:0cm 5.4pt 0cm 5.4pt">
<p align="center" style="text-align:center;line-height:12.0pt;mso-line-height-rule:
exactly"><span lang="EN-US" style="font-size: 10.5pt; mso-bidi-font-size: 13.5pt"><font face="Times New Roman">Cultural and Social Sciences<o:p>
</o:p>
</font>
</span></p>
</td>
</tr>
<tr>
<td width="229" valign="top" style="width:171.75pt;border:none;padding:0cm 5.4pt 0cm 5.4pt">
<p align="center" style="text-align:center;line-height:12.0pt;mso-line-height-rule:
exactly"><span lang="EN-US" style="font-size: 10.5pt; mso-bidi-font-size: 13.5pt"><font face="Times New Roman">Chemistry and Chemical Engineering<o:p>
</o:p>
</font>
</span></p>
</td>
<td width="229" valign="top" style="width:171.75pt;border:none;padding:0cm 5.4pt 0cm 5.4pt">
<p align="center" style="text-align:center;line-height:12.0pt;mso-line-height-rule:
exactly"><font face="Times New Roman"><span lang="EN-US" style="font-size: 10.5pt; mso-bidi-font-size: 13.5pt">Finance and Economics</span><span lang="EN-US" style="font-size:10.5pt;mso-bidi-font-size:10.0pt"><o:p>
</o:p>
</span></font></p>
</td>
<td width="229" valign="top" style="width:171.75pt;border:none;padding:0cm 5.4pt 0cm 5.4pt">
<p align="center" style="text-align:center;line-height:12.0pt;mso-line-height-rule:
exactly"><span lang="EN-US" style="font-size: 10.5pt; mso-bidi-font-size: 13.5pt"><font face="Times New Roman">Geology and Environment Protection<o:p>
</o:p>
</font>
</span></p>
</td>
</tr>
<tr>
<td width="229" valign="top" style="width:171.75pt;border:none;padding:0cm 5.4pt 0cm 5.4pt">
<p align="center" style="text-align:center;line-height:12.0pt;mso-line-height-rule:
exactly"><span lang="EN-US" style="font-size: 10.5pt; mso-bidi-font-size: 13.5pt"><font face="Times New Roman">Biology<o:p>
</o:p>
</font>
</span></p>
</td>
<td width="229" valign="top" style="width:171.75pt;border:none;padding:0cm 5.4pt 0cm 5.4pt">
<p align="center" style="text-align:center;line-height:12.0pt;mso-line-height-rule:
exactly"><span lang="EN-US" style="font-size: 10.5pt; mso-bidi-font-size: 13.5pt"><font face="Times New Roman">Corporate Management<o:p>
</o:p>
</font>
</span></p>
</td>
<td width="229" valign="top" style="width:171.75pt;border:none;padding:0cm 5.4pt 0cm 5.4pt">
<p align="center" style="text-align:center;line-height:12.0pt;mso-line-height-rule:
exactly"><span lang="EN-US" style="font-size: 10.5pt; mso-bidi-font-size: 13.5pt"><font face="Times New Roman">Commerce<o:p>
</o:p>
</font>
</span></p>
</td>
</tr>
<tr>
<td width="229" valign="top" style="width:171.75pt;border:none;padding:0cm 5.4pt 0cm 5.4pt">
<p align="center" style="text-align:center;line-height:12.0pt;mso-line-height-rule:
exactly"><span lang="EN-US" style="font-size: 10.5pt; mso-bidi-font-size: 13.5pt"><font face="Times New Roman">Law and Legal Documentation<o:p>
</o:p>
</font>
</span></p>
</td>
<td width="229" valign="top" style="width:171.75pt;border:none;padding:0cm 5.4pt 0cm 5.4pt">
<p align="center" style="text-align:center;line-height:12.0pt;mso-line-height-rule:
exactly"><font face="Times New Roman"><span lang="EN-US" style="font-size: 10.5pt; mso-bidi-font-size: 10.0pt"> Insurance</span><span lang="EN-US" style="font-size:10.5pt;mso-bidi-font-size:13.5pt;font-family:
Arial"><o:p>
</o:p>
</span></font></p>
</td>
<td width="229" valign="top" style="width:171.75pt;border:none;padding:0cm 5.4pt 0cm 5.4pt">
<p align="center" style="text-align:center;line-height:12.0pt;mso-line-height-rule:
exactly"><span lang="EN-US" style="font-size: 10.5pt; mso-bidi-font-size: 13.5pt"><font face="Times New Roman">Education<o:p>
</o:p>
</font>
</span></p>
</td>
</tr>
</table>
<p style="line-height:12.0pt;mso-line-height-rule:exactly"><font face="Times New Roman"><span lang="EN-US" style="font-size: 10.5pt; mso-bidi-font-size: 13.5pt">With
a staff of eight full-time employees and 1,500 staff translators,
we are fully able to deal with the most challenging of projects,
regardless of size or complexity. A majority of our managers and
full-time employees have doctoral or master’s degrees in science,
law or other specialties and have considerable knowledge of our client's
areas of business activity. </span><span lang="EN-US" style="font-size:10.5pt;mso-bidi-font-size:10.0pt"><o:p>
</o:p>
</span></font></p>
<p style="line-height:12.0pt;mso-line-height-rule:exactly"><font face="Times New Roman"><span lang="EN-US" style="font-size: 10.5pt; mso-bidi-font-size: 10.0pt; mso-font-kerning: 1.0pt">We translate both in the traditional way, by human
professionals, and by computer-aided translation software. We use
industry-standard software such as Star Transit and TermStar. The
combination of translation professionals and advanced software
technology produces higher quality and elevated productivity.</span><span lang="EN-US" style="font-size:
10.5pt;mso-bidi-font-size:10.0pt;font-family:"Times New Roman""> </span><span lang="EN-US" style="font-size:10.5pt;mso-bidi-font-size:10.0pt"><o:p>
</o:p>
</span></font></p>
<p style="line-height:12.0pt;mso-line-height-rule:exactly"><font face="Times New Roman"><span lang="EN-US" style="font-size: 10.5pt; mso-bidi-font-size: 10.0pt">We
would greatly appreciate any opportunity to find cost-effective and
professional solutions to your company’s translations needs. Our
management and staff look forward to hearing from you soon!</span><span lang="EN-US" style="font-size:10.5pt;mso-bidi-font-size:10.0pt"><o:p>
</o:p>
</span></font></p>
<p style="line-height:12.0pt;mso-line-height-rule:exactly"><font face="Times New Roman"><span lang="EN-US" style="font-size: 10.5pt; mso-bidi-font-size: 10.0pt">Dr.
Wei Zhen </span><span lang="EN-US" style="font-size:10.5pt;mso-bidi-font-size:
10.0pt"><o:p>
</o:p>
</span></font></p>
<p style="line-height:12.0pt;mso-line-height-rule:exactly"><font face="Times New Roman"><span lang="EN-US" style="font-size: 10.5pt; mso-bidi-font-size: 10.0pt">General
Manager<br>
Beijing Expert Translation Co., Ltd.<br>
<br>
Tel: 0086-10-82115891 82115892 Fax: 0086-10-82115893<br>
</span><span lang="IT" style="font-size:10.5pt;mso-bidi-font-size:10.0pt;
font-family:"Times New Roman";mso-font-kerning:1.0pt;mso-ansi-language:IT">E-mail:
bj...@16... </span><span lang="EN-US" style="font-size:10.5pt;mso-bidi-font-size:10.0pt"></o:p>
</span></font></p>
<p style="line-height:12.0pt;mso-line-height-rule:exactly"><span lang="EN-US" style="font-size:10.5pt;mso-bidi-font-size:13.5pt"><font face="Times New Roman">Rates: </font></span></p>
<p style="line-height:12.0pt;mso-line-height-rule:exactly"><span lang="EN-US" style="font-size:10.5pt;mso-bidi-font-size:10.0pt"><font face="Times New Roman">English-Chinese:
US$0.045-0.05/English word<br>
Chinese-English: US$0.065-0.08/English word<br>
French-Chinese:<span style="mso-spacerun: yes"> </span>US$0.055-0.06/French
word<br>
Chinese-French:<span style="mso-spacerun: yes"> </span>US$0.065-0.08/French
word<br>
German-Chinese: US$0.055-0.06 per German word<br>
Chinese-German: US$0.065-0.08 per German word<br>
Japanese-Chinese: US$0.035-0.05 /Japanese Character<br>
Chinese-Japanese: US$0.04-0.06 /Japanese Character<br>
Russian-Chinese: US$0.03-0.035/Chinese Character<br>
Chinese-Russian: US$0.04-0.045 /Chinese Character<br>
Korean-Chinese:<span style="mso-spacerun: yes"> </span>US$0.03-0.035/Chinese
Character<br>
<span style="mso-font-kerning:1.0pt">Chinese-Korean:<span style="mso-spacerun:
yes"> </span>US$0.040-0.045/ Chinese Character.</span><o:p>
</o:p>
</font>
</span></p>
<p style="line-height:12.0pt;mso-line-height-rule:exactly"><font face="Times New Roman"><span lang="EN-US" style="font-size: 10.5pt; mso-bidi-font-size: 10.0pt; mso-font-kerning: 1.0pt">Please accept my apologies if this message is an
intrusion. You can e-mail me at: <a href="mailto:to:tra...@so...">tra...@so...</a> and I will remove your address from our lists.</span><span lang="EN-US" style="font-size:10.5pt;mso-bidi-font-size:10.0pt"><o:p>
</o:p>
</span></font></td>
</tr>
</table>
</center>
</div>
</body>
</html>
|
180 messages has been excluded from this view by a project administrator.
![http://www.play-the-market-to-win.com/casino_1e.jpg"](http://www.play-the-market-to-win.com/casino_1e.jpg"){kind=link}
![http://www.trafficmagnet.com/img/img_tm.gif"](http://www.trafficmagnet.com/img/img_tm.gif"){kind=link}
![http://image10.trafficmagnet.net/img4/ZEUS214/001/015/aii.jpg"](http://image10.trafficmagnet.net/img4/ZEUS214/001/015/aii.jpg"){kind=link}
![http://www.trafficmagnet.com/img/img_signup.gif"](http://www.trafficmagnet.com/img/img_signup.gif"){kind=link}
![http://www.lunchmate.com/mailimages/lunchmate_logo.jpg"](http://www.lunchmate.com/mailimages/lunchmate_logo.jpg"){kind=link}