| #include <stdio.h> | |
| #include <string.h> | |
| #include <stdlib.h> | |
| // initialize the tape with 30,000 zeroes | |
| unsigned char tape[30000] = {0}; | |
| // set the pointer to point at the left-most cell of the tape | |
| unsigned char* ptr = tape; |
| square: | |
| .byte 48 ;0 | |
| .byte 49 ;1 | |
| .byte 50 ;2 | |
| .byte 51 ;3 | |
| .byte 52 ;4 | |
| .byte 53 ;5 | |
| .byte 54 ;6 | |
| .byte 55 ;7 | |
| .byte 56 ;8 |
| using System; | |
| using System.Diagnostics; | |
| namespace ConsolePauser | |
| { | |
| internal class Program | |
| { | |
| private static void Main(string[] args) | |
| { |
| #include <stdio.h> | |
| #include <stdlib.h> | |
| typedef union { | |
| char bytes[4]; | |
| long instruction; | |
| } data_t; | |
| int main(int argc, char ** argv) { |
| W pamieci jest na poczatku labirynt potem jest tablica gdzie algorytm byl a na koncu jest tablica z wlasciwa sciezka | |
| Dalej sa zmienne takie jak poczatkowy x y koncowy x y x i y i czy labirynt zostal rozwiazany | |
| >+<+[ | |
| Inicjalizacja poczatkowego x | |
| start >[>[-]+<-]>[<+ | |
| >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>[-] | |
| Inicjalizacja poczatkowego y | |
| start <[-] | |
| Inicjalizacja zmiennej czy rozwiazano | |
| <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<[-] |
| >+<+[>[>[-]+<-]>[<+>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> | |
| >>>>>>>>>>>>>>>[-]<[-]<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<[-]>> | |
| [-]++++++++++<[-]++++++++++<<<<<<<<<<<[-]<[-]<<<<<<<<<+++++++++++[>+++++++>+++++ | |
| ++++>+++++++++++>+++>++++<<<<<-]>.>--.>+.<++++.>>-.<<++.--.+++++++++.---------.> | |
| --------.<----.>++.<++++++++.>-----.-.>.<<.>.>.<<<-----------.>>++++.<--------.+ | |
| +++++++.>----.<---.>+++++++.<---.++++++++.>>>++.[-]<[-]<[-]<[-]<[-]<++++++++++.[ | |
| -]+++++++++++++++++[>++++>+++++++>++>++++++>+++++>+++<<<<<<-]>--.>++.>--.<<+++++ | |
| ++++.>-------.++++++++.-.------.+++++++.------.-----.>>.<.>>--.<<<+++++++++++.>> | |
| -.<<---.>>--.<<+++.-.>>++++++++.<.>-----.+++++++++.+++.<.<<++.>>>>++++++++++++++ | |
| .<.>++++.++++++.<<.<<----------.>>>>---.<---.>+.<-.+++++.>++.--.>-----.[-]<[-]<[ |
| GCC-generated code for searching 1000 first primes: | |
| .LC0: | |
| .string "2 " | |
| .LC1: | |
| .string "%d " | |
| .LC2: | |
| .string "Time elapsed: %d" | |
| primes: | |
| pushq %rbp |
| .program: | |
| .string ",[.,]" | |
| main: | |
| push r12 ; Function entry point | |
| or r12d, -1 ; Setting up parameters in registers | |
| push rbp | |
| mov ebp, OFFSET FLAT:l | |
| push rbx | |
| xor ebx, ebx | |
| .mainloop: |
This small file was made to help beginners with OOP in C. I hope it will be helpful. All code included in this file is released to public domain, while this document itself is released under terms of MIT license. This file contains C99 code, so please adjust your compiler to use it. For gcc pass: -std=c99
To create new class, we have to create new two files first. First will be named 'simple.c' and second will be named 'simple.h'.
simple.h:
| %&pdfLaTeX | |
| % !TEX encoding = UTF-8 Unicode | |
| \documentclass{article} | |
| \usepackage{ifxetex} | |
| \usepackage{listings} | |
| \ifxetex | |
| \usepackage{fontspec} | |
| \setmainfont[Mapping=tex-text]{STIXGeneral} | |
| \else | |
| \usepackage[T1]{fontenc} |