https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/ 2026-04-18T15:29:44+00:00 https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/ https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/lib/exe/fetch.php?media=wiki:dokuwiki.svg text/html 2013-11-28T16:04:27+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=adresare&rev=1385654667&do=diff package adresare; import javax.swing.*; import javax.swing.tree.*; import java.io.*; public class Window extends javax.swing.JFrame { DefaultTreeModel m; MyNode root; public Window() { initComponents(); String s = "c:\\Program Files"; root = new MyNode (s); root.path = s; m = new DefaultTreeModel (root); jTree1.setModel (m); showDir (root, root.path, 2); } private void showDir (MyNode above, String path, int lev… text/html 2014-11-20T18:12:04+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=alice&rev=1416507124&do=diff do tridy MyScene public void run() { Window w = new Window (); w.setVisible (true); w.info (this); } public class MyNode { public String name; public Object obj; public java.lang.reflect.Method met; public String toString () { return name; } } text/html 2014-11-24T16:04:43+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=alice3&rev=1416845083&do=diff public void run() { Window w = new Window (); w.setVisible (true); // w.test (); w.detail (this); } pridat do tridy Window import javax.swing.tree.*; import org.alice.apis.moveandturn.*; import java.lang.reflect.*; text/html 2008-04-02T16:05:00+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=apache&rev=1207152300&do=diff Apache Zkontrolovat pritomnost balicku se serverem: yum list '*http*' Nainstalovat balicek, napriklad: su yum install httpd Spustit httpd server: su /etc/init.d/httpd start stop status restart ... start a stop reload ... server jen nacte nova data text/html 2021-06-18T17:00:08+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=archlinux&rev=1624035608&do=diff Arch Linux mount /dev/sdaN /mnt mcedit /etc/pacman.d/mirrorlist pacstrap /mnt base pacstrap /mnt base linux linux-firmware networkmanager xorg-server xorg-xinit xorg-drivers xorg-twm xterm mate mate-extra grub sudo openssh mc firefox genfstab /mnt >> /mnt/etc/fstab arch-chroot /mnt ln -sf /usr/share/zoneinfo/Europe/Prague /etc/localtime hwclock --systohc locale-gen echo "LANG=en_US.UTF-8" > /etc/locale.conf echo "pc" > /etc/hostname echo "127.0.0.1 localhost" > /etc/hosts echo "::1 … text/html 2019-05-06T14:05:24+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=asm&rev=1557151524&do=diff asm( ".intel_syntax noprefix;" ); asm( "mov rax, 0x12345678;" ); asm( "add rax, 1;" ); asm(".att_syntax noprefix"); menu Tools, Options, zalozka Debugger, zasktrnout use Intel ... text/html 2017-04-27T13:09:42+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=avl_ctvrtek&rev=1493298582&do=diff // tree.cpp : Defines the entry point for the console application. #include "stdafx.h" #include <iostream> #include <string> using namespace std; struct item { int key; int v; /* 1, ... */ item * left; item * right; }; item* root=0; item* search(int k){ item* p=root; while (p!=NULL) { if (k < p->key) p = p->left; else if(k > p->key) p = p->right; else return p; } return p; } inline int vyska (item * p) { if… text/html 2019-04-24T14:22:13+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=avl_st_2019&rev=1556115733&do=diff <http://kmlinux.fjfi.cvut.cz/~culik/zalg/Tree05.zip> #include "stdafx.h" #include "form.h" #include "tree.h" #include <string> using namespace std; struct Item { int key; int height; Item * left; Item * right; Item () : key (0), height(1), left (nullptr), right (nullptr) { } }; inline int h (Item * p) { if (p == nullptr) return 0; else return p->height; } void update (Item * p) { int L = h (p->left); int R = h (p->right); if (L > R) … text/html 2018-05-15T09:17:56+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=avl_st&rev=1526375876&do=diff #include "stdafx.h" #include <iostream> #include <string> using namespace std; struct Item { string key; int height; Item* left; Item* right; Item (); }; Item::Item () : key (""), height (1), left (nullptr), right (nullptr) {} Item* root = nullptr; Item * search (Item * p, string name) { while (p != nullptr && p->key != name) { if (name < p->key) p = p->left; else p = p->right; } return p; } inline int findHeight (I… text/html 2019-05-07T09:15:09+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=avl_ut_2019&rev=1557220509&do=diff <http://kmlinux.fjfi.cvut.cz/~culik/zalg/Tree05.zip> #include "stdafx.h" #include "form.h" #include "tree.h" #include <string> using namespace std; const int MAX = 4; struct Item { int cnt; // pocet klicu , 1 <= cnt <= MAX ( obcas MAX+1 ) int key [MAX + 1]; // key [0] ... key [cnt-1] Item * ptr[MAX + 2]; // ptr [0] ... ptr [cnt], ukazatelu je o jedna vice nez klicu Item (); }; Item::Item() { cnt = 0; for (int i = 0; i <= MAX; i++) key[i] = -1; for (int i = 0;… text/html 2018-05-15T09:16:46+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=avl_ut&rev=1526375806&do=diff #include "stdafx.h" #include <iostream> #include <string> using namespace std; struct Item { string key; int height; Item*left; Item*right; Item (); }; Item*root = nullptr; Item::Item () :key (""), height (1), left (nullptr), right (nullptr) {} Item*search (Item* p, string name) { while (p != nullptr && p->key != name) { if (name < p->key) p = p->left; else /* if (p->key < name) */ p = p->right; } /* p == nullptr … text/html 2017-05-09T09:04:02+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=avl_utery&rev=1494320642&do=diff #include "stdafx.h" #include <iostream> #include <string> using namespace std; struct item { int key; int h; item* left; item* right; }; item* root = nullptr; inline int v (item * p) { if (p == nullptr) return 0; else return p->h; } inline void oprav (item * p) { int L = v (p->left); int R = v (p->right); p->h = L+1; if (R+1 > p->h) p->h = R+1; } void enter (item* & p, int k) { if (p == nullptr ){ item* t = new item; … text/html 2015-03-13T11:31:37+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=browse&rev=1426246297&do=diff package browse; import java.awt.Component; import java.awt.Container; import javax.swing.*; import javax.swing.tree.*; import java.lang.reflect.*; public class BrowseWindow extends javax.swing.JFrame { DefaultMutableTreeNode root; DefaultTreeModel model; public BrowseWindow() { initComponents(); root = new DefaultMutableTreeNode ("root"); scan (root, this); model = new DefaultTreeModel (root); jTree1.setModel (model); } … text/html 2018-11-14T09:43:31+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=browser&rev=1542188611&do=diff myitem.h #ifndef MYITEM_H #define MYITEM_H #include <QTreeWidget> #include <QMetaMethod> class MyItem : public QTreeWidgetItem { }; class ObjectItem : public MyItem { public: ObjectItem () : obj (nullptr) { } private: QObject * obj; public: QObject * getObject () { return obj; } void setObject (QObject * p) { obj = p; } }; class MethodItem : public ObjectItem { public: MethodItem () { } private: QMetaMethod meth; public: QMetaMethod getMethod () { return meth; }… text/html 2018-03-14T16:12:26+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=bstrom_2018_st&rev=1521043946&do=diff #include "stdafx.h" #include <iostream> #include <string> using namespace std; const int min = 2; const int max = 2*min; struct Item { int cnt; // 1 <= cnt <= max string key [max+1]; // 0..cnt-1 Item* ptr [max+2]; // 0..cnt Item (); }; Item::Item () { cnt = 0; for (int i = 0; i < max + 1; i++) key[i] = ""; for (int i = 0; i < max + 2; i++) ptr[i] = nullptr; } Item* root = nullptr; bool search (Item * p, string name) { bool result = false; while (p != null… text/html 2015-04-09T11:23:53+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=bstrom&rev=1428578633&do=diff #include "stdafx.h" #include <string> #include <iostream> using namespace std; const int Z = 2; const int N = 2*Z; struct item { int v; int key [N+1]; item * ptr [N+2]; }; item * root; item * alloc () { item * result = new item; result->v = 0; for (int i = 0; i < N+1; i++) result->key[i] = 0; for (int i = 0; i < N+2; i++) result->ptr[i] = nullptr; return result; } void split (item * branch, int & d, item * & next) { int c = branch->v; int a = Z; // doleva int b = c-a-1; // dopr… text/html 2015-04-09T11:24:51+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=bstrom2&rev=1428578691&do=diff #include "stdafx.h" #include <string> #include <iostream> using namespace std; const int Z = 2; const int N = 2*Z; struct item { int v; int key [N+1]; item * ptr [N+2]; }; item * root; item * alloc () { item * result = new item; result->v = 0; for (int i = 0; i < N+1; i++) result->key[i] = 0; for (int i = 0; i < N+2; i++) result->ptr[i] = nullptr; return result; } void split (item * branch, int & d, item * & next) { int c = branch->v; int a = Z; // doleva int b = c-a-1; // dopr… text/html 2018-04-03T15:07:35+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=btree_2018_ut&rev=1522768055&do=diff #include "btreewin.h" #include "ui_btreewin.h" #include <QApplication> #include <QTreeWidgetItem> #include <string> using namespace std; #define nullptr NULL BTreeWin * win = nullptr; /* ---------------------------------------------------------------------- */ const int Min = 2; const int Max = 2 * Min; struct Item { int cnt; // 1 <= cnt <= Max (+ 1) int key [Max+1]; // 0..cnt-1 Item* ptr [Max+2]; // 0..cnt Item (); }; Item::Item () { cnt = 0; for (int i = 0; i < … text/html 2019-05-14T09:07:00+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=btree_2019&rev=1557824820&do=diff <http://kmlinux.fjfi.cvut.cz/~culik/zalg/Tree05.zip> #include "stdafx.h" #include "form.h" #include "tree.h" #include <string> using namespace std; const int MAX = 4; struct Item { int cnt; // pocet klicu , 1 <= cnt <= MAX ( obcas MAX+1 ) int key [MAX + 1]; // key [0] ... key [cnt-1] Item * ptr[MAX + 2]; // ptr [0] ... ptr [cnt], ukazatelu je o jedna vice nez klicu Item (); }; Item::Item() { cnt = 0; for (int i = 0; i <= MAX; i++) key[i] = -1; for (int i = 0;… text/html 2019-04-23T09:02:48+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=btree_ut_2019&rev=1556010168&do=diff #include "stdafx.h" #include "form.h" #include "tree.h" #include <string> #include <sstream> using namespace std; const int Max = 4; struct Item { int cnt; // pocet klicu int key [Max+1]; // key[0], ... key[cnt-1], a jeden navic Item * ref [Max+2]; // ptr [0], ... ptr [cnt], a jeden navic Item(); }; Item::Item() { cnt = 0; for (int i = 0; i < Max + 1; i++) key[i] = -1; for (int i = 0; i < Max + 2; i++) ref [i] = nullptr; } void enter0 (Item * p, int val) { i… text/html 2017-05-16T08:59:34+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=btree_utery&rev=1494925174&do=diff // BTree.cpp #include "stdafx.h" #include <iostream> #include <string> using namespace std; const int k = 2; const int n = 2 * k; struct item { int cnt; // pocet klicu v bloku, k .. 2*k int key [n + 1]; // key[0] ... key [cnt-1] item * ptr [n + 2]; // ptr[0] ... ptr [cnt] }; item* root = nullptr; bool search (item * p, int x) { bool result = false; while (p != nullptr && ! result) { int i = 0; while (i < p->cnt && p->key[i] < x) i … text/html 2014-03-26T16:08:48+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=btree&rev=1395850128&do=diff Program BTree; Const m = 2; Type ref = ^ node; node = record cnt: integer; key: array [1..2*m] of integer; br: array [1..2*m+1] of ref; end; Var root: ref; Procedure Pridej (p: ref; vi: integer; vs: ref; vk: integer; var ns: ref; var nk: integer); // Vlozit hodnotu vk a podstrom vs na pozici vi // Pokud pri vkladani dojde k rozdeleni stranky, // nasledujici parametry obsahuji informaci o nove (leve) strance // ns - nova stranka // nk - novy klic Var i, s, t… text/html 2017-05-04T13:15:09+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=bttree_ctvrtek&rev=1493903709&do=diff // btree.cpp #include "stdafx.h" #include <iostream> #include <string> using namespace std; const int k = 2; const int n = 2 * k; struct block { int p; /* 1, ..., n, (n+1) */ int key [n+1]; /* key[0], ..., key [p-1] */ block * ref [n+2]; /* ref [0], ..., ref [p] */ }; block * root = NULL; void insert (block * & b, int x) { if (b == NULL) { b = new block; b->p = 1; b->key[0] = x; b->ref[0] = NULL; b->ref[1] = NULL; } else… text/html 2013-03-13T12:03:27+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=buildapache&rev=1363176207&do=diff <http://kmlinux/~culik/sos/build-apache.sh> spustit preklad sh build-apache.sh pridat balicky (v jinem terminalu) su - yum install pcre-devel ncurses-devel readline-devel libmcrypt-devel libxml2-devel upravit konfiguracni soubor httpd.conf gedit ~/apache/appl/etc/httpd/httpd.conf zmenit Listen 80 na Listen 8080 text/html 2018-12-17T13:10:36+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=c_sharp_script&rev=1545052236&do=diff using Microsoft.CodeAnalysis.CSharp.Scripting; using System; using System.Windows.Forms; namespace Pokus { public partial class Form1 : Form { public Form1() { InitializeComponent(); } private async void button1_ClickAsync(object sender, EventArgs e) { string source = "Win.Text = \"Click \" + X + Y ;"; var variables = new Variables { X = 1, Y = 2, Win = this }; var state = await CSharpScript.RunAsyn… text/html 2018-11-26T19:59:07+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=c_tokens&rev=1543262347&do=diff ==== #include <iostream> #include <fstream> using namespace std; class TokenStream : public ifstream { public : TokenStream (string fileName) : ifstream (fileName) { nextChar (); nextToken (); } private: char ch; void nextChar (); public: string token; void nextToken (); }; const char eos = 0; void TokenStream::nextChar() { *this >> ch; if (! *this) ch = eos; } void TokenStream::nextToken () { while (ch != eos && ch <= '… text/html 2008-03-06T12:02:00+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=c&rev=1204804920&do=diff #include <stdio.h> #include <stdlib.h> #include <string.h> void main (void) { char *http_user_agent; printf ("Content-type: text/plain\n\n"); http_user_agent = getenv ("HTTP_USER_AGENT"); if (http_user_agent == NULL) { printf ("Oops! Your browser failed to set the HTTP_USER_AGENT "); printf ("environment variable!\n"); } else if (!strncmp (http_user_agent, "Mosaic", 6)) { printf ("I guess you are sticking with the original, huh?\n"); } else if… text/html 2008-04-02T16:10:00+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=cgi&rev=1207152600&do=diff Perl #! /usr/bin/perl print "Content-type: text/plain\n\n"; print "This is output from simple Perl script \n"; print "\n"; foreach $var (sort(keys(%ENV))) { $val = $ENV{$var}; $val =~ s|\n|\\n|g; $val =~ s|"|\\"|g; print "${var}=\"${val}\"\n"; } text/html 2018-10-11T15:16:29+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=cisla&rev=1539270989&do=diff <http://kmlinux/~culik/wiki> #include <iostream> #include <string> using namespace std; int cnv (char c) { if (c >= '0' && c <= '9') return c - '0'; else if (c >= 'a' && c <= 'z') return c - 'a' + 10; else if (c >= 'A' && c <= 'Z') return c - 'A' + 10; else return 0; } char eval (int k) { if (k < 10) return '0' + k ; else return 'a' + k - 10; } string toString (int n, int z) { string t = ""; if (n == 0) { … text/html 2019-11-28T14:07:50+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=cisla2019&rev=1574950070&do=diff Prevod z dvojkove soustavy int main() { string s = "101011"; int len = s.length(); int v = 0; // vysledek for (int i = 0; i < len; i++) { char c = s[i]; v = 2 * v; // posunout, pridat na konec nulu if (c == '1') v = v + 1; } cout << s << " ... " << v << endl; text/html 2019-12-17T11:49:04+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=ckresleni2019&rev=1576583344&do=diff <http://kmlinux.fjfi.cvut.cz/~culikzde/zpro/simple-drawing.zip> #include "drawing.h" #include <cmath> void draw (int w, int h) { color (255, 0, 0); line (0, 0, w-1, 0); color (0, 255, 0); line (w-1, 0, w-1, h-1); color (0, 0, 255); line (w-1, h-1, 0, h-1); color (255, 200, 0); line (0, h-1, 0, 0); /* osa x */ color (255, 0, 0); line (0, h/2, w-1, h/2); color (0, 0, 255); for (int i = 0; i < w; i += 4) { double x = double (i)… text/html 2016-11-24T16:10:41+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=class&rev=1480003841&do=diff import java.awt.*; import javax.swing.*; import javax.swing.table.*; import javax.swing.tree.*; import java.lang.reflect.*; private void jButton1ActionPerformed(java.awt.event.ActionEvent evt) { // showInfo (jButton2); // import javax.swing.tree.*; Object obj = jButton2; // import java.awt.*; if (obj instanceof Component) { Component c = (Component) obj; while (c.getParent() != … text/html 2019-12-05T14:09:28+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=cmatice2019&rev=1575554968&do=diff #include <iostream> #include <cassert> using namespace std; void zero(int* v, int r, int s) { int cnt = r * s; for (int i = 0; i < cnt; i++) v[i] = 0; } void one(int* v, int r, int s) { zero(v, r, s); assert (r == s); for (int i = 0; i < r; i++) v[i * s + i] = 1; } void print (int* v, int r, int s) { for (int i = 0; i < r; i++) { cout << "("; for (int k = 0; k < s; k++) { cout << v[i * s + k]; if (k < … text/html 2026-01-02T17:16:45+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=com&rev=1767374205&do=diff FPGA library ieee; use ieee.std_logic_1164.all; use ieee.numeric_std.all; -------------------------------------------------------------------------------- package float32 is -------------------------------------------------------------------------------- type fp32 is record sign : std_logic; exponent : unsigned(7 downto 0); mantissa : unsigned(22 downto 0); end record fp32; type fp32_array is array(natural range<>) of fp32; -----------------------------------------------------… text/html 2015-04-01T19:20:20+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=conv&rev=1427916020&do=diff soubor build-conv-../example.txt Nejaka hlavicka @repeat Jedna polozka (@name, @ red, @blue, @green) @next Konec #ifndef MAINWINDOW_H #define MAINWINDOW_H #include <QMainWindow> namespace Ui { class MainWindow; } class MainWindow : public QMainWindow { Q_OBJECT public: explicit MainWindow(QWidget *parent = 0); ~MainWindow(); void load (QString file_name); void put (QString s); void scan (); void save (QString file_name); private slots: void… text/html 2019-12-03T12:11:06+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=cpole2019&rev=1575375066&do=diff #include <iostream> using namespace std; void fill(int* v, int c) { for (int i = 0; i < 10; i++) v[i] = c; } void add(int* v, int* x, int * y) { for (int i = 0; i < 10; i++) v[i] = x[i] + y[i]; } void print(int* v) { cout << "["; for (int i = 0; i < 10; i++) cout << v[i] << ", "; cout << "]" << endl; } int a[10]; int b[10]; int c[10]; int main() { fill(a, 10); fill(b, 20); add(c, a, b); // c[i] = a[i] + b[i] pro i = 0...9 print(c)… text/html 2018-02-28T10:11:11+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=createfile_2018&rev=1519812671&do=diff #include "stdafx.h" #undef UNICODE #include <windows.h> #include <iostream> using namespace std; int main() { HANDLE h = CreateFile ("abc.txt", // lpFileName, GENERIC_READ | GENERIC_WRITE, // dwDesiredAccess, 0, // dwShareMode, NULL, // lpSecurityAttributes, CREATE_ALWAYS, // dwCreationDisposition, FILE_ATTRIBUTE_NORMAL, // dwFlagsAndAttributes, NULL // hTemplateFile ); if (h == INVALID_HANDLE_VALUE) { DWORD code = GetLastError (); cout << "Chyba pri… text/html 2009-04-07T15:05:39+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=createprocess&rev=1239116739&do=diff #include <iostream> #include <windows.h> using namespace std; int main (int argc, char * * argv) { cout << "Start" << endl; STARTUPINFO startup; memset (&startup, 0, sizeof (startup)); PROCESS_INFORMATION info; BOOL ok = CreateProcess ( NULL, // LPCTSTR lpApplicationName, "notepad pokus.txt", // LPTSTR lpCommandLine, NULL, // LPSECURITY_ATTRIBUTES lpProcessAttributes, NULL, // LPSECURITY_ATTRIBUTES lpThreadAttributes, FALSE, // BOOL bInher… text/html 2019-12-09T18:25:20+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=csharpcomponents&rev=1575915920&do=diff <http://kmlinux.fjfi.cvut.cz/~culikzde/pw/Components03.zip> using System; using System.Collections.Generic; // using System.ComponentModel; using System.Data; using System.Drawing; using System.Linq; using System.Text; using System.Threading.Tasks; using System.Windows.Forms; using System.Reflection; using System.ComponentModel; namespace Components { public partial class Form1 : Form { public Form1() { InitializeComponent(); } private voi… text/html 2019-12-02T16:43:06+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=csharpproperties&rev=1575304986&do=diff <http://kmlinux.fjfi.cvut.cz/~culikzde/pw/Properties-2019-11-18.zip> using System; using System.Collections.Generic; using System.Linq; using System.Text; using System.Threading.Tasks; using System.Drawing; using System.ComponentModel; namespace Properties { public class Data { [DisplayName("Jmeno")] [Description("Jmeno objektu")] public string Name { get; set; } [Category ("Souradnice")] public int X { get; set; } [Category("Soura… text/html 2019-09-26T12:41:27+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=cyklus&rev=1569501687&do=diff #include <iostream> using namespace std; int main() { int n = 1; double v = 1; // a[1] = 1 while (n <= 10) { cout << "a " << n << " je " << v << endl; v = 2 * v + 1; // a[n] = 2 *a[n-1] +1 n = n + 1; } cout << "Konec" << endl; } #include <iostream> using namespace std; int main(int argc, char** argv) { int n; cout << "vlozte cislo: "; cin >> n; cout << endl; int v = 1; for (int k = 1; k <= n; k++) { v = v * k; } cout << n << "! je " << v << endl; return 0; } text/html 2020-03-23T22:39:17+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=dama_2019_st&rev=1585003157&do=diff #include <iostream> using namespace std; const int N = 8; int p [N]; int cnt = 0; void place (int s) { for (int r = 0; r < N; r++) { bool ok = true; for (int v = 1; v <= s && ok; v++) { int d = p[s - v]; if (d == r || d == r-v || d == r+v) ok = false; } if (ok) { p[s] = r; if (s < N - 1) place(s + 1); else { cnt++; … text/html 2019-03-26T12:46:59+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=dama_2019_ut&rev=1553604419&do=diff #include "pch.h" #include <iostream> using namespace std; const int N = 8; int p[N]; int cnt = 0; void umisti(int s) { for (int i = 0; i < N; i++) { bool collision = false; for (int v = 1; v <= s && !collision; v++) { if (p[s - v] == i || p[s-v] == i-v || p[s-v] == i+v) collision = true; } if (!collision) { p[s] = i; if (s < N - 1) umisti(s + 1); else { for (int j = 0; j < N; j… text/html 2015-04-16T15:56:52+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=dama_a_prekazky&rev=1429199812&do=diff // dama.cpp : Defines the entry point for the console application. // #include "stdafx.h" #include <string> #include <iostream> using namespace std; const int N = 4; int a [N][N]; void nuluj() { for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) a[i][j] = -1; } int cnt = 0; void tiskni() { cnt ++; cout << "Vysledek " << cnt << endl; for (int j = 0; j < N; j++) cout << "--"; cout << "-" << endl; for (int i = 0; i < N; i++) { cout << "|"; for (… text/html 2017-04-06T12:38:38+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=dama_ctvrtek&rev=1491482318&do=diff // dama.cpp #include "stdafx.h" #include <iostream> #include <string> using namespace std; const int N = 8; int pole[N]; int pocet = 0; void vypis(){ cout << pocet <<": "; for(int i=0;i<N;i++){ cout << pole[i] << ", "; } cout << endl; }; void vypissach(){ for (int k=0;k<N;k++){ for(int i=0;i<N;i++){ char c = '.'; if (pole[i] == k) c = 'O'; cout << c << " "; } cout << endl; } cout << endl; system ("pause"); }; void umisti(int j){ for(int i=0;i<N;i++) { bool ok … text/html 2014-04-03T11:58:41+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=dama_pas&rev=1396526321&do=diff program dama; const n=8; var a : array [1..n] of integer; procedure umisti (k:integer); var i,j,p:integer; ok:boolean; begin for i:=1 to n do begin a[k]:=i; ok:=true; for p:=1 to k-1 do if (a[p]=i) or (a[p]=i-(k-p)) or (a[p]=i+k-p) then ok:=false; if ok = true then begin if k<n then umisti (k+1) else begin for j:=1 to n do write(a[j],' '); writeln; end; end; end; end; begin umisti (1… text/html 2017-04-11T08:16:40+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=dama_utery&rev=1491898600&do=diff #include "stdafx.h" #include <iostream> #include <string> #include <cassert> using namespace std; const int N=8; int v[N]; int pocet=0; void vypis(){ for(int i=0; i< N; i++) cout << v[i] << " "; cout << " ... " << pocet<< endl; } void vypisSach(){ for(int j=0; j<N; j++){ for(int i=0; i<N; i++){ char c = '.'; if (v[i]==j) c = '*'; cout << c << " "; } cout << endl; } cout << endl; char… text/html 2013-04-17T09:26:32+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=dama&rev=1366190792&do=diff #ifndef MOJEOKNO_H #define MOJEOKNO_H #include <QMainWindow> #include <QTableWidgetItem> #include <QTreeWidgetItem> namespace Ui { class MojeOkno; } class MojeOkno : public QMainWindow { Q_OBJECT public: explicit MojeOkno(QWidget *parent = 0); ~MojeOkno(); private: int pocet; int pole [8]; void umisti (int k); private slots: void on_horizontalSlider_sliderMoved(int position); void on_actionRun_triggered(); private: Ui::MojeOkno *ui; }; #endif /… text/html 2018-03-28T15:13:17+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=data_2018_st&rev=1522249997&do=diff #include "stdafx.h" #include <iostream> #include <string> using namespace std; const int n = 8; int p[n]; void place (int i) { for (int k = 0; k < n; k++) { bool ok = true; for (int d = 1; d <= i; d++) { if (p[i - d] == k || p[i - d] == k - d || p[i - d] == k + d) ok = false; } if (ok) { p[i] = k; if (i != n - 1) place (i + 1); else { … text/html 2018-03-27T09:13:03+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=data_2018_ut&rev=1522141983&do=diff #include "stdafx.h" #include <iostream> #include <string> using namespace std; const int n = 8; int p[n] ; void umisti (int k) /* k .. cislo sloupce */ { for (int i = 0; i < n; i++) { bool ok = true; for (int d = 1; d <= k; d++) { if (p[k-d] == i || p[k-d] == i-d || p[k-d] == i+d) { ok = false; } } if (ok) { p[k] = i; if (k < n - 1) umisti (k + 1… text/html 2016-12-09T11:53:54+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=db&rev=1481284434&do=diff <?php // error_reporting (E_ALL); // @ini_set ("display_errors", "on"); echo "Point 1 <br>"; $conn = mysql_connect ("localhost", "uzivatel", "heslo"); if ($conn) { mysql_select_db ("test"); $cmd = "create table colors (name varchar (80) primary key not null, red int, green int, blue int); "; mysql_query ($cmd); $cmd = "insert into colors values ('modra', 0, 0, 255);"; mysql_quer… text/html 2015-04-13T14:51:51+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=dbus&rev=1428936711&do=diff su - yum install qt5-qdbusviewer qdbusviewer-qt5 .pro .... QT += core gui dbus #ifndef RECEIVER_H #define RECEIVER_H #include <QMainWindow> namespace Ui { class Receiver; } class Receiver : public QMainWindow { Q_OBJECT Q_CLASSINFO ("D-Bus Interface", "org.example.ReceiverInterface") public: explicit Receiver(QWidget *parent = 0); ~Receiver(); public slots: Q_SCRIPTABLE void hello (QString s); Q_SCRIPTABLE QString hello2 (QString s); privat… text/html 2022-05-02T13:34:57+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=debian9&rev=1651498497&do=diff apt-get install build-essential pkgconf python-qt4 clang llvm libclang-dev llvm-dev python-clang-3.8 text/html 2017-12-04T16:08:20+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=designer&rev=1512403700&do=diff Adapter.cs using System; using System.Collections.Generic; using System.ComponentModel; using System.Drawing; using System.Data; using System.Linq; using System.Text; using System.Threading.Tasks; using System.Windows.Forms; namespace designer { public partial class Adapter : UserControl { private Control comp; public Adapter (Control c) { InitializeComponent(); comp = c; comp.MouseDown += Adapter_MouseDown; comp… text/html 2019-09-30T17:33:15+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=destructo&rev=1569864795&do=diff public class Class1 : TreeNode { public static int cnt = 0; public Class1() { cnt++; Console.WriteLine("begin of Class1"); } ~Class1() { cnt--; Console.WriteLine("end of Class1"); } } text/html 2019-03-19T14:13:24+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=dnd&rev=1553004804&do=diff #ifndef MAINWINDOW_H #define MAINWINDOW_H #include <QMainWindow> namespace Ui { class MainWindow; } class MainWindow : public QMainWindow { Q_OBJECT public: explicit MainWindow(QWidget *parent = nullptr); ~MainWindow(); private slots: void on_action_Test_triggered(); private: Ui::MainWindow *ui; protected: void dragEnterEvent (QDragEnterEvent *event); void dropEvent (QDropEvent *event); }; #endif // MAINWINDOW_H text/html 2022-12-02T10:31:13+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=dots&rev=1669977073&do=diff #include <iostream> using namespace std; void put (string s) { cout << "retezec " << s << endl; } void put (int p) { cout << "cele cislo " << p << endl; } void put (double p) { cout << "cislo " << p << endl; } void put (char c) { cout << "pismeno " << c << endl; } void print () { } template <class T, class ... S> void print (T head, S ... other) { put (head); print (other ...); } void f () { print (1, 1.2, "abc", 'c'); } text/html 2018-03-26T15:05:57+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=drag_and_drop&rev=1522076757&do=diff #include "mainwindow.h" #include "ui_mainwindow.h" #include <QGraphicsRectItem> #include <QGraphicsEllipseItem> #include <QDrag> #include <QMimeData> #include <QGraphicsSceneDragDropEvent> #include <QPixmap> #include <QPainter> QPixmap * image () { QPixmap * p = new QPixmap (24, 24); p->fill (Qt::transparent); QPainter m (p); m.setPen (QColor ("blue")); m.setBrush (QColor ("orange")); m.drawEllipse (2, 2, 20, 20); return p; } QIcon icon () { QPixmap * p = im… text/html 2016-11-15T09:35:00+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=drawing&rev=1479202500&do=diff <http://kmlinux/~culik/wiki> using System; using System.Collections.Generic; using System.ComponentModel; using System.Data; using System.Drawing; using System.Linq; using System.Text; using System.Threading.Tasks; using System.Windows.Forms; using System.Drawing.Imaging; using System.Drawing.Drawing2D; namespace Drawing { public partial class MainWindow : Form { private Pen pen; private Brush brush; private Color basic1; private Color basic2; p… text/html 2019-11-26T12:17:34+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=drobnosti&rev=1574770654&do=diff Soubor abc.txt ve Visual Studio umustit do adresare s .CPP, napr: C:\Users\Jmeno\source\repos\ConsoleApplication5\ConsoleApplication5\abc.txt #include <iostream> #include <fstream> using namespace std; int main() { ifstream f ("abc.txt"); while (f.good()) { string s; f >> s; cout << s << endl; } cout << "O.K." << endl; } text/html 2019-10-01T15:06:41+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=example&rev=1569942401&do=diff #ifndef MYEDIT_H #define MYEDIT_H #include <QWidget> #include <QPlainTextEdit> class MyEdit : public QPlainTextEdit { // Q_OBJECT public: explicit MyEdit (QWidget *parent = nullptr); protected: void dragEnterEvent(QDragEnterEvent *event); void dropEvent(QDropEvent *event); }; #endif // MYEDIT_H text/html 2017-03-03T10:12:49+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=file_handles_2017&rev=1488535969&do=diff // ConsoleApplication1.cpp : Defines the entry point for the console application. // #include "stdafx.h" #undef UNICODE #include "windows.h" #include <iostream> #include <string> using namespace std; int _tmain(int argc, _TCHAR* argv[]) { HANDLE h = CreateFile ("C:\\temp\\abc.txt", // lpFileName, GENERIC_READ | GENERIC_WRITE, // dwDesiredAccess, 0, // dwShareMode, NULL, // lpSecurityAttributes, CREATE_ALWAYS,… text/html 2009-03-19T11:44:02+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=filehandles&rev=1237463042&do=diff /* Handle.cpp */ #undef UNICODE #include <windows.h> // CreateFile, ... #include <stdio.h> // printf, scanf int main (int argc, char * argv []) { HANDLE h = CreateFile ("abc.TXT", // pointer to name of the file /* GENERIC_READ | */ GENERIC_WRITE, // access (read-write) mode 0, // share mode NULL, // pointer to security attributes OPEN_ALWAYS, // how to create FILE_ATTRIBUTE_NORMAL, // file attributes NULL // handle t… text/html 2012-02-20T13:57:39+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=filehandles2&rev=1329746259&do=diff // pokus2.cpp : Defines the entry point for the console application. // #include "stdafx.h" #include <windows.h> // CreateFile, ... #include <stdio.h> // printf, scanf int _tmain(int argc, _TCHAR* argv[]) { HANDLE h; h = CreateFile ( "c:\\work\\abc.TXT", // pointer to name of the file GENERIC_READ | GENERIC_WRITE, // access (read-write) mode 0, // share mode NULL, // pointer to security attributes OPEN_ALWAYS, // how to create FILE_… text/html 2008-05-20T07:49:47+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=files&rev=1211269787&do=diff HANDLE hFile = CreateFile ( "abc.txt", // name of the file GENERIC_READ | GENERIC_WRITE, // access (read-write) mode 0, // share mode NULL, // pointer to security attributes OPEN_ALWAYS, // how to create FILE_ATTRIBUTE_NORMAL, // file attributes NULL // handle to file with attributes to copy ); if (hFile != INVALID_HANDLE_VALUE) { Button1->Caption = "Open"; HANDLE hMap = CreateF… text/html 2019-09-26T13:01:56+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=funkce&rev=1569502916&do=diff inline int plus (int a, int b) { return a+b; } int max (int a, int b) { if (a > b) { return a; } else { return b; } } int max (int a, int b) { int v = 0; if (a > b) { v = a; } else { v = b; } return v; } text/html 2020-03-25T11:29:36+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=git_sos&rev=1585135776&do=diff Přístup k GIT z Linuxu git clone http://gitlab.fjfi.cvut.cz/culikzde/sos.git A později v adresáři “sos” stažení nových verzí: git pull Přístup k GIT z Windows Windows Git: <http://git-scm.com/download/win> a užitečný doplněk Windows Tortoise Git: <http://tortoisegit.org/download/> Zkopírování příkladů text/html 2020-03-23T20:35:09+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=git&rev=1584995709&do=diff Přístup k GIT z Linuxu git clone http://gitlab.fjfi.cvut.cz/culikzde/zalg.git A později v adresáři “zalg” stažení nových verzí: git pull Přístup k GIT z Windows Windows Git: <http://git-scm.com/download/win> a užitečný doplněk Windows Tortoise Git: <http://tortoisegit.org/download/> Zkopírování příkladů text/html 2022-11-13T15:04:16+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=grub&rev=1668351856&do=diff Grub # file /boot/grub2/grub.cfg or /boot/grub/grub.cfg # set root=(hd0,1) # (hd0,1) ... sda1 # mkfs.ext4 -O ^has_journal /dev/sdx1 # tune2fs -l /dev/sdx1 # tune2fs -m 0 /dev/sdx1 # no reservered blocks # mkdir /mnt/other # mount /dev/sdx1 /mnt/other # mkdir /mnt/other/dev # mount --bind /dev /mnt/other/dev # grub2-install /dev/sdx --boot-directory=/mnt/other/boot set default=1 set timeout=60 set menu_color_normal=cyan/blue set menu_color_highlight=white/blue # set menu_color_normal=whi… text/html 2009-03-12T13:30:42+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=gtk&rev=1236864642&do=diff <http://kmlinux/~culik/wiki> GtkWidget * box = gtk_hbox_new (FALSE, 8); button = gtk_button_new_with_label ("Hello World"); GtkWidget * button2 = gtk_button_new_with_label ("Second Button"); GtkWidget * button3 = gtk_button_new_with_label ("Third Button"); gtk_container_add (GTK_CONTAINER (window), box); gtk_container_add (GTK_CONTAINER (box), button); gtk_container_add (GTK_CONTAINER (box), button2); gtk_container_add (GTK_CON… text/html 2017-04-13T12:35:50+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=heap_ctvrtek&rev=1492086950&do=diff // heap.cpp : Defines the entry point for the console application. // dama.cpp #include "stdafx.h" #include <iostream> #include <string> #include <cassert> using namespace std; const int N = 1000000; int a [N]; void change(int i, int j){ int pom; pom= a[i]; a[i]=a[j]; a[j]=pom; } void swap(int &c, int &k){ int pom; pom=c; c=k; k=pom;} void heap(int i, int j) { while((2*i+1) <= j ) { int levy = 2*i+1; int v = levy; if((2*i+2) <= … text/html 2017-04-18T09:12:52+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=heap_utery&rev=1492506772&do=diff // heap.cpp #include "stdafx.h" #include <iostream> #include <string> #include <cassert> using namespace std; const int N = 1000000; int a[N]; void swap (int &x, int &y){ int z = x; x = y; y = z; } void change (int i, int j){ int z = a[i]; a[i] = a[j]; a[j] = z; } void makeheap(int i, int j){ while (2*i+1 <= j){ int v = 2*i +1; if(v+1 <= j && a[v] < a[v+1]) v = v+1; if(a[v] > a[i]){ swap(a[i], a[v]); … text/html 2022-03-30T14:27:52+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=heap2022&rev=1648650472&do=diff #include <iostream> using namespace std; const int N = 10; int a[N] = { 20, 30, 40, 7, 5, 80, 22, 33, -1, -2 }; void swap (int& x, int& y) { int t = x; x = y; y = t; } void heapify (int i, int k) { while (2*i+1 <= k) { int v = 2 * i + 1; if (v + 1 <= k && a[v + 1] > a[v]) v = v + 1; if (a[i] < a[v]) { swap (a[i], a[v]); i = v; } else { // i = k + 1; break; … text/html 2015-04-23T14:50:55+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=heapsort_c&rev=1429800655&do=diff // HeapSort.cpp : #include "stdafx.h" #include <string> #include <iostream> #include <cstdlib> using namespace std; const int N=100; int a[N]; void heapify(int i, int k){ while(2*i+1<=k) { int p; p=2*i+1; if(p+1 <= k) if(a[p]<a[p+1]) p=p+1; if(a[p]>a[i]){ int q; q=a[p]; a[p]=a[i]; a[i]=q; i=p; } else { i=k; // konec naší smyčky } } } void heapSort() { for(int i = N-1; i >= 0; i--) { heapify (i, N-1); } for(int k = N-1; k > 0; k--) { int pom = a[0]; a[0] =… text/html 2019-04-03T15:11:48+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=heapsort_st_2019&rev=1554304308&do=diff #include "pch.h" #include <iostream> #include <time.h> using namespace std; const int N = 1000000; int a[N]; inline void swap_a (int i, int j) { int t = a[i]; a[i] = a[j]; a[j] = t; } inline void swap (int & x, int & y) { int t = x; x = y; y = t; } void heapify(int i, int k) // vytvorit hromadu z a[i] ... a[k] // za predpokladu, ze a[i+1] ... a[k] jiz hromadu tvori { while (2 * i + 1 <= k) { int v = 2 * i + 1; if (v + 1 <= k) if (… text/html 2018-04-11T15:47:48+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=heapsort_st&rev=1523461668&do=diff #include "stdafx.h" #include <iostream> #include <string> using namespace std; const int n = 1000000; // int a[n] = { 7, 1, 12, 2, 8, 5, 20, 3 }; int a[n]; void swap (int &a, int &b) { int tmp = a; a = b; b = tmp; } void heapify (int i, int k) { while (2 * i + 1 <= k) { int w = 2 * i + 1; if (w + 1 <= k && a[w+1] > a[w]) w += 1; // w = w + 1 if (a[i] < a[w]) { swap (a[i], a[w]); i = w; } e… text/html 2019-04-02T08:43:38+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=heapsort_ut_2010&rev=1554194618&do=diff #include "pch.h" #include <iostream> #include <stdlib.h> /* srand, rand */ #include <time.h> /* time */ using namespace std; const int N = 2000000; int a[N+2]; inline void swap_a (int i, int k) { int t = a[i]; a[i] = a[k]; a[k] = t; } inline void swap (int & a, int & b) { int t = a; a = b; b = t; } void heapify(int i, int k) // opravit hromadu a[i], ... , a[k] // puvodni a[i+1], ... a[k] jiz hromadu tvori { while (2*i + 1 <= k ) { int v = 2 * i + … text/html 2019-04-03T15:10:58+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=heapsort_ut_2019&rev=1554304258&do=diff #include "pch.h" #include <iostream> #include <stdlib.h> /* srand, rand */ #include <time.h> /* time */ using namespace std; const int N = 2000000; int a[N+2]; inline void swap_a (int i, int k) { int t = a[i]; a[i] = a[k]; a[k] = t; } inline void swap (int & a, int & b) { int t = a; a = b; b = t; } void heapify(int i, int k) // opravit hromadu a[i], ... , a[k] // puvodni a[i+1], ... a[k] jiz hromadu tvori { while (2*i + 1 <= k ) { int v = 2 * i + … text/html 2018-04-24T07:56:48+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=heapsort_ut&rev=1524556608&do=diff #include "stdafx.h" #include <iostream> #include <string> #include <ctime> using namespace std; // const int n = 7; // int a[n] = { 20, 7, 15, 1, 3, 10, 12 }; const int n = 1000000; int a[n]; void swap (int i, int k) { int c; c = a[i]; a[i] = a[k]; a[k] = c; } void heapify (int i, int k) { while (2 * i + 1 <= k) { int w = 2 * i + 1; if (w + 1 <= k && a[w + 1] > a[w]) w = w + 1; if (a[w] > a[i]) { swap (i, w); … text/html 2014-04-17T13:02:08+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=heapsort&rev=1397739728&do=diff program heapsort; const n=40; var a: array [1..n] of integer; procedure swap (var a, b: integer); var t : integer; begin t := a; a := b; b := t; end; procedure heapify (i, k : integer); var j: integer; begin while 2*i<=k do begin j:=2*i; if j+1<=k then if a[j]<a[j+1] then j:=j+1; if a[i]<a[j] then begin swap (a[i], a[j]); i:=j; end else i:=k+1; end; end; procedure show ; var i, j, k, step, width: integer; begin i := 1; s… text/html 2019-03-04T16:11:53+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=icons&rev=1551715913&do=diff #include <QDir> void showDir (QTreeWidgetItem * target, QDir dir) { QTreeWidgetItem * top = new QTreeWidgetItem; top->setText (0, dir.dirName()); top->setToolTip (0, dir.path()); top->setForeground (0, QColor ("red")); top->setIcon (0, QIcon::fromTheme ("folder")); target->addChild(top); QFileInfoList list = dir.entryInfoList (QDir::AllEntries | QDir::NoDotAndDotDot); for (QFileInfo file : list) { if (file.isDir()) showDir (top, QDir (file.… text/html 2020-03-29T18:17:23+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=ide_qtcreator&rev=1585505843&do=diff Qt Creator Windows: <http://download.qt.io/official_releases/qt/5.12/5.12.2/> Novější: <http://download.qt.io/official_releases/qt/5.14/5.14.1/> Arch Linux: pacman -S qtcreator Debian/Ubuntu: apt-get install qtcreator Fedora: dnf install qt-creator Ve Windows vyberte knihovny pro jeden překladač (např. MinGW 64-bit), zmíněný překladač (předposlední checkbox). text/html 2020-03-29T18:16:52+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=ide&rev=1585505812&do=diff Vývojová prostředí Dev C++ Pro naše cvičení stačí Dev-C++ 5.0 beta 9.2 (4.9.9.2) (9.0 MB) with Mingw/GCC <http://www.bloodshed.net/dev/devcpp.html> Code Blocks Balíček s překladačem GCC codeblocks-17.12mingw-setup.exe <http://www.codeblocks.org/downloads/26> Qt Creator Windows: <http://download.qt.io/official_releases/qt/5.12/5.12.2/> Novější: <http://download.qt.io/official_releases/qt/5.14/5.14.1/> Arch Linux: pacman -S qtcreator text/html 2024-05-28T21:29:39+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=image&rev=1716931779&do=diff <https://stackoverflow.com/questions/70248510/how-do-i-load-a-bitmap-into-a-win32-application> #ifndef UNICODE #define UNICODE #endif #include <windows.h> #include <iostream> HANDLE hImg = NULL; LRESULT CALLBACK WindowProc(HWND hwnd, UINT uMsg, WPARAM wParam, LPARAM lParam); int WINAPI WinMain (HINSTANCE hInstance, HINSTANCE hPrevInstance, LPSTR lpCmdLine, int nShowCmd) { const wchar_t CLASS_NAME[] = L"Window Class"; WNDCLASS wc = {}; wc.lpfnWndProc = WindowProc; wc.hInst… text/html 2018-10-30T10:21:29+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=insert&rev=1540894889&do=diff #include <iostream> using namespace std; const int N = 10; int a[N]; void insert (int x) { int k = 0; while (k < N && x > a[k]) k++; // x umistit do a[k] // k == N znamena, ze jsme nenasli vhodne misto if (k < N) { for (int i = N-1; i>k; i--) a[i] = a[i-1]; a[k] = x; } } int main() { for (int j = 0; j<N; j++) a[j] = 999; insert (1); insert (10); insert (7); insert (1000); for (int j = 0; j<N; … text/html 2008-05-05T14:57:12+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=inventor&rev=1209999432&do=diff #include <Inventor/nodes/SoCube.h> #include <Inventor/engines/SoElapsedTime.h> #include <Inventor/manips/SoTrackballManip.h> SoCone * k = new SoCone; k->height = 1; k->bottomRadius = 5; root->addChild(k); SoMaterial *m2 = new SoMaterial; m2->diffuseColor.setValue(0.0, 1.0, 0.0); root->addChild(m2); SoElapsedTime * counter = new SoElapsedTime; root->addChild(new SoTrackballManip); SoCube * c = new SoCube; c->width = 0.5; // c->width.connectFrom (&count… text/html 2016-11-10T15:18:19+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=jbutton&rev=1478791099&do=diff private void jButton2ActionPerformed(java.awt.event.ActionEvent evt) { MyButton b = new MyButton (); b.setText ("Muj knoflik"); b.addText ("..."); b.addText ("???"); b.removeText ("???"); jToolBar1.add (b); } text/html 2020-05-09T12:01:43+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=jepr&rev=1589025703&do=diff Literatura Niklaus Wirth: Compiler Construction <http://inf.ethz.ch/personal/wirth/CompilerConstruction/CompilerConstruction1.pdf> Steven Pemberton and Martin Daniels: Pascal Implementation: The P4 Compiler and Interpreter <http://homepages.cwi.nl/~steven/pascal> Lexikální analyzátor lexikální analyzátor Video: Lexical Analysis <http://www.youtube.com/watch?v=sJKFLcsysVs> ( Úvod: <http://www.youtube.com/watch?v=0A079QpDAzY> ) Syntaktická analýza Syntaktická analýza výrazů… text/html 2016-11-03T16:02:46+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=jlist&rev=1478188966&do=diff <http://kmlinux/~culik/wiki> jList1.setModel(new MyModel ()); package example; import javax.swing.*; import javax.swing.event.ListDataListener; public class MyModel implements ListModel { String [] data = { "Abc", "Xyz" }; @Override public int getSize() { return data.length; } @Override public Object getElementAt(int index) { return data [index]; } @Override public void addListDataListener(ListDataListener l) { } @Ove… text/html 2019-11-12T16:23:10+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=js2019&rev=1573575790&do=diff #include "mainwindow.h" #include "ui_mainwindow.h" // Fedora : dnf install qt5-qtdeclarative-devel // .pro file: qt += qml #include <QJSEngine> MainWindow::MainWindow(QWidget *parent) : QMainWindow(parent), ui(new Ui::MainWindow) { ui->setupUi(this); } MainWindow::~MainWindow() { delete ui; } void MainWindow::on_pushButton_clicked() { QString source = ui->input->toPlainText(); QJSEngine e; e.globalObject().setProperty("abc", 7); e.globalObject().setProperty("btn",… text/html 2014-11-03T15:57:49+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=jtree&rev=1415030269&do=diff // import javax.swing.tree.*; // import java.io.*; DefaultTreeModel model; DefaultMutableTreeNode root; private void showBranch (DefaultMutableTreeNode above, File dir, int level) { File [] files = dir.listFiles(); if (files != null) for (File f : files) { DefaultMutableTreeNode node; node = new DefaultMutableTreeNode (f.getName()); above.add (node); if (le… text/html 2017-11-10T11:44:59+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=jtree2017&rev=1510314299&do=diff package abc; import java.io.*; public class Data { private String name; private String fullName; public Data (File f) { name = f.getName(); fullName = f.getAbsolutePath(); } public String toString () { return name; } private String getFullName () { return fullName; } } text/html 2017-12-08T11:28:16+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=jtree2017b&rev=1512732496&do=diff import javax.swing.*; import javax.swing.tree.*; import javax.swing.table.*; import java.awt.*; import java.lang.reflect.*; DefaultTreeModel model; private void showBranch (DefaultMutableTreeNode branch, Container source) { int n = source.getComponentCount(); for (int i = 0; i < n; i++) { Component c = source.getComponent (i); DefaultMutableTreeNode node = new DefaultMutableTreeNode (c); … text/html 2018-10-11T13:19:20+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=komb&rev=1539263960&do=diff <http://kmlinux/~culik/wiki> #include <iostream> #include <iomanip> using namespace std; const int M = 10; int p [M][M]; int main () { for (int i = 0; i < M; i++) { for (int j = 0; j < M; j++) { p[i][j] = 0; } } p[0][0] = 1; for (int n = 1; n < M; n++) { p[n][0] = 1; p[n][n] = 1; for (int k = 1; k < n; k++) { p[n][k] = p[n-1][k-1] + p[n-1][k]; } } for (int n = 0; n < M; n… text/html 2013-10-22T11:12:31+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=kresleni&rev=1382440351&do=diff na zacatek tridy Pen p; Brush b; na konec konstruktoru p = new Pen (panel1.BackColor); b = new SolidBrush (panel1.BackColor); na konec newColorMenuItem_Click p = new Pen(t.BackColor); upravit pictureBox_MouseMove text/html 2013-10-29T12:06:26+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=kresleni2&rev=1383048386&do=diff private void newObjectMenuItem_Click(object sender, EventArgs e) { Panel t = new Panel(); t.Parent = pictureBox; t.BackColor = Color.Blue; // t.BorderStyle = BorderStyle.FixedSingle; Button u = new Button(); u.Parent = t; u.BackColor = SystemColors.Control; u.Left = 8; u.Top = 8; t.MouseDown += area_MouseDown; t.MouseMove += area_MouseMove; t.M… text/html 2014-10-13T12:58:58+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=kresleni3&rev=1413205138&do=diff using System; using System.Collections.Generic; using System.ComponentModel; using System.Data; using System.Drawing; using System.Drawing.Drawing2D; using System.Linq; using System.Text; using System.Threading.Tasks; using System.Windows.Forms; namespace kresleni { public partial class MainWindow : Form { public MainWindow() { InitializeComponent(); comboBox1.SelectedIndex = 0; pictureBox_SizeChanged(null, null); } pr… text/html 2017-10-23T14:40:40+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=kresleni2017&rev=1508769640&do=diff using System; using System.Collections.Generic; using System.ComponentModel; using System.Data; using System.Drawing; using System.Linq; using System.Text; using System.Threading.Tasks; using System.Windows.Forms; using System.Drawing.Drawing2D; using System.Drawing.Imaging; namespace Kresleni { enum ToolIndex { lineIndex, rectangleIndex, ellipseIndex }; public partial class Window : Form { public Window() { InitializeComp… text/html 2019-11-04T18:12:28+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=kresleni2019&rev=1572891148&do=diff Kompletni prikladv ZIP souboru: <http://kmlinux.fjfi.cvut.cz/~culik/pw/Kresleni-2019-11-04.zip> using System; using System.Collections.Generic; using System.ComponentModel; using System.Data; using System.Drawing; using System.Linq; using System.Text; using System.Threading.Tasks; using System.Windows.Forms; using System.Drawing.Imaging; using System.Drawing.Drawing2D; namespace Kresleni { public partial class Form1 : Form { Pen pen; Brush brush; const int lin… text/html 2018-04-04T15:08:56+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=kun_2018_st&rev=1522854536&do=diff #include "stdafx.h" #include <iostream> #include <string> using namespace std; const int n = 8; int p[n][n]; int zx[n][n]; int zy[n][n]; void skok (int x, int y, int d, int x0, int y0) { if (x >= 0 && x < n && y >= 0 && y < n) { if (p[x][y] == -1 || p[x][y]>d) { p[x][y] = d; zx[x][y] = x0; zy[x][y] = y0; skok (x + 2, y + 1, d + 1, x, y); skok (x + 2, y - 1, d + 1, x, y); skok (x + 1, y + 2, d + 1,… text/html 2018-04-17T07:41:38+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=kun_2018_ut&rev=1523950898&do=diff #include "stdafx.h" #include <iostream> #include <string> using namespace std; const int n = 8; int p[n][n]; int zx[n][n]; int zy[n][n]; void jump (int x, int y, int poradi, int x0, int y0) { if (x >= 0 && x < n && y >= 0 && y < n) { if (p[x][y]==(-1)||p[x][y] > poradi) { p[x][y] = poradi; zx[x][y] = x0; zy[x][y] = y0; jump (x + 2, y + 1, poradi + 1, x, y); jump (x + 2, y - 1, poradi + 1, x, y); jum… text/html 2019-03-27T16:08:32+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=kun_2019_st&rev=1553702912&do=diff #include "pch.h" #include <iostream> using namespace std; const int N = 8; int p[N][N]; int zx[N][N]; int zy[N][N]; void jump(int i, int k, int v, int i0, int k0) // skoc na (i,k) a je to v-ty skok, skaceme z (i0, k0) { if (i < N && i >= 0 && k < N && k >= 0) { if (p[i][k] == -1 || p[i][k] >= v) { p[i][k] = v; zx[i][k] = i0; zy[i][k] = k0; jump(i + 2, k + 1, v + 1, i, k); jump(i + 2, k - 1, v + 1, i, k); … text/html 2019-04-02T09:10:32+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=kun_2019_ut&rev=1554196232&do=diff #include "pch.h" #include <iostream> using namespace std; const int N = 8; int p[N][N]; int zx[N][N]; int zy[N][N]; // p[i][j] ... vzdalenost // zx[i][j] ... cislo radky odkud jsme skocili na (i,j) // zy[i][j] ... cislo sloupce void umisti(int i, int j, int k, int i0, int j0) // skok z (i0, j0) na (i,j), k-ty skok { if ( i < N && i >= 0 && j >= 0 && j < N && (p[i][j] == -1 || p[i][j] > k )) { p[i][j] = k; zx[i][j] = i0; zy[i][j] = j0; umisti(i - 2, j - 1… text/html 2015-04-09T15:27:41+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=kun_c&rev=1428593261&do=diff #include "stdafx.h" #include <string> #include <iostream> using namespace std; const int N = 8; int a [N] [N]; void nuluj() { for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) a[i][j] = -1; } void tiskni() { for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << a[i][j] << " "; } cout << endl; } } void place (int i, int j, int k) { if (i >= 0 && i < N && j >= 0 && j < N) { if (a[i][j] == -1 || a[i][j] > k) { a[i][j] = k; place… text/html 2017-03-30T12:48:24+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=kun_ctvrtek&rev=1490878104&do=diff // kun.cpp : Defines the entry point for the console application. // #include "stdafx.h" #include <iostream> #include <string> #include <cassert> using namespace std; const int N = 8; int pole [N][N]; int zpetX [N][N]; int zpetY [N][N]; void skok (int x, int y, int i, int j, int k) { if (i >= 0 && i < N && j >= 0 && j < N) { if(pole[i][j] == -1 || pole [i][j] > k) { pole[i][j] = k; zpetX[i][j] = x; zpetY[i][j] = y; skok(i , j, i + 1, j + 2, k+1); skok(i , j, i + 2, j… text/html 2014-04-03T12:55:15+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=kun_pas&rev=1396529715&do=diff program kun; const n=8; var a: array [1..n,1..n] of integer; procedure Init; var i,j: integer; begin for i:=1 to n do for j:=1 to n do a[i,j]:= -1; end; procedure Hraj (i,j:integer; k:integer); begin if (i>=1) and (i<=n) and (j>=1)and (j<=n) then begin if (a[i,j] = -1) or (a[i,j] > k) then begin a[i,j]:=k; Hraj(i+2,j+1,k+1); Hraj(i+2,j-1,k+1); Hraj(i-2,j+1,k+1); Hraj(i-2,j-1,k+1); Hraj(i+1,j+2,k+1); Hraj(i+1,j… text/html 2017-04-04T08:38:41+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=kun_utery&rev=1491295121&do=diff #include "stdafx.h" #include <iostream> #include <string> #include <cassert> using namespace std; const int N=8; int v[N][N]; int zx[N][N]; int zy[N][N]; void init(){ for(int i=0;i<N;i++) for(int j=0;j<N;j++){ v[i][j]=-1; zx[i][j]=-1; zy[i][j]=-1; } }; void skoc(int x, int y,int i,int j,int k){ if (i<=N-1 && i>=0 && j<=N-1 && j>=0) { if (v[i][j]==-1 || v[i][j] > k) { v[i][j]=k; zx[… text/html 2013-04-17T09:24:44+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=kun&rev=1366190684&do=diff #ifndef MOJEOKNO_H #define MOJEOKNO_H #include <QMainWindow> #include <QTableWidgetItem> #include <QTreeWidgetItem> namespace Ui { class MojeOkno; } class MojeOkno : public QMainWindow { Q_OBJECT public: explicit MojeOkno(QWidget *parent = 0); ~MojeOkno(); private: int limit; QTreeWidgetItem * top; // QTableWidgetItem * v [8][8]; int z [8][8]; void skoc (int x0, int y0, int n, int x, int y); void hraj (int x0, int y0, int n); private slots: … text/html 2014-04-03T13:12:41+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=kun2_pas&rev=1396530761&do=diff program kun; const n=8; var a, zi, zj: array [1..n, 1..n] of integer; procedure Init; var i,j: integer; begin for i:=1 to n do for j:=1 to n do begin a[i,j]:= -1; zi[i,j]:= -1; zj[i,j]:= -1; end; end; procedure Hraj (ii, jj, i,j:integer; k:integer); begin if (i>=1) and (i<=n) and (j>=1)and (j<=n) then begin if (a[i,j] = -1) or (a[i,j] > k) then begin a [i,j] := k; zi[i,j] := ii; zj[i,j] := jj; Hraj(i,j, i… text/html 2019-10-03T13:08:06+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=lecos&rev=1570108086&do=diff #include <iostream> using namespace std; int fakt (int n) { int v = 1; for (int i = 1; i <= n; i++) { v = v * i; } return v; } int komb (int n, int k) { return fakt(n) / ( fakt(n - k) * fakt(k) ); } #include <iomanip> int main() { for (int n = 0; n <= 10; n++) { for (int k = 0; k <= n; k++) { cout << setw (3) << komb(n, k) << setw (1) << " "; } cout << endl; } cout << "O.K." << endl; } text/html 2018-12-11T11:06:43+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=lexer_2&rev=1544526403&do=diff lexer.h #ifndef LEXER_H #define LEXER_H #include <string> #include <fstream> using namespace std; enum TokenKind { ident, number, text, separator, eos }; class Lexer { private: ifstream f; char ch; void nextChar (); public: TokenKind kind; string token; void nextToken (); void error (string msg); bool isSeparator (char c); void checkSeparator (char c); string readIdent (); public: Lexer (string fileName); }; #endif // LEXER_H text/html 2018-12-13T11:55:50+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=lexer_5&rev=1544702150&do=diff <http://kmlinux.fjfi.cvut.cz/~culik/zpro/lexer05> soubor list.h class List { ... void print (int level = 0); void section (ostream & f, int level); void html (ostream & f); ... }; class Item { public: string name; string info; List inner; ... }; soubor list.cpp void Indent(int level) { if (level > 0) cout << string(level * 4,' '); } void List::print (int level) { // #include <iostream> Indent(level); cout << "[" << endl; Item * p = fir… text/html 2019-11-25T16:27:21+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=lexer2019&rev=1574699241&do=diff <http://kmlinux.fjfi.cvut.cz/~culikzde/sos/Lexer.zip> package example; public class Arit { public String name; public Arit left; public Arit middle; public Arit right; public Arit (String name0) { name = name0; } public String toString () { return name; } } package example; import static com.sun.corba.se.impl.util.Utility.printStackTrace; public class Lexer { public String token; public static final int eos = 0; // end of source public sta… text/html 2015-05-14T14:40:44+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=lexi_c_druha_varianta&rev=1431614444&do=diff #include "stdafx.h" #include <string> #include <iostream> #include <cstdlib> using namespace std; const int K = 5; const char minc = ' '; const char maxc = 127; struct Item { char a [K]; Item * next; Item () : next (nullptr) { } }; struct List { Item * first; Item * last; List () : first (nullptr), last (nullptr) { } void addLast (Item * p); Item * unlinkFirst (); void join(List& L); }; void List::join(List& L){ if (L.first!=nullptr) { if (first==nullptr) … text/html 2015-05-14T13:47:33+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=lexi_c&rev=1431611253&do=diff #include "stdafx.h" #include <string> #include <iostream> #include <cstdlib> using namespace std; const int K = 5; const char minc = ' '; const char maxc = 127; struct Item { char a [K]; Item * next; Item () : next (nullptr) { } }; struct List { Item * first; Item * last; List () : first (nullptr), last (nullptr) { } void addLast (Item * p); }; void List::addLast (Item * p) { p->next = nullptr; if (first == nullptr) first = p; else last->next = p; last = p; } … text/html 2017-05-18T13:01:46+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=lexi_sort&rev=1495112506&do=diff // lexsort.cpp #include "stdafx.h" #include <string> #include <iostream> using namespace std; const char low = 'a'; const char high = 'z'; const int k = high - low + 1; // pocet prihradek const int z = 3; // delka retezce class item{ public: char slovo[z]; item*next; item():next(nullptr){for (int i=0;i<z;i++) slovo[i]=low;}; }; class list{ public:item*first; item*last; list(); void add(item* p)… text/html 2019-04-17T14:14:36+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=lexi_st_2019&rev=1555510476&do=diff #include "pch.h" #include <iostream> #include <time.h> using namespace std; const int N = 20; const int D = 20; // pocet pismen ve slove const int K = 256; // pocet prihradek struct Item { char key [D+1]; // znak 0 na konci Item * next; }; struct List { Item * first; Item * last; }; List inp; // vstup a vystup List tab[K]; // pole prihradek void init (List & a) { a.first = nullptr; a.last = nullptr; } void add (List & a, Item * p) { p->next = nullptr; if … text/html 2018-04-25T15:13:49+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=lexi_st&rev=1524669229&do=diff #include "stdafx.h" #include <iostream> #include <string> #include <ctime> using namespace std; const int length = 4; struct Item { char key [length+1]; Item * next; }; struct List { Item * first; Item * last; }; List queue; // vstup (a pozdeji vystup) const int buckets = 10; List arr [buckets]; // prihradky void clear (List &L) { L.first = nullptr; L.last = nullptr; } void add (char * value) { Item * p = new Item; for (int i = 0; i < length; i++) … text/html 2019-04-16T09:13:35+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=lexi_ut_2019&rev=1555406015&do=diff #include "pch.h" #include <iostream> #include <stdlib.h> /* srand, rand */ #include <time.h> /* time */ using namespace std; const int P = 256; // pocet prihradek const int Z = 16; // pocet pismen v retezci struct Item { char key [Z+1]; Item * next; }; struct List { Item * first; Item * last; }; List inp; // vstupni posloupnost List tab [P]; // pole prihradek inline void init (List & a) { a.first = nullptr; a.last = nullptr; } inline void add (List & a, Item * … text/html 2018-04-24T09:11:55+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=lexi_ut&rev=1524561115&do=diff #include "stdafx.h" const int length = 4; struct Item { char key [length]; Item * next; }; struct List { Item * first; Item * last; }; const int digits = 10; List array [digits]; void clear (List & list) { list.first = nullptr; list.last = nullptr; } void clearAll () { for (int k = 0; k < digits; k++) clear (array [k]); } List queue; void add (List & target, Item * p) { if (target.first == nullptr) target.first = p; else target… text/html 2014-10-23T16:18:46+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=list&rev=1414081126&do=diff Object [] a = { "a", "bb", "ccc" }; MyModel m = new MyModel (a); jList1.setModel (m); package pokus; import javax.swing.*; public class MyModel extends AbstractListModel { private Object [] data; public MyModel (Object [] p) { data = p; } public int getSize () { return data.length; } public Object getElementAt (int index) { return data [index]; } } text/html 2019-11-07T14:09:04+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=list2019&rev=1573135744&do=diff #include <iostream> #include "assert.h" using namespace std; struct Item; struct List { Item* first; Item* last; }; struct Item { Item* prev; string name; Item* next; }; void clear (List & a) { a.first = NULL; a.last = NULL; } void link(List & a, Item* before, Item* fresh, Item* after) // a - seznam do ktereho vkladame // fresh - nove vkladany prvek (musi existovat, nesmi byt v zadnem seznamu) // before - ukazatel na predchozi prvek ( before == nullptr => fresh b… text/html 2020-03-05T13:38:20+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=list2020&rev=1583415500&do=diff #include <iostream> #include <string> #include <cassert> using namespace std; class Item; class List { public: Item* first; Item* last; List () : first (nullptr), last (nullptr) { } ~ List (); private: void link(Item* before, Item* fresh, Item* after); public: void insertFirst(int key0, string note0 = ""); void insertLast(int key0, string note0 = ""); void print(); Item * find (int key0); friend class Item; }; class Item { public: Item* prev; i… text/html 2023-03-14T22:12:44+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=listen&rev=1678831964&do=diff from socketserver import TCPServer from http.server import SimpleHTTPRequestHandler import sys, socket, optparse options = optparse.OptionParser () options.add_option ("-p", "--port", dest="port", default = 1234, action="store", help="Web server TCP port number") (opts, args) = options.parse_args () port = int (opts.port) class MyHandler (SimpleHTTPRequestHandler): def handle (self): print ("Connection from", self.client_address[0]) stop = False while not stop : … text/html 2013-10-24T12:34:18+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=malovani&rev=1382618058&do=diff na zacatek tridy Pen p; Brush b; na konec konstruktoru p = new Pen (panel1.BackColor); b = new SolidBrush (panel1.BackColor); na konec newColorMenuItem_Click p = new Pen(t.BackColor); upravit pictureBox_MouseMove text/html 2013-10-15T11:59:03+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=mapy&rev=1381838343&do=diff Vizualizace dat pomoci webovych map Seznamte se s JavaScriptem Prostudujte zaklady Google Maps API Porovnejte moznosti OpenStreetMaps a jinych technologii Pokuste se navrhnout jednoduchou aplikaci zobrazujici data na webove mape Pokuste se vytvorit jednochou aplikaci shromazdujici data z verejnych zdroju (napr. znecisteni CO2) text/html 2017-04-18T08:26:35+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=matice_add_mul&rev=1492503995&do=diff const int N = 10; struct Matice { double m [N][N]; }; void add (Matice & a, Matice & b, Matice & c) { for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) c.m[i][j] = a.m[i][j] + b.m[i][j]; } void mul (Matice a, Matice b, Matice & c) { for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) { double s = 0; for (int k = 0; k < N; k++) s = s + a.m[i][k] + b.m[k][j]; c.m[i][j] = s; } } Matice x, y, z; void f () { add (x, y, z); m… text/html 2018-10-16T14:46:46+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=matice&rev=1539701206&do=diff #include <iostream> using namespace std; const int N = 10; struct Mat { int m [N][N]; }; void zero (Mat & z) { for ( int i = 0; i < N; i++ ) for (int j = 0; j < N; j++) z.m[i][j] = 0; } void one (Mat & z) { for ( int i = 0; i < N; i++ ) for (int j = 0; j < N; j++) { if (i == j) z.m[i][j] = 1; else z.m[i][j] = 0; } } void add (Mat &c, Mat a, Mat b) { for ( int i = 0; i < N; i++ … text/html 2014-04-30T12:49:42+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=memmap&rev=1398862182&do=diff #include "stdafx.h" #include <windows.h> int _tmain (int argc, _TCHAR* argv[]) { HANDLE f = CreateFile ("C:\\temp\\abc.txt", GENERIC_READ | GENERIC_WRITE, 0, // no sharing NULL, // no security attributes OPEN_ALWAYS, FILE_ATTRIBUTE_NORMAL, NULL // no template ); if (f != INVALID_HANDLE_VALUE) { printf ("Soubor otevren \n"); HANDLE m = CreateFileMapping (f, // file handle NULL, // no security attributes PAGE… text/html 2017-05-05T09:07:26+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=mmap&rev=1493975246&do=diff // ConsoleApplication5.cpp : Defines the entry point for the console application. // #include "stdafx.h" #undef UNICODE #include "windows.h" #include <iostream> #include <string> using namespace std; int _tmain(int argc, _TCHAR* argv[]) { HANDLE h = CreateFile ("C:\\temp\\abc.txt", // lpFileName, GENERIC_READ | GENERIC_WRITE, // dwDesiredAccess, 0, // dwShareMode, NULL, // lpSecurityAttributes, CREATE_ALWAYS,… text/html 2014-11-27T17:55:59+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=mouselistener&rev=1417110959&do=diff public Window() { initComponents(); Reaction r = new Reaction (jButton1); jButton1.addMouseListener(r); } package simple; import java.awt.event.*; import javax.swing.*; public class Reaction implements MouseListener { private JButton button; public Reaction (JButton b) { button = b; } public void mouseClicked(MouseEvent e) { button.setText ("clicked"); } public void mousePressed(MouseEvent e) { … text/html 2008-04-02T16:13:00+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=mysql&rev=1207152780&do=diff MySQL yum install php-mysql /etc/init.d/httpd restart mysql -u root create database pokus; show databases; quit text/html 2022-06-16T21:50:20+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=npp&rev=1655416220&do=diff path c:\Appl\Qt\Qt5.15.2\Tools\mingw810_64\bin;%path% mingw32-make pause text/html 2019-11-14T14:05:12+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=objectlist2019&rev=1573740312&do=diff class List { public: void move(List& other); }; void List::move(List& other) { while (other.first != nullptr) { Item* a = other.first; other.unlink(other.first); insertLast(a); } } List b; b.move(seznam); seznam.print(); b.print(); text/html 2019-11-19T12:09:30+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=objectlistoflists2019&rev=1574165370&do=diff #include <iostream> #include "assert.h" using namespace std; class Item; class List { private: Item* first; Item* last; public: Item* getFirst() { return first; } Item* getLast() { return last; } private: void link(Item* before, Item* fresh, Item* after); public: void insertFirst(Item* fresh); void insertLast(Item* fresh); void insertBefore(Item* target, Item* fresh); void insertAfter(Item* target, Item* fresh); void unlink(Item* elem); void rem… text/html 2019-11-21T14:08:57+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=objecttree2019&rev=1574345337&do=diff #include <iostream> #include "assert.h" using namespace std; class Item { public: string name; private: Item* up; Item* prev; Item* next; Item* first; Item* last; public: Item* getUp() { return up; } Item* getPrev() { return prev; } Item* getNext() { return next; } Item* getFirst() { return first; } Item* getLast() { return last; } private: void link(Item* before, Item* fresh, Item* after); public: void insertFirst(Item* fresh); void… text/html 2014-10-16T11:05:56+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=objekty&rev=1413457556&do=diff File myitem.h #ifndef MYITEM_H #define MYITEM_H #include <QString> class MyItem { public: virtual QString info (); }; #endif // MYITEM_H File myitem.cpp #include "myitem.h" QString MyItem::info () { return "my item"; } File myrectangle.h text/html 2011-10-06T14:59:13+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=okenka&rev=1317913153&do=diff package example; public class Window extends javax.swing.JFrame { public static int citac = 0; public String id = ""; public Window above = null; public Window [] below = new Window [] { }; public Window (Window from) { this (); // super (1, 2); above = from; } /** Creates new form Window */ public Window() { initComponents(); citac ++; // ++ citac; // citac += 1; // citac = citac + 1; id … text/html 2025-06-25T08:08:50+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=old&rev=1750838930&do=diff heap2022 strom ctvrtek strom utery dvousmerny seznam seznam qt graphics qt tree kresleni matice pole poznamky PyQt C# components C# properties Open Inventor cisla drobnosti SQLite Strom Objektovy seznam obsahujici seznamy Objektovy seznam Obousměrný seznam Java lexer virtualbox qt javascript qt xml seznam ukazatele qt properties struktury tree pole (4) soustava kresleni Java strom pole (3) pole (2) C# pole lecos pole funkce cyklus example C# destruc… text/html 2024-05-17T17:26:19+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=openfoam-pictures&rev=1715966779&do=diff text/html 2024-05-17T17:32:19+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=openfoam&rev=1715967139&do=diff <https://www.openfoam.com> <https://www.openfoam.org> <https://gitlab.com/foam-for-nuclear/offbeat> <https://dl.openfoam.com/repos/deb/dists/> (new versions) OpenFOAM 9 <https://openfoam.org/download/history/> <https://openfoam.org/download/9-ubuntu/> <https://dl.openfoam.org/ubuntu/dists/jammy/main/binary-amd64/> <https://dl.openfoam.org/ubuntu/dists/focal/main/binary-amd64/> patch <https://github.com/OpenFOAM/OpenFOAM-9/commit/b0c15bebd37142f3902901ed5e9a60e33ed456eb> <https://github… text/html 2019-12-02T13:58:21+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=openinventor2019&rev=1575295101&do=diff dnf install Inventor-devel InventorXt-devel Inventor-data Inventor-examples Inventor-demos zkopirovat /usr/lib64/Inventor/examples adresar example/Mentor/CXX make ./02.1.HelloCone #include <Inventor/nodes/SoCube.h> #include <Inventor/nodes/SoRotationXYZ.h> #include <Inventor/engines/SoElapsedTime.h> #include <Inventor/manips/SoTrackballManip.h> text/html 2024-11-16T14:49:35+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=packages-fedora21&rev=1731768575&do=diff sil-padauk-fonts-2.8-7.fc21.noarch caja-open-terminal-1.8.0-4.fc21.i686 python-hawkey-0.5.1-1.fc21.i686 rsyslog-7.4.10-5.fc21.i686 bluez-libs-5.23-1.fc21.i686 im-chooser-1.6.4-4.fc21.i686 mariadb-config-10.0.14-7.fc21.i686 adobe-source-han-sans-twhk-fonts-1.001-1.fc21.noarch seahorse-3.14.0-3.fc21.i686 libqmi-utils-1.10.2-2.fc21.i686 kdegraphics-strigi-analyzer-4.14.3-1.fc21.i686 perl-Pod-Perldoc-3.23-2.fc21.noarch libkmahjongg-4.14.3-1.fc21.i686 skkdic-20131114-8.T1121.fc21.noarch google-noto-s… text/html 2013-10-22T14:34:16+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=pascal&rev=1382452456&do=diff program Project1; const eso = 1; svrsek = eso + 1; type figurka = ( nic, pesec, vez, kun, strelec, dama, kral ); barva = ( cerna, bila ); radka = 1..8; sloupec = ( A, B, C, D, E, F, G, H ); policko = record fig: figurka; bar: barva; end; var sachovnice : array [radka, sloupec] of policko; procedure nastav (r: radka; s: sloupec; fi: figurka; ba: barva); begin sachovnice [r,s].fig := fi; sachovnice [r,s].ba… text/html 2014-12-04T11:54:11+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=patterns&rev=1417694051&do=diff class Area : public QWidget { public: void dragEnterEvent (QDragEnterEvent * event); }; Area * area; area = new Area; area->setAcceptDrops(true); area->setParent (ui->base); QSize s = ui->base->size(); area->setGeometry(4, 4, s.width()-8, s.height()-8); QPalette palette; QBrush brush1 (QColor (255, 255, 155)); brush1.setStyle (Qt::SolidPattern); palette.setBrush (QPalette::Active, QPalette::Window, brush1); area->setPalette (palette); ar… text/html 2008-03-06T12:00:00+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=perl&rev=1204804800&do=diff Perl #! /usr/bin/perl print "Content-type: text/plain\n\n"; print "This is output from simple Perl script \n"; print "\n"; foreach $var (sort(keys(%ENV))) { $val = $ENV{$var}; $val =~ s|\n|\\n|g; $val =~ s|"|\\"|g; print "${var}=\"${val}\"\n"; } text/html 2014-04-24T12:25:11+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=php_1&rev=1398342311&do=diff echo "<td> <a href='?fce=edit'> edit </a> </td>"; su - cd /var/www/html mkdir pokus chown jmeno pokus ll yum install httpd mysql mysql-server php php-mysqlnd phpMyAdmin apachectl start systemctl start mariadb.service cp ~/Downloads/db-example.txt /var/www/html/pokus/db-example.php mysql -u root create database mydb; use mydb; create table colors (name varchar(80), red int, green int, blue int); insert into colors values ("blue", 0, 0, 255); select * from colors;… text/html 2021-11-08T15:45:23+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=pismena&rev=1636386323&do=diff #include <iostream> #include <string> using namespace std; void pismeno (char a) { switch (a) { case 'A': cout << " aa " << endl; cout << " aa a " << endl; cout << " aa a " << endl; cout << " aa a " << endl; cout << " aaaaaaaaaa " << endl; cout << " aaaaaaaaaaa " << endl; cout << " aa a " << endl; cout << " aaaa aaa " << endl; break… text/html 2021-12-09T17:48:54+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=pokus_dbs&rev=1639072134&do=diff #!/usr/bin/env python import sys from PyQt5.QtCore import * from PyQt5.QtGui import * from PyQt5.QtWidgets import * from PyQt5.QtSql import * # -------------------------------------------------------------------------- class DatabaseInfo (object) : def __init__ (self) : self.item_list = [ ] class TableInfo (object) : def __init__ (self) : self.item_name = "" self.item_list = [ ] class ColumnInfo (object) : def __init__ (self) : self.item_name = "" # --… text/html 2021-11-25T17:57:18+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=pokus&rev=1637863038&do=diff import os, sys, time, hashlib from stat import * from PyQt5.QtCore import * from PyQt5.QtGui import * from PyQt5.QtWidgets import * def size_str (n) : s = str (n) while len (s) < 9 : s = " " + s s = s[0:3] + " " + s[3:6] + " " + s[6:] return s def mark (node, col, cond) : if cond : node.setForeground (col, QColor ("lime")) else : node.setForeground (col, QColor ("red")) class Window (QMainWindow) : def __init__ (self) : … text/html 2021-12-02T18:00:34+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=pokus2&rev=1638468034&do=diff import sys from PyQt5.QtCore import * from PyQt5.QtGui import * from PyQt5.QtWidgets import * class ColorButton (QToolButton) : def __init__ (self, page, name, color) : super().__init__(page) self.name = name self.color = color self.setToolTip (name) page.addWidget (self) pixmap = QPixmap (12, 12) pixmap.fill (Qt.transparent) painter = QPainter (pixmap) painter.setPen (Qt.NoPen) painter.setBru… text/html 2021-12-09T17:30:02+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=pokus3&rev=1639071002&do=diff import sys from PyQt5.QtCore import * from PyQt5.QtGui import * from PyQt5.QtWidgets import * from PyQt5.QtSql import * db = QSqlDatabase.addDatabase ("QSQLITE") # db.setDatabaseName (":memory:") db.setDatabaseName ("test.sqlite") db.open () query = db.exec_ ("CREATE TABLE IF NOT EXISTS colors (name TEXT," "red INTEGER, green INTEGER, blue INTEGER)") db.exec_ ("INSERT INTO colors (name, red, green, blue) VALUES (\"blue\", 0, 0, 255)") db.close () text/html 2014-03-10T16:06:38+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=pokus4&rev=1394467598&do=diff #ifndef OKNO_H #define OKNO_H #include <QMainWindow> #include <QTableWidget> #include <QTreeWidgetItem> namespace Ui { class Okno; } class Info { public: int len; int from_line; int from_col; Info () : len (-1), from_line (-1), from_col (-1) { } }; const int n = 8; class MyItem : public QTreeWidgetItem { public: Info pole [n][n]; int xx, yy; }; class Okno : public QMainWindow { Q_OBJECT public: explicit Okno(QWidget *parent = 0); ~Okno(); private slo… text/html 2019-10-07T17:14:50+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=pole_csharp&rev=1570468490&do=diff private void Button1_Click(object sender, EventArgs e) { int[,,] a = new int[5, 5, 10]; a[0, 0, 0] = 10; a[0, 1, 1] = 20; tabControl1.TabPages.Clear(); for (int i = 0; i < a.GetLength(0); i++) { TabPage page = new TabPage(); page.Text = "Stranka " + i; tabControl1.TabPages.Add(page); DataGridView grid = new DataGridView(); // stranku vyplnit tabulkou … text/html 2011-10-10T14:30:09+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=pole&rev=1318257009&do=diff <http://kmlinux/~culik/wiki> private void send (String s) { jTextArea1.append (s + "\n"); } private void send (String id, int [] p) { if (p == null) { send (id + " je null"); } else { /* send (id + " ma " + p.length + " prvku"); for (int i = 0; i < p.length ; i ++) send (id + "[" + i + "] = " + p[i]); */ String txt = id + " = ("; for (… text/html 2014-10-16T16:51:30+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=pole2&rev=1413478290&do=diff Soubor Node.java package pokus; import javax.swing.tree.*; public class Node extends DefaultMutableTreeNode { public Node (Object obj) { super (obj); } } Soubor Window.java import javax.swing.tree.*; text/html 2016-10-20T14:06:46+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=pole3&rev=1476972406&do=diff <http://kmlinux/~culik/wiki> package javaapplication11; import javax.swing.*; public class Window extends javax.swing.JFrame { public Window() { initComponents(); } private void display (int [] t) { if (t != null) { // import javax.swing.*; JToolBar q = new JToolBar (); area.add (q); for (int j = 0; j < t.length; j ++) { JButton b = new JButton (); b.setText (… text/html 2018-10-18T15:05:54+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=pole10&rev=1539875154&do=diff #include <iostream> using namespace std; const int N= 10; int a[N]; void tisk (int p[N]) { for (int j=0; j<N; j++) { cout << "p[" << j << "]=" << p[j] << endl; } } int main() { a[0]=1; for (int i=1; i<N; i++) { // a[i]= 2 * a[i-1]; // mocniny 2 a[i]= i * a[i-1]; // faktorialy } tisk (a); cout << "KONEC" << endl; return 0; } text/html 2019-10-01T11:01:53+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=pole2019&rev=1569927713&do=diff #include <iostream> using namespace std; const int N = 4; int a [N]; void zvetsi() // zvetsi o jedna { int p = 1; // co se pricita for (int i = 0; i < N; i++) { a[i] = a[i] + p; // zvetsit cifru p = 0; // co se priste pricte if (a[i] >= 2) // moc velka cislice { a[i] = a[i] - 2; // opravime (o 1 rad) p = 1; // priste pricist } } } int main() { a[0] = 1; a[1] = 0; a[2] = 1; a[3] = 0; zvetsi(); … text/html 2019-10-10T12:48:38+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=pole2019b&rev=1570711718&do=diff #include <iostream> using namespace std; const int N = 3; typedef double T; T a[N], b[N]; T c[N]; void add(T* z, T* x, T* y) // z[i] = x[i] + y[i] { for (int i = 0; i < N; i++) { z[i] = x[i] + y[i]; } } void mult (T* z, T c, T* x) // z[i] = c *x[i] { for (int i = 0; i < N; i++) { z[i] = c * x[i]; } } void print(string name, T* x) { cout << name << " ( "; for (int i = 0; i < N; i++) { cout << x[i]; if (i < N - 1) cout << ", "; } … text/html 2019-10-10T13:02:07+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=pole2019c&rev=1570712527&do=diff #include <iostream> using namespace std; const int M = 3; const int N = 3; typedef double T; T a [M][N], b [M][N], c[M][N]; void zero(T x[M][N]) { for (int i = 0; i < M; i++) { for (int k = 0; k < N; k++) { a[i][k] = 0; } } } void one(T x[M][N]) { zero(x); for (int i = 0; i < M; i++) { x[i][i] = 1; } } void print(string name, T x [M][N]) { cout << name << " [ " << endl; for (int i = 0; i < M; i++) // cyklus pro ra… text/html 2019-10-17T13:21:07+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=pole2019d&rev=1571318467&do=diff #include <iostream> #include <fstream> #include <iomanip> #include <string> using namespace std; const int M = 3; // pocet radku const int N = 4; // pocet sloupcu typedef double T; // typ T = double void clear(T p[M][N]) { for (int i = 0; i < M; i++) for (int j = 0; j < N; j++) p[i][j] = 0; } void print(ostream& f, T p[M][N]) { for (int i = 0; i < M; i++) // cyklus pro radky { for (int j = 0; j < N; j++) // cyklus pro sloupce { f… text/html 2014-11-20T12:05:37+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=popis_typu&rev=1416485137&do=diff #include <QTreeWidgetItem> void info (QTreeWidgetItem * target, QObject * obj); void MainWindow::on_pushButton_clicked() { // info (ui->pushButton); // info (ui->treeWidget); info (NULL, this); } // #include <QTreeWidgetItem> // #include <QMetaMethod> // #include <QMetaProperty> void MainWindow::info (QTreeWidgetItem * target, QObject * obj) { QTreeWidgetItem * top = new QTreeWidgetItem; if (target == NULL) ui->treeWidget->addTopLevelItem (top); else … text/html 2019-12-09T20:15:10+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=poznamky&rev=1575922510&do=diff <http://kmlinux/~culik/wiki/poznamky> SQLite <https://medium.com/@alexandermlharris/sqlite-and-ef6-the-tutorial-that-works-181da420899f> <https://github.com/damienbod/SQLiteExamples> <https://github.com/icsharpcode/SharpDevelop/tree/master/src/AddIns/DisplayBindings/Data/ICSharpCode.Data.Addin> <https://www.youtube.com/watch?v=iX0fYGy6_9A> Python decorators <https://realpython.com/primer-on-python-decorators/> Flask <https://docs.python.org/3.7/library/dataclasses.html> C #include "s… text/html 2014-05-15T13:09:46+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=prihradky&rev=1400159386&do=diff program lexi; const k=5; zero='0'; nine='9'; type blok=record next:^blok; number:string[k]; end; type entry=record first:^blok; last:^blok; end; type uk=^blok; var pole: array[zero..nine] of entry; seznam: entry; procedure vynuluj; var a:char; begin for a:=zero to nine do with pole[a] do begin first:=nil; last:=nil; end; end; procedure vloznakonec(var r:entry; u:uk); begin if r.first<>nil then r.last^.nex… text/html 2014-12-08T13:49:12+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=properties&rev=1418046552&do=diff public Form1() { InitializeComponent(); showControls (treeView1.Nodes, this); } void showControls (TreeNodeCollection target, Control control) { TreeNode node = new TreeNode (); node.Text = control.Name + ":" + control.GetType().Name; node.Tag = control; target.Add (node); foreach (Control c in control.Controls) … text/html 2019-10-29T16:14:11+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=properties2019&rev=1572365651&do=diff treeitem.h #ifndef TREEITEM_H #define TREEITEM_H #include <QTreeWidgetItem> class TreeItem : public QTreeWidgetItem { public: QObject * obj; TreeItem () : obj (nullptr) { } }; #endif // TREEITEM_H mainwindow.h #ifndef MAINWINDOW_H #define MAINWINDOW_H #include <QMainWindow> #include <QTreeWidget> #include <QTableWidget> namespace Ui { class MainWindow; } class MainWindow : public QMainWindow { Q_OBJECT public: explicit MainWindow(QWidget *parent = nullptr); … text/html 2018-10-17T09:06:56+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=pyqt_svg&rev=1539767216&do=diff <https://dev.w3.org/SVG/tools/svgweb/samples/svg-files/tiger.svg> from __future__ import print_function import os, sys, time from PyQt4.QtCore import * from PyQt4.QtGui import * from PyQt4.QtSvg import * from PyQt4.QtNetwork import * class Window (QMainWindow) : def __init__ (self) : super (Window, self).__init__ () self.view = QSvgWidget () self.setCentralWidget (self.view) if False : self.view.load ("Downloads/tiger.svg") … text/html 2018-10-10T09:20:12+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=pyqt_tree&rev=1539163212&do=diff import os, sys, time from PyQt4.QtCore import * from PyQt4.QtGui import * class Window (QMainWindow) : def __init__ (self) : super (Window, self).__init__ () self.setWindowTitle ("Okno") self.tree = QTreeWidget () self.setCentralWidget (self.tree) self.tree.itemActivated.connect (self.onClick) self.tree.setColumnCount (3) self.tree.setHeaderLabels (["name", "size", "date"]) self.scanDir (self.tree, ".") … text/html 2018-10-17T08:51:38+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=pyqt_xml&rev=1539766298&do=diff <https://dev.w3.org/SVG/tools/svgweb/samples/svg-files/tiger.svg> from __future__ import print_function import os, sys, time from PyQt4.QtCore import * from PyQt4.QtGui import * class Window (QMainWindow) : def __init__ (self) : super (Window, self).__init__ () self.tree = QTreeWidget () self.setCentralWidget (self.tree) self.scanXml ("Downloads/plant_catalog.xml") def scanXml (self, fileName) : f = QFile (fileName) … text/html 2019-12-09T20:09:03+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=pyqt&rev=1575922143&do=diff from __future__ import print_function import sys try : from PyQt5.QtCore import * from PyQt5.QtGui import * from PyQt5.QtWidgets import * print ("using PyQt5") except : from PyQt4.QtCore import * from PyQt4.QtGui import * print ("using PyQt4") # pip3 install PyQt5 # Debian, Ubuntu: apt-get install python3-pyqt5 # Fedora: dnf install python3-qt5 # ArchLinux: pacman -S python-pyqt5 class Window (QMainWindow) : def __init__ (self, parent = None) : super (Window… text/html 2009-05-21T13:04:29+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=pyqt4_cont&rev=1242911069&do=diff #!/usr/bin/env python from PyQt4 import QtCore, QtGui import sys class MainWin (QtGui.QMainWindow): def __init__ (self, parent=None): QtGui.QMainWindow.__init__ (self, parent) fileMenu = self.menuBar().addMenu ("&File") toolbar = self.addToolBar ("tools") toolbar.setMovable (True) toolbar.setIconSize (QtCore.QSize (16, 16)) self.setStatusBar (QtGui.QStatusBar ()) act = QtGui.QAction ("&Open", self) act.setIcon (QtG… text/html 2009-05-21T12:27:07+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=pyqt4&rev=1242908827&do=diff #!/usr/bin/env python from PyQt4 import QtCore, QtGui import sys def start () : app = QtGui.QApplication (sys.argv) win = QtGui.QMainWindow () win.show () app.exec_ () start () #!/usr/bin/env python from PyQt4 import QtCore, QtGui import sys class MainWin (QtGui.QMainWindow): def __init__ (self, parent=None): QtGui.QMainWindow.__init__ (self, parent) fileMenu = self.menuBar().addMenu ("&File") toolbar = self.addToolBar ("tools") tool… text/html 2017-03-07T13:41:41+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=qdir&rev=1488894101&do=diff mainwindow.h public: void showDir (QString path); private: void showSubdir (QTreeWidgetItem * branch, QDir dir); mainwindow.cpp #include "mainwindow.h" #include <QDir> #include <QTreeWidgetItem> #include <iostream> using namespace std; MainWindow::MainWindow(QWidget *parent) : QMainWindow(parent) { setupUi(this); showDir (".."); } void MainWindow::showDir (QString path) { QDir dir0 (path); QDir dir (dir0.absolutePath()); auto branch = new QTreeWidgetIte… text/html 2017-03-13T16:13:12+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=qdrag&rev=1489421592&do=diff #ifndef MYLINEEDIT_H #define MYLINEEDIT_H #include <QLineEdit> class MyLineEdit : public QLineEdit { public: MyLineEdit (QWidget * parent = NULL); protected: void dragEnterEvent(QDragEnterEvent *event); void dropEvent(QDropEvent *event); }; #endif // MYLINEEDIT_H text/html 2016-11-04T10:09:42+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=qgraphics&rev=1478254182&do=diff #ifndef MAINWINDOW_H #define MAINWINDOW_H #include <QMainWindow> #include <QTreeWidget> #include <QGraphicsRectItem> namespace Ui { class MainWindow; } class MainWindow : public QMainWindow { Q_OBJECT public: explicit MainWindow(QWidget *parent = 0); ~MainWindow(); private: Ui::MainWindow *ui; void init (); void list (); void list (QTreeWidgetItem *branch, QGraphicsItem *container); QTreeWidgetItem *createNode(QGraphicsItem *item); }; #endif // MAINWINDOW_H text/html 2017-04-03T14:45:41+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=qshape&rev=1491230741&do=diff #ifndef MAINWINDOW_H #define MAINWINDOW_H #include <QMainWindow> #include <QGraphicsScene> #include <QAbstractGraphicsShapeItem> namespace Ui { class MainWindow; } class ColorButton : public QToolButton { private : QString name; QColor color; public : ColorButton (QString s); }; typedef QAbstractGraphicsShapeItem ShapeItem; class ParamList : public QMap <QString, QString> { public: int number (QString key, int default_value = 0); }; class MainWindow : public QMainWin… text/html 2017-04-10T15:01:58+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=qt_xml&rev=1491836518&do=diff #ifndef MAINWINDOW_H #define MAINWINDOW_H #include <QMainWindow> #include <QTreeWidgetItem> #include <QToolButton> #include <QGraphicsScene> #include <QAbstractGraphicsShapeItem> #include <QGraphicsRectItem> #include <QGraphicsEllipseItem> #include <QTableWidgetItem> namespace Ui { class MainWindow; } class ParamList : public QMap <QString, QString> { public: int number (QString key, int default_value = 0); }; class ColorButton : public QToolButton { private : QString name; … text/html 2008-04-15T11:57:24+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=qt&rev=1208260644&do=diff mkdir pokus cd pokus kate pokus.cc qmake -project qmake make ./pokus #include <qapplication.h> #include <qpushbutton.h> #include <qslider.h> #include <qlcdnumber.h> #include <qfont.h> #include <qvbox.h> class MyWidget : public QVBox { Q_OBJECT public: MyWidget( QWidget *parent=0, const char *name=0 ); private: QPushButton * quit; public slots: void stisknuto (); }; #include "pokus.moc" void MyWidget::stisknuto () { quit->setText ("ABC"); } MyWidget::MyWidget( QWidget *par… text/html 2009-04-15T14:13:01+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=qt4&rev=1239804781&do=diff priklad.pro HEADERS = form.h FORMS = form.ui SOURCES = form.cpp \ main.cpp qmake-qt4 Vznikne Makefile make main.cc #include <QApplication> #include "form.h" int main(int argc, char *argv[]) { QApplication app(argc, argv); MyForm win; win.show(); return app.exec(); } text/html 2018-02-26T16:21:39+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=qtextedit&rev=1519662099&do=diff #include <QTextCursor> #include <QTextCharFormat> void MainWindow::on_pushButton_clicked() { QTextCharFormat fmt = ui->textEdit->currentCharFormat(); fmt.setForeground(QColor ("red")); ui->textEdit->setCurrentCharFormat(fmt); ui->textEdit->insertPlainText("Abc "); QTextCursor c = ui->textEdit->textCursor(); QTextCharFormat f = c.charFormat(); f.setForeground(QColor ("blue")); c.setCharFormat(f); c.insertText("Def "); } text/html 2014-03-18T10:13:29+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=qtgraph&rev=1395137609&do=diff #include "mainwindow.h" #include "ui_mainwindow.h" #include <QGraphicsRectItem> #include <QGraphicsSceneWheelEvent> #include <QGraphicsSceneDragDropEvent> #include <QDrag> #include <QMimeData> MainWindow * win = 0; class MyItem : public QGraphicsRectItem { private: QColor clr; int cnt; public: void setClr () { clr = QColor::fromHsl(abs (cnt) % 360, 250, 150); setBrush (clr); setToolTip (QString::number(cnt)); // setRotation(abs (cnt) % 360); … text/html 2014-03-25T09:43:38+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=qtgraph2&rev=1395740618&do=diff #include "mainwindow.h" #include "ui_mainwindow.h" #include <QGraphicsRectItem> #include <QGraphicsSceneWheelEvent> #include <QGraphicsSceneDragDropEvent> #include <QDrag> #include <QMimeData> MainWindow * win = 0; class MyItem : public QGraphicsRectItem { private: QColor clr; int cnt; public: void setClr () { clr = QColor::fromHsl(abs (cnt) % 360, 250, 150); setBrush (clr); setToolTip (QString::number(cnt)); // setRotation(abs (cnt) % 360); … text/html 2014-03-17T16:01:39+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=qtgraphics&rev=1395072099&do=diff #include "mainwindow.h" #include "ui_mainwindow.h" #include <QGraphicsRectItem> #include <QGraphicsSceneWheelEvent> #include <QDrag> #include <QMimeData> #include <QGraphicsSceneDragDropEvent> QMainWindow * win = NULL; class MyItem : public QGraphicsRectItem { private: int cnt = 0; QColor clr; protected: virtual void wheelEvent ( QGraphicsSceneWheelEvent * event ) { cnt += event->delta() / 8; clr = QColor::fromHsl(abs (cnt)%360, 250, 200); setBrush (clr)… text/html 2020-03-09T16:00:23+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=qtgraphics2020&rev=1583769623&do=diff <http://kmlinux.fjfi.cvut.cz/~culikzde/sos/graphics03.tgz> #ifndef MAINWINDOW_H #define MAINWINDOW_H #include <QMainWindow> #include <QGraphicsScene> #include <QTreeWidgetItem> #include <QTableWidgetItem> QT_BEGIN_NAMESPACE namespace Ui { class MainWindow; } QT_END_NAMESPACE class MainWindow : public QMainWindow { Q_OBJECT public: MainWindow(QWidget *parent = nullptr); ~MainWindow(); void openFile (QString fileName); void refreshTree (); QTableWidgetItem * addTabl… text/html 2018-10-31T09:39:17+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=qtproperties&rev=1540978757&do=diff #ifndef MAINWINDOW_H #define MAINWINDOW_H #include <QMainWindow> #include <QTableWidget> #include <QMetaProperty> namespace Ui { class MainWindow; } class MainWindow : public QMainWindow { Q_OBJECT public: explicit MainWindow(QWidget *parent = 0); ~MainWindow(); private: Ui::MainWindow *ui; int line_count; QTableWidgetItem * displayLine (QString name, QString value); void displayProperty (const QObject * obj, QMetaProperty prop); void displayObject (QObject *… text/html 2019-03-05T14:10:54+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=qtree&rev=1551795054&do=diff #ifndef MAINWINDOW_H #define MAINWINDOW_H #include <QMainWindow> #include <QTreeWidget> namespace Ui { class MainWindow; } class MainWindow : public QMainWindow { Q_OBJECT public: explicit MainWindow(QWidget *parent = nullptr); ~MainWindow(); private slots: void on_actionQuit_triggered(); void on_actionTest_triggered(); void on_treeWidget_itemDoubleClicked(QTreeWidgetItem *item, int column); private: Ui::MainWindow *ui; }; #endif // MAINWINDOW_H text/html 2018-03-05T15:25:25+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=qtree2018&rev=1520263525&do=diff #ifndef MAINWINDOW_H #define MAINWINDOW_H #include <QMainWindow> #include <QTreeWidgetItem> #include <QDir> namespace Ui { class MainWindow; } class MainWindow : public QMainWindow { Q_OBJECT public: explicit MainWindow(QWidget *parent = 0); ~MainWindow(); private slots: void on_pushButton_clicked(); private: Ui::MainWindow *ui; void showDir (QTreeWidgetItem * target, QDir dir); }; #endif // MAINWINDOW_H text/html 2018-02-27T14:11:14+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=qtreewidget_2018&rev=1519740674&do=diff #ifndef MAINWINDOW_H #define MAINWINDOW_H #include <QMainWindow> #include <QTreeWidgetItem> namespace Ui { class MainWindow; } class MainWindow : public QMainWindow { Q_OBJECT private: QTreeWidgetItem * current; public: void open (QString s); void add (QString s); void close (); public: explicit MainWindow(QWidget *parent = 0); ~MainWindow(); private slots: void on_pushButton_clicked(); private: Ui::MainWindow *ui; }; #endif // MAINWINDOW_H text/html 2015-03-04T14:08:10+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=qtreewidget&rev=1425478090&do=diff <http://kmlinux/~culik/wiki> #include <QDir> #include <QFileInfo> #include <QTreeWidget> void showFile (QTreeWidgetItem * branch, QFileInfo info, int level); void MainWindow::showFile (QTreeWidgetItem * branch, QFileInfo info, int level) { QTreeWidgetItem * item = new QTreeWidgetItem; item->setText (0, info.fileName()); item->setToolTip (0, info.filePath()); if (info.isDir()) item… text/html 2014-03-17T14:30:57+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=qtscene&rev=1395066657&do=diff #include "mainwindow.h" #include "ui_mainwindow.h" #include <QGraphicsScene> #include <QGraphicsItem> #include <QDrag> #include <QMimeData> #include <QGraphicsSceneDragDropEvent> MainWindow * w; class MyItem : public QGraphicsRectItem { protected : virtual void wheelEvent ( QGraphicsSceneWheelEvent * event ) { setBrush (Qt::green); } virtual void mousePressEvent ( QGraphicsSceneMouseEvent * event ) { QDrag * d = new QDrag (w); QMimeData * m = new QM… text/html 2014-03-26T16:08:10+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=qtthread&rev=1395850090&do=diff #ifndef MAINWINDOW_H #define MAINWINDOW_H #include <QMainWindow> #include <QThread> #include <QMap> #include <QTreeWidgetItem> namespace Ui { class MainWindow; } class MainWindow : public QMainWindow { Q_OBJECT public: explicit MainWindow(QWidget *parent = 0); ~MainWindow(); private: QMap <QString, QTreeWidgetItem*> branch; private slots: void receive (QString s); void receive2 (QString id, QString s); private: Ui::MainWindow *ui; }; class Vlakno : public QThr… text/html 2014-04-02T13:09:46+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=qtthread1&rev=1396444186&do=diff #ifndef MAINWINDOW_H #define MAINWINDOW_H #include <QMainWindow> #include <QThread> #include <QHash> #include <QTreeWidgetItem> namespace Ui { class MainWindow; } class Vlakno : public QThread { Q_OBJECT public: QString name; signals: void send (QString s); void send2 (QString id, QString s); public: void run (); }; class MainWindow : public QMainWindow { Q_OBJECT private: QHash <QString, QTreeWidgetItem*> b; private slots: void receive (QString s); void r… text/html 2020-02-24T15:47:24+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=qttree202&rev=1582559244&do=diff #include "mainwindow.h" #include "ui_mainwindow.h" MainWindow::MainWindow(QWidget *parent) : QMainWindow(parent) , ui(new Ui::MainWindow) { ui->setupUi(this); } MainWindow::~MainWindow() { delete ui; } #include <QDir> void MainWindow::on_action_Run_triggered() { QDir t (".."); QString s = t.absolutePath(); QDir d (s); setWindowTitle (s); QTreeWidgetItem * root = new QTreeWidgetItem; root->setText (0, d.dirName()); root->setToolTip (0, d.absolutePa… text/html 2021-10-22T21:00:25+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=qtzip&rev=1634936425&do=diff do souboru .pro pridat QT += gui-private #include <QCoreApplication> #include "QtGui/private/qzipwriter_p.h" #include <iostream> using namespace std; int main(int argc, char *argv[]) { // QCoreApplication a(argc, argv); QByteArray data = "nejaky text"; QZipWriter w ("pokus.zip"); w.addFile ("abc.txt", data); w.close(); cout << "O.K." << endl; // return a.exec(); } text/html 2015-05-07T13:40:30+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=quicksort_c&rev=1431006030&do=diff // QuickSort.cpp : #include "stdafx.h" #include <string> #include <iostream> #include <cstdlib> using namespace std; const int N = 200; int a[N]; void QuickSort (int L, int P){ int i = L; int k = P; int h= a[(L+P)/2]; while(i <= k){ while ( a[i] < h) i++; while ( a[k] > h) k--; if (i<=k) { int p = a[i]; a[i] = a[k]; a[k] = p; i++; k--; } } if (L<k) QuickSort(L , k); if (i<P) QuickSort(i , P); } void print() { for (int i = 0; i< N; i++) { if… text/html 2017-04-20T13:04:43+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=quicksort_ctvrtek&rev=1492693483&do=diff // quick.cpp #include "stdafx.h" #include <iostream> #include <string> #include <cassert> using namespace std; const int N = 1000000; int a [N]; void swap(int &c, int &k){ int pom; pom=c; c=k; k=pom; } void quick (int r, int s){ int i=r; int j=s; int h = a[(r+s)/2]; // cout << "quick (" << r << "," << s << ") :" << h << ":" << endl; // for (int k=r; k<=s; k++) cout << a[k] << ", "; // cout << endl; while (i <= j) { while (a[i]<h) i++; … text/html 2018-04-24T15:30:07+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=quicksort_list&rev=1524583807&do=diff // #include "stdafx.h" #include <iostream> #include <string> #include <ctime> using namespace std; struct Item { int key; Item * next; }; Item * start = nullptr; const bool debug = false; const bool print_numbers = true; const int random_numbers = 1000; // pri velkem poctu cisel (nad 80 000) dojde k preplneni zasobnik void add (Item * & list, int value) { Item * p = new Item; p->key = value; p->next = nullptr; if (list != nullptr) p->next = list; list = p… text/html 2019-04-10T14:22:32+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=quicksort_st_2019&rev=1554906152&do=diff #include "pch.h" #include <iostream> #include <time.h> using namespace std; const int N = 1; int a[N]; inline void swap (int & x, int & y) { int t = x; x = y; y = t; } void quicksort(int r, int s) // tridime a[r] , ... , a[s] { int h = a[(r + s) / 2];// r <= (r + s) / 2 <= s int i = r; int k = s; while (i <= k) { while (a[i] < h) { i++; } // preskocime prvky a[i] < h while (a[k] > h) { k--; } // preskocime prvky a[k] > h if (i <= k) … text/html 2018-04-24T16:21:00+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=quicksort_st&rev=1524586860&do=diff #include "stdafx.h" #include <iostream> #include <string> #include <ctime> using namespace std; //const int n = 7; //int a[n] = { 20, 7, 15, 1, 3, 10, 12 }; const int n = 1000000; int a[n]; void swap (int i, int k) { int c; c = a[i]; a[i] = a[k]; a[k] = c; } void quickSort (int r, int s) { int i=r; int k=s; int h=a[(i+k)/2]; while (i <= k) { while (h > a[i]) i++; while (h < a[k]) k--; if (i <= k) { swap (i, k); … text/html 2019-04-09T08:21:12+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=quicksort_ut_2019&rev=1554798072&do=diff #include "pch.h" #include <iostream> #include <stdlib.h> /* srand, rand */ #include <time.h> /* time */ using namespace std; const int N = 10; int a[N]; inline void swap (int & a, int & b) { int t = a; a = b; b = t; } void quicksort (int r, int s) { int h = a[(r + s) / 2]; // r <= (r+s)/2 <= s int i = r; int k = s; while(i <= k) { while (a[i] < h) i++; while (a[k] > h) k--; if (i <= k) { swap(a[i], a[k]); … text/html 2018-04-24T16:19:37+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=quicksort_ut&rev=1524586777&do=diff #include "stdafx.h" #include <iostream> #include <string> #include <ctime> using namespace std; //const int n = 7; //int a[n] = { 20, 7, 15, 1, 3, 10, 12 }; const int n = 1000000; int a[n]; void swap (int i, int k) { int c; c = a[i]; a[i] = a[k]; a[k] = c; } void quickSort (int r, int s) { int i=r; int k=s; int h=a[(i+k)/2]; while (i <= k) { while (h > a[i]) i++; while (h < a[k]) k--; if (i <= k) { swap (i, k); … text/html 2017-04-25T09:05:57+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=quicksort_utery&rev=1493111157&do=diff // quicksort.cpp #include "stdafx.h" #include <iostream> #include <string> #include <cassert> #include <cstdlib> // srand () #include <ctime> // time () using namespace std; const int N = 1000000; int a[N]; void swap (int &x, int &y) { int z = x; x = y; y = z; } void change (int i, int j) { int z = a[i]; a[i] = a[j]; a[j] = z; } void quick (int r, int s) { int h = a[(r+s)/2]; int i = r; int j = s; // cout << "quick (" << r << "," << s << ", h=" << h<< "): "; // for (int k = … text/html 2014-04-24T12:24:42+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=quicksort&rev=1398342282&do=diff program quicksort; const n=31; var a: array [1..n] of integer; procedure aswap (i, j: integer); var t : integer; begin t := a[i]; a[i] := a[j]; a[j] := t; end; procedure swap (var a, b: integer); var t : integer; begin t := a; a := b; b := t; end; procedure quick (r, s: integer); var i, k, x: integer; begin i := r; k := s; x := a[(i+k) div 2]; repeat while a[i] < x do i:= i+1; while a[k] > x do k:=k-1; if i<=k then beg… text/html 2014-04-24T13:09:46+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=quicksortwin&rev=1398344986&do=diff Vlozte za implementation {$R *.lfm} Var g: TTreeView; Pozmnente proceduru quick procedure quick (r, s: integer; t: TTreeNode); ... t := g.Items.AddChild (t, IntToStr (r) + '..' + IntToStr (s)); ... if r<k then quick(r,k, t); if i<s then quick(i,s, t); text/html 2014-12-03T10:08:26+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=readfiles&rev=1417601306&do=diff private void readData (string path) { dataGridView1.Rows.Clear (); StreamReader r = new StreamReader(path); string s = r.ReadLine (); while (s != null) { string [] items = s.Split (','); while (dataGridView1.ColumnCount < items.Length) dataGridView1.Columns.Add ("", ""); dataGridView1.Rows.Add(items); s = r.ReadLine(); } } text/html 2014-11-06T18:01:33+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=reflection&rev=1415296893&do=diff private String call (Object obj, String m, String param) { String result; Class cls = obj.getClass (); try { Method met = cls.getMethod (m, String.class); Object answer = met.invoke (obj, param); result = "" + answer; } catch (Exception ex) { result = "exception: " + ex; } return result; } private void jButton3ActionPerformed(java.awt.event.ActionEvent evt) { … text/html 2018-11-01T16:11:22+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=sachovnice&rev=1541088682&do=diff #include <iostream> using namespace std; struct Bod { string name; int x; int y; int z; }; enum Figurka { nic, pesec, strelec, jezdec, vez, dama, kral }; enum Barva { bila, cerna }; struct Policko { Figurka f; Barva b; }; const int N = 8; Policko sach [N][N]; void um (int r, int s, Figurka ff, Barva bb) { sach[r][s].f = ff; sach[r][s].b = bb; } void umisti (int r, Barva b) { um (r, 0, vez, b); um (r, 1, jezdec, b); um (r, 2, strelec, b); um … text/html 2020-04-02T11:46:14+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=scanner&rev=1585827974&do=diff Mozna zkus CanoScan Toolbox v. 5.0.1.2a (Windows 8.1/8.1 x64/8/8 x64/7/7 x64/Vista/Vista64/XP/XP x64/2000/Me/98) podle jedne diskuze by mohl fungovat i ve Win 10 <https://www.canon-europe.com/support/consumer_products/products/scanners/canoscan_series/canoscan_4400f.html?type=download&softwaredetailid=tcm:13-986284&os=all&language=en> je tam download tlacitko vedouci na: <https://www.canon-europe.com/support/consumer_products/products/scanners/canoscan_series/canoscan_4400f.html?type=downloa… text/html 2015-03-25T14:02:14+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=script&rev=1427292134&do=diff su - yum install qt5-qtscript-devel do .pro pridat QT += core gui script scripttools do okna pridat QPlainText input QTextEdit output a tlacitko Run #include <QScriptEngine> #include <QScriptEngineDebugger> void MainWindow::on_actionRun_triggered() { QScriptEngine e; QScriptEngineDebugger debugger; debugger.attachTo (&e); QMainWindow *debugWindow = debugger.standardWindow (); debugWindow->resize (1024, 640); QScriptValue infoObject = e.newQObject (ui->output… text/html 2015-03-30T15:14:52+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=script2&rev=1427728492&do=diff #ifndef BLOCK_H #define BLOCK_H #include <QObject> #include <QGraphicsRectItem> class Block : public QObject { Q_OBJECT public: explicit Block(QObject *parent = 0); signals: public slots: void go (int x, int y) { r->moveBy (x, y); } public: QGraphicsRectItem * r; }; #endif // BLOCK_H text/html 2014-03-17T12:13:51+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=select&rev=1395058431&do=diff bool IsIdent (char * s) { return sy == IDENT && strcmp (IdentVal, s) == 0; } void CheckIdent (char * s) { if (IsIdent (s)) NextSymbol (); else { STR_TYP msg; strcpy (msg, s); stradd (msg, sizeof (msg), " expected"); Error (msg); } } void field () { if (sy == IDENT) { PutStr ("field "); PutStr (IdentVal); PutEol (); NextSymbol (); } else Error ("Field identifier expected"); } … text/html 2013-04-09T09:10:41+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=semafor&rev=1365498641&do=diff #include "windows.h" HANDLE s; int f (void * p) { int n = (int) p; while (true) { WaitForSingleObject (s, INFINITE); printf ("Kriticka sekce %d \n", n); ReleaseSemaphore (s, 1, NULL); } } int _tmain(int argc, _TCHAR* argv[]) { s = CreateSemaphore (NULL, // security attr 1, // init 1, // max NULL // name ); for (int i = 1; i <= 3; i++) CreateThread (NULL, 0, (LPTHREAD_START_ROUTINE)f, (void*)i, … text/html 2019-02-27T15:58:51+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=seznam_2019_st&rev=1551283131&do=diff #include "pch.h" #include <iostream> #include <string> #include <cassert> using namespace std; class Item; class List { public: Item * first; Item * last; List () : first (nullptr), last (nullptr) { } ~ List (); void insertFirst(Item * p); void insertLast (Item * p); void print(); Item * search (string s); private: void link (Item * a, Item * b, Item * c); // b .. novy prvek friend class Item; }; class Item { public: string name; List * owner; … text/html 2019-03-05T10:10:43+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=seznam_2019_ut&rev=1551780643&do=diff #include "pch.h" #include <iostream> #include <cassert> #include <string> using namespace std; class Item; class List { public: Item* first; Item* last; List() : first(nullptr), last(nullptr) {} ~ List (); void insertFirst(Item *p); void insertLast(Item *p); void add(string s); void print(); Item* search(string s); private: void link(Item* a, Item* b, Item* c); friend class Item; }; class Item { public: string name; Item* prev; Item* next; List* own… text/html 2015-03-05T15:32:28+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=seznam_c&rev=1425569548&do=diff <http://kmlinux/~culik/wiki> #include "stdafx.h" #include <iostream> using namespace std; struct item { string name; string number; item * prev; item * next; }; struct queue { item * first; item * last; }; queue list; void init () { list.first = nullptr; list.last = nullptr; } void add (string id, string num) { item * t = new item; t->name = id; t->number = num; t->prev = list.last; t->next = nullptr; if (list.first == nullptr) list.first = t; else list.l… text/html 2017-02-23T14:14:02+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=seznam_ctvrtek&rev=1487859242&do=diff #include "stdafx.h" #include <iostream> #include <string> using namespace std; struct item { string key; string val; item *next; }; item *first; item *last; item* find(string k){ item* p = first; while(p != NULL && p->key!=k) { p = p->next; } return p; } void list(){ item* p = first; cout << "Reading list." << endl; while(p != NULL) { cout << p->key << " , " << p->val << endl; p = p->next; } } void insertFirst(string k, string v){ item* p = new item; p->key = k; p->… text/html 2018-11-06T09:51:18+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=seznam_pole&rev=1541497878&do=diff #include <iostream> #include <fstream> using namespace std; const int MAX = 100; struct Item { string name; string addr; }; struct List { int cnt; Item data [MAX]; }; void clear (List & a) { a.cnt = 0; for (int i = 0; i< MAX; i++) { a.data [i].name = ""; a.data [i].addr = ""; } } void insert (List & a, string name0, string addr0) { int i = a.cnt; if (i < MAX) { a.cnt++; a.data [i].name = name0; a.data [i].addr = addr0; } } void ti… text/html 2017-02-28T10:10:50+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=seznam_utery&rev=1488276650&do=diff #include "stdafx.h" #include <iostream> #include <string> using namespace std; struct krabicka { string klic; string hodnota; krabicka* dalsi; }; krabicka* prvni = nullptr; krabicka* posledni = nullptr; void vypis () { cout<< "Seznam:"<<endl; krabicka* p = prvni; while(p!=0) { cout << p->klic << " ... "<< p->hodnota<<endl; p = p -> dalsi; }; }; krabicka * hledej (string k) { krabicka* a = prvni; while(a!=0) { if(a->klic == k) return a; a = a -> dalsi; } return 0… text/html 2013-12-10T16:02:44+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=seznam&rev=1386691364&do=diff program seznam; uses list; var queue : DList; p : ^ block; begin Init (queue); InsertLast (queue, 'abc'); InsertLast (queue, 'def'); InsertLast (queue, 'klm'); InsertAfter (queue, queue.first, 'something'); InsertAfter (queue, queue.last, 'last'); InsertBefore (queue, queue.first, 'first'); InsertBefore (queue, queue.last, 'before last'); Remove (queue, queue.first); Remove (queue, queue.last^.prev); Remove (queue, queue.last); … text/html 2017-11-14T11:30:59+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=seznam2017&rev=1510659059&do=diff #include "stdafx.h" #include <string> #include <iostream> using namespace std; struct Color { string name; int r; int g; int b; Color * next; Color () : name (""), r(0), g (0), b (0), next (nullptr) {} Color(string name0, int r0, int g0, int b0) : name (name0), r(r0), g(g0), b(b0), next(nullptr) { } }; Color * first = nullptr; int main() { Color * p = new Color ("Modra", 0, 0, 255); // p->next = first; /* 1 */ // first = p; /* 2 */ p->next = nullptr; if (fir… text/html 2017-11-14T11:37:43+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=seznam2017b&rev=1510659463&do=diff #include "stdafx.h" #include <string> #include <iostream> using namespace std; struct Color { string name; int r; int g; int b; Color * next; Color () : name (""), r(0), g (0), b (0), next (nullptr) {} Color(string name0, int r0, int g0, int b0) : name (name0), r(r0), g(g0), b(b0), next(nullptr) { } }; Color * first = nullptr; void insertFirst (string name0, int r0, int g0, int b0) { Color * p = new Color (name0, r0, g0, b0); p->next = first; first = p; } voi… text/html 2017-11-21T12:12:34+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=seznam2017c&rev=1511266354&do=diff // LinkedList.cpp : Defines the entry point for the console application. // #include "stdafx.h" #include <iostream> #include <string> using namespace std; class Data { public: string name; int r, g, b; Data*next; Data() :name(""), r(0), g(0), b(0), next(nullptr) {} Data(string name0, int r0, int g0, int b0) : name(name0), r(r0), g(g0), b(b0), next(nullptr) {} }; Data*first = nullptr; Data*last = nullptr; void insertFirst(string name0, int r0, int g0, int b0) { … text/html 2017-12-05T12:20:09+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=seznam2017d&rev=1512476409&do=diff list.h #pragma once #include <string> using namespace std; class Data; class List { public: Data * first; Data * last; public: Data * getFirst() { return first; } Data * getLast() { return last; } private: void printItem (Data * data); public: List(); ~List(); void insertFirst(Data * data); void insertLast(Data * data); void insertAfter(Data * old, Data * data); void insertBefore(Data * old, Data * data); void remove (Data * data); void p… text/html 2017-12-12T12:19:42+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=seznam2017e&rev=1513081182&do=diff void List::insert (Data * data) { Data * t = first; while (t != nullptr && t->name <= data->name) t = t->next; if (t != nullptr) insertBefore (t, data); else insertLast (data); } text/html 2018-02-21T15:56:29+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=seznam2018_st_a&rev=1519228589&do=diff #include "stdafx.h" #include <stdlib.h> #include <iostream> #include <string> #include <cassert> using namespace std; struct Prvek { string name; int r, g, b; Prvek* prev; Prvek* next; }; Prvek* first = nullptr; Prvek* last = nullptr; void InsertLast (Prvek* p) { if (first == nullptr) { first = p; last = p; p->prev = nullptr; p->next = nullptr; } else { last->next = p; p->prev = last; last = p; … text/html 2018-02-21T16:10:47+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=seznam2018_st_b&rev=1519229447&do=diff #include "stdafx.h" #include <stdlib.h> #include <iostream> #include <string> #include <cassert> using namespace std; class Prvek { public: string name; int r, g, b; Prvek* prev; Prvek* next; Prvek (string name0, int r0, int g0, int b0); ~ Prvek (); }; Prvek::Prvek (string name0, int r0, int g0, int b0) : name (name0) , r (r0), g (g0), b (b0), prev (nullptr), next (nullptr) { } Prvek::~Prvek () { } class List { public: Prvek* first; Prvek* last; Lis… text/html 2018-02-28T16:04:56+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=seznam2018_st_c&rev=1519833896&do=diff #include "stdafx.h" #include <stdlib.h> #include <iostream> #include <string> #include <cassert> using namespace std; // class List; class Prvek { public: string name; int r, g, b; Prvek* prev; Prvek* next; // List * owner; Prvek (); Prvek (string name0, int r0, int g0, int b0); ~ Prvek (); }; Prvek::Prvek () : name (""), r (0), g (0), b (0), prev (nullptr), next (nullptr) { } Prvek::Prvek (string name0, int r0, int g0, int b0) : name (name0) , r (… text/html 2018-02-20T09:45:00+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=seznam2018a&rev=1519119900&do=diff #include "stdafx.h" #include <stdlib.h> #include <iostream> #include <cassert> #include <string> using namespace std; struct T { string data; int r, g, b; T* prev; T* next; }; T* first; T* last; T*create (string jmeno, int r0, int g0, int b0) { T*result = new T; result->data = jmeno; result->r = r0; result->g = g0; result->b = b0; result->prev = nullptr; result->next = nullptr; return result; } void place (T* prvek) { if (first == nullpt… text/html 2018-02-20T10:09:22+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=seznam2018b&rev=1519121362&do=diff #include "stdafx.h" #include <stdlib.h> #include <iostream> #include <cassert> #include <string> using namespace std; class T { public: string data; int r, g, b; T* prev; T* next; T (); T (string jmeno, int r0, int g0, int b0); ~T () { } }; T::T () : data (""), r (0), g (0), b (0), prev (nullptr), next (nullptr) { } T::T (string jmeno, int r0, int g0, int b0) : data (jmeno), r (r0), g (g0), b (b0), prev (nullptr), next (nullptr) { } class List { public: … text/html 2018-02-27T09:57:24+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=seznam2018c&rev=1519725444&do=diff #include "stdafx.h" #include <stdlib.h> #include <iostream> #include <cassert> #include <string> using namespace std; // class List; class T { public: string data; int r, g, b; T* prev; T* next; // List * owner; T (); T (string jmeno, int r0, int g0, int b0); ~T () { } }; T::T () : data (""), r (0), g (0), b (0), prev (nullptr), next (nullptr) { } T::T (string jmeno, int r0, int g0, int b0) : data (jmeno), r (r0), g (g0), b (b0), prev (nullptr), next (n… text/html 2019-11-05T12:25:04+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=seznam2019&rev=1572956704&do=diff #include <iostream> using namespace std; struct Item { string name; Item* next; }; void insertFirst(Item*& first, string name0) { Item* p=new Item; p->name = name0; p->next = nullptr; p->next = first; first = p; } void insertLast(Item*& first, string name0) { Item* p = new Item; p->name = name0; p->next = nullptr; if (first == nullptr) { first = p; } else { Item* t = first; while (t->next != nullptr) t = t->nex… text/html 2020-02-25T11:32:02+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=seznam2020&rev=1582630322&do=diff #include <iostream> using namespace std; class Item; class List { public: Item * first; List() : first (nullptr) { } void insert (int k0, string v0); void insertLast (int k0, string v0); void print(); }; class Item { public: int key; string value; Item * next; // Item(); Item(int key0, string value0); }; void List::insert (int k0, string v0) { Item * p = new Item (k0, v0); p->next = first; first = p; } void List::insertLast(int k0, strin… text/html 2019-04-02T12:57:18+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=shape_2019&rev=1554209838&do=diff window.h class MainWindow { /* ... */ public: static MainWindow * instance; void updateTree (); private: void updateBranch (QTreeWidgetItem *branch, QGraphicsItem *item); void addLine(QString name, QVariant value); void updateTable (QGraphicsItem * item); }; void refreshTree (); class TreeItem : public QTreeWidgetItem { public: QGraphicsItem * shape; }; text/html 2014-11-27T11:45:24+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=singleton&rev=1417088724&do=diff #include "params.h" Params::instance().name = ui->lineEdit->text ().toStdString(); Params::instance().setNumber (ui->spinBox->value()); Params & p = Params::instance(); p.getNumber (); Soubor params.h #ifndef PARAMS_H #define PARAMS_H #include <string> using namespace std; class Params { public: string name; private: int number; public: int getNumber () { return number; } void setNumber (int n) { number = n; } public: Params(); private: stat… text/html 2020-05-05T12:32:59+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=sos&rev=1588681979&do=diff Příklad "vektorové" grafiky v Qt Příklad naleznete v GIT repository <http://gitlab.fjfi.cvut.cz/culikzde/sos> v adresáři graphics04 Nebo .zip soubor <http://kmlinux.fjfi.cvut.cz/~culikzde/sos/graphics04a.zip> Stručný návod pro přístup k GIT git Minimalistický návod na instalaci prosředí Qt Creator ide_qtcreator Vytvoření grafické scény Vytvoření grafické scény Uložení do XML souboru text/html 2013-11-19T12:08:31+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=soubory&rev=1384862911&do=diff using System.Windows.Forms; namespace Soubory { public class MyTreeNode : TreeNode { public string path; public bool scanned; } } using System; using System.Collections.Generic; using System.ComponentModel; using System.Data; using System.Drawing; using System.Linq; using System.Text; using System.Threading.Tasks; using System.Windows.Forms; using System.IO; namespace Soubory { public partial class Form1 : Form { public Form1() { … text/html 2017-11-20T16:12:56+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=soubory2017&rev=1511194376&do=diff using System; using System.Collections.Generic; using System.Linq; using System.Text; using System.Threading.Tasks; using System.Windows.Forms; namespace Files { public class Node : TreeNode { public Data data; } } using System; using System.Collections.Generic; using System.Linq; using System.Text; using System.Threading.Tasks; using System.ComponentModel; namespace Files { public class Data { [ Category ("Basic") ] public string Name { get; s… text/html 2017-12-19T11:32:16+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=soustava&rev=1513683136&do=diff // soustava.cpp #include "stdafx.h" #include <iostream> #include <string> using namespace std; const int R = 3; const int S = 3; double a[R][S] = { { 3, 1, 0 }, { 1, 0, 2 }, { 1, 1, 1 } }; double b[R] = { 11, 5, 6 }; string jmena[S] = { "x", "y", "z" }; void print () { for (int i = 0; i < R; i++) { for (int j = 0; j < S; j++) { if (a[i][j] >= 0 && j > 0) cout << "+"; … text/html 2017-12-19T12:19:53+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=soustava2&rev=1513685993&do=diff // soustava.cpp #include "stdafx.h" #include <iostream> #include <string> using namespace std; const int R = 3; const int S = 3; double a[R][S] = { { 0, 1, 0 }, { 1, 0, 2 }, { 1, 1, 1 } }; double b[R] = { 1, 0, 0 }; string jmena[S] = { "x", "y", "z" /*, "a", "b", "c" */ }; void print () { for (int i = 0; i < R; i++) { for (int j = 0; j < S; j++) { if (a[i][j] >= 0 && j > 0) cou… text/html 2018-10-25T15:08:28+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=soustava2018&rev=1540480108&do=diff #include <iostream> #include <iomanip> // setw #include <cmath> // abs using namespace std; const int N = 3; double a [N][N] = { {1, 2, 3}, {1, 2, 1}, {3, 1, 2} }; double b [N] = {6, 3, 6}; string name [N] = { "x", "y", "z"}; void tisk () { int i,k; for (i=0; i<N; i++) { for (k=0; k<N; k++) { if (a[i][k] >= 0 ) { cout << "+"; } cout << a[i][k] << "*" << name[k] << " "; } … text/html 2019-10-22T10:55:34+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=soustava2019&rev=1571741734&do=diff input.txt 2 4 4 42 1 2 7 46 2 2 0 14 #include <iostream> #include <fstream> #include <iomanip> #include <string> using namespace std; const int M = 3; // pocet radku const int N = 4; // pocet sloupcu typedef double T; // typ T = double void clear(T p[M][N]) { for (int i = 0; i < M; i++) for (int j = 0; j < N; j++) p[i][j] = 0; } string name[] = { "x", "y", "z", "" }; string separator[] = { "", "", "", " = " }; bool znam[] = { false, true, true, false}; i… text/html 2015-03-11T13:29:32+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=spirala&rev=1426080572&do=diff #ifndef MAINWINDOW_H #define MAINWINDOW_H #include <QMainWindow> namespace Ui { class MainWindow; } class MainWindow : public QMainWindow { Q_OBJECT public: explicit MainWindow(QWidget *parent = 0); ~MainWindow(); void place (int r, int s, int i, int k); void setup (); private: Ui::MainWindow *ui; }; #endif // MAINWINDOW_H text/html 2018-11-15T14:54:29+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=spojovy_seznam_2&rev=1542293669&do=diff #include <iostream> using namespace std; struct Item; struct List { Item * first; Item * last; }; struct Item { string name; Item * next; }; void init (List & a) { a.first = nullptr; a.last = nullptr; } void insertFirst (List & a, string name0) { Item * p = new Item; p-> name = name0; p->next = a.first; a.first = p; if (a.last==nullptr) a.last = p; } void insertLast (List & a, string name0) { Item * p = new Item; p->name = name0; p->… text/html 2018-11-15T15:26:16+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=spojovy_seznam_3&rev=1542295576&do=diff #include <iostream> using namespace std; struct Item; struct List { Item * first; Item * last; List (); void insertFirst (string name0); void linkFirst (Item * p); }; struct Item { string name; Item * next; Item (); }; List::List () : first (nullptr), last (nullptr) { } Item::Item () : name (""), next (nullptr) { } void List :: insertFirst (string name0) { Item * p = new Item; p->name = name0; linkFirst (p); } void List :: linkFirst (Item * p) {… text/html 2018-11-20T10:14:07+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=spojovy_seznam_4&rev=1542708847&do=diff Soubor list.h #ifndef LIST_H #define LIST_H #include <string> using namespace std; class Item; class List { public: Item * first; Item * last; List (); // konstruktor ~ List (); // destruktor void insertFirst (string name0); void insertLast (string name0); void linkFirst (Item * p); void linkLast (Item * p); void linkBefore (Item * old, Item * p); // vloz p pred old void linkAfter (Item * old, Item * p); // vloz p za old void unlink (Item * p… text/html 2018-11-22T16:12:10+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=spojovy_seznam_5&rev=1542903130&do=diff #ifndef LIST_H #define LIST_H #include <string> using namespace std; class Item; class List { private: Item * first; Item * last; public: Item * getFirst () { return first; } Item * getLast () { return last; } public: List (); // konstruktor ~ List (); // destruktor void insertFirst (string name0); void insertLast (string name0); void linkFirst (Item * p); void linkLast (Item * p); void linkBefore (Item * old, Item * p); // vloz p pred old … text/html 2018-12-04T10:22:31+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=spojovy_seznam&rev=1543918951&do=diff #include <iostream> using namespace std; struct Item { string name; string desc; Item * next; }; Item * first = nullptr; // nullptr ... prazdny seznam void tisk () { cout << "[" << endl; Item * p = first; if (p == nullptr) cout << "Prazny seznam" << endl; while (p != nullptr) { cout << p->name << ": " << p->desc << endl; p = p->next; } cout << "]" << endl << endl; } int main() { tisk (); first = new Item; first->name… text/html 2015-03-23T16:09:17+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=sqlite&rev=1427126957&do=diff do .pro pridat qt += sql #include "mainwindow.h" #include "ui_mainwindow.h" #include <QSqlDatabase> #include <QSqlQuery> #include <QSqlTableModel> #include <QSqlRecord> MainWindow::MainWindow(QWidget *parent) : QMainWindow(parent), ui(new Ui::MainWindow) { ui->setupUi(this); QSqlDatabase db = QSqlDatabase::addDatabase ("QSQLITE"); // db.setDatabaseName (":memory:"); db.setDatabaseName ("test.sqlite"); bool ok = db.open (); if (ok) { setWindowTitle… text/html 2019-12-09T20:11:03+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=sqlite2019&rev=1575922263&do=diff Sharp Develop <http://en.wikipedia.org/wiki/SharpDevelop> <http://github.com/icsharpcode> <http://sourceforge.net/projects/sharpdevelop/> DB Browser for SQLite <http://sqlitebrowser.org> <https://download.sqlitebrowser.org/DB.Browser.for.SQLite-3.11.2-win32.zip> SQLite Sharp Develop --> Menu Project --> Manage Packages nainstalovat balicky System.Data.SQLite.Core.MSIL System.Data.SQLite.Core.MSIL zkopirovat packages/SQLite.Interop.1.0.0/lib/SQLite.Interop.dll do adresare k .EXE sou… text/html 2025-10-29T19:44:19+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=start&rev=1761767059&do=diff <http://kmlinux.fjfi.cvut.cz/~culikzde/wiki> Zaklady programovani - cviceni Softwarovy seminar - Qt Softwarovy seminar - Python Softwarovy seminar - Java Programovani pro Windows Uvod do objektoveho programovani Programovani periferii Letní semestr Zaklady algoritmizace cviceni Softwarovy seminar - Qt Zaklady operacnich systemu Jednoduche prekladace old vhdl com text/html 2018-03-14T15:39:09+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=strom_2018_st&rev=1521041949&do=diff #include "stdafx.h" #include <iostream> #include <string> using namespace std; struct Item { string key; Item* left; Item* right; Item (); }; Item::Item () : key (""), left (nullptr), right (nullptr) {} Item* root = nullptr; Item * search (Item * p, string name) { // while (p != nullptr && p->key != name) while (! (p == nullptr || p->key == name) ) { if (name < p->key) p = p->left; else p = p->right; } return p; } I… text/html 2018-03-13T09:48:58+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=strom_2018_ut&rev=1520934538&do=diff #include "stdafx.h" #include <iostream> #include <string> using namespace std; struct Item { string key; Item*left; Item*right; Item (); }; Item*root = nullptr; Item::Item () :key (""), left (nullptr), right (nullptr){} Item*search (Item* p, string name) { while (p!= nullptr && p->key != name) { if (name < p->key) p = p->left; else /* if (p->key < name) */ p = p->right; } /* p == nullptr || p->key == name */ return p; } Ite… text/html 2019-03-13T16:14:44+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=strom_2019_st&rev=1552493684&do=diff #include "pch.h" #include <iostream> #include <string> using namespace std; struct Item { int key; Item * left; Item * right; Item() : key(0), left(nullptr), right(nullptr) {} }; Item* search (Item* p, int k) { while (p != nullptr && p->key != k) { if (p->key < k) p = p->right; else /* if (p->key > k) */ p = p->left; } return p; } Item* find(Item* p, int k) { if (p == nullptr || p->key == k) return p; … text/html 2019-03-12T10:13:08+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=strom_2019_ut&rev=1552385588&do=diff #include "pch.h" #include <iostream> using namespace std; struct Item { int key; Item * left; Item * right; Item () : key (0), left (nullptr), right (nullptr) { } }; Item * root = nullptr; Item * search(Item* p, int k) { while (p != nullptr && p->key != k) { if (k < p->key) p = p->left; else p = p->right; } return p; } Item* find(Item* p, int k) { if (p == NULL || p->key == k) { r… text/html 2020-03-23T21:07:14+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=strom_add&rev=1584997634&do=diff Hledání prvku ve stromu zdrojový text Funkce search je vlastne cyklus jdouci od korene dolu k listum. Pokud najde hledany klic, vrati ukazatel na cely uzel stromu. Pokud nenajde, vraci nullptr. Parametrem je ukazatel na koren stomu a hodnota hledaneho klice. text/html 2015-03-26T15:34:37+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=strom_c&rev=1427384077&do=diff #include "stdafx.h" #include <string> #include <iostream> using namespace std; struct item { int key; item * left; item * right; }; item * root; void init () { root = nullptr; } void insert (item * & target, int k ) { if (target == nullptr) { target = new item; target->key = k; target->left = nullptr; target->right = nullptr; } else if (target->key == k) cout << k <<" uz je ve stromu" << endl; else if (k < target->key) insert (tar… text/html 2017-03-16T13:24:08+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=strom_ctvrtek&rev=1489670648&do=diff // tree.cpp : Defines the entry point for the console application. #include "stdafx.h" #include <iostream> #include <string> using namespace std; struct item { int key; item* left; item* right; }; item* root=0; item* search(int k){ item* p=root; while (p!=NULL) { if (k < p->key) p = p->left; else if(k > p->key) p = p->right; else return p; } return p; } item* search2(int k){ item* p=root; while (p!=NULL && p… text/html 2020-03-23T21:16:21+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=strom_del&rev=1584998181&do=diff Odpojení jednoho prvku ze stromu zdrojový text Skripta, příklad 2.4, odstavec: Zrušení vrcholu Item * remove (Item * & p, int k) Funkce remove ma ve stromu s korenem p najit a odpjit prvek s klicem k. Funkce remove vraci ukazatel na odpojeny prvek. text/html 2017-03-09T14:15:28+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=strom_qt_ctvrtek&rev=1489068928&do=diff mainwindow.h #ifndef MAINWINDOW_H #define MAINWINDOW_H #include <QMainWindow> #include <QTreeWidgetItem> namespace Ui { class MainWindow; } struct item; class MainWindow : public QMainWindow { Q_OBJECT public: explicit MainWindow(QWidget *parent = 0); ~MainWindow(); void print (QTreeWidgetItem * branch, item * p); private slots: void on_actionRun_triggered(); private: Ui::MainWindow *ui; }; #endif // MAINWINDOW_H text/html 2017-03-14T09:51:26+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=strom_utery&rev=1489485086&do=diff #include "stdafx.h" #include <iostream> #include <string> using namespace std; struct item { int key; item* left; item* right; }; item* root = nullptr; item* hledat(item* p, int k){ while (p != nullptr) { if(p -> key == k){ return p; } if (k < p->key) {p = p->left;} else {p = p->right;} } return p; } item* hledat2 (item* p, int k) { while (p != nullptr && p->key != k) { if (k < p->key) p = p->left; else p = p->right; } … text/html 2011-11-24T15:58:25+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=strom&rev=1322150305&do=diff DefaultMutableTreeNode root = new DefaultMutableTreeNode ("abc"); DefaultMutableTreeNode node = new DefaultMutableTreeNode ("klm"); root.add (node); treeModel = new DefaultTreeModel (root); jTree1.setModel(treeModel); if (root != null && treeModel != null) { DefaultMutableTreeNode node = new DefaultMutableTreeNode ("rst"); treeModel.insertNodeInto (node, root, 0); } text/html 2018-12-18T10:04:48+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=strom2&rev=1545127488&do=diff <http://kmlinux.fjfi.cvut.cz/~culik/zpro/tree> #ifndef TREE_H #define TREE_H #include <string> using std::string; class Node { private: Node*up; Node*next; Node*prev; Node*first; Node*last; void link (Node*a,Node*b, Node*c); //b novy prvek public: string name; Node*getUp(){return up;} Node*getNext(){return next;} Node*getPrev(){return prev;} Node*getFirst(){return first;} Node*getLast(){return last;} void linkNext (Node*p); void li… text/html 2019-10-11T11:06:16+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=strom2019&rev=1570791976&do=diff package example; import javax.swing.*; import javax.swing.tree.*; import java.io.*; public class Window extends javax.swing.JFrame { private DefaultTreeModel model ; private DefaultMutableTreeNode root; private void showDir (DefaultMutableTreeNode target , File dir) { File [] a = dir.listFiles(); for (File t : a) { DefaultMutableTreeNode item = new DefaultMutableTreeNode (t.getName()); if (t.isDirectory()) … text/html 2020-03-05T14:17:24+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=strom2020ct&rev=1583417844&do=diff #include <iostream> using namespace std; class Node { public: int key; Node * left; Node * right; Node () : key (0), left (nullptr), right (nullptr) { } }; Node* find (Node* start, int value) // ve stromu s korenem start hledame klic value // vysledkem je ukazatel na nalezeny uzel nebo null { while (start != nullptr && start->key != value) { if (value < start->key) start = start-> left; else start = start->right; } return … text/html 2020-03-03T11:56:41+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=strom2020ut&rev=1583236601&do=diff #include <iostream> using namespace std; class Node { public: int key; Node * left; Node * right; Node () : key (0), left (nullptr), right (nullptr) { } }; Node* find (Node* start, int value) // vysledek : ukazatel na nalezeny prvek nebo nullptr { while (start != nullptr && start->key != value) { if (value < start->key) start = start->left; else if (value > start->key) start = start->right; } return start; } Node* sear… text/html 2014-03-13T14:12:34+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=stromecek&rev=1394719954&do=diff program strom; type uk=^tree; tree = record data:integer; left:^tree; right:^tree; end; var root:^tree; procedure insert0(x:integer); var p:uk; begin new(p); p^.data:=x; p^.left:=nil; p^.right:=nil; root:=p; end; procedure insert (x:integer); var p,z:uk; begin p:=root; z:=nil; while (p<>nil) and (p^.data<>x) do begin z:=p; if p^.data > x then p:=p^.left else p:=p^.right; end; if p=nil then begin new (p);… text/html 2019-10-29T12:13:12+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=struct2019&rev=1572351192&do=diff enum Answer { yes, no, maybe }; enum Figurka { jezdec, strelec, dama, kral }; #include <iostream> using namespace std; struct Nevim { string otazka; string odpoved; bool jistota; }; const int limit = 100; int pocet = 0; Nevim tabulka[limit]; void print() { for (int i = 0; i < pocet; i++) { cout << i << ".) "; cout << tabulka[i].otazka << " --> "; cout << tabulka[i].odpoved << " : "; if (tabulka[i].jistota) … text/html 2018-10-25T14:10:04+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=swap&rev=1540476604&do=diff #include <iostream> using namespace std; void swap (int & a, int & b) { // cout << "na vstupu a=" << a << ", b=" << b << endl; int t = a; a = b; b = t; // cout << "na vystupu a=" << a << ", b=" << b << endl; } const int N = 10; int a[N] = { 10, 40, 20, 70, 30, 80, 40 }; int main() { bool change = true; while (change) { change = false; for (int i = 1; i < N; i++) { if (a[i-1] > a[i]) { s… text/html 2019-04-04T14:08:35+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=thread_2019&rev=1554386915&do=diff #include "pch.h" #undef UNICODE #include <windows.h> #include <iostream> using namespace std; class Thread { public: HANDLE handle; virtual void run () { } void start(); }; class MyThread : public Thread { public: void run() { while (true) cout << "Hello from thread" << endl; } }; DWORD WINAPI f (void * p) { Thread * t = (Thread *) p; t->run (); return 0; } void Thread::start() { HANDLE handle = CreateThread (NULL, // lpThreadAttributes, 0, // dwStackSize, f, //… text/html 2014-11-27T17:06:53+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=thread&rev=1417108013&do=diff MyScene.java private void click () { if (! stopped) t.suspend (); else t.resume(); stopped = ! stopped; } MyThread t; boolean stopped; public void run() { MyThread t = new MyThread (this); t.start (); this.bunny2.addMouseButtonListener(new MouseButtonListener() { public void mouseButtonClicked(final MouseButtonEvent e) { MyScene.this.bunny2.say("h… text/html 2025-06-25T21:04:10+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=tiskarna&rev=1750885450&do=diff Soubor 1) nainstalovat CUPS napr. dnf install cups 2) zastavit cups systemctl stop cups 3) nakopirovat .ppd do adresare /etc/cups/ppd 4) radeji zazalohovat /etc/cups/printers.conf 5) nakopirovat printers.conf do /etc/cups 6) mozna nastavit prava a vlastnika text/html 2018-11-23T12:11:23+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=tokens&rev=1542975083&do=diff package forge; import java.io.*; import java.nio.file.*; import java.util.*; public class Window extends javax.swing.JFrame { private String data; private int pos; private int len; private char ch; private String token; private void open (String s) { data = s; pos = 0; len = data.length (); nextChar (); nextToken (); } public final char eos = 0; private void nextChar () { i… text/html 2013-11-21T14:02:17+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=tree&rev=1385042537&do=diff <http://kmlinux/~culik/wiki> namespace tree { public class MyNode : TreeNode { public string path; public bool scanned = false; } } private void showDrives (TreeNodeCollection above) { DriveInfo [] info = DriveInfo.GetDrives (); foreach (DriveInfo d in info) { MyNode node = new MyNode(); node.path = d.ToString(); node.Text = d.Name; node.ToolTipText = d.To… text/html 2014-11-24T13:48:45+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=tree2&rev=1416836925&do=diff // using System.Windows.Forms; class MyNode : TreeNode { public string path; public bool ready = false; } using System; using System.Collections.Generic; using System.ComponentModel; using System.Data; using System.Drawing; using System.IO; using System.Linq; using System.Text; using System.Threading.Tasks; using System.Windows.Forms; namespace Strom { private void showItems (MyNode branch, DirectoryInfo dir, … text/html 2014-11-10T15:56:08+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=tree3&rev=1415634968&do=diff // import javax.swing.tree.*; private DefaultTreeModel m; private DefaultMutableTreeNode act; private void open (String s) { if (m == null) { DefaultMutableTreeNode r; r = new DefaultMutableTreeNode (s); m = new DefaultTreeModel (r); jTree1.setModel (m); act = r; } else { DefaultMutableTreeNode node; node = new DefaultMutableTreeNode (s); in… text/html 2014-11-13T18:36:29+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=tree4&rev=1415903789&do=diff import javax.swing.tree.*; import org.alice.apis.moveandturn.*; DefaultTreeModel model; DefaultMutableTreeNode act; public void open (Object s) { DefaultMutableTreeNode node = new DefaultMutableTreeNode (s); if (model == null) { model = new DefaultTreeModel (node); jTree1.setModel (model); } else { int inx = act.getChildCount(); model.insertNodeInto (node, act, inx); } … text/html 2019-10-22T15:09:55+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=tree2019&rev=1571756995&do=diff #ifndef MAINWINDOW_H #define MAINWINDOW_H #include <QMainWindow> #include <QTreeWidget> namespace Ui { class MainWindow; } class MainWindow : public QMainWindow { Q_OBJECT public: explicit MainWindow(QWidget *parent = nullptr); ~MainWindow(); private: Ui::MainWindow *ui; void showDir (QTreeWidgetItem * target, QString path, int level); }; #endif // MAINWINDOW_H text/html 2016-11-22T10:08:30+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=treeview&rev=1479809310&do=diff private void directoryMenu_Click(object sender, EventArgs e) { tree.ShowNodeToolTips = true; showDir (tree.Nodes, "c:\\", 2); } private void showDir (TreeNodeCollection target, string path, int levels) { try { DirectoryInfo info = new DirectoryInfo (path); TreeNode branch = new TreeNode(); branch.Text = info.Name; branch.ToolTipText = path; … text/html 2016-12-06T10:06:59+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=treeview2&rev=1481018819&do=diff using System; using System.Collections.Generic; using System.Linq; using System.Text; using System.Collections; using System.Windows.Forms; namespace Directories { class ListViewItemComparer : IComparer { private int col; public ListViewItemComparer() { col = 0; } public ListViewItemComparer(int column) { col = column; } public int Compare(object x, object y) { ListViewItem a =… text/html 2016-10-21T08:37:38+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=tridy&rev=1477039058&do=diff #include "mainwindow.h" #include "ui_mainwindow.h" struct C { int x, y; void (*set) (C * t, int a, int b); void (*move) (C * t, int a, int b); // virtual void set (int a, int b) { x=a; y=b; } // virtual void move (int a, int b) { x=x+a; y=y+b; } // C (int aa, int bb) : a (aa) , b (bb) { } }; void C_set_impl (C * t, int a, int b) { t->x=a; t->y=b; } void C_move_impl (C * t, int a, int b) { t->x += a; t->y += b; } C * C_new (C * t = NULL) { C * v = t; if (v == NUL… text/html 2019-01-03T16:33:09+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=tridy2&rev=1546533189&do=diff #include <iostream> using namespace std; class Date { public: int day; int month; int year; string note; Date (); void print (); void next (); bool less (Date v); }; Date::Date () { day = 1; month = 1; year = 2000; note = ""; } bool Date::less (Date v) { if (year < v.year) return true; else if (this->year > v.year) return false; else if (month < v.month) return true; else if (month > v.month) re… text/html 2008-04-02T17:33:00+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=turbogears&rev=1207157580&do=diff Turbo Gears tg-admin quickstart jmeno projektu: foto Turbo Gears Toolbox SQLite sqlite3 devdata.sqlite CREATE TABLE fotografie ( id INTEGER PRIMARY KEY, nazev TEXT, soubor TEXT ); INSERT INTO "fotografie" VALUES(1,'Acko','aaa.txt'); Některé příkazy sqlite3 text/html 2008-04-17T10:16:36+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=turbogears1&rev=1208427396&do=diff První verze, adresář foto/foto <http://kmlinux.fjfi.cvut.cz/~culik/foto/tg-foto01.tgz> Soubor controllers.py from turbogears import controllers, expose, flash # from foto import model import logging log = logging.getLogger("foto.controllers") class Root(controllers.RootController): @expose(template="foto.templates.welcome") def index(self): import time # log.debug("Happy TurboGears Controller Responding For Duty") flash("Your application is now running")… text/html 2008-04-17T12:13:23+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=turbogears2&rev=1208434403&do=diff Druhá verze <http://kmlinux.fjfi.cvut.cz/~culik/foto/tg-foto02.tgz> Přenést obrázky z <http://kmlinux/~culik/foto> do adresáře static Data sqlite3 devdata.sqlite CREATE TABLE fotografie ( id INTEGER PRIMARY KEY, nazev TEXT, soubor TEXT ); INSERT INTO "fotografie" VALUES(1,'Kvetouci strom','0053.jpg'); INSERT INTO "fotografie" VALUES(2,'Hlemyzd','4635.jpg'); INSERT INTO "fotografie" VALUES(3,'Kobylka','1940.jpg'); INSERT INTO "fotografie" VALUES(4,'Safran a vcela','3515.jpg'… text/html 2008-04-17T10:17:59+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=turbogears3&rev=1208427479&do=diff Editace 1 <http://kmlinux.fjfi.cvut.cz/~culik/foto/tg-foto03.tgz> Soubor controlers.py from turbogears import controllers, expose, flash, redirect from foto import model from model import Fotografie from turbogears.toolbox.catwalk import CatWalk import logging log = logging.getLogger("foto.controllers") class Root(controllers.RootController): catwalk = CatWalk(model) @expose(template="foto.templates.uvod") def index(self): import time log.debug("*** Nek… text/html 2008-04-24T11:42:15+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=turbogears4&rev=1209037335&do=diff Editace 2 <http://kmlinux.fjfi.cvut.cz/~culik/foto/tg-foto04.tgz> Přenést obrázky z <http://kmlinux/~culik/foto> do adresáře static Soubor controlers.py from turbogears import controllers, expose, flash from turbogears import redirect from turbogears import validate, widgets, validators, error_handler from foto import model from model import Fotografie from turbogears.toolbox.catwalk import CatWalk import logging log = logging.getLogger("foto.controllers") class Policka(widgets.WidgetsL… text/html 2008-04-24T13:02:20+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=turbogears5&rev=1209042140&do=diff <http://kmlinux/~culik/foto/inst/> soubory setup.tgz, TGFastData-0.9a7-py2.5.egg su - tar xzf setup.tgz ./easy_install TGFastData-0.9a7-py2.5.egg from tgfastdata import DataController ... class Root(controllers.RootController): editor = DataController(Fotografie) ./easy_install TGWebServices ./easy_install TGWebServices-1.2.0-py2.5.egg text/html 2008-04-03T15:09:00+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=turbogearsdatabase&rev=1207235340&do=diff SQLite sqlite3 devdata.sqlite CREATE TABLE fotografie ( id INTEGER PRIMARY KEY, nazev TEXT, soubor TEXT ); INSERT INTO "fotografie" VALUES(1,'Acko','aaa.txt'); Některé příkazy sqlite3 .help .databases .tables .schema fotografie .dump fotografie .explain on select * from fotografie; .mode list .mode html .mode insert .headers on .explain on .quit text/html 2008-04-03T16:38:00+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=turbogearstoolbox&rev=1207240680&do=diff Turbo Gears Toobox tg-admin quickstart jmeno projektu: foto cd foto tg-admin toolbox tg-admin toolbox -c ::ffff:127.0.0.1 ModelDesigner Add New Class (Fotografie) Add Columns (dva textove sloupce, ktere se jmenuji nazev a soubor) text/html 2021-10-14T15:22:12+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=uiq&rev=1634224932&do=diff <https://github.com/up42/image-similarity-measures> <https://ece.uwaterloo.ca/~z70wang/publications/quality_2c.pdf> <https://en.wikipedia.org/wiki/Algorithms_for_calculating_variance> const int width = 200; const int height = 200; inline int sum (int v) { return (v >> 16) & 255 + (v >> 8) & 255 + v & 255; } double meanx, meany, varx, vary, varxy; void f (int * imgx, int * imgy) { int n = 0; long sumx = 0, sumxx = 0, sumy = 0, sumyy = 0, sumxy = 0; for (int i = 0; i < heig… text/html 2019-10-31T14:09:21+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=ukazatele2019&rev=1572530961&do=diff #include <iostream> using namespace std; struct Item { string name; int r, g, b; Item* next; }; void vypis(Item* p) { if (p == nullptr) { cout << "Seznam je prazdny"; } else { while (p != nullptr) { cout << p->name << endl; p = p->next; } } } void vytiskni(Item* p) { if (p != nullptr) { vytiskni (p->next); cout << p->name << endl; } } void hledej(Item* p, string text) { … text/html 2008-03-31T13:54:00+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=vbox&rev=1206971640&do=diff <http://kmlinux/~culik/wiki/> rpm -Uvh VirtualBox-1.5.6_28266_fedora8-1.i586.rpm /etc/init.d/vboxdrv setup groupadd vboxusers /etc/init.d/vboxdrv start text/html 2019-03-19T09:35:14+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=veze_2019_ut&rev=1552988114&do=diff #include "pch.h" #include <iostream> #include <cassert> using namespace std; const int N = 32; struct Vez { int v; // 0 <= v <= N int p[N]; // p[0] dole , ... , p[v-1] vrchol, // p[i] ... { 1, ..., N } }; void clear(Vez &A) { A.v = 0; for (int i = 0; i < N; i++) A.p[i] = 0; } void init(Vez &A) { A.v = N; for (int i = 0; i < N; i++) A.p[i] = (N - i); } void print(Vez &A) { for (int i = 0; i < N; i++) { if (i < A.v) … text/html 2015-03-05T16:09:36+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=veze_c&rev=1425571776&do=diff #include "stdafx.h" #include <string> #include <iostream> using namespace std; const int N = 5; struct Vez { int v; int p [N]; }; Vez A, B, C; void nuluj (Vez & X) { X.v=0; for(int i=0; i<N; i++) X.p[i]=0; } void init (Vez & X) { X.v=N; for(int i=0; i<N; i++) X.p[i]=N-i; } void zobraz (Vez & X) { for (int i = 0; i < X.v; i++) cout << X.p[i]; for (int i = X.v; i <= N; i++) cout << ' '; } void tiskni (Vez & X, Vez & Y, Vez & Z) { zobraz (X); cout << " : "; zobraz (Y… text/html 2017-03-23T13:18:14+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=veze_ctvrtek&rev=1490275094&do=diff // veze.cpp #include "stdafx.h" #include <iostream> #include <string> #include <cassert> using namespace std; const int N = 5; struct Vez { int k; int p[N]; }; Vez A, B, C; void init (Vez & X){ X.k=0; for (int i=0; i<N; i++) X.p[i]=0; } void setup (Vez& X){ X.k=N; for (int i=0; i<N; i++) X.p[i]=N-i; } void vypis(Vez &X){ for (int i=0; i<X.k; i++) cout<< X.p[i]<< " "; for (int i=X.k; i<N; i++) cout<<" "<< " "; } void prehod ( Vez & X, Vez & … text/html 2015-03-05T23:05:42+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=veze_qt&rev=1425596742&do=diff #define TOWER_H #include <QMainWindow> namespace Ui { class TowerWindow; } struct Vez; class TowerWindow : public QMainWindow { Q_OBJECT public: explicit TowerWindow(QWidget *parent = 0); ~TowerWindow(); void resizeEvent (QResizeEvent * event); private: void nakresliVez (int relx, const Vez & U); void nakresli (int k); private slots: void on_actionRun_triggered(); void on_horizontalScrollBar_valueChanged(int value); private: Ui::TowerWindow *ui; }; … text/html 2018-05-02T15:09:06+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=veze_st&rev=1525273746&do=diff #include "stdafx.h" #include <iostream> #include <string> #include <cassert> using namespace std; const int n = 9; // pocet disku struct Vez { int cnt; // vyska veze, pocet disku ve vezi int pole [n]; // pole [0] ... velikost spodniho disku // pole [cnt-1] ... velikost vrcholoveho disku }; Vez A, B, C; void empty (Vez& X) { X.cnt = 0; for (int i = 0; i < n; i++) X.pole[i] = 0; } void init (Vez& X) { X.cnt = n; for (int i = 0; i < n; i++) … text/html 2018-05-15T08:24:38+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=veze_ut&rev=1526372678&do=diff #include "stdafx.h" #include <iostream> #include <string> #include <cassert> using namespace std; const int N = 9; struct Vez { int k; int p[N]; }; Vez A, B, C; void inic(Vez &X) { for (int i = 0; i < N; i++) { X.p[i] = N - i; } X.k = N; } void clear (Vez &X) { for (int i = 0; i < N; i++) { X.p[i] = 0; } X.k = 0; } void put (Vez &X) { for (int i = 0; i < X.k; i++) cout << X.p[i] << " "; for (int i = X.k; i < N; i++) … text/html 2017-03-28T07:57:47+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=veze_utery&rev=1490687867&do=diff #include "stdafx.h" #include <iostream> #include <string> #include <cassert> using namespace std; const int N = 20; struct vez { int k; int p[N]; }; vez x,y,z; void vynuluj (vez &a) { a.k=0; for (int i=0;i<N; i++) a.p[i]=0; } void vypln (vez &a) { a.k=N; for (int i=0;i<N; i++) a.p[i]=N-i; } void vypis (vez &a) { for (int i=0; i<N; i++) if (i < a.k) { char c; … text/html 2014-04-29T12:51:57+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=veze&rev=1398775917&do=diff program towers; const n=4; type vez=record p:integer; d:array [1..n] of integer; end; var a,b,c:vez; procedure nuluj(var v:vez); var i:integer; begin v.p:=0; for i:=1 to n do v.d[i]:=0; end; procedure napln(var v:vez); var i:integer; begin for i:=1 to n do v.d[i]:=n-i+1; v.p:=n; end; procedure vypis(v:vez); var i:integer; begin for i:=1 to v.p do write(v.d[i],' '); write(' ':(2*n+2-2*v.p)); end; procedure vypisVse; begin … text/html 2015-03-16T16:04:00+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=vezicky&rev=1426521840&do=diff #ifndef MAINWINDOW_H #define MAINWINDOW_H #include <QMainWindow> #include <QGraphicsScene> namespace Ui { class MainWindow; } struct Vez; class MainWindow : public QMainWindow { Q_OBJECT public: explicit MainWindow(QWidget *parent = 0); ~MainWindow(); private slots: void on_horizontalScrollBar_valueChanged(int value); private: Ui::MainWindow *ui; QGraphicsScene * scene; void nakresli (int relx, Vez & X); }; #endif // MAINWINDOW_H text/html 2025-12-29T00:25:10+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=vhdl&rev=1766967910&do=diff VHDL <https://tapec.uv.es/pardo/hdlsim/> Verilator <https://itsembedded.com/dhd/verilator_1/> SDRAM <https://electronics.stackexchange.com/questions/631943/fpga-to-sdram-communication> and <https://github.com/nullobject/sdram-fpga/blob/master/sdram.vhd> DE-25 Standard <https://www.mouser.com/datasheet/2/598/DE25_Standard_User_manual_revC-3680989.pdf> DE-10 Standard <https://www.rocketboards.org/foswiki/pub/Documentation/DE10Standard/DE10-Standard_Getting_Started_Guide.pdf> <https://fpgac… text/html 2019-11-25T14:06:41+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=virtualbox&rev=1574690801&do=diff Instalace Virtual Boxu ve Fedore 30 <https://download.virtualbox.org/virtualbox/6.0.14/VirtualBox-6.0-6.0.14_133895_fedora29-1.x86_64.rpm> Prenout na administratora realneho pocitace su - dnf install SDL dnf install compat-libvpx5 dnf install kernel-headers dnf install kernel-devel dnf install genisoimage cd /local/uzivatel/Downloads rpm -Uvh VirtualBox<TAB> /sbin/vboxconfig # /usr/lib/virtualbox/vboxdrv.sh setup # insmod vboxdrv.ko lsmod | grep vbox text/html 2013-04-09T14:49:44+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=vlakno&rev=1365518984&do=diff <http://kmlinux/~culik/wiki> #include "windows.h" HANDLE s; bool stop = false; unsigned long __stdcall f (void * p) { int n = (int) p; while (! stop) { WaitForSingleObject (s, INFINITE); printf ("Kriticka sekce %d \n", n); ReleaseSemaphore (s, 1, NULL); } return 0; } int _tmain(int argc, _TCHAR* argv[]) { s = CreateSemaphore (NULL, // security attr 1, // init 1, // max NULL // name ); for (int i = 1; i < 3; i ++) CreateThread (N… text/html 2018-04-11T16:40:31+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=vzdalenosti&rev=1523464831&do=diff Novejsi varianta dle <http://cs.wikipedia.org/wiki/Dijkstr%C5%AFv_algoritmus> #include "stdafx.h" #include <iostream> #include <string> using namespace std; const int n = 3; // pocet vrcholu const int inf = 1000000; // nekonecna vzdalenost int dist[n][n]; // delka hran ... zadani int start = 0; // index vychoziho vrcholu bool S[n]; // mnozina navstivenych bodu int d[n]; // d[i] ... vzdalenost vychoziho vrcholu a vrcholu s indexem i int main() { for (int i = 0; i < n; i++) … text/html 2019-04-01T15:08:41+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=xml_2019&rev=1554131321&do=diff #ifndef MAINWINDOW_H #define MAINWINDOW_H #include <QMainWindow> #include <QTreeWidgetItem> namespace Ui { class MainWindow; } class MainWindow : public QMainWindow { Q_OBJECT public: explicit MainWindow(QWidget *parent = nullptr); ~MainWindow(); private slots: void on_action_Open_triggered(); void on_treeWidget_itemDoubleClicked(QTreeWidgetItem *item, int column); private: Ui::MainWindow *ui; }; #endif // MAINWINDOW_H text/html 2017-03-27T15:10:06+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=xml&rev=1490627406&do=diff #ifndef MAINWINDOW_H #define MAINWINDOW_H #include <QMainWindow> #include <QGraphicsScene> namespace Ui { class MainWindow; } class Param { public: QString name; QString value; }; class MainWindow : public QMainWindow { Q_OBJECT public: explicit MainWindow(QWidget *parent = 0); ~MainWindow(); void readFile(QString fileName); void createShape(QGraphicsItem *&target, QString name, QList<Param> list); private: Ui::MainWindow *ui; QGraphicsScene * scene; };… text/html 2019-11-12T14:57:59+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=xml2019&rev=1573570679&do=diff #include "mainwindow.h" #include "ui_mainwindow.h" MainWindow::MainWindow(QWidget *parent) : QMainWindow(parent), ui(new Ui::MainWindow) { ui->setupUi(this); } MainWindow::~MainWindow() { delete ui; } void MainWindow::put (QString s) { ui->textEdit->append(s); } void MainWindow::clear () { ui->textEdit_2->setText(""); } void MainWindow::info (QString s) { ui->textEdit_2->append(s); } #include <QMetaProperty> void MainWindow::on_pushButton_clicked() { QObjec… text/html 2020-03-30T13:38:19+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=zalg_dama_src&rev=1585575499&do=diff #include <iostream> using namespace std; const int N = 8; int p [N]; int cnt = 0; void place (int s) { for (int r = 0; r < N; r++) { bool ok = true; for (int v = 1; v <= s && ok; v++) { int d = p[s - v]; if (d == r || d == r-v || d == r+v) ok = false; } if (ok) { p[s] = r; if (s < N - 1) place(s + 1); else { cnt++; … text/html 2020-04-07T08:08:41+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=zalg_dama&rev=1586246921&do=diff Osm dam Metoda hledání s návratem, problém osmi dam (skripta 3.4) Zadání úlohy: <http://cs.wikipedia.org/wiki/Probl%C3%A9m_osmi_dam> Zdrojový text Pocet sloupcu const int N = 8; Jednorozmerne pole pro evidenci dam int p [N]; Prvek pole p [i] obsahuje informaci o dame v i-tem slopci: obsahuje cislo radky, kde se nachazi dama. text/html 2020-05-11T16:29:06+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=zalg&rev=1589214546&do=diff Příklady Příklady naleznete v GIT repository <http://gitlab.fjfi.cvut.cz/culikzde/zalg> <html> Nejjednodušší přístup k zdrojovým souborům na zmíněné webové stránce je tlačítko “Download”, schované vedle tlačítka “Clone”. (A nemusíte se zabývat následujícím odkazem popisujícím přistup k GIT.) </html> text/html 2020-03-26T15:33:30+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=zos_createprocess&rev=1585236810&do=diff Podíjte se, prosím Vás, na funkci CreateProcess <https://docs.microsoft.com/en-us/windows/win32/api/processthreadsapi/nf-processthreadsapi-createprocessa> Zkuste si maly program, ktery spousti notepad.exe s parametrem pokus.txt #include <iostream> #include <windows.h> using namespace std; int main (int argc, char * * argv) { cout << "Start" << endl; STARTUPINFO startup; memset (&startup, 0, sizeof (startup)); PROCESS_INFORMATION info; BOOL ok = CreateProcess ( NULL, // … text/html 2020-05-20T13:33:54+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=zos&rev=1589981634&do=diff Literatura Skripta Vysoké školy báňské <http://projekty.fs.vsb.cz/463/edubase/VY_01_043> soubor Operační systémy.pdf Andrew S. Tanenbaum: Operating Systems Design and Implementation William Stallings: Operating Systems: Internals and Design Principles Abraham Silberschatz, Peter B. Galvin, Greg Gagne: Operating System Concepts text/html 2026-04-12T17:16:03+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=%D0%B2%D0%B5%D0%B1_%D1%80%D0%B0%D1%81%D0%BA%D1%80%D1%83%D1%82%D0%BA%D0%B0_%D1%81%D0%B0%D0%B9%D1%82%D0%B0&rev=1776014163&do=diff веб раскрутка сайта Аудит сайта — это всестороннее анализ сайта с целью обнаружения проблем, ошибок и возможностей для улучшения. Задача веб-аудита состоит в увеличении продуктивности сайта, улучшении его видимости в поисковиках и привлечении больше целевых посетителей.… text/html 2026-04-11T07:41:46+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=%D0%BF%D0%BE%D0%B8%D1%81%D0%BA%D0%BE%D0%B2%D0%B0%D1%8F_%D1%80%D0%B0%D1%81%D0%BA%D1%80%D1%83%D1%82%D0%BA%D0%B0&rev=1775893306&do=diff поисковая раскрутка Индексация сайта — это добавление страниц сайта в БД поисковиков, чтобы они могли появляться в результатах поиска. Индексирование играет ключевую роль в поисковой оптимизации, так как только индексированные страницы имеют шанс ранжироваться по соответствующим запросам.… text/html 2026-03-04T13:43:24+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=%D0%BF%D0%BE%D0%B8%D1%81%D0%BA%D0%BE%D0%B2%D0%BE%D0%B5_%D0%BF%D1%80%D0%BE%D0%B4%D0%B2%D0%B8%D0%B6%D0%B5%D0%BD%D0%B8%D0%B5_%D0%BD%D0%B5%D0%B4%D0%BE%D1%80%D0%BE%D0%B3%D0%BE&rev=1772631804&do=diff поисковое продвижение недорого Веб-оптимизация имеет целью улучшение веб-сайта производительности, удобства использования а также видимости в поисковых системах. Качественная оптимизация увеличивает результативность сайта и способствует росту количества посетителей и конверсий. Давайте рассмотрим основные направления веб-оптимизации:… text/html 2026-04-12T11:10:23+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=%D0%BF%D1%80%D0%BE%D0%B4%D0%B2%D0%B8%D0%B6%D0%B5%D0%BD%D0%B8%D0%B5_%D0%B8_%D1%80%D0%B0%D1%81%D0%BA%D1%80%D1%83%D1%82%D0%BA%D0%B0_%D1%81%D0%B0%D0%B9%D1%82%D0%B0&rev=1775992223&do=diff продвижение и раскрутка сайта Продвижение сайта включает набор действий, направленных на увеличение заметности сайта в выдаче поисковых систем, привод целевой аудитории и повышение коэффициента конверсии. Для успешного раскрутки сайта нужно учитывать несколько важных моментов:… text/html 2026-03-01T09:08:38+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=%D0%BF%D1%80%D0%BE%D0%B4%D0%B2%D0%B8%D0%B6%D0%B5%D0%BD%D0%B8%D0%B5_%D1%81%D0%B0%D0%B9%D1%82%D0%B0&rev=1772356118&do=diff продвижение сайта Продвижение сайта — представляет собой комплекс мер, направленных на повышение популярности и посещаемости ресурса, улучшение его ранга в поисковых системах и увеличение прибыльности. Успешное продвижение требует планомерной работы и знания особенностей целевой аудитории. Ключевые шаги раскрутки сайта:… text/html 2026-02-19T14:55:00+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=%D0%BF%D1%80%D0%BE%D0%B4%D0%B2%D0%B8%D0%B6%D0%B5%D0%BD%D0%B8%D0%B5_%D1%81%D0%B0%D0%B9%D1%82%D0%BE%D0%B2_%D0%B0%D0%BD%D0%BA%D0%B5%D1%82%D0%BD%D0%B8%D0%BA%D0%BE%D0%B2&rev=1771512900&do=diff продвижение сайтов анкетников Продвижение сайта — это комплекс мер, которые направлены на повышение популярности и посещаемости ресурса, улучшение его ранга в поисковых системах и рост конверсии. Успешное продвижение нуждается в комплексного подхода и знания нюансов целевой аудитории. Ключевые шаги раскрутки сайта:… text/html 2026-04-12T01:54:37+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=%D1%80%D0%B0%D1%81%D0%BA%D1%80%D1%83%D1%82%D0%BA%D0%B0_%D1%81%D0%B0%D0%B9%D1%82%D0%B0&rev=1775958877&do=diff раскрутка сайта Раскрутка сайта включает комплекс мероприятий, направленных на улучшение позиций сайта в поисковых системах, привод целевой аудитории и увеличение конверсии. Для того чтобы результативного раскрутки сайта нужно учитывать некоторые основные факторы: text/html 2026-04-16T06:06:38+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=%D1%81%D0%B5%D1%80%D0%B8%D0%B0%D0%BB%D1%8B_%D1%81%D0%BA%D0%B0%D1%87%D0%B0%D1%82%D1%8C_%D0%B1%D0%B5%D1%81%D0%BF%D0%BB%D0%B0%D1%82%D0%BD%D0%BE&rev=1776319598&do=diff сериалы скачать бесплатно Зачем скачивать фильмы на смартфон? Хранение лент на телефоне скачать фильм венам — это не просто удобство, которое даёт множество плюсов, делающих кино доступным по-настоящему удобным. text/html 2026-04-13T16:42:21+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=%D1%81%D0%BA%D0%B0%D1%87%D0%B0%D1%82%D1%8C_%D0%BA%D0%BE%D0%BC%D0%B5%D0%B4%D0%B8%D1%8E&rev=1776098541&do=diff скачать комедию Скачивание фильмов может иметь ряд реальных преимуществ, но сопряжено с законодательными и этическими вопросами. Вот объективный разбор: text/html 2026-04-17T21:49:43+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=%D1%81%D0%BA%D0%B0%D1%87%D0%B0%D1%82%D1%8C_%D1%81%D0%B5%D1%80%D0%B8%D0%B0%D0%BB&rev=1776462583&do=diff скачать сериал Чтобы смотреть картинам на смартфоне, существует ряд основных способов. Ниже — подробная инструкция: 1. Кино по подписке text/html 2026-04-17T15:34:17+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=%D1%81%D0%BA%D0%B0%D1%87%D0%B0%D1%82%D1%8C_%D1%84%D0%B8%D0%BB%D1%8C%D0%BC_%D0%B1%D0%B5%D1%81%D0%BF%D0%BB%D0%B0%D1%82%D0%BD&rev=1776440057&do=diff скачать фильм бесплатн Чтобы просматривать кинолентам на смартфоне, существует ряд основных способов. Рассказываем, как это сделать: 1. Онлайн-кинотеатры text/html 2026-04-14T18:06:11+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=%D1%81%D0%BA%D0%B0%D1%87%D0%B0%D1%82%D1%8C_%D1%84%D0%B8%D0%BB%D1%8C%D0%BC&rev=1776189971&do=diff скачать фильм Скачивание фильмов может иметь как практические причины, а также важные правовые и моральные риски. Ниже — взвешенный анализ: text/html 2026-04-16T15:51:21+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=%D1%81%D0%BA%D0%B0%D1%87%D0%B0%D1%82%D1%8C_%D1%84%D0%B8%D0%BB%D1%8C%D0%BC%D1%8B_%D0%B1%D0%B5%D1%81%D0%BF%D0%BB%D0%B0%D1%82%D0%BD%D0%BE_%D0%BD%D0%BE%D0%B2%D0%B8%D0%BD%D0%BA%D0%B8&rev=1776354681&do=diff скачать фильмы бесплатно новинки Чтобы смотреть фильмам на телефоне, у вас есть основных способов. Рассказываем, как это сделать: 1. Стриминговые сервисы text/html 2026-04-15T06:03:54+00:00 Anonymous (anonymous@undisclosed.example.com) https://kmlinux.fjfi.cvut.cz/~culikzde/wiki/doku.php?id=%D1%81%D0%BA%D0%B0%D1%87%D0%B0%D1%82%D1%8C_%D1%84%D0%B8%D0%BB%D1%8C%D0%BC%D1%8B_%D1%87%D0%B5%D1%80%D0%B5%D0%B7_%D1%82%D0%BE%D1%80%D1%80%D0%B5%D0%BD%D1%82_%D0%B1%D0%B5%D1%81%D0%BF%D0%BB%D0%B0%D1%82%D0%BD%D0%BE&rev=1776233034&do=diff скачать фильмы через торрент бесплатно Зачем сохранять кино на смартфон? Хранение лент на гаджете скачать фильм холодный телефон — это ключ к мобильному кинотеатру, которое даёт множество плюсов, делающих кино доступным лёгким и приятным.