Changeset 58b6d1b
- Timestamp:
- Aug 6, 2018, 4:33:35 PM (7 years ago)
- Branches:
- ADT, aaron-thesis, arm-eh, ast-experimental, cleanup-dtors, deferred_resn, demangler, enum, forall-pointer-decay, jacob/cs343-translation, jenkins-sandbox, master, new-ast, new-ast-unique-expr, no_list, persistent-indexer, pthread-emulation, qualifiedEnum
- Children:
- 524ed86
- Parents:
- 73abe95
- Files:
-
- 40 edited
- 1 moved
-
libcfa/src/Makefile.am (modified) (1 diff)
-
libcfa/src/Makefile.in (modified) (4 diffs)
-
libcfa/src/bits/signal.hfa (modified) (1 diff)
-
libcfa/src/common.cfa (modified) (2 diffs)
-
libcfa/src/concurrency/alarm.hfa (modified) (1 diff)
-
libcfa/src/concurrency/coroutine.cfa (modified) (1 diff)
-
libcfa/src/concurrency/kernel.cfa (modified) (1 diff)
-
libcfa/src/concurrency/kernel_private.hfa (modified) (1 diff)
-
libcfa/src/concurrency/monitor.cfa (modified) (2 diffs)
-
libcfa/src/concurrency/monitor.hfa (modified) (1 diff)
-
libcfa/src/concurrency/mutex.cfa (modified) (1 diff)
-
libcfa/src/concurrency/mutex.hfa (modified) (1 diff)
-
libcfa/src/concurrency/thread.cfa (modified) (1 diff)
-
libcfa/src/concurrency/thread.hfa (modified) (1 diff)
-
libcfa/src/containers/maybe.cfa (modified) (1 diff)
-
libcfa/src/containers/pair.cfa (modified) (4 diffs)
-
libcfa/src/containers/result.cfa (modified) (1 diff)
-
libcfa/src/containers/vector.cfa (modified) (1 diff)
-
libcfa/src/fstream.cfa (modified) (1 diff)
-
libcfa/src/fstream.hfa (modified) (1 diff)
-
libcfa/src/heap.cfa (modified) (1 diff)
-
libcfa/src/interpose.cfa (modified) (1 diff)
-
libcfa/src/iostream.cfa (modified) (1 diff)
-
libcfa/src/iostream.hfa (moved) (moved from libcfa/src/iostream) (1 diff)
-
libcfa/src/iterator.cfa (modified) (2 diffs)
-
libcfa/src/limits.cfa (modified) (3 diffs)
-
libcfa/src/math.hfa (modified) (1 diff)
-
libcfa/src/rational.cfa (modified) (1 diff)
-
libcfa/src/rational.hfa (modified) (1 diff)
-
libcfa/src/stdlib.cfa (modified) (1 diff)
-
libcfa/src/stdlib.hfa (modified) (1 diff)
-
libcfa/src/time.cfa (modified) (2 diffs)
-
tests/.expect/fstream_test.txt (modified) (1 diff)
-
tests/.expect/io1.txt (modified) (1 diff)
-
tests/Makefile.in (modified) (3 diffs)
-
tests/coroutine/.expect/fmtLines.txt (modified) (1 diff)
-
tests/fstream_test.c (modified) (1 diff)
-
tests/io1.c (modified) (2 diffs)
-
tests/maybe.c (modified) (1 diff)
-
tests/result.c (modified) (1 diff)
-
tests/time.c (modified) (1 diff)
Legend:
- Unmodified
- Added
- Removed
-
TabularUnified libcfa/src/Makefile.am ¶
r73abe95 r58b6d1b 67 67 bits/debug.hfa \ 68 68 bits/locks.hfa \ 69 concurrency/invoke.h fa69 concurrency/invoke.h 70 70 71 71 MOSTLYCLEANFILES = prelude.c -
TabularUnified libcfa/src/Makefile.in ¶
r73abe95 r58b6d1b 343 343 AM_CCASFLAGS = -g -Wall -Wno-unused-function @ARCH_FLAGS@ 344 344 345 #---------------------------------------------------------------------------------------------------------------- 346 345 347 # not all platforms support concurrency, add option do disable it 346 headers = fstream iostream iterator limits rational time stdlib common \ 347 containers/maybe containers/pair containers/result \ 348 containers/vector concurrency/coroutine concurrency/thread \ 349 concurrency/kernel concurrency/monitor concurrency/mutex 350 libobjs = ${headers:=.o} 348 headers = fstream.hfa iostream.hfa iterator.hfa limits.hfa \ 349 rational.hfa time.hfa stdlib.hfa common.hfa \ 350 containers/maybe.hfa containers/pair.hfa containers/result.hfa \ 351 containers/vector.hfa concurrency/coroutine.hfa \ 352 concurrency/thread.hfa concurrency/kernel.hfa \ 353 concurrency/monitor.hfa concurrency/mutex.hfa 354 libobjs = ${headers:.hfa=.o} 351 355 352 356 # not all platforms support concurrency, add option do disable it 353 357 libsrc = prelude.c startup.cfa interpose.cfa bits/debug.cfa assert.cfa \ 354 exception.c virtual.c heap.cfa ${headers: =.cfa} \358 exception.c virtual.c heap.cfa ${headers:.hfa=.cfa} \ 355 359 concurrency/CtxSwitch-@ARCHITECTURE@.S concurrency/alarm.cfa \ 356 360 concurrency/invoke.c concurrency/preemption.cfa … … 359 363 cfa_includedir = $(CFA_INCDIR) 360 364 nobase_cfa_include_HEADERS = \ 361 ${headers} 362 ${stdhdr} 363 math 364 gmp 365 time_t.h 366 bits/align.h 367 bits/containers.h 368 bits/defs.h 369 bits/debug.h 370 bits/locks.h 365 ${headers} \ 366 ${stdhdr} \ 367 math.hfa \ 368 gmp.hfa \ 369 time_t.hfa \ 370 bits/align.hfa \ 371 bits/containers.hfa \ 372 bits/defs.hfa \ 373 bits/debug.hfa \ 374 bits/locks.hfa \ 371 375 concurrency/invoke.h 372 376 373 CLEANFILES = prelude.c377 MOSTLYCLEANFILES = prelude.c 374 378 all: all-am 375 379 … … 670 674 fi 671 675 mostlyclean-generic: 676 -test -z "$(MOSTLYCLEANFILES)" || rm -f $(MOSTLYCLEANFILES) 672 677 673 678 clean-generic: 674 -test -z "$(CLEANFILES)" || rm -f $(CLEANFILES)675 679 676 680 distclean-generic: … … 783 787 $(am__mv) $$depbase.Tpo $$depbase.Po 784 788 785 # extensionless header files are overridden by -o flag in default makerule => explicitly override default rule to silently do nothing 786 # SKULLDUGGERY in order to make sure this isn't called make the rule always fail but also create a rule for headers 787 % : %.c 788 echo "Dummy rule, should never be called" 789 false 790 791 # This rule should always match headers and since it has no prerequisite it will never be called 792 $(addprefix $(srcdir)/,$(headers)): 793 echo "Dummy rule, should never be called" 794 false 795 796 ${libobjs} : ${cfalib_DATA} # add dependency to cfa-cpp so all libraries are rebuilt with new translator 797 789 #---------------------------------------------------------------------------------------------------------------- 790 # add dependency to cfa-cpp so all libraries are rebuilt with new translator 791 ${libobjs} : ${cfalib_DATA} 792 793 #---------------------------------------------------------------------------------------------------------------- 798 794 maintainer-clean-local: 799 795 -rm -rf ${CFA_INCDIR} ${CFA_LIBDIR} -
TabularUnified libcfa/src/bits/signal.hfa ¶
r73abe95 r58b6d1b 22 22 #include <errno.h> 23 23 #define __USE_GNU 24 #include <signal.h fa>24 #include <signal.h> 25 25 #undef __USE_GNU 26 26 #include <stdlib.h> -
TabularUnified libcfa/src/common.cfa ¶
r73abe95 r58b6d1b 1 // -*- Mode: C -*- 2 // 1 // -*- Mode: C -*- 2 // 3 3 // Cforall Version 1.0.0 Copyright (C) 2016 University of Waterloo 4 4 // 5 5 // The contents of this file are covered under the licence agreement in the 6 6 // file "LICENCE" distributed with Cforall. 7 // 8 // common.c -- 9 // 7 // 8 // common.c -- 9 // 10 10 // Author : Peter A. Buhr 11 11 // Created On : Thu Jul 12 08:02:29 2018 … … 13 13 // Last Modified On : Thu Jul 12 08:38:47 2018 14 14 // Update Count : 3 15 // 15 // 16 16 17 #include "common "17 #include "common.hfa" 18 18 #include <stdlib.h> // div_t, *div 19 19 -
TabularUnified libcfa/src/concurrency/alarm.hfa ¶
r73abe95 r58b6d1b 21 21 #include <assert.h> 22 22 23 #include "time "23 #include "time.hfa" 24 24 25 25 struct thread_desc; -
TabularUnified libcfa/src/concurrency/coroutine.cfa ¶
r73abe95 r58b6d1b 14 14 // 15 15 16 #include "coroutine "16 #include "coroutine.hfa" 17 17 18 18 extern "C" { -
TabularUnified libcfa/src/concurrency/kernel.cfa ¶
r73abe95 r58b6d1b 22 22 #include <fenv.h> 23 23 #include <sys/resource.h> 24 #include <signal.h fa>24 #include <signal.h> 25 25 #include <unistd.h> 26 26 } 27 27 28 28 //CFA Includes 29 #include "time "29 #include "time.hfa" 30 30 #include "kernel_private.hfa" 31 31 #include "preemption.hfa" -
TabularUnified libcfa/src/concurrency/kernel_private.hfa ¶
r73abe95 r58b6d1b 16 16 #pragma once 17 17 18 #include "kernel "19 #include "thread "18 #include "kernel.hfa" 19 #include "thread.hfa" 20 20 21 21 #include "alarm.hfa" -
TabularUnified libcfa/src/concurrency/monitor.cfa ¶
r73abe95 r58b6d1b 14 14 // 15 15 16 #include "monitor "16 #include "monitor.hfa" 17 17 18 18 #include <stdlib.hfa> … … 21 21 #include "kernel_private.hfa" 22 22 23 #include "bits/algorithm s.hfa"23 #include "bits/algorithm.hfa" 24 24 25 25 //----------------------------------------------------------------------------- -
TabularUnified libcfa/src/concurrency/monitor.hfa ¶
r73abe95 r58b6d1b 20 20 #include <assert.h> 21 21 #include "invoke.h" 22 #include "stdlib "22 #include "stdlib.hfa" 23 23 24 24 trait is_monitor(dtype T) { -
TabularUnified libcfa/src/concurrency/mutex.cfa ¶
r73abe95 r58b6d1b 16 16 // 17 17 18 #include "mutex "18 #include "mutex.hfa" 19 19 20 20 #include "kernel_private.hfa" -
TabularUnified libcfa/src/concurrency/mutex.hfa ¶
r73abe95 r58b6d1b 20 20 #include <stdbool.h> 21 21 22 #include "bits/algorithm s.hfa"22 #include "bits/algorithm.hfa" 23 23 #include "bits/locks.hfa" 24 24 -
TabularUnified libcfa/src/concurrency/thread.cfa ¶
r73abe95 r58b6d1b 14 14 // 15 15 16 #include "thread "16 #include "thread.hfa" 17 17 18 18 #include "kernel_private.hfa" -
TabularUnified libcfa/src/concurrency/thread.hfa ¶
r73abe95 r58b6d1b 19 19 #include "invoke.h" 20 20 21 #include "coroutine "22 #include "kernel "23 #include "monitor "21 #include "coroutine.hfa" 22 #include "kernel.hfa" 23 #include "monitor.hfa" 24 24 25 25 //----------------------------------------------------------------------------- -
TabularUnified libcfa/src/containers/maybe.cfa ¶
r73abe95 r58b6d1b 14 14 // 15 15 16 #include <containers/maybe >16 #include <containers/maybe.hfa> 17 17 #include <assert.h> 18 18 -
TabularUnified libcfa/src/containers/pair.cfa ¶
r73abe95 r58b6d1b 11 11 // 12 12 13 #include <containers/pair >13 #include <containers/pair.hfa> 14 14 15 forall(otype R, otype S 15 forall(otype R, otype S 16 16 | { int ?==?(R, R); int ?<?(R, R); int ?<?(S, S); }) 17 17 int ?<?(pair(R, S) p, pair(R, S) q) { … … 19 19 } 20 20 21 forall(otype R, otype S 21 forall(otype R, otype S 22 22 | { int ?==?(R, R); int ?<?(R, R); int ?<=?(S, S); }) 23 23 int ?<=?(pair(R, S) p, pair(R, S) q) { … … 35 35 } 36 36 37 forall(otype R, otype S 37 forall(otype R, otype S 38 38 | { int ?==?(R, R); int ?>?(R, R); int ?>?(S, S); }) 39 39 int ?>?(pair(R, S) p, pair(R, S) q) { … … 41 41 } 42 42 43 forall(otype R, otype S 43 forall(otype R, otype S 44 44 | { int ?==?(R, R); int ?>?(R, R); int ?>=?(S, S); }) 45 45 int ?>=?(pair(R, S) p, pair(R, S) q) { -
TabularUnified libcfa/src/containers/result.cfa ¶
r73abe95 r58b6d1b 14 14 // 15 15 16 #include <containers/result >16 #include <containers/result.hfa> 17 17 #include <assert.h> 18 18 -
TabularUnified libcfa/src/containers/vector.cfa ¶
r73abe95 r58b6d1b 14 14 // 15 15 16 #include <containers/vector >16 #include <containers/vector.hfa> 17 17 18 18 #include <stdlib.hfa> -
TabularUnified libcfa/src/fstream.cfa ¶
r73abe95 r58b6d1b 14 14 // 15 15 16 #include "fstream "16 #include "fstream.hfa" 17 17 18 18 #include <stdio.h> // vfprintf, vfscanf -
TabularUnified libcfa/src/fstream.hfa ¶
r73abe95 r58b6d1b 16 16 #pragma once 17 17 18 #include "iostream "18 #include "iostream.hfa" 19 19 20 20 enum { sepSize = 16 }; -
TabularUnified libcfa/src/heap.cfa ¶
r73abe95 r58b6d1b 26 26 #include "bits/locks.hfa" // __spinlock_t 27 27 #include "startup.hfa" // STARTUP_PRIORITY_MEMORY 28 #include "stdlib " // bsearchl28 #include "stdlib.hfa" // bsearchl 29 29 #include "malloc.h" 30 30 -
TabularUnified libcfa/src/interpose.cfa ¶
r73abe95 r58b6d1b 18 18 #include <unistd.h> // _exit, getpid 19 19 #define __USE_GNU 20 #include <signal.h fa>20 #include <signal.h> 21 21 #undef __USE_GNU 22 22 extern "C" { -
TabularUnified libcfa/src/iostream.cfa ¶
r73abe95 r58b6d1b 14 14 // 15 15 16 #include "iostream "16 #include "iostream.hfa" 17 17 18 18 extern "C" { -
TabularUnified libcfa/src/iostream.hfa ¶
r73abe95 r58b6d1b 16 16 #pragma once 17 17 18 #include "iterator "18 #include "iterator.hfa" 19 19 20 20 trait ostream( dtype ostype ) { -
TabularUnified libcfa/src/iterator.cfa ¶
r73abe95 r58b6d1b 5 5 // file "LICENCE" distributed with Cforall. 6 6 // 7 // iterator.c -- 7 // iterator.c -- 8 8 // 9 9 // Author : Richard C. Bilson … … 14 14 // 15 15 16 #include "iterator "16 #include "iterator.hfa" 17 17 18 18 forall( otype iterator_type, otype elt_type | iterator( iterator_type, elt_type ) ) -
TabularUnified libcfa/src/limits.cfa ¶
r73abe95 r58b6d1b 1 // 1 // 2 2 // Cforall Version 1.0.0 Copyright (C) 2016 University of Waterloo 3 3 // 4 4 // The contents of this file are covered under the licence agreement in the 5 5 // file "LICENCE" distributed with Cforall. 6 // 7 // limits.c -- 8 // 6 // 7 // limits.c -- 8 // 9 9 // Author : Peter A. Buhr 10 10 // Created On : Wed Apr 6 18:06:52 2016 … … 12 12 // Last Modified On : Thu Mar 1 16:22:51 2018 13 13 // Update Count : 74 14 // 14 // 15 15 16 16 #include <limits.h> … … 19 19 #include <math.h> 20 20 #include <complex.h> 21 #include "limits "21 #include "limits.hfa" 22 22 23 23 // Integral Constants -
TabularUnified libcfa/src/math.hfa ¶
r73abe95 r58b6d1b 350 350 //--------------------------------------- 351 351 352 #include "common "352 #include "common.hfa" 353 353 354 354 //--------------------------------------- -
TabularUnified libcfa/src/rational.cfa ¶
r73abe95 r58b6d1b 14 14 // 15 15 16 #include "rational "17 #include "fstream "18 #include "stdlib "16 #include "rational.hfa" 17 #include "fstream.hfa" 18 #include "stdlib.hfa" 19 19 20 20 forall( otype RationalImpl | arithmetic( RationalImpl ) ) { -
TabularUnified libcfa/src/rational.hfa ¶
r73abe95 r58b6d1b 18 18 #pragma once 19 19 20 #include "iostream "20 #include "iostream.hfa" 21 21 22 22 trait scalar( otype T ) { -
TabularUnified libcfa/src/stdlib.cfa ¶
r73abe95 r58b6d1b 14 14 // 15 15 16 #include "stdlib "16 #include "stdlib.hfa" 17 17 18 18 //--------------------------------------- -
TabularUnified libcfa/src/stdlib.hfa ¶
r73abe95 r58b6d1b 251 251 //--------------------------------------- 252 252 253 #include "common "253 #include "common.hfa" 254 254 255 255 // Local Variables: // -
TabularUnified libcfa/src/time.cfa ¶
r73abe95 r58b6d1b 1 // 1 // 2 2 // Cforall Version 1.0.0 Copyright (C) 2018 University of Waterloo 3 3 // 4 4 // The contents of this file are covered under the licence agreement in the 5 5 // file "LICENCE" distributed with Cforall. 6 // 7 // time.c -- 8 // 6 // 7 // time.c -- 8 // 9 9 // Author : Peter A. Buhr 10 10 // Created On : Tue Mar 27 13:33:14 2018 … … 12 12 // Last Modified On : Sun May 6 22:26:00 2018 13 13 // Update Count : 37 14 // 14 // 15 15 16 #include "time "17 #include "iostream "16 #include "time.hfa" 17 #include "iostream.hfa" 18 18 #include <stdio.h> // snprintf 19 19 #include <assert.h> -
TabularUnified tests/.expect/fstream_test.txt ¶
r73abe95 r58b6d1b 2 2 Vous avez entré -2 3 3 le nombre -2 est négatif 4 Entrez trois nombres, s'il vous plaît: 4 Entrez trois nombres, s'il vous plaît: 5 5 Vous avez entré i:2 j:3 k:4 -
TabularUnified tests/.expect/io1.txt ¶
r73abe95 r58b6d1b 8 8 9 9 closing delimiters 10 1, x 2. x 3; x 4! x 5? x 6% x 7 ¢ x 8» x 9) x 10] x 11} x10 1, x 2. x 3; x 4! x 5? x 6% x 7 ¢ x 8 » x 9) x 10] x 11} x 11 11 12 12 opening/closing delimiters -
TabularUnified tests/Makefile.in ¶
r73abe95 r58b6d1b 307 307 fstream_test_SOURCES = fstream_test.c 308 308 avl_test_SOURCES = avltree/avl_test.c avltree/avl0.c avltree/avl1.c avltree/avl2.c avltree/avl3.c avltree/avl4.c avltree/avl-private.c 309 310 # SKULLDUGGERY like libcfa/Makefile.am prevent extensionless headers from being generated311 # however, here it is more complicated because it must match the dependencies based on how312 # they are generated by gcc313 headers = $(shell find $(top_srcdir)/libcfa/src -type f ! -name "*.*")314 headers_real = $(shell realpath --relative-to=$(top_srcdir)/libcfa/src $(headers))315 headers_deps = $(addprefix %/, $(headers_real))316 309 all: all-am 317 310 … … 618 611 .INTERMEDIATE: .validate .validate.c 619 612 613 #---------------------------------------------------------------------------------------------------------------- 620 614 all-local : 621 615 @+${TEST_PY} --debug=${debug} ${concurrent} ${quick_test} … … 638 632 concurrency : 639 633 @+${TEST_PY} --debug=${debug} -Iconcurrent 640 $(headers_deps) : 641 echo "Dummy rule, should never be called" 642 643 # %/stdlib: 644 # echo "Dummy rule, should never be called" 645 634 635 #---------------------------------------------------------------------------------------------------------------- 646 636 # implicit rule so not all test require a rule 647 637 % : %.c $(CC) -
TabularUnified tests/coroutine/.expect/fmtLines.txt ¶
r73abe95 r58b6d1b 1 // / / Cf oral l Ve rsio 2 n 1. 0.0 Copy righ t (C 3 ) 20 17 U nive rsit y of 4 Wat erlo o/// / Th e co 5 nten ts o f th is f ile 6 are cove red unde r th 7 e li cenc e ag reem ent 8 in t he// fil e "L ICEN 9 CE" dist ribu ted with 10 Cfo rall .// // f mtLi 11 nes. cc - - // // Auth 12 or : P eter 13 A. Buhr // C reat ed O 14 n : Su n Se p 17 15 21: 56:1 5 20 17// Las 16 t Mo difi ed B y : Pete 17 r A. Buh r// Last Mod 18 ifie d On : M on S ep 1 19 8 11 :35: 57 2 017/ / Up 20 date Cou nt : 31/ 21 / #i nclu de < fstr eam> 22 #inc lude <co rout ine> 23 coro utin e Fo rmat { c 24 har ch; // 25 use d fo r co mmun icat 26 ion int g, b ; 27 // g loba l be caus 28 e us ed i n de stru ctor 29 };vo id ? {}( Form at & 30 fmt ) { resu me( 31 fmt ); // s 32 tart cor outi ne}v oid 33 ^?{} ( Fo rmat & f mt ) 34 { if ( f mt.g != 35 0 || fmt .b ! = 0 ) so 36 ut | end l;}v oid main 37 ( Fo rmat & f mt ) { f 38 or ( ;; ) { 39 // for as m any char 40 acte rs for ( fm t.g 41 = 0; fmt .g < 5; fmt. 42 g += 1 ) { // g roup 43 s of 5 b lock s for 44 ( fm t.b = 0; fmt .b < 45 4; fmt. b += 1 ) { / 46 / bl ocks of 4 ch arac 47 ters for ( ;; ) { 48 / / fo r ne wlin 49 e ch arac ters sus 50 pend (); if ( fmt 51 .ch != ' \n' ) br eak; 52 // ign ore newl ine 53 } // for s out 54 | fm t.ch ; // p 55 rint cha ract er } / 56 / fo r sout | " "; 57 // p rint blo 58 ck s epar ator } // f 59 or sout | e ndl; 60 // prin t gr oup 61 sepa rato r } // f or} 62 // m ainv oid prt( For 63 mat & fm t, c har ch ) 64 { fm t.ch = c h; 65 re sume ( fm t ); } // 66 prt int main () { For 67 mat fmt; cha r ch ; fo 68 r ( ;; ) { sin | ch 69 ; / / re ad o 70 ne c hara cter i f ( 71 eof( sin ) ) bre ak; 72 // eof ? prt( 73 fmt , ch ); } // for 74 } // mai n// Loca l Va 75 riab les: /// / ta b-wi 76 dth: 4 / /// comp ile- 77 comm and: "cf a fm tLin 78 es.c " // // E nd: // 1 //// Cfo rall Ver sion 2 1.0 .0 C opyr ight (C) 3 201 7 Un iver sity of 4 Wate rloo //// The con 5 tent s of thi s fi le a 6 re c over ed u nder the 7 lic ence agr eeme nt i 8 n th e// file "LI CENC 9 E" d istr ibut ed w ith 10 Cfor all. //// fmt Line 11 s.cc --/ /// Auth or 12 : P eter A. 13 Buhr // C reat ed O n 14 : Su n Se p 17 21: 15 56:1 5 20 17// Las t Mo 16 difi ed B y : Pete r A. 17 Buh r// Last Mod ifie 18 d On : M on S ep 1 8 11 19 :35: 57 2 017/ / Up date 20 Cou nt : 31/ /#in 21 clud e <f stre am.h fa># 22 incl ude <cor outi ne.h 23 fa>c orou tine For mat 24 { ch ar c h; 25 // used for com muni 26 cati on i nt g , b; 27 / / gl obal bec 28 ause use d in des truc 29 tor} ;voi d ?{ }( F orma 30 t & fmt ) { r esum 31 e( f mt ) ; / 32 / st art coro utin e}vo 33 id ^ ?{}( For mat & fm 34 t ) { if ( fm t.g 35 != 0 || fmt. b != 0 ) 36 sou t | endl ;}vo id m 37 ain( For mat & fm t ) 38 { fo r ( ;; ) { 39 // f or a s ma ny c 40 hara cter s f or ( fmt 41 .g = 0; fmt. g < 5; f 42 mt.g += 1 ) { / / gr 43 oups of 5 bl ocks f 44 or ( fmt .b = 0; fmt. 45 b < 4; f mt.b += 1 ) 46 { // blo cks of 4 cha 47 ract ers f or ( ;; 48 ) { // for new 49 line cha ract ers 50 susp end( ); i f ( 51 fmt. ch ! = '\ n' ) bre 52 ak; // igno re n ewli 53 ne } // f or so 54 ut | fmt .ch; / 55 / pr int char acte r 56 } // for s out | " 57 "; / / pr int 58 bloc k se para tor } / 59 / fo r s out | en dl; 60 // p rint gro 61 up s epar ator } / / fo 62 r} / / ma invo id p rt( 63 Form at & fmt , ch ar c 64 h ) { fmt .ch = ch 65 ; res ume( fmt );} 66 // prti nt m ain( ) { 67 Form at f mt; char ch; 68 for ( ; ; ) { s in | 69 ch; // rea 70 d on e ch arac ter if 71 ( e of( sin ) ) brea 72 k; // eof ? p 73 rt( fmt, ch ); } // 74 for} // main // L ocal 75 Var iabl es: //// tab 76 -wid th: 4 // // c ompi 77 le-c omma nd: "cfa fmt 78 Line s.c" /// / En d: / 79 / -
TabularUnified tests/fstream_test.c ¶
r73abe95 r58b6d1b 18 18 int main( void ) { 19 19 int nombre; 20 sout | "Entrez un nombre, s'il vous pla �t:" | endl;20 sout | "Entrez un nombre, s'il vous plaît:" | endl; 21 21 sin | nombre; 22 sout | "Vous avez entr �" | nombre | endl;22 sout | "Vous avez entré" | nombre | endl; 23 23 sout | "le nombre" | nombre | "est" 24 | (nombre > 0 ? "positif" : nombre == 0 ? "z �ro" : "n�gatif") | endl;24 | (nombre > 0 ? "positif" : nombre == 0 ? "zéro" : "négatif") | endl; 25 25 26 sout | "Entrez trois nombres, s'il vous pla �t: " | endl;26 sout | "Entrez trois nombres, s'il vous plaît: " | endl; 27 27 int i, j, k; 28 28 sin | i | j | k; 29 sout | "Vous avez entr �" | "i:" | "" | i | "j:" | "" | j | "k:" | "" | k | endl;29 sout | "Vous avez entré" | "i:" | "" | i | "j:" | "" | j | "k:" | "" | k | endl; 30 30 } 31 31 -
TabularUnified tests/io1.c ¶
r73abe95 r58b6d1b 31 31 | "x =" | 4 32 32 | "x $" | 5 33 | "x �" | 634 | "x �" | 735 | "x �" | 836 | "x �" | 937 | "x �" | 1033 | "x £" | 6 34 | "x ¥" | 7 35 | "x ¡" | 8 36 | "x ¿" | 9 37 | "x «" | 10 38 38 | endl | endl; 39 39 … … 46 46 | 5 | "? x" 47 47 | 6 | "% x" 48 | 7 | " �x"49 | 8 | " �x"48 | 7 | "¢ x" 49 | 8 | "» x" 50 50 | 9 | ") x" 51 51 | 10 | "] x" -
TabularUnified tests/maybe.c ¶
r73abe95 r58b6d1b 15 15 16 16 #include <assert.h> 17 #include <containers/maybe >17 #include <containers/maybe.hfa> 18 18 19 19 void checkPredicates() { -
TabularUnified tests/result.c ¶
r73abe95 r58b6d1b 15 15 16 16 #include <assert.h> 17 #include <containers/result >17 #include <containers/result.hfa> 18 18 19 19 void checkPredicates() { -
TabularUnified tests/time.c ¶
r73abe95 r58b6d1b 14 14 // 15 15 16 #include "time "16 #include "time.hfa" 17 17 #include <fstream.hfa> 18 18
Note: See TracChangeset
for help on using the changeset viewer.
