Re: ADD Re: Musatov claims "Mode/Code" -

From:

musatovatattdotnet@gmail.com

Newsgroups:

comp.lang.c++

Date:

Mon, 17 Dec 2012 03:21:57 -0800 (PST)

Message-ID:

<2db6255b-2c07-403e-b84d-de78923f3d1a@googlegroups.com>

On Monday, December 10, 2012 3:36:46 AM UTC-8, musatovat...@gmail.com wrote=
:

also true -time =On Saturday, October 31, 2009 1:40:28 PM UTC-7, Musato=

v wrote:

== New-Player ==

<mode>[[struct]]</code>) allow related data elements to be combined

and manipulated as a unit. C program source text is free-format,

using the semicolon as a statement terminator (not a delimiter).

<mode>{ ... }</code> rather than either of [[ALGOL 60]]'s

<mode>begin ... end</code> or [[ALGOL 68]]'s

<mode>.EQ.</code> in [[Fortran]] or the equal-sign in [[BASIC]] and

ALGOL)

<mode>&&</code> and

<mode>||</code> in place of ALGOL's "=E2=88=A7" (AND) and "=E2=88=A8" (=

OR) (these are

semantically distinct from the [[bitwise operation|bit-wise]]

operators

<mode>&</code> and

<mode>|</code> because they will never evaluate the right operand if

the result can be determined from the left alone ([[short-circuit

evaluation]])).

<mode>+=</code>,

<mode>++</code>, etc. (Equivalent to [[ALGOL 68]]'s

<mode>+:=</code> and

<mode>+:=1</code> operators)

<mode>struct</code> or

<mode>union</code> type is supported)

<mode>A..B</code> notation used in several languages

<mode>_Bool</code> type, but it was not retrofitted into the

language's existing Boolean contexts. One can simulate a Boolean

datatype, ''e.g.'' with

<mode>enum { false, true } bool;</code>, but this does not provide all

of the features of a separate Boolean datatype.</ref>

<mode>[[errno]]</code> variable and/or special return values

<mode>[[fflush]]()</code> on a stream opened for input is an example

of a different kind of undefined behavior, not necessarily a

programming error but a case for which some conforming implementations

may provide well-defined, useful semantics (in this example,

presumably discarding input through the next new-line) as an allowed

''extension''. Use of such nonstandard extensions generally but not

always limits [[software portability]].

<mode>struct</code> types, the C language had become powerful enough

most of the [[Unix]] [[kernel (computers)|kernel]] was rewritten in

C. This was one of the first operating system kernels implemented in

a language other than assembly. (Earlier instances include the

[[Multics]] system (written in [[PL/I]]), and MCP ([[MCP (Burroughs

Large Systems)|Master Control Program]]) for the [[Burroughs large

systems|Burroughs B5000]] written in [[ALGOL]] in 1961.)

<mode>long int</code> data type

<mode>unsigned int</code> data type

<mode>=</code>''op'' (such as

<mode>=-</code>) were changed to the form ''op''

<mode>=</code> to remove the semantic ambiguity created by such

constructs as

<mode>i=-10</code>, which had been interpreted as

<mode>i =- 10</code> instead of the possibly intended

<mode>long int SomeFunction();

<mode>

<mode> CallingFunction()

<mode>{

<mode> long int test1;

<mode> register test2;

<mode>

<mode> test1 = SomeFunction();

<mode> if (test1 > 0)

<mode> test2 = 0;

<mode> else

<mode> test2 = OtherFunction();

<mode>

<mode> return test2;

<mode>}

<mode>

<mode>int</code> declarations were be omitted in Mode/C.

<mode>[[void type|void]]</code> functions

<mode>[[Struct (C programming language)|struct]]</code> or

<mode>[[union (computer science)|union]]</code> types (rather than

pointers)

<mode>struct</code> data types

<mode>void</code> pointers, support for international [[character

encoding|character sets]] and [[locale]]s, and preprocessor

enhancements. The syntax for parameter declarations was also augmented

to include the style used in C++, although the K&R interface continued

to be permitted, for compatibility with existing source code.

<mode>__STDC__</code> macro can be used to split the code into

Standard and K&R sections to take advantage of features available only

in Standard C.

<mode>long long int</code> and a

<mode>complex</code> type to represent [[complex number]]s),

[[variable-length array]]s, support for [[variadic macro]]s (macros of

variable [[arity]]) and support for one-line comments beginning with

<mode>//</code>, as in [[BCPL]] or C++. Many of these had already been

implemented as extensions in several C compilers.

<mode>int</code> implicitly assumed. A standard macro

<mode>__STDC_VERSION__</code> is defined with value

<mode>199901L</code> to indicate C99 support is available. [[GNU

Compiler Collection|GCC]], [[Sun Studio (software)|Sun Studio]] and

other C compilers now support many or all of the new features of C99.

<mode>/*</code> and

<mode>*/</code>, or (in C99) following

<mode>//</code> until the end of the line.

<mode>struct</code>,

<mode>union</code>, and

<mode>enum</code>, or assign types to and perhaps reserve storage for

new variables, usually by writing the type followed by the variable

name. Keywords such as

<mode>char</code> and

<mode>int</code> specify built-in types. Sections of code are enclosed

in braces (

<mode>{</code> and

<mode>}</code>, sometimes called "curly brackets") to limit the scope

of declarations and to act as a single statement for control

structures.

<mode>if</code>(-

<mode>else</code>) conditional execution and by

<mode>do</code>-

<mode>while</code>,

<mode>while</code>, and

<mode>for</code> iterative execution (looping). The

<mode>for</code> statement has separate initialization, testing, and

reinitialization expressions, any or all of which can be omitted.

<mode>break</code> and

<mode>continue</code> can be used to leave the innermost enclosing

loop statement or skip to its reinitialization. There is also a non-

structured

<mode>[[goto]]</code> statement which branches directly to the

designated [[label (programming language)|label]] within the

function.

<mode>switch</code> selects a

<mode>case</code> to be executed based on the value of an integer

expression.

<mode>&&</code>,

<mode>||</code>,

<mode>[[?:]]</code> and the [[comma operator]]). This permits a high

degree of object code optimization by the compiler, but requires C

programmers to take more care to obtain reliable results than is

needed for other programming languages.

<mode>==</code> binding more tightly than

<mode>&</code> and

<mode>|</code> in expressions like

<mode>x & 1 == 0</code>.

<mode>=</code> operator, used in mathematics for equality, to indicat=

assignment, following the precedent of [[Fortran]], [[PL/I]], and

[[BASIC]], but unlike [[ALGOL]] and its derivatives. Ritchie made this

syntax design decision consciously, based primarily on the argument

assignment occurs more often than comparison.

<mode>=</code> and

<mode>==</code>), making it easy to accidentally substitute one for

the other. C's weak type system permits each to be used in the context

of the other without a compilation error (although some compilers

produce warnings). For example, the conditional expression in

<mode>if (a=b)</code> is only true if

<mode>a</code> is not zero after the assignment.<ref>{{cite web|

url=http://www.cs.ucr.edu/~nxiao/cs10/errors.htm |title=10 Common

Programming Mistakes in C |publisher=Cs.ucr.edu |date= |

accessdate=2009-06-26}}</ref>

<mode>+</code>]], [[subtraction|

<mode>-</code>]], [[multiplication|

<mode>*</code>]], [[division (mathematics)|

<mode>/</code>]], [[modulo operation|

<mode>%</code>]])

<mode>==</code>]], [[inequality (mathematics)|

<mode>!=</code>]])

<mode><</code>,

<mode><=</code>,

<mode>></code>,

<mode>>=</code>)

<mode>!</code>,

<mode>&&</code>,

<mode>||</code>)

<mode>~</code>,

<mode>&</code>,

<mode>|</code>,

<mode>^</code>)

<mode><<</code>,

<mode>>></code>)

<mode>=</code>,

<mode>+=</code>,

<mode>-=</code>,

<mode>*=</code>,

<mode>/=</code>,

<mode>%=</code>,

<mode>&=</code>,

<mode>|=</code>,

<mode>^=</code>,

<mode><<=</code>,

<mode>>>=</code>)

<mode>++</code>,

<mode>--</code>)

<mode>&</code>,

<mode>*</code>,

<mode>[ ]</code>)

<mode>? :</code>]])

<mode>.</code>,

<mode>-></code>)

<mode>( )</code>)

<mode>[[sizeof]]</code>)

<mode>( )</code>)

<mode>,</code>]])

<mode>( )</code>)

<mode>main()

<mode>{

<mode> printf("hello, world\n");

<mode>}

<mode>#include <stdio.h></code>

<mode> printf("hello, world\n");</code>

<mode> return 0;</code>

<mode>#include</code>. This causes the preprocessor =E2=80=94 the firs=

t tool

to examine source code as it is compiled =E2=80=94 to substitute the li=

ne with

the entire text of the

<mode>stdio.h</code> standard header, which contains declarations for

standard input and output functions such as

<mode>printf</code>. The angle brackets surrounding

<mode>stdio.h</code> indicate

<mode>stdio.h</code> is located using a search strategy prefers

standard headers to other headers having the same name. Double quotes

may also be used to include local or project-specific header files.

<mode>main</code> is being defined. The

<mode>[[main function (programming)|main]]</code> function serves a

special purpose in C programs: The run-time environment calls the

<mode>main</code> function to begin program execution. The type

specifier

<mode>int</code> indicates the ''return value,'' the value is returned

to the invoker (in this case the run-time environment) as a result of

evaluating the

<mode>main</code> function, is an integer. The keyword

<mode>void</code> as a parameter list indicates the

<mode>main</code> function takes no arguments.<ref>The

<mode>main</code> function actually has two arguments,

<mode>int argc</code> and

<mode>char *argv[]</code>, respectively, which can be used to handle

[[command line arguments]]. The C standard requires both forms of

<mode>main</code> be supported, which is special treatment not

afforded any other function.</ref>

<mode>main</code> function.

<mode>[[printf]]</code>, which was declared in

<mode>stdio.h</code> and is supplied from a system [[library (computer

science)|library]]. In this call, the

<mode>printf</code> function is ''passed'' (provided with) a single

argument, the address of the first character in the string literal

<mode>"hello, world\n"</code>. The string literal is an unnamed

[[Array data type|array]] with elements of type

<mode>char</code>, set up automatically by the compiler with a final 0-

valued character to mark the end of the array (

<mode>printf</code> needs to know this). The

<mode>\n</code> is an ''escape sequence'' C translates to a

''[[newline]]'' character, which on output signifies the end of the

current line. The return value of the

<mode>printf</code> function is of type

<mode>int</code>, but it is silently discarded since it is not used.

(A more careful program might test the return value to determine

whether or not the

<mode>printf</code> function succeeded.) The semicolon

<mode>;</code> terminates the statement.

<mode>main</code> function and causes it to return the integer value

0, which is interpreted by the run-time system as an exit code

indicating successful execution.

<mode>main</code> function.

<mode>enum</code>). C99 added a [[boolean datatype]]. There are also

derived types including [[Array data type|array]]s, [[Pointer

(computing)|pointer]]s, [[record (computer science)|records]] (

<mode>struct</code>), and untagged [[union (computer science)|unions]]

(

<mode>union</code>).

<mode>struct</code> objects linked together using pointers. Pointers

to functions are useful for [[callback (computer science)|callbacks]]

from event handlers.

<mode>void *</code>) point to objects of unknown type, and can

therefore be used as "generic" data pointers. Since the size and type

of the pointed-to object is not known, void pointers cannot be

dereferenced, nor is pointer arithmetic on them allowed, although they

can easily be (and in many contexts implicitly are) converted to and

from any other object pointer type.

<mode>malloc</code> function, and treat it as an array. C's

unification of arrays and pointers (see below) means true arrays and

these dynamically-allocated, simulated arrays are virtually

interchangeable. Since arrays are always accessed (in effect) via

pointers, array accesses are typically ''not'' checked against the

underlying array size, although the compiler may provide bounds

checking as an option. Array bounds violations are therefore possible

and rather common in carelessly written code, and can lead to various

repercussions, including illegal memory accesses, corruption of data,

buffer overruns, and run-time exceptions.

<mode>x[i]</code> can also be used when

<mode>x</code> is a pointer; the interpretation (using pointer

arithmetic) is to access the

<mode>(i+1)</code>th of several adjacent data objects pointed to by <

<mode>x</code>, counting the object

<mode>x</code> points to (which is

<mode>x[0]</code>) as the first element of the array.

<mode>x[i]</code> is equivalent to

<mode>*(x + i)</code>. Since the type of the pointer involved is known

to the compiler at compile time, the address

<mode>x + i</code> points to is ''not'' the address pointed to by

<mode>x</code> incremented by

<mode>i</code> bytes, but rather incremented by

<mode>i</code> multiplied by the size of an element

<mode>x</code> points to. The size of these elements can be determined

with the operator

<mode>[[sizeof]]</code> by applying it to any dereferenced element of

<mode>x</code>, as in

<mode>n = sizeof *x</code> or

<mode>n = sizeof x[0]</code>.

<mode>sizeof </code>''array''), the name of an array is automatically

converted to a pointer to the array's first element; this implies an

array is never copied as a whole when named as an argument to a

function, but rather only the address of its first element is passed.

Therefore, although C's function calls use [[call-by-value|pass-by-

value]] semantics, arrays are ''in effect'' passed by [[reference

(computer science)|reference]].

<mode>a</code> can be determined as

<mode>sizeof a / sizeof a[0]</code>.

<mode>i[x] = 1;</code>, which has the index variable

<mode>i</code> apparently interchanged with the array variable

<mode>x</code>. This last line might be found in [[International

Obfuscated C Code Contest|obfuscated C]] code.

<mode>/* x designates an array */</code>

<mode>i[x] = 1; /* strange, but correct: i[x] is equivalent to *(i +

x) */</code>

<mode>memcpy</code> function, for example.)

<mode>[[malloc]]</code> from a region of memory called the [[dynamic

memory allocation|heap]]; these blocks persist until subsequently

freed for reuse by calling the library function

<mode>[[malloc|free]]</code>

<mode>[[malloc]]</code> for an example of dynamically allocated

arrays).

<mode>[[malloc|free()]]</code> has been called, then memory cannot be

recovered for later reuse and is essentially lost to the program, a

phenomenon known as a ''[[memory leak]].'' Conversely, it is possible

to release memory too soon and continue to access it; however, since

the allocation system can re-allocate or itself use the freed memory,

unpredictable behavior is likely to occur when the multiple users

corrupt each other's data. Typically, the symptoms will appear in a

portion of the program far removed from the actual error. Such issues

are ameliorated in languages with [[garbage collection (computer

science)|automatic garbage collection]] or [[resource acquisition is

initialization|RAII]].

<mode>-lm</code>, shorthand for "math library").

Musatov and MeAmI (http://www.meami.org) 'Search for the People!'(TM)</

code>

<mode>application/javascript</code>, which I registered in 2009 but is

supported by all major browsers. [[Internet Explorer]] processes

scripts with the attribute

<mode>type="application/javascript"</code>. The [[HTML 4.01]] and

[[HTML 5]] specifications mention the registered

<mode>text/javascript</code>, which is supported by all major browsers

and is more commonly used.

<mode><tt><!--</tt></code> ...

<mode><tt>--></tt> comment markup is required in order to ensure

that the code is not rendered as text by very old browsers which do

not recognize the

<mode><script></code> tag in HTML documents (although

<mode><tt>script</tt</code>-tags contained within the

<mode><tt>head</tt></code>-tag will never be rendered, thus the

comment markup is not always necessary), and the LANGUAGE attribute is

a [[Deprecation|deprecated]] HTML attribute which may be required for

old browsers. However,

<mode><script></code> tags in [[XHTML]]/[[XML]] documents will

not work if commented out, as conformant XHTML/XML parsers ignore

comments and also may encounter problems with

<mode><tt>--</tt></code>,

<mode><tt><</tt></code> and

<mode><tt>></tt></code> signs in scripts (for example, the integer

decrement operator and the comparison operators). XHTML documents

should therefore have scripts included as XML [[CDATA]] sections, by

preceding them with

<mode><code>//</code> at the start of a line marks a JavaScript

comment, which prevents the

<mode><nowiki></code><![CDATA[</nowiki></code> and

<mode><nowiki>]]></nowiki></code> from being parsed by the script.)

<mode><script type="application/javascript" src="hello.js"></script=

code>

<mode>language</code> is used in the following context:

<mode><meta http-equiv="Content-Script-Type" content="application/

javascript" /></code>

<mode>javascript:alert('Hello, world!');</code>

<mode>.pop(), .push(), .shift(), and .unshift() methods of arrays.</

code>

<mode>function set_image_source ( imageName, imageURL )</code>

<mode> if ( document.images ) // a test to discern if the

'document' object has a property called 'images' which value type-

converts to boolean true (as object references do)</code>

<mode> document.images[imageName].src = imageURL; // only

executed if there is an 'images' collection</code>

<mode> if ( document.body && document.body.style )</code>

<mode>document.body.style</code>" would ordinarily cause an error in a

browser that does not have a "

<mode>document.body</code>" property, but using the boolean operator "

<mode>&&</code>" ensures that "

<mode>document.body.style</code>" is never called if "document.body"

doesn't exist. This technique is called [[minimal evaluation]].

<mode>{{main|List of web application frameworks#JavaScript|l1=List of

client-side JavaScript frameworks}}</code>

Musatov and MeAmI (http://www.meami.org) 'Search for the People!'(TM)</

code>

/*BELOW CODE COPYRIGHT 2012 M. MUSATOV \*Mon 12/10/2012

03:30 AM

Volume in drive C has no label.

Volume Serial Number is 1026-A655

Directory of C:\Users\mmusatov

12/10/2012 03:30 AM <DIR> .

12/10/2012 03:30 AM <DIR> ..

12/08/2012 01:56 PM 0 !$OMP

11/23/2012 10:22 PM 0 #endif

12/08/2012 02:01 PM 0 #include

12/08/2012 01:50 PM 0 $KCODE

11/16/2012 12:29 PM 0 '

11/16/2012 12:29 PM 0 ''loathsome.al

11/16/2012 12:29 PM 0 ''Theft

05/15/2009 03:35 AM 0 '101010101010101010101010101010101=

0101010101010101010101010010

11/16/2012 12:29 PM 0 'Phalve

11/16/2012 12:29 PM 0 'vochtig

11/16/2012 12:29 PM 0 '~urif

11/23/2012 08:40 PM 0 (

12/02/2012 09:09 PM 0 (1)

12/02/2012 09:09 PM 0 (11)

11/15/2012 03:01 PM 0 (97

11/16/2012 12:28 PM 0 (97d

11/16/2012 12:28 PM 0 (97Errors

11/16/2012 12:28 PM 0 (97iEmany

12/02/2012 09:09 PM 0 (compiler

12/08/2012 01:51 PM 0 (I

11/16/2012 12:28 PM 0 (in

12/08/2012 01:51 PM 0 (Though

11/23/2012 10:37 PM 0 +

11/23/2012 10:37 PM 0 +-----+

11/23/2012 10:37 PM 0 +------+

11/23/2012 10:37 PM 0 +------------+

11/23/2012 10:37 PM 0 +-------------+

11/23/2012 10:37 PM 0 +-----------------+

11/23/2012 10:37 PM 0 +-----------------------+

11/23/2012 10:37 PM 0 +------------------------+

11/20/2012 03:29 PM 0 +A

11/20/2012 03:29 PM 0 +C

12/08/2012 02:01 PM 0 -

12/08/2012 01:54 PM 0 ---

11/23/2012 10:37 PM 0 ----------------------

11/20/2012 03:29 PM 0 -A

12/08/2012 02:01 PM 0 -l

10/18/2012 02:47 PM <DIR> .cisco

11/16/2012 12:29 PM 0 .~~

05/15/2009 03:35 AM 0 00

10/19/2012 11:00 PM <DIR> 000

05/15/2009 03:35 AM 0 0000030000'

05/15/2009 03:35 AM 0 002

05/15/2009 03:35 AM 0 01

12/09/2012 05:54 PM 0 013023003798

05/15/2009 03:35 AM 0 02

05/15/2009 03:35 AM 0 03

05/15/2009 03:35 AM 0 05

12/09/2012 05:53 PM 0 0525245774

05/15/2009 03:35 AM 0 06

05/15/2009 03:35 AM 0 07

05/15/2009 03:35 AM 0 08

05/15/2009 03:35 AM 0 09

12/09/2012 05:54 PM 0 093228040323

11/23/2012 10:37 PM 0 1

12/08/2012 01:51 PM 0 1)

11/23/2012 10:22 PM 0 10

10/19/2012 11:00 PM <DIR> 100

11/19/2012 04:21 AM 0 1000

05/15/2009 03:35 AM 0 1010101010101010101010101010101010=

1010101010

05/15/2009 03:34 AM 0 1010101010101010101010101010101010=

1010101010101010101010100101

05/15/2009 03:35 AM 0 1010101010101010101010101010101010=

1010101010101010101010100101000010000010000020000030000

12/09/2012 05:54 PM 0 101997070127

12/08/2012 01:55 PM 0 11

11/15/2012 12:55 AM 0 128

11/23/2012 10:37 PM 0 1BRMSTM1

11/23/2012 10:37 PM 0 1ESTIMATEPRIM

11/23/2012 10:37 PM 0 1FCOULC1

11/23/2012 10:37 PM 0 1PESTIMATEIRFR1

11/23/2012 10:37 PM 0 1PESTIMATEIRFZ1

11/23/2012 10:37 PM 0 1PESTIMATEIRRM1

11/23/2012 10:37 PM 0 1REMSLEEP_WESTIMATEKE!

11/23/2012 10:37 PM 0 1REMSLEEP_WESTIMATEKE!TM1

11/23/2012 10:37 PM 0 1RFMS1

12/09/2012 05:54 PM 0 2

12/08/2012 01:55 PM 0 23

12/09/2012 05:54 PM 0 275

11/23/2012 10:37 PM 0 3

12/09/2012 05:54 PM 0 3259190311497

12/08/2012 01:52 PM 0 4

12/09/2012 05:54 PM 0 4006680102160

12/08/2012 01:55 PM 0 5

12/09/2012 05:54 PM 0 5019322236382

12/09/2012 05:54 PM 0 5020393901024

12/09/2012 05:54 PM 0 5037300503929

12/09/2012 05:54 PM 0 5039036032575

12/09/2012 05:54 PM 0 5055060922231

12/09/2012 05:54 PM 0 5060018705224

12/09/2012 05:54 PM 0 5060023173896

12/09/2012 05:54 PM 0 5099720259794

12/10/2012 01:03 AM 0 6

12/09/2012 05:54 PM 0 6003805081940

12/09/2012 05:54 PM 0 6004416063554

12/09/2012 05:54 PM 0 600835076326

12/09/2012 05:54 PM 0 6009509313882

12/09/2012 05:54 PM 0 6009692883681

12/09/2012 05:54 PM 0 602498262290

12/09/2012 05:54 PM 0 724355208026

12/09/2012 05:54 PM 0 733565031317

12/09/2012 05:54 PM 0 803341192324

12/09/2012 05:54 PM 0 809478009313

12/09/2012 05:54 PM 0 828767527925

12/09/2012 05:54 PM 0 8717418137335

12/09/2012 05:54 PM 0 9780006174462

12/09/2012 05:54 PM 0 9780006550914

12/09/2012 05:54 PM 0 9780007105656

12/09/2012 05:54 PM 0 9780091732288

12/09/2012 05:54 PM 0 9780091825461

12/09/2012 05:54 PM 0 9780099831808

12/09/2012 05:54 PM 0 9780130108920

12/09/2012 05:54 PM 0 9780132233125

12/09/2012 05:54 PM 0 9780132345606

12/09/2012 05:54 PM 0 9780136012405

12/09/2012 05:54 PM 0 9780140297775

12/09/2012 05:54 PM 0 9780141442105

12/09/2012 05:54 PM 0 9780194573443

12/09/2012 05:54 PM 0 9780205380459

12/09/2012 05:54 PM 0 9780205561988

12/09/2012 05:54 PM 0 9780224068758

12/09/2012 05:54 PM 0 9780312940805

12/09/2012 05:54 PM 0 9780321289544

12/09/2012 05:54 PM 0 9780321341006

12/09/2012 05:54 PM 0 9780321473615

12/09/2012 05:54 PM 0 9780324272741

12/09/2012 05:54 PM 0 9780333485095

12/09/2012 05:54 PM 0 9780333748640

12/09/2012 05:54 PM 0 9780333980637

12/09/2012 05:54 PM 0 9780340859568

12/09/2012 05:54 PM 0 9780352331465

12/09/2012 05:54 PM 0 9780375405969

12/09/2012 05:54 PM 0 9780412369209

12/09/2012 05:54 PM 0 9780415301916

12/09/2012 05:54 PM 0 9780415393393

12/09/2012 05:54 PM 0 9780419258902

12/09/2012 05:54 PM 0 9780440219422

12/09/2012 05:54 PM 0 9780486407456

12/09/2012 05:54 PM 0 9780563463863

12/09/2012 05:54 PM 0 9780573114748

12/09/2012 05:54 PM 0 9780575076365

12/09/2012 05:54 PM 0 9780697138767

12/09/2012 05:54 PM 0 9780701138592

12/09/2012 05:54 PM 0 9780708909591

12/09/2012 05:54 PM 0 9780708922941

12/09/2012 05:54 PM 0 9780708949092

12/09/2012 05:54 PM 0 9780747529026

12/09/2012 05:54 PM 0 9780750516532

12/09/2012 05:54 PM 0 9780751531886

12/09/2012 05:54 PM 0 9780752843315

12/09/2012 05:54 PM 0 9780752881355

12/09/2012 05:54 PM 0 9780753122440

12/09/2012 05:54 PM 0 9780754001591

12/09/2012 05:54 PM 0 9780757818530

12/09/2012 05:54 PM 0 9780757826689

12/09/2012 05:54 PM 0 9780757864612

12/09/2012 05:54 PM 0 9780763137601

12/09/2012 05:54 PM 0 9780792849971

12/09/2012 05:54 PM 0 9780805853605

12/09/2012 05:54 PM 0 9780812590043

12/09/2012 05:54 PM 0 9780815156598

12/09/2012 05:54 PM 0 9780855981235

12/09/2012 05:54 PM 0 9780958535304

12/09/2012 05:54 PM 0 9781401911898

12/09/2012 05:54 PM 0 9781402213052

12/09/2012 05:54 PM 0 9781419827297

12/09/2012 05:54 PM 0 9781434619457

12/09/2012 05:54 PM 0 9781437508383

12/09/2012 05:54 PM 0 9781558744158

12/09/2012 05:54 PM 0 9781564554901

12/09/2012 05:54 PM 0 9781575307121

12/09/2012 05:54 PM 0 9781593244231

12/09/2012 05:54 PM 0 9781602527799

12/09/2012 05:54 PM 0 9781741664973

12/09/2012 05:54 PM 0 9781840592474

12/09/2012 05:54 PM 0 9781841490830

12/09/2012 05:54 PM 0 9781843191193

12/09/2012 05:54 PM 0 9781857720655

12/09/2012 05:54 PM 0 9781860428234

12/09/2012 05:54 PM 0 9781863150682

12/09/2012 05:54 PM 0 9781864489606

12/09/2012 05:54 PM 0 9781890560539

12/09/2012 05:54 PM 0 9781898924418

12/09/2012 05:54 PM 0 9781902509211

12/09/2012 05:54 PM 0 9781929494934

12/09/2012 05:54 PM 0 9783540532729

12/09/2012 05:54 PM 0 9785550240328

12/09/2012 05:54 PM 0 9785552401253

12/09/2012 05:54 PM 0 9785553597993

12/09/2012 05:54 PM 0 9785557488624

12/09/2012 05:54 PM 0 9785557831284

12/09/2012 05:54 PM 0 9785558481839

12/09/2012 05:54 PM 0 9785558630497

12/09/2012 05:54 PM 0 9785559116136

12/09/2012 05:54 PM 0 9785559216768

12/09/2012 05:54 PM 0 9785559540283

12/09/2012 05:54 PM 0 9785559717609

12/09/2012 05:54 PM 0 9785559845715

12/09/2012 05:54 PM 0 9786000052874

12/02/2012 09:09 PM 0 able

12/08/2012 12:00 AM 0 About

12/09/2012 05:54 PM 0 According

11/16/2012 12:29 PM 0 adscone

12/08/2012 12:00 AM 0 After

12/08/2012 12:00 AM 0 Again

12/08/2012 01:50 PM 0 agent

12/08/2012 05:55 PM 0 Alas!

12/08/2012 01:52 PM 0 alex

12/08/2012 01:54 PM 0 Alexandro

12/02/2012 09:09 PM 0 align

12/08/2012 12:00 AM 0 All

12/02/2012 09:09 PM 0 Allows

11/16/2012 12:28 PM 0 als

05/15/2009 03:36 AM 0 Amansions

12/08/2012 12:00 AM 0 Amarilly

12/08/2012 01:56 PM 0 an

12/08/2012 02:01 PM 0 angle_degree

12/02/2012 09:09 PM 0 applications

12/02/2012 09:09 PM 0 approximate

12/02/2012 09:09 PM 0 approximately

12/08/2012 12:00 AM 0 As

11/21/2012 05:41 AM 0 asset

12/08/2012 05:55 PM 0 Assuming

12/08/2012 12:00 AM 0 at

12/08/2012 02:01 PM 0 atan

12/02/2012 09:09 PM 0 attributed

12/02/2012 09:09 PM 0 automatic

12/03/2012 12:35 AM 0 A?D?P?_?T?r?a?n?s?a?c?t?i?o?n?R?e?=

q?u?i?r?e?d?_?E?x?e?c?u?t?e?

12/04/2012 11:07 AM 1,726 backtracking

12/04/2012 05:05 AM 1,726 BACKTRACKING.css

12/08/2012 12:00 AM 0 Beth

12/08/2012 12:00 AM 0 Beth's

12/08/2012 01:56 PM 0 between

11/23/2012 10:37 PM 0 BHESTIMATEBFM

12/09/2012 05:54 PM 0 Bible

12/09/2012 05:54 PM 0 Biography

11/16/2012 12:29 PM 0 Blaauw-bezien.W

12/02/2012 09:09 PM 0 body

12/09/2012 05:54 PM 0 Book

11/23/2012 10:22 PM 0 bool

12/02/2012 09:09 PM 0 border

11/23/2012 10:22 PM 0 bRestoreWS

11/23/2012 10:37 PM 0 BRMSFZ1

11/23/2012 10:37 PM 0 BRMSRZ

12/02/2012 09:09 PM 0 BtYacc

12/07/2012 01:42 AM <DIR> build

12/08/2012 12:00 AM 0 But

12/02/2012 09:09 PM 0 capable

10/19/2012 11:00 PM <DIR> CCCIDDD

12/09/2012 05:53 PM 0 CDROM

12/08/2012 05:55 PM 0 Children

12/02/2012 09:09 PM 0 clean

11/20/2012 03:29 PM 0 Client

12/02/2012 09:09 PM 0 code

11/23/2012 10:37 PM 0 COHETZ

11/21/2012 05:41 AM 0 command_line_parameters)

11/21/2012 05:41 AM 0 command_line_parameters[$key]

12/08/2012 02:01 PM 0 commented

11/23/2012 10:37 PM 0 COMP

12/02/2012 09:09 PM 0 compatibles

12/02/2012 09:09 PM 0 compilers

12/02/2012 09:09 PM 0 completely

12/09/2012 05:54 PM 0 Conducting

12/08/2012 12:00 AM 0 Conflicting

11/23/2012 10:22 PM 0 const

12/02/2012 09:09 PM 0 constituted

12/02/2012 09:09 PM 0 construction

12/09/2012 05:54 PM 0 Contabrica

11/14/2012 01:42 AM <DIR> Contacts

12/02/2012 09:09 PM 0 context-free

12/08/2012 01:55 PM 0 Could

12/02/2012 09:09 PM 0 CppCC

12/09/2012 05:54 PM 0 Curriculum

12/03/2012 10:03 PM 0 D

11/21/2012 05:41 AM 0 datadir

11/23/2012 12:00 AM 0 Dear

12/02/2012 09:09 PM 0 debugger

12/02/2012 09:09 PM 0 defined

12/02/2012 09:09 PM 0 Delphi

12/08/2012 01:55 PM 0 Depending

12/02/2012 09:09 PM 0 descent

12/07/2012 01:30 AM <DIR> Desktop

12/08/2012 12:00 AM 0 Diogenes

12/08/2012 12:00 AM 0 Diogenes'

12/10/2012 03:28 AM 0 DIR

12/08/2012 01:56 PM 0 direct

12/08/2012 01:55 PM 0 Do

12/10/2012 01:28 AM <DIR> Documents

12/02/2012 09:09 PM 0 does

11/21/2012 05:41 AM 0 doneFile

12/08/2012 02:01 PM 0 double

12/09/2012 04:34 PM <DIR> Downloads

12/09/2012 05:54 PM 0 Doyle

12/02/2012 09:09 PM 0 driver

12/08/2012 12:00 AM 0 During

10/19/2012 11:00 PM <DIR> e'en

12/08/2012 05:55 PM 0 Early

11/23/2012 10:37 PM 0 EBIND

11/16/2012 12:29 PM 0 een

11/23/2012 10:37 PM 0 ELEM

11/16/2012 12:28 PM 0 elev

12/02/2012 09:09 PM 0 Elkhound

11/16/2012 12:29 PM 0 ELw

10/19/2012 11:00 PM <DIR> end

12/02/2012 09:09 PM 0 english_adjectives__go.h

12/08/2012 01:54 PM 0 environment

12/09/2012 05:54 PM 0 Erotica

11/21/2012 05:41 AM 0 error

11/23/2012 10:37 PM 0 ESTIMATELKEI

11/23/2012 10:37 PM 0 ESTIMATEMOLFM

11/23/2012 10:37 PM 0 ESTIMATEND

11/23/2012 10:37 PM 0 ESTIMATEREC

12/02/2012 09:09 PM 0 evaluates

12/08/2012 05:55 PM 0 Even

12/08/2012 12:00 AM 0 Every

12/08/2012 12:00 AM 0 Everyone

12/08/2012 12:00 AM 0 Evidently

12/02/2012 09:09 PM 0 executable

11/21/2012 08:10 AM 6,040 ext.txt

11/23/2012 10:22 PM 0 false)

12/05/2012 11:44 AM <DIR> Favorites

12/02/2012 09:09 PM 0 few

12/02/2012 09:09 PM 0 file

11/19/2012 03:50 AM 568 filenames.txt

12/08/2012 01:56 PM 0 first

12/08/2012 02:01 PM 0 first but even as you're

12/02/2012 09:09 PM 0 Flex

12/02/2012 09:09 PM 0 flexibility

12/08/2012 02:01 PM 0 flows

06/15/2012 02:01 PM 428,888 FL_Microsoft.TeamFoundation.TestMa=

nagement.Client.xml

10/19/2012 11:00 PM <DIR> for

12/08/2012 01:47 PM 0 for(i

12/02/2012 09:09 PM 0 formalism

12/08/2012 12:00 AM 0 Fortunately

12/08/2012 12:00 AM 0 Four

11/14/2012 03:13 PM 544 ful.crd

11/21/2012 05:41 AM 0 fullname

12/08/2012 01:53 PM 0 functions

11/16/2012 12:29 PM 0 f~ittin

12/03/2012 10:03 PM 0 G

12/09/2012 05:54 PM 0 G.Kenneth

12/09/2012 05:54 PM 0 Galahad

11/20/2012 03:29 PM 0 GANC

12/02/2012 09:09 PM 0 generates

12/02/2012 09:09 PM 0 generating

12/02/2012 09:09 PM 0 generator

12/02/2012 09:09 PM 0 Generators

12/08/2012 01:47 PM 0 get

11/21/2012 05:41 AM 0 getDataDir()

11/21/2012 05:41 AM 0 getDBname

12/08/2012 01:51 PM 0 glen

11/23/2012 10:22 PM 0 go()

11/23/2012 10:22 PM 0 goFactory()

12/08/2012 12:00 AM 0 Going

12/09/2012 05:54 PM 0 Gordon

12/02/2012 09:09 PM 0 grammar

12/02/2012 09:09 PM 0 grammars

12/09/2012 05:54 PM 0 Grdaid

11/07/2012 10:41 AM <DIR> gtmp

11/16/2012 12:28 PM 0 gtmpgPa

12/03/2012 10:03 PM 0 h

12/02/2012 09:09 PM 0 handle

11/23/2012 12:00 AM 0 hard

12/08/2012 01:53 PM 0 have

12/08/2012 12:00 AM 0 He

12/02/2012 09:09 PM 0 height

12/02/2012 09:09 PM 0 Help

12/08/2012 05:55 PM 0 Her

12/08/2012 01:46 PM 0 Here

12/08/2012 01:56 PM 0 Hi

12/09/2012 05:53 PM 0 His

12/08/2012 12:00 AM 0 Hope

12/08/2012 01:54 PM 0 How

12/02/2012 09:09 PM 0 href

12/02/2012 09:09 PM 0 html

12/08/2012 12:00 AM 0 Huldah

12/08/2012 12:08 AM 0 I

12/04/2012 04:24 AM 0 i.prev_run

12/04/2012 04:24 AM 0 i.private

12/04/2012 04:24 AM 0 i.wait_queue

12/02/2012 09:09 PM 0 iburg

10/19/2012 11:00 PM <DIR> ID

12/08/2012 02:01 PM 0 IF

11/16/2012 12:28 PM 0 iff

11/23/2012 12:00 AM 0 illustrates

12/09/2012 05:54 PM 0 Incidence

12/08/2012 01:53 PM 0 increment

12/02/2012 09:09 PM 0 independent

12/08/2012 01:53 PM 0 indirection

10/12/2012 11:04 PM <DIR> information

12/08/2012 01:53 PM 0 init

12/08/2012 01:53 PM 0 initialization

12/02/2012 09:09 PM 0 input

12/08/2012 01:53 PM 0 integer

12/02/2012 09:09 PM 0 integrated

12/02/2012 09:09 PM 0 interactive

12/08/2012 01:46 PM 0 invite

11/16/2012 12:29 PM 0 isaccording

11/16/2012 12:29 PM 0 iseen

12/08/2012 12:00 AM 0 It

12/02/2012 09:09 PM 0 JB2CSharp

12/09/2012 05:54 PM 0 Johnny

12/08/2012 01:55 PM 0 Jugoslav

12/08/2012 12:00 AM 0 Just

11/16/2012 12:29 PM 0 Ke~'

12/09/2012 05:54 PM 0 Kirkby

10/19/2012 11:00 PM <DIR> Kruid

12/02/2012 09:09 PM 0 LALR(1)

12/02/2012 09:09 PM 0 language

12/08/2012 05:55 PM 0 Late

12/08/2012 02:01 PM 0 ld

12/02/2012 09:09 PM 0 Lexer

12/02/2012 09:09 PM 0 lexers

12/02/2012 09:09 PM 0 License

12/08/2012 12:00 AM 0 Life

12/02/2012 09:09 PM 0 link

08/31/2012 10:14 AM <DIR> Links

12/09/2012 05:54 PM 31 Lit

12/02/2012 09:09 PM 0 LLgen

12/08/2012 01:55 PM 0 loops

12/08/2012 01:53 PM 0 loop_expression

11/14/2012 03:21 PM 544 m.crd

12/08/2012 01:53 PM 0 manually

12/08/2012 12:00 AM 0 Many

12/06/2012 03:28 AM <DIR> Martin

12/09/2012 10:28 PM 150 Meami.org

11/23/2012 10:37 PM 0 MEESTIMATEMI.ORG

12/08/2012 12:00 AM 0 Men

12/08/2012 02:01 PM 0 merit

11/23/2012 10:37 PM 0 MESTIMATETHEMESTIMATETICESTIMATEL

12/10/2012 12:42 AM 439 Meta-S

12/09/2012 05:54 PM 0 Military

12/08/2012 12:00 AM 0 Miss

11/23/2012 10:37 PM 0 MIXT

12/09/2012 05:54 PM 0 mm

12/08/2012 01:46 PM 0 MM@rix

12/08/2012 01:55 PM 0 much

12/02/2012 09:09 PM 0 Multiple

11/15/2012 12:32 AM 16 Musatov.txt

12/03/2012 06:41 AM <DIR> Music

12/08/2012 12:00 AM 0 Mutual

12/08/2012 12:00 AM 0 my

11/19/2012 04:21 AM 0 m_classname

11/19/2012 04:21 AM 0 m_hWnd

12/03/2012 10:03 PM 0 n

11/21/2012 05:41 AM 0 namespaces[$ns])

12/09/2012 05:54 PM 0 Nations

11/14/2012 01:39 PM 1,426 new 2.mak

12/04/2012 11:07 AM 2,036 new 2.txt

12/04/2012 11:07 AM 5,935 new 4.txt

12/04/2012 11:07 AM 404 new 5

12/08/2012 02:02 PM 0 Newsgroup

12/08/2012 12:00 AM 0 Next

12/08/2012 02:01 PM 0 Nice

12/08/2012 02:01 PM 0 No

12/08/2012 12:00 AM 0 Nothing

12/08/2012 01:56 PM 0 now

11/21/2012 05:41 AM 0 ns

12/02/2012 09:09 PM 0 object-oriented

11/16/2012 12:29 PM 0 oin

12/08/2012 01:53 PM 0 OK

12/08/2012 12:00 AM 0 On

12/08/2012 12:00 AM 0 One

12/02/2012 09:09 PM 0 Online

12/08/2012 01:53 PM 0 Only

12/02/2012 09:09 PM 0 oolex

12/08/2012 01:56 PM 0 openmp

12/08/2012 01:55 PM 0 OpenMP)

05/15/2009 03:35 AM 0 operable

11/23/2012 10:37 PM 0 OR

12/09/2012 05:54 PM 0 Ordnance

12/09/2012 05:54 PM 0 Orrico

12/08/2012 12:00 AM 0 Our

12/08/2012 01:53 PM 0 out

12/10/2012 03:30 AM 27 output.txt

12/02/2012 09:09 PM 0 Outputs

12/02/2012 09:09 PM 0 package

12/08/2012 01:50 PM 0 page

12/08/2012 01:55 PM 0 parallizing

11/21/2012 05:41 AM 0 parseParameters()

12/02/2012 09:09 PM 0 parser

11/23/2012 10:22 PM 0 parser)

12/02/2012 09:09 PM 0 parsers

12/02/2012 09:09 PM 0 parsing

12/02/2012 09:09 PM 0 Pascal

12/02/2012 09:09 PM 0 PCCTS

12/08/2012 05:55 PM 0 Perceiving

12/02/2012 09:09 PM 0 perform

11/23/2012 10:37 PM 0 PESTIMATEIRFR

12/09/2012 05:54 PM 0 Philipp

12/08/2012 02:01 PM 0 pi

12/09/2012 01:17 PM <DIR> Pictures

12/08/2012 01:53 PM 0 platform

12/09/2012 05:54 PM 0 Polymeric

12/02/2012 09:09 PM 0 ports

12/08/2012 01:50 PM 0 Posted

11/23/2012 10:22 PM 0 pParent

12/08/2012 01:46 PM 0 practical

12/08/2012 02:01 PM 0 precisely

12/08/2012 12:00 AM 0 Presently

11/23/2012 10:22 PM 0 pReturnSymbol

11/23/2012 10:22 PM 0 pReturnSymbol)

12/08/2012 02:01 PM 0 printf

11/23/2012 10:22 PM 0 private

12/08/2012 01:53 PM 0 problem.solutions().push_back(

12/09/2012 05:54 PM 0 Procedures

12/02/2012 09:09 PM 0 program

12/02/2012 09:09 PM 0 provided

11/20/2012 03:29 PM 0 Proxy

12/08/2012 12:00 AM 0 Ptolemy

12/08/2012 12:00 AM 0 Ptolemy's

11/23/2012 10:22 PM 0 public

12/09/2012 05:54 PM 0 Publishers

12/08/2012 12:00 AM 0 Pythagoras

11/23/2012 10:37 PM 0 QFIT

12/08/2012 01:51 PM 0 quotients

11/23/2012 10:37 PM 0 r

12/02/2012 09:09 PM 0 Ragel

12/02/2012 09:09 PM 0 re-entrant

12/02/2012 09:09 PM 0 recovery

12/08/2012 02:01 PM 0 red

12/09/2012 05:54 PM 0 Registered

11/23/2012 10:07 PM 0 REMSLEEP_WAKE!FR

11/23/2012 10:07 PM 0 REMSLEEP_WAKE!TM

11/23/2012 10:37 PM 0 REMSLEEP_WESTIMATEKE!FR

11/23/2012 10:37 PM 0 REMSLEEP_WESTIMATEKE!FR1

11/23/2012 10:37 PM 0 REMSLEEP_WESTIMATEKE!FZ

11/23/2012 10:37 PM 0 REMSLEEP_WESTIMATEKE!TM1-+

11/23/2012 10:37 PM 0 REMSLEEP_WESTIMATEKE!TR

11/23/2012 10:37 PM 0 REMSLEEP_WESTIMATEKE!TR1

12/02/2012 09:09 PM 0 requested

12/08/2012 01:50 PM 0 require

12/08/2012 02:01 PM 0 result

12/08/2012 12:00 AM 0 Rob

12/08/2012 12:00 AM 0 Rob's

11/23/2012 10:22 PM 0 rpReturnSymbol

12/08/2012 01:50 PM 0 ruby

11/23/2012 12:09 AM 0 rWorkArea.bottom)

11/23/2012 12:09 AM 0 rWorkArea.right)

12/09/2012 05:54 PM 0 Sarah

08/28/2012 08:14 AM <DIR> Saved Games

12/09/2012 05:54 PM 0 Schwantner

11/16/2012 12:30 PM <DIR> Searches

12/08/2012 01:54 PM 0 select

12/04/2012 04:24 AM 0 self

12/02/2012 09:09 PM 0 semantic

11/16/2012 12:28 PM 0 Semis

12/02/2012 09:09 PM 0 serif

11/20/2012 03:29 PM 0 Server

12/08/2012 12:00 AM 0 She

12/08/2012 01:50 PM 0 shell

12/08/2012 12:00 AM 0 Silvia

12/08/2012 12:00 AM 0 Silvia's

12/02/2012 09:09 PM 0 simple

12/08/2012 02:01 PM 0 sin

12/02/2012 09:09 PM 0 SNOBOL4

10/19/2012 11:00 PM <DIR> so

12/08/2012 01:53 PM 0 solver.init(

12/08/2012 05:55 PM 0 Some

12/02/2012 09:09 PM 0 source

11/23/2012 10:37 PM 0 SPIONB1

12/02/2012 09:09 PM 0 Spirit

12/02/2012 09:09 PM 0 src

12/08/2012 01:53 PM 0 statement

11/23/2012 10:22 PM 0 static

12/09/2012 05:54 PM 0 Status

11/20/2012 03:29 PM 0 Stoddard

12/08/2012 12:00 AM 0 Strange

12/02/2012 09:09 PM 0 strictly

12/08/2012 01:53 PM 0 such

12/09/2012 05:54 PM 0 Support

12/08/2012 02:01 PM 0 symbol

11/16/2012 12:28 PM 0 S~tal-l,tter

11/16/2012 12:28 PM 0 TA

12/02/2012 09:09 PM 0 template

12/08/2012 01:54 PM 0 Thank

12/08/2012 01:55 PM 0 thanks

12/08/2012 12:00 AM 0 Then

12/08/2012 12:00 AM 0 there

12/08/2012 05:55 PM 0 Thereafter

12/08/2012 12:00 AM 0 They

12/08/2012 02:01 PM 0 Though

12/08/2012 05:55 PM 0 Through

12/08/2012 12:00 AM 0 Throughout

12/08/2012 05:55 PM 0 Time

12/09/2012 05:54 PM 0 Timeout

11/21/2012 05:41 AM 0 title

12/02/2012 09:09 PM 0 Toy

12/02/2012 09:09 PM 0 TPG

12/09/2012 05:54 PM 0 Traditions

12/02/2012 09:09 PM 0 transducer

12/02/2012 09:09 PM 0 translator

11/20/2012 06:26 PM <DIR> Trelby

12/08/2012 01:53 PM 0 Try

12/02/2012 09:09 PM 0 Turbo

12/08/2012 05:55 PM 0 Turning

12/10/2012 03:29 AM 0 type

11/20/2012 03:29 PM 0 UE

12/08/2012 05:55 PM 0 Uncle

12/08/2012 02:01 PM 0 Undefined

11/23/2012 10:22 PM 0 unsigned

11/23/2012 12:00 AM 0 useful

11/20/2012 03:29 PM 0 User

11/23/2012 10:37 PM 0 V

12/08/2012 01:54 PM 0 variables

12/04/2012 03:56 AM <DIR> Videos

12/08/2012 01:46 PM 0 vipopa

11/23/2012 10:22 PM 0 virtual

12/08/2012 12:00 AM 0 Visions

12/08/2012 02:01 PM 0 void

12/08/2012 12:00 AM 0 Wake

12/08/2012 12:00 AM 0 We

12/08/2012 01:51 PM 0 Well

12/08/2012 05:55 PM 0 What

12/08/2012 12:00 AM 0 when

12/08/2012 01:51 PM 0 where

12/02/2012 09:09 PM 0 Whereas

12/02/2012 09:09 PM 0 which

12/08/2012 05:55 PM 0 WHILE

12/08/2012 01:53 PM 0 while(

12/08/2012 01:53 PM 0 while(check())

12/08/2012 02:01 PM 0 why

12/02/2012 09:09 PM 0 width

11/15/2012 08:41 AM 2 Windows[1]

10/12/2012 11:00 PM <JUNCTION> with [\??\C:\Users\mmusatov\inscri=

ption]

12/08/2012 01:53 PM 0 within

12/08/2012 01:55 PM 0 without

12/02/2012 09:09 PM 0 works

11/21/2012 05:41 AM 0 wpipe_url

12/08/2012 01:53 PM 0 Writing

12/08/2012 01:51 PM 0 Wrong

11/16/2012 12:28 PM 0 x.16

11/23/2012 10:36 PM 0 XSIF

11/15/2012 03:01 PM 0 Y.Y.Y.Y.53

12/02/2012 09:09 PM 0 yacc

12/02/2012 09:09 PM 0 YAY

11/19/2012 04:26 AM 0 Yeah

12/02/2012 09:09 PM 0 YooLex

12/08/2012 02:01 PM 0 You

11/16/2012 12:28 PM 0 Y~(97g

12/09/2012 05:53 PM 0 zx715515047814

11/23/2012 10:07 PM 0 [

12/08/2012 02:02 PM 7,287 [...]

12/02/2012 09:09 PM 0 [LLOOP

12/08/2012 01:54 PM 0 _putenv(

11/23/2012 10:22 PM 0 {

12/08/2012 01:47 PM 0 {int

11/23/2012 10:22 PM 0 }

12/03/2012 12:36 AM 0 }??$

11/16/2012 12:29 PM 0 ~

11/16/2012 12:28 PM 0 ~(97e

11/16/2012 12:28 PM 0 ~(97welkast~ind.e.~aroead

12/09/2012 05:54 PM 0 c2009

12/08/2012 01:47 PM 0 O

12/08/2012 12:00 AM 0 "A

12/08/2012 12:00 AM 0 "About

12/08/2012 12:00 AM 0 "After

12/08/2012 12:00 AM 0 "Amarilly

12/08/2012 12:00 AM 0 "And

12/08/2012 12:00 AM 0 "Anyway

12/08/2012 12:00 AM 0 "Are

12/08/2012 12:00 AM 0 "As

12/08/2012 12:00 AM 0 "Back

12/08/2012 12:00 AM 0 "Bacon

12/08/2012 12:00 AM 0 "Be

12/08/2012 12:00 AM 0 "Because

12/08/2012 12:00 AM 0 "Beth

12/08/2012 12:00 AM 0 "Bless

12/08/2012 05:55 PM 0 "Boys!"

12/08/2012 12:00 AM 0 "Bravo

12/08/2012 12:00 AM 0 "Break

12/08/2012 12:00 AM 0 "Bring

12/08/2012 12:00 AM 0 "But

12/08/2012 12:00 AM 0 "By

12/08/2012 12:00 AM 0 "Certainly

12/08/2012 12:00 AM 0 "Chicken

12/08/2012 05:55 PM 0 "Children

12/08/2012 12:00 AM 0 "Come

12/08/2012 12:00 AM 0 "Couldn't

12/08/2012 12:00 AM 0 "Di

12/08/2012 12:00 AM 0 "Did

12/08/2012 12:00 AM 0 "Didn't

12/08/2012 12:00 AM 0 "Diogenes

12/08/2012 12:00 AM 0 "Diogenes!"

12/08/2012 12:00 AM 0 "Do

12/08/2012 05:55 PM 0 "Do!"

12/08/2012 12:00 AM 0 "Does

12/08/2012 12:00 AM 0 "Don't

12/08/2012 05:55 PM 0 "Emerald

12/08/2012 12:00 AM 0 "Et

12/08/2012 05:55 PM 0 "Father

12/08/2012 12:00 AM 0 "Fishing

12/08/2012 12:00 AM 0 "For

12/08/2012 12:00 AM 0 "Four

12/08/2012 12:00 AM 0 "From

12/08/2012 12:00 AM 0 "Gee!

12/08/2012 12:00 AM 0 "Get

12/08/2012 12:00 AM 0 "Ghosts

12/08/2012 05:55 PM 0 "Gladys

12/08/2012 12:00 AM 0 "Go

12/08/2012 12:00 AM 0 "Good

12/08/2012 05:55 PM 0 "Got

12/08/2012 12:00 AM 0 "Great

12/08/2012 12:00 AM 0 "Guess

12/08/2012 12:00 AM 0 "H

12/08/2012 05:55 PM 0 "Halloa!"

12/08/2012 12:00 AM 0 "He

12/08/2012 05:55 PM 0 "Here

12/08/2012 05:55 PM 0 "Here!"

12/08/2012 12:00 AM 0 "Here's

12/08/2012 12:00 AM 0 "He'll

12/08/2012 05:55 PM 0 "He's

12/08/2012 12:00 AM 0 "His

12/08/2012 12:00 AM 0 "Hold

12/08/2012 12:00 AM 0 "How

12/08/2012 12:00 AM 0 "Huh!

12/08/2012 12:00 AM 0 "Huh!"

12/08/2012 12:00 AM 0 "Huldah

12/08/2012 12:00 AM 0 "Hush!"

12/08/2012 12:00 AM 0 "I

12/08/2012 12:00 AM 0 "If

12/08/2012 12:00 AM 0 "In

12/08/2012 12:00 AM 0 "Indeed

12/08/2012 12:00 AM 0 "Is

12/08/2012 12:00 AM 0 "It

12/08/2012 12:00 AM 0 "It's

12/08/2012 12:00 AM 0 "I'd

12/08/2012 12:00 AM 0 "I'll

12/08/2012 12:00 AM 0 "I'm

12/08/2012 05:55 PM 0 "I've

12/08/2012 05:55 PM 0 "Keep

12/08/2012 12:00 AM 0 "Knowing

12/08/2012 12:00 AM 0 "Let's

12/08/2012 12:00 AM 0 "Line

12/08/2012 12:00 AM 0 "Lucien

12/08/2012 12:00 AM 0 "Lucien!"

12/08/2012 12:00 AM 0 "Lucien's

12/08/2012 12:00 AM 0 "May

12/08/2012 12:00 AM 0 "Maybe

12/08/2012 12:00 AM 0 "Mebby

12/08/2012 05:55 PM 0 "Milk

12/08/2012 12:00 AM 0 "Miss

12/08/2012 12:00 AM 0 "Mosquitoes!"

12/08/2012 05:55 PM 0 "Mother

12/08/2012 05:55 PM 0 "Mother!"

12/08/2012 12:00 AM 0 "Needn't

12/08/2012 12:00 AM 0 "Never

12/08/2012 05:55 PM 0 "Nevertheless

12/08/2012 12:00 AM 0 "No

12/08/2012 12:00 AM 0 "No!

12/08/2012 12:00 AM 0 "No!"

12/08/2012 12:00 AM 0 "None

12/08/2012 12:00 AM 0 "Not

12/08/2012 12:00 AM 0 "Now

12/08/2012 12:00 AM 0 "Numerous

12/08/2012 12:00 AM 0 "N--o

12/08/2012 12:00 AM 0 "Ocean

12/08/2012 12:00 AM 0 "Of

12/08/2012 12:00 AM 0 "Often

12/08/2012 12:00 AM 0 "Oh

12/08/2012 12:00 AM 0 "Oh!"

12/08/2012 12:00 AM 0 "On

12/08/2012 12:00 AM 0 "One

12/08/2012 12:00 AM 0 "Only

12/08/2012 12:00 AM 0 "People

12/08/2012 12:00 AM 0 "Playing

12/08/2012 12:00 AM 0 "Poor

12/08/2012 12:00 AM 0 "Presently

12/08/2012 12:00 AM 0 "Ptolemy

12/08/2012 12:00 AM 0 "Ptolemy's

12/08/2012 12:00 AM 0 "Pythagoras

12/08/2012 12:00 AM 0 "Read

12/08/2012 05:55 PM 0 "Resort

12/08/2012 12:00 AM 0 "Right

12/08/2012 12:00 AM 0 "Rob

12/08/2012 12:00 AM 0 "Say

12/08/2012 12:00 AM 0 "See

12/08/2012 12:00 AM 0 "She

12/08/2012 12:00 AM 0 "She'd

12/08/2012 12:00 AM 0 "She'll

12/08/2012 12:00 AM 0 "Show

12/08/2012 12:00 AM 0 "Sho'

12/08/2012 12:00 AM 0 "Silvia

12/08/2012 12:00 AM 0 "So

12/08/2012 12:00 AM 0 "Some

12/08/2012 12:00 AM 0 "Starboard!"

12/08/2012 12:00 AM 0 "Still

12/08/2012 12:00 AM 0 "Stop!"

12/08/2012 12:00 AM 0 "Such

12/08/2012 05:55 PM 0 "Suppose

12/08/2012 12:00 AM 0 "Sure

12/08/2012 12:00 AM 0 "Take

12/08/2012 12:00 AM 0 "Talk

12/08/2012 12:00 AM 0 "Tattle-tale!"

12/08/2012 12:00 AM 0 "Tell

12/08/2012 12:00 AM 0 "Thank

12/08/2012 12:00 AM 0 "That

12/08/2012 12:00 AM 0 "That's

12/08/2012 12:00 AM 0 "The

12/08/2012 12:00 AM 0 "Them

12/08/2012 12:00 AM 0 "Then

12/08/2012 12:00 AM 0 "There

12/08/2012 12:00 AM 0 "There's

12/08/2012 12:00 AM 0 "They

12/08/2012 05:55 PM 0 "They'd

12/08/2012 12:00 AM 0 "This

12/08/2012 12:00 AM 0 "Those

12/08/2012 12:00 AM 0 "Thrice

12/08/2012 12:00 AM 0 "Tightwad

12/08/2012 12:00 AM 0 "To

12/08/2012 12:00 AM 0 "Tolly!"

12/08/2012 12:00 AM 0 "Trying

12/08/2012 12:00 AM 0 "Very

12/08/2012 05:55 PM 0 "Wait!"

12/08/2012 12:00 AM 0 "Want

12/08/2012 12:00 AM 0 "We

12/08/2012 12:00 AM 0 "Well

12/08/2012 12:00 AM 0 "Well!"

12/08/2012 12:00 AM 0 "Went

12/08/2012 12:00 AM 0 "Were

12/08/2012 12:00 AM 0 "We'll

12/08/2012 12:00 AM 0 "We're

12/08/2012 12:00 AM 0 "We've

12/08/2012 12:00 AM 0 "What

12/08/2012 12:00 AM 0 "What'll

12/08/2012 12:00 AM 0 "What's

12/08/2012 12:00 AM 0 "Where

12/08/2012 12:00 AM 0 "Which

12/08/2012 12:00 AM 0 "Who

12/08/2012 12:00 AM 0 "Whom

12/08/2012 12:00 AM 0 "Why

12/08/2012 12:00 AM 0 "Will

12/08/2012 12:00 AM 0 "Wish

12/08/2012 12:00 AM 0 "With

12/08/2012 12:00 AM 0 "Won't

12/08/2012 12:00 AM 0 "Ye

12/08/2012 12:00 AM 0 "Yes

12/08/2012 12:00 AM 0 "You

12/08/2012 12:00 AM 0 "Young

12/08/2012 12:00 AM 0 "Your

12/08/2012 12:00 AM 0 "You'd

12/08/2012 12:00 AM 0 "You'll

12/08/2012 12:00 AM 0 "You're

12/08/2012 12:00 AM 0 "You've

12/08/2012 12:00 AM 0 "`Don't

12/08/2012 12:00 AM 0 "`Oh

12/08/2012 12:00 AM 0 "`Rob

12/08/2012 12:00 AM 0 "`You

12/03/2012 12:35 AM 0 ?p(

12/03/2012 12:36 AM 0 ??$

821 File(s) 457,789 bytes

29 Dir(s) 107,986,673,664 bytes free

/*ABOVE CODE COPYRIGHT 2012 M. MUSATOV MUSATOV[AT]ATT[DOT]NET \*

On Sat, Dec 12, 2009 at 1:00 AM, MeAmI.org <meami@vzw.blackberry.net> wrote=
:

{Main}
    Mai
     Ma
       M
         M
           M
             M
               M
                  M
                     M

Sent from my Verizon Wireless BlackBerry

--
Martin Musatov

Tel: (818) 430-4586
E-mail: marty.musatov@gmail.com

On Sat, Dec 12, 2009 at 10:18 PM, Martin Musatov <marty.musatov@gmail.com> =
wrote:

Meami.org
------Original Message------
From: MeAmI.org
To: marty.musatov@gmail.com
ReplyTo: meami@vzw.blackberry.net
Subject: Encryption Test:in:g:out:l
Sent: Dec 12, 2009 9:17 PM

martydotmusatovatgmaildotcom>g<l:reply+sender+auto-reply+generated-report=

:http://meami.org=forward

Sent from my Verizon Wireless BlackBerry

Sent from my Verizon Wireless BlackBerry

--
Martin Musatov

Tel: (818) 430-4586
E-mail: marty.musatov@gmail.com

---------- Forwarded message ----------
From: MeAmI.org <meami@vzw.blackberry.net>
Date: Sun, Dec 13, 2009 at 11:05 PM
Subject: The Formative Proof P = NP and Polynomial Algorithms Exist as Ac=
ts of Will
To: marty.musatov@gmail.com

Below this text as in explicitly stated below these words in the body or sa=
me portion of this e-mail message is sufficient proof to provably declare P=
= NP:

Proof:

1) Consider the predominately held belief by experts:

P=/=NP:translates to the conclusion outside of a machine as the computa=
tive symbolic statement and conclusion meaning the literal statement and be=
lief in quotation marks: "P does not equal NP"

2) Consider the alternative:

P = NP:translates to statement and result providing proof "P equals NP".

3) Statements 1 and 2 are binary conditions representing conclusive observa=
tions of real world experience, meaning the condition observed is the resul=
t of a mechanical process acknowledged by a person.

4) For the observation to be conclusive and at essence true to the nature o=
f the question either statement 1 is true or statement 2 is true and this c=
ondition is true and exists independent of observation.

To model this with a computer:

// Statement 1 is true;
// or
// Statement 2 is true;
// when
// true = true;

Sent from my Verizon Wireless BlackBerry

--
Martin Musatov

Tel: (818) 430-4586
E-mail: marty.musatov@gmail.com

---------- Forwarded message ----------
From: MeAmI.org <meami@vzw.blackberry.net>
Date: Mon, Dec 14, 2009 at 12:42 AM
Subject:
To: marty.musatov@gmail.com

2=true; 4=False < START http://www.meami.org/helloworld.html {e+mc^2-//=
in polynomial-time
// generate proof P =
// NP by halting when either:
// 1 statement 1 is true;
// print:(2)
// 2 statement 2 is true;
// print:(4)
// 2=true > ping command:
// print:
// 4=false < ping command:
// ping
Sent from my Verizon Wireless BlackBerry

--
Martin Musatov

Tel: (818) 430-4586
E-mail: marty.musatov@gmail.com

---------- Forwarded message ----------
From: johnprime13 <johnprime13@yahoo.com>
Date: Thu, Oct 15, 2009 at 1:40 PM
Subject: [primeform] Next prime after any integer
To: primeform@yahoogroups.com



Hello,

I've been playing about with prime numbers and came up with a program (C++)=
that tells you the next prime number following any integer you enter (with=
out using sieves or anything like that, ie it directly uses the number you =
enter to calculate the next prime number).

The way the program works is that it looks at the modulus of every number u=
p to the number you enter and then deduces from that the next prime number.

I was wondering if this method had been done before?

If not how does the speed of this method compare to current programs?
(If you type in 50000000 it will come back with the prime of 50000017 in ab=
out 80 seconds on my Athlon 64 5000+)

Sorry if the C++ looks a bit simple but this was my first attempt at a prog=
ram in C++ so i might have missed a few tricks.

Thanks

John

#include "stdafx.h"
#include <iostream>
#include <vector>
using namespace System;

int main(array<System::String ^> ^args)
{
using std::cin;
using std::cout;

long primeStart, loopF;
cin >> primeStart;
std::vector <bool> primeOK (primeStart);
loopF=2;
while (loopF < primeStart)
{
primeOK [loopF-primeStart%loopF]=true;
loopF++;
}

loopF=1;
while (primeOK[loopF]==true)
{
loopF++;
}
cout << primeStart << " " << loopF << std::endl;
Console::WriteLine(primeStart + loopF);
return 0;
}

__._,_.___
Reply to sender | Reply to group
Messages in this topic (1)
Recent Activity: New Members 1
Visit Your Group Start a New Topic
List address:
  Post message: primeform@yahoogroups.com
Web access:
  http://groups.yahoo.com/group/primeform
MARKETPLACE

Parenting Zone: Your community resource for family and home

Switch to: Text-Only, Daily Digest =E2=80=A2 Unsubscribe =E2=80=A2 Terms of=
Use
..

__,_._,___

--
Martin Musatov

Tel: (818) 430-4586
E-mail: marty.musatov@gmail.com

On Wed, Dec 16, 2009 at 3:53 PM, Yahoo! Groups <notify@yahoogroups.com> wro=
te:

We are unable to deliver the message from <marty.musatov@gmail.com>
to <primeform@yahoogroups.com>.

The email address used to send your message is not subscribed to this
group. If you are a member of this group, please be aware that you may
only send messages to this group using the email address(es) you have
registered with Yahoo! Groups.

If you would like to subscribe to this group:
1. visit
   http://groups.yahoo.com/group/primeform/join
-OR-
2. send email to primeform-subscribe@yahoogroups.com

For further assistance, please visit http://help.yahoo.com/l/us/yahoo/group=
s/original/members/forms/general.html

---------- Forwarded message ----------
From: "Martin Musatov" <marty.musatov@gmail.com>
To: primeform@yahoogroups.com
Cc:
Date: Wed, 16 Dec 2009 23:52:13 +0000
Subject: Re: [primeform] Next prime after any integer
[Un]http://-_+
[Uh\hn+pi-t=cysclock.+stadio.h@#.string

Sent from my Verizon Wireless BlackBerry
From: "johnprime13" <johnprime13@yahoo.com>
Date: Thu, 15 Oct 2009 20:40:50 -0000
To: <primeform@yahoogroups.com>
Subject: [primeform] Next prime after any integer



Hello,

I've been playing about with prime numbers and came up with a program (C++)=
that tells you the next prime number following any integer you enter (with=
out using sieves or anything like that, ie it directly uses the number you =
enter to calculate the next prime number).

The way the program works is that it looks at the modulus of every number u=
p to the number you enter and then deduces from that the next prime number.

I was wondering if this method had been done before?

If not how does the speed of this method compare to current programs?
(If you type in 50000000 it will come back with the prime of 50000017 in ab=
out 80 seconds on my Athlon 64 5000+)

Sorry if the C++ looks a bit simple but this was my first attempt at a prog=
ram in C++ so i might have missed a few tricks.

Thanks

John

#include "stdafx.h"
#include <iostream>
#include <vector>
using namespace System;

int main(array<System::String ^> ^args)
{
using std::cin;
using std::cout;

long primeStart, loopF;
cin >> primeStart;
std::vector <bool> primeOK (primeStart);
loopF=2;
while (loopF < primeStart)
{
primeOK [loopF-primeStart%loopF]=true;
loopF++;
}

loopF=1;
while (primeOK[loopF]==true)
{
loopF++;
}
cout << primeStart << " " << loopF << std::endl;
Console::WriteLine(primeStart + loopF);
return 0;
}

__._,_.___
Reply to sender | Reply to group
Messages in this topic (1)
Recent Activity: New Members 1
Visit Your Group Start a New Topic
List address:
  Post message: primeform@yahoogroups.com
Web access:
  http://groups.yahoo.com/group/primeform
MARKETPLACE

Parenting Zone: Your community resource for family and home

Switch to: Text-Only, Daily Digest =E2=80=A2 Unsubscribe =E2=80=A2 Terms of=
Use
..

__,_._,___

--
Martin Musatov

Tel: (818) 430-4586
E-mail: marty.musatov@gmail.com

---------- Forwarded message ----------
From: MeAmI.org <meami@vzw.blackberry.net>
Date: Fri, Dec 18, 2009 at 3:17 PM
Subject:
To: marty.musatov@gmail.com

12/23 12:25am
Sent from my Verizon Wireless BlackBerry

--
Martin Musatov

Tel: (818) 430-4586
E-mail: marty.musatov@gmail.com

---------- Forwarded message ----------
From: Martin Musatov <marty.musatov@gmail.com>
Date: Fri, Dec 18, 2009 at 3:19 PM
Subject: Re:
To: meami@vzw.blackberry.net

5:50pm on 1/10
------Original Message------
From: MeAmI.org
To: marty.musatov@gmail.com
ReplyTo: meami@vzw.blackberry.net
Subject:
Sent: Dec 18, 2009 2:17 PM

12/23 12:25am
Sent from my Verizon Wireless BlackBerry

Sent from my Verizon Wireless BlackBerry

--
Martin Musatov

Tel: (818) 430-4586
E-mail: marty.musatov@gmail.com

---------- Forwarded message ----------
From: Google Alerts <googlealerts-noreply@google.com>
Date: Sat, Dec 19, 2009 at 2:54 AM
Subject: Google Alert - "Martin Musatov"
To: marty.musatov@gmail.com

Google Web Alert for: "Martin Musatov"Math Forum Discussions
<+||Martin Musatov|||||||||+> <+|||||||||||||||||||||||||+> <+||All Rights =
Reserved||||+> <+||In Perpetuity||||||||||+> <+|||||||||||||||||||||||||+> =
....
Biodegradable Peanuts | TakePart Social Action Network ...
Check out some of our most popular stories of the week, as well as a few Ta=
kePart blogger favorites! TakePart Gang: Obama Global Love Fest by Martin M=
usatov ...
Computer-Aided Polynomial Time Processing - sci.comp-aided ...
The above message is from the inbox of Martin Musatov. It ... board:pequals=
np@ xxxxxxxxxxxxxxx).--Martin Musatov: As to languages and ...
OK, that's enough! - sci.math | Google Groups
Martin Musatov me...@vzw.blackberry.net. "Support Kindness Tolerance and Fr=
ee Speech online ..... credit exists):(but the author:(is)unknown. Martin M=
usatov ...

Tip: Use site restrict in your query to search within a site (site:nytimes.=
com or site:.edu). Learn more.

Remove this alert.
Create another alert.
Manage your alerts.

--
Martin Musatov

Tel: (818) 430-4586
E-mail: marty.musatov@gmail.com

---------- Forwarded message ----------
From: SamKillorfski <raghunandanwilkeningqyy@gmail.com>
Date: Wed, Jan 27, 2010 at 3:45 PM
Subject: Twitter software. Automatic twitter followers
To: "MeAmI.org" <meami-dot-org@googlegroups.com>

Twitter IM

Twitter IM is an open source desktop Twitter client for Windows.

      Store multiple search results in tabs.
    * Favourite
      Store individual tweets in a favourite list in the Categories
pane.
    * Set Twitter API refresh time interval
    * Improved performance and memory usage
and much more options. Read here http://trig.in/twitterim
Or you can download it here http://trig.in/twitterimdownlo .

Related searches: about twitter, twitter images, twitter on
blackberry, twitterrific, twitter oprah, tina fey twitter, twitter
shaq, mark hoppus twitter etc.
our airline tickets friends group
http://groups.google.com/group/airlineticketssearch/web/airline-tickets-for=
-sale

--
You received this message because you are subscribed to the Google Groups "=
MeAmI.org" group.
To post to this group, send email to meami-dot-org@googlegroups.com.
To unsubscribe from this group, send email to meami-dot-org+unsubscribe@goo=
glegroups.com.
For more options, visit this group at http://groups.google.com/group/meami-=
dot-org?hl=en.

--
Martin Musatov

Tel: (818) 430-4586
E-mail: marty.musatov@gmail.com