Attention ! Gitlab fournissant maintenant nativement des certificats Let’s Encrypt aux domaines personnalisés des Gitlab Pages, nous avons coupé notre service qui le faisait automatiquement pour vous.

Il est impératif, pour que votre domaine personnalisé continue à avoir un certificat Let’s Encrypt à jour, d’activer la fonctionnalité native dans les paramètres de votre projet. Cette activation remplacera votre certificat actuel par un nouveau certificat Let’s Encrypt géré par Gitlab.

Voir les détails sur https://docs.framasoft.org/fr/gitlab/gitlab-pages-le.html

Commit bdfdfba0 authored by Gérard Meunier's avatar Gérard Meunier

first commit

parents
This diff is collapsed.
Making of WotWizard
Download the Blackbox Component Framework Version 1.7 at:
http://blackboxframework.org/stable/blackbox-1.7.zip
and extract it into the "Blackbox" directory (you may have copied this directory elsewhere before).
Then, run "Blackbox/BlackBox.exe", open this file itself in the BlackBox framework (Blackbox/Duniter/Docu/MakingOf.odc) and execute the commands below.
DevCompiler.CompileThis
CpcUtf8Conv SQLiteHost SQLiteStrings SQLiteDriver UtilExternal UtilAvlTree UtilBTree UtilBBTree DuniterBlockchain DuniterSandbox DuniterWotWizard DuniterWWViews
DevDebug.UnloadThis
DuniterWWViews DuniterWotWizard DuniterSandbox DuniterBlockchain UtilBBTree UtilBTree UtilAvlTree UtilExternal SQLiteDriver SQLiteStrings SQLiteHost CpcUtf8Conv
DevLinker.Link WotWizard.exe :=
Kernel$+ Files HostFiles HostPackedFiles StdLoader
1 Applogo.ico 2 Doclogo.ico 3 SFLogo.ico 4 CFLogo.ico 5 DtyLogo.ico
6 folderimg.ico 7 openimg.ico 8 leafimg.ico
1 Move.cur 2 Copy.cur 3 Link.cur 4 Pick.cur 5 Stop.cur 6 Hand.cur 7 Table.cur
DevPacker.PackThis WotWizard.exe :=
Duniter/Code/Blockchain.ocf Duniter/Code/Sandbox.ocf Duniter/Code/WWViews.ocf Duniter/Code/WotWizard.ocf Host/Code/CFrames.ocf Host/Code/Clipboard.ocf Host/Code/Cmds.ocf Host/Code/Dialog.ocf Host/Code/Files.ocf Host/Code/Fonts.ocf Host/Code/Mechanisms.ocf Host/Code/Menus.ocf Host/Code/Ports.ocf Host/Code/Printers.ocf Host/Code/Registry.ocf Host/Code/Windows.ocf Ole/Code/Data.ocf SQLite/Code/Driver.ocf SQLite/Code/Host.ocf SQLite/Code/Strings.ocf Sql/Code/DB.ocf Sql/Code/Drivers.ocf Std/Code/Api.ocf Std/Code/CFrames.ocf Std/Code/Cmds.ocf Std/Code/Dialog.ocf Std/Code/Interpreter.ocf Std/Code/Links.ocf Std/Code/Loader.ocf Std/Code/Log.ocf Std/Code/MenuTool.ocf System/Code/Containers.ocf System/Code/Controllers.ocf System/Code/Controls.ocf System/Code/Converters.ocf System/Code/Dates.ocf System/Code/Dialog.ocf System/Code/Documents.ocf System/Code/Files.ocf System/Code/Fonts.ocf System/Code/Init.ocf System/Code/Kernel.ocf System/Code/Log.ocf System/Code/Math.ocf System/Code/Mechanisms.ocf System/Code/Meta.ocf System/Code/Models.ocf System/Code/Ports.ocf System/Code/Printers.ocf System/Code/Printing.ocf System/Code/Properties.ocf System/Code/Sequencers.ocf System/Code/Services.ocf System/Code/Stores.ocf System/Code/Strings.ocf System/Code/Views.ocf System/Code/Windows.ocf Text/Code/Cmds.ocf Text/Code/Controllers.ocf Text/Code/Mappers.ocf Text/Code/Models.ocf Text/Code/Rulers.ocf Text/Code/Setters.ocf Text/Code/Views.ocf Util/Code/AvlTree.ocf Util/Code/BBTree.ocf Util/Code/BTree.ocf
Cpc/Code/Utf8Conv.ocf
Dev/Code/Browser.ocf
Dev/Code/Commanders.ocf
Dev/Code/Debug.ocf
Docu/CP-Lang.odc
Duniter/Code/SA-Config.ocf => System/Code/Config.ocf
Duniter/Docu/GNU-License.odc
Duniter/Docu/MakingOf.odc
Duniter/Docu/Manual.odc
Duniter/Docu/Quick-Start.odc
Duniter/Docu/fr/Manual.odc
Duniter/Mod/Blockchain.odc
Duniter/Mod/SA-Config.odc
Duniter/Mod/Sandbox.odc
Duniter/Mod/WotWizard.odc
Duniter/Mod/WWViews.odc
Duniter/Rsrc/About.odc
Duniter/Rsrc/Documentation.odc
Duniter/Rsrc/MaxTime.odc
Duniter/Rsrc/Sources.odc
Duniter/Rsrc/Strings.odc
Duniter/Rsrc/fr/Strings.odc
Duniter/Rsrc/SA-Menus.odc => System/Rsrc/Menus.odc
Form/Code/Controllers.ocf
Form/Code/Models.ocf
Form/Code/Views.ocf
Host/Code/Bitmaps.ocf
Host/Code/Pictures.ocf
Host/Docu/Prefs.odc
Host/Rsrc/Prefs.odc
Host/Rsrc/Strings.odc
Host/Rsrc/fr/Strings.odc
Host/Code/TextConv.ocf
Ole/Code/Client.ocf
Ole/Code/Server.ocf
SQL/Rsrc/Strings.odc
SQL/Rsrc/fr/Strings.odc
SQLite/Rsrc/Strings.odc
Std/Code/Folds.ocf
Std/Code/Headers.ocf
Std/Code/Stamps.ocf
Std/Rsrc/Strings.odc
Std/Rsrc/fr/Strings.odc
System/Rsrc/Strings.odc
System/Rsrc/fr/Strings.odc
Text/Rsrc/Strings.odc
Text/Rsrc/fr/Strings.odc
Util/Code/External.ocf
Util/Docu/AvlTree.odc
Util/Docu/BBTree.odc
Util/Docu/BTree.odc
Util/Docu/GNU-License.odc
Util/Mod/AvlTree.odc
Util/Mod/BBTree.odc
Util/Mod/BTree.odc
Util/Rsrc/Strings.odc
Util/Rsrc/fr/Strings.odc
Xhtml/Code/Exporter.ocf
Copy "BlackBox/WotWizard.exe" in an empty directory, download and copy "sqlite3.dll" in the same directory as "WotWizard.exe":
https://www.sqlite.org/2015/sqlite-dll-win32-x86-3081002.zip
It's done.
\ No newline at end of file
WotWizard Quick-Start
Copyright © 2017, by Gérard Meunier.
Version 19-September-2017.
This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 3 of the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
Saved from 'Component Pascal Collection' url http://www.zinnamturm.eu
WotWizard: A predictor for future entries into the Duniter Web of Trust.
WotWizard (WW) builds, from the blockchain and sandbox of Duniter, a prediction of the future entries of candidates into the Duniter Web of Trust (WOT). It uses a simulation of the Duniter mechanism. When several possibilities may happen, each one is listed with its probabilities. The published lists are automatically updated every five minutes, and any change is signalled visually.
Contents:
1 Installation
2 How to use it?
3 Reference
1 Installation Up
1. Preconditions.
WotWizard needs the installation of the SQLite, CpcUtf8Conv and Util subsystems.
Check that you have installed the SQLite subsystem.
Check that you have installed the CpcUtf8Conv subsystem.
Check that you have installed the Util subsystem.
2. Unpack all files via Tools -> Decode.
List of contents
3. Compile the following modules:
DevCompiler.CompileThis
DuniterBlockchain DuniterSandbox DuniterWotWizard DuniterWWViews
4. Update menus:
"StdMenuTool.UpdateAllMenus; CpcDropDown.MakeDropDowns"
A new menu Duniter appears.
2 How to use it? Up
This program needs that a Duniter node runs on the same computer.
This program runs natively on Windows. If your computer runs on Linux, install "wine" and "winetricks" first, and, in "winetricks", run "winecfg" and configure the drives to be sure that the Duniter database (see below) can be reached.
Put the file "WotWizard.exe" into an empty directory, put the Windows dll "sqlite3.dll" into the same directory and run WotWizard with a double-click. The dll can be found at the address:
https://www.sqlite.org/2015/sqlite-dll-win32-x86-3081002.zip
Choose your language in "Edit->Preferences...".
Open WordWizard with "Duniter->New WotWizard View". When this command is used for the first time, WotWizard asks you where the Duniter database lies. A first window pops up with the text "Choose Duniter Database". Click on "OK". Then, a new window lets you navigate to the database file. E.g. on Linux, the path of this file is:
~/.config/duniter/duniter_default/duniter.db
You can:
- choose the way the list is displayed (by names or by dates)
- manually update the list (it's automatically updated every five minutes)
After the first opening of WotWizard, a part of Duniter data is copied into a new database, to accelerate their future use. This operation may take a rather long time, and you'll can see, at the bottom of the application, the block numbers pass before your eyes.
When the list has changed, two asterisks appear, one on each side of the title, and a new button "Checked" is created. Click on the button to make the marks disappear.
You can save the list with "File->Save" or "File-> Save as...", and reopen it with "File->Open". Unlike the command "Duniter->New WotWizard View", this method makes appear the marks if a change happened since the last save command, even if WotWizard has been stopped meanwhile.
If the list is too long to compute, it may not be displayed. In this case you may want to increase the maximum computing time with "Edit->Change Max Computing Time".
In rare cases, you may want to change the path to the Duniter database. Use "Edit->Change Duniter Database".
You may, rarely too, want to reset the database WotWizard builds from Duniter. In this case, use "Edit->Reset WotWizard Database". Warning: this operation may be long.
3 References Up
Duniter on Github
Use it and enjoy! - ¡Úsalos y disfrútalos! - Bonne utilisation - Приятного использованияn - Powodzenia - Viel Spaß
Gérard Meunier
mailto:gemeu@free.fr
UtilAvlTree
DEFINITION UtilAvlTree;
CONST
lt = -1;
eq = 0;
gt = 1;
TYPE
Elem = POINTER TO ABSTRACT RECORD
(e: Elem) Compare- (el: Elem): BYTE, NEW, EXTENSIBLE;
(e: Elem) Copy- (): Elem, NEW, EXTENSIBLE;
(e: Elem) Do- (p: ANYPTR), NEW, EMPTY
END;
Tree = POINTER TO LIMITED RECORD
(t: Tree) SearchIns (VAR key: Elem; OUT rank: INTEGER): BOOLEAN, NEW;
(t: Tree) Search (VAR key: Elem; OUT rank: INTEGER): BOOLEAN, NEW;
(t: Tree) SearchNext (VAR key: Elem; OUT rank: INTEGER): BOOLEAN, NEW;
(t: Tree) Delete (key: Elem): BOOLEAN, NEW;
(t: Tree) Insert (key: Elem; rank: INTEGER), NEW;
(t: Tree) Prepend (key: Elem), NEW;
(t: Tree) Append (key: Elem), NEW;
(t: Tree) Find (rank: INTEGER; OUT val: Elem), NEW;
(t: Tree) Erase (rank: INTEGER), NEW;
(t: Tree) Empty, NEW;
(t: Tree) IsEmpty (): BOOLEAN, NEW;
(t: Tree) Copy (): Tree, NEW;
(t1: Tree) Cat (t2: Tree), NEW;
(t1: Tree) Split (after: INTEGER; OUT t2: Tree), NEW;
(t: Tree) NumberOfElems (): INTEGER, NEW;
(t: Tree) Next (e: Elem): Elem, NEW;
(t: Tree) Previous (e: Elem): Elem, NEW;
(t: Tree) WalkThrough (p: ANYPTR), NEW;
(t: Tree) Valid (): BOOLEAN, NEW
END;
PROCEDURE New (OUT t: Tree);
END UtilAvlTree.
This module implements balanced and threaded trees. All elements must be of the same extension of Elem.
CONST lt
Result of a comparison: less than.
CONST eq
Result of a comparison: equal.
CONST eq
Result of a comparison: greater than.
TYPE Elem
ABSTRACT
Element of a tree.
TYPE Tree
LIMITED
A tree.
PROCEDURE (e: Elem) Compare- (el: Elem): BYTE
NEW, EXTENSIBLE
Compare e to el; returns lt if e< el, eq if e= el and eq if e> el; must be extended before use (in Tree.SearchIns, Tree.Search, Tree.SearchNext and Tree.Delete).
Pre
Extended 25
PROCEDURE (e: Elem) Copy- (): Elem
NEW, EXTENSIBLE
Copies and returns the element e; must be extended before use (in Tree.Copy).
Pre
Extended 26
PROCEDURE (e: Elem) Do- (p: ANYPTR)
NEW, EMPTY
Used in Tree.WalkThrough; action on an element e, with parameter p, while traversing a tree in inorder.
PROCEDURE (t: Tree) SearchIns (VAR key: Elem; OUT rank: INTEGER): BOOLEAN
NEW
Searches the element key in the sorted tree t; if key is found, returns TRUE, else key is inserted in the tree; rank returns the rank of key in the tree (beginning at 1); Elem.Compare must be instantiated. It's key.Compare which is used when testing the position of key in the tree t.
Pre
t.Valid() 20
key # NIL 21
Post
t.Valid()
PROCEDURE (t: Tree) Search (VAR key: Elem; OUT rank: INTEGER): BOOLEAN
NEW
Searches the element key in the sorted tree t; if key is found, returns TRUE; rank returns the rank of key in the tree (beginning at 1), or 0 if not found; Elem.Compare must be instantiated. It's key.Compare which is used when testing the position of key in the tree t.
Pre
t.Valid() 20
key # NIL 21
PROCEDURE (t: Tree) SearchNext (VAR key: Elem; OUT rank: INTEGER): BOOLEAN
NEW
Searches the element key in the sorted tree t, or the next element if not found; if key is found, returns TRUE, the found element in key and its rank in rank; otherwise, returns FALSE, the successor in key and its rank in rank; returns NIL in key and 0 in rank if key is not found and has no successor; Elem.Compare must be instantiated. It's key.Compare which is used when testing the position of key in the tree t.
Pre
t.Valid() 20
key # NIL 21
PROCEDURE (t: Tree) Delete (key: Elem): BOOLEAN
NEW
Erases the element key in the sorted tree t; returns TRUE if key is found, else does nothing; Elem.Compare must be instantiated. It's key.Compare which is used when testing the position of key in the tree t.
Pre
t.Valid() 20
key # NIL 21
Post
t.Valid()
PROCEDURE (t: Tree) Insert (key: Elem; rank: INTEGER)
NEW
Inserts the element key at the position rank in the tree t; the first rank of the tree is 1.
Pre
t.Valid() 20
key # NIL 21
Post
t.Valid()
PROCEDURE (t: Tree) Prepend (key: Elem)
NEW
Inserts the element key at the beginning of the tree t.
Pre
t.Valid() 20
key # NIL 21
Post
t.Valid()
PROCEDURE (t: Tree) Append (key: Elem)
NEW
Inserts the element key at the end of the tree t.
Pre
t.Valid() 20
key # NIL 21
Post
t.Valid()
PROCEDURE (t: Tree) Find (rank: INTEGER; OUT val: Elem)
NEW
Finds and returns in val the element of position rank in the tree t (beginning at 1); if the element does not exist, val returns NIL; rank must verify 1<= rank<= t.NumberOfElems().
Pre
t.Valid() 20
PROCEDURE (t: Tree) Erase (rank: INTEGER)
NEW
Erases the element of position rank in the tree t (beginning at 1).
Pre
t.Valid() 20
1<= rank<= t.NumberOfElems() 21
Post
t.Valid()
PROCEDURE (t: Tree) Empty
NEW
Empties the tree t.
Post
t.Valid() & (t.NumberOfElems()= 0)
PROCEDURE (t: Tree) IsEmpty (): BOOLEAN
NEW
Is t empty?
Pre
t.Valid() 20
PROCEDURE (t: Tree) Copy (): Tree
NEW
Makes a deep copy of the tree t; the method Elem.Copy must be instantiated.
Pre
t.Valid() 20
Post
result.Valid()
PROCEDURE (t1: Tree) Cat (t2: Tree)
NEW
Concatenates the trees t1 and t2; returns the result in t1; t2 is no more valid.
Pre
t1.Valid() 20
t2.Valid() 21
t1# t2 22
Post
t1.Valid() & ~t2.Valid()
PROCEDURE (t1: Tree) Split (after: INTEGER; OUT t2: Tree)
NEW
Splits the tree t1 after the element of rank after (beginning at 1); the result is returned in t1 and t2.
Pre
t1.Valid() 20
Post
t1.Valid() & t2.Valid() & (t1.Cat(t2)= t1' ) & (t1.NumberOfElems()= MIN(after, t1'.NumberOfElems())
PROCEDURE (t: Tree) NumberOfElems (): INTEGER
NEW
Returns the number of elements in the tree t.
Pre
t.Valid() 20
PROCEDURE (t: Tree) Next (e: Elem): Elem
NEW
Returns the element following e in the tree t; if e = NIL, the first element is returned; if e is the last element of the tree, NIL is returned.
Pre
t.Valid() 20
PROCEDURE (t: Tree) Previous (e: Elem): Elem
NEW
Returns the element preceding e in the tree t; if e = NIL, the last element is returned; if e is the first element of the tree, NIL is returned.
Pre
t.Valid() 20
PROCEDURE (t: Tree) WalkThrough (p: ANYPTR)
NEW
Traverses the tree t in inorder and calls the method Elem.Do, with p as parameter, on each element; the method Elem.Do must be instantiated.
Pre
t.Valid() 20
PROCEDURE (t: Tree) Valid (): BOOLEAN
NEW
Tests if the tree t is valid; the method Tree.Cat invalidates its argument.
PROCEDURE New (OUT t: Tree)
Creates a new empty tree t.
Post
t.Valid() & (t.NumberOfElems() = 0)
UtilBBTree
DEFINITION UtilBBTree;
IMPORT UtilBTree;
CONST
BOS = 1;
SCS = 1;
CHS = 2;
BYS = 1;
SIS = 2;
INS = 4;
LIS = 8;
SRS = 4;
RES = 8;
SES = 4;
bNil = 0;
lt = -1;
eq = 0;
gt = 1;
TYPE
Database = UtilBTree.Database;
DataFac = UtilBTree.DataFac;
Data = UtilBTree.Data;
StringFac = UtilBTree.StringFac;
String = UtilBTree.String;
DataMan = UtilBTree.DataMan;
IndexPos = UtilBTree.IndexPos;
Index = UtilBTree.Index;
KeyManager = UtilBTree.KeyManager;
StringKeyManager = UtilBTree.StringKeyManager;
Reader = UtilBTree.Reader;
Writer = UtilBTree.Writer;
VAR
fac-: UtilBTree.Factory;
END UtilBBTree.
Implementation of BTree for BlackBox. For use in BlackBox, this module should be imported in place of UtilBTree.
This diff is collapsed.
WotWizard Manual
This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 3 of the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
WotWizard builds, from the blockchain and sandbox of Duniter, a prediction of the future entries of candidates into the Duniter Web of Trust (WOT). It uses a simulation of the Duniter mechanism. When several possibilities may happen, each one is listed with its probabilities. The published lists are automatically updated every five minutes, and any change is signalled visually.
How to use it?
This program needs that a Duniter node runs on the same computer.
This program runs natively on Windows. If your computer runs on Linux, install "wine" and "winetricks" first, and, in "winetricks", run "winecfg" and configure the drives to be sure that the Duniter database (see below) can be reached.
Put the file "WotWizard.exe" into an empty directory, put the Windows dll "sqlite3.dll" into the same directory and run WotWizard with a double-click. The dll can be found at the address:
https://www.sqlite.org/2015/sqlite-dll-win32-x86-3081002.zip
Choose your language in "Edit->Preferences...".
Open WordWizard with "Duniter->New WotWizard View". When this command is used for the first time, WotWizard asks you where the Duniter database lies. A first window pops up with the text "Choose Duniter Database". Click on "OK". Then, a new window lets you navigate to the database file. E.g. on Linux, the path of this file is:
~/.config/duniter/duniter_default/duniter.db
You can:
- choose the way the list is displayed (by names or by dates)
- manually update the list (it's automatically updated every five minutes)
After the first opening of WotWizard, a part of Duniter data is copied into a new database, to accelerate their future use. This operation may take a rather long time, and you'll can see, at the bottom of the application, the block numbers pass before your eyes.
When the list has changed, two asterisks appear, one on each side of the title, and a new button "Checked" is created. Click on the button to make the marks disappear.
You can save the list with "File->Save" or "File-> Save as...", and reopen it with "File->Open". Unlike the command "Duniter->New WotWizard View", this method makes appear the marks if a change happened since the last save command, even if WotWizard has been stopped meanwhile.
If the list is too long to compute, it may not be displayed. In this case you may want to increase the maximum computing time with "Edit->Change Max Computing Time".
In rare cases, you may want to change the path to the Duniter database. Use "Edit->Change Duniter Database".
You may, rarely too, want to reset the database WotWizard builds from Duniter. In this case, use "Edit->Reset WotWizard Database". Warning: this operation may be long.
Use it and enjoy! - ¡Úsalos y disfrútalos! - Bonne utilisation - Приятного использованияn - Powodzenia - Viel Spaß
Gérard Meunier
WotWizard : Mode d'emploi
This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 3 of the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
WotWizard construit, à partir de la chaîne de blocs et de la piscine de Duniter, une prédiction des futures entrées des candidats dans la toile de confiance (Wot) de Duniter. Il utilise pour cela une simulation du mécanisme de Duniter. Lorsque plusieurs dates d'entrées sont possibles pour la même personne, chacune est affectée d'une probabilité. La liste affichée est mise à jour automatiquement toutes les cinq minutes, et tout changement est signalé par une marque visible.
Comment l'utiliser ?
Ce programme doit être utilisé sur un ordinateur faisant tourner un nœud Duniter.
Ce programme tourne nativement sous Windows. Si votre ordinateur tourne sous Linux, installez d'abord "wine" et "winetricks", et, dans "winetricks", lancez "winecfg" et configurez les lecteurs de façon à pouvoir atteindre sans problème la base de données de Duniter (voir ci-dessous).
Copiez le fichier "WotWizard.exe" dans un répertoire vide, placez la dll Windows "sqlite3.dll" dans le même répertoire et lancez WotWizard en double-cliquant dessus. La dll peut être téléchargée à l'adresse :
https://www.sqlite.org/2015/sqlite-dll-win32-x86-3081002.zip
Choisissez votre langue dans "Édition->Préférences...".
Ouvrez WotWizard avec "Duniter->Nouvelle fenêtre WotWizard". Lorsque cette commande est utilisée pour la première fois, WotWizard demande où se trouve la base de données de Duniter. Une première fenêtre s'ouvre avec le texte "Ouvrez la base de données Duniter". Cliquez sur "OK". Une autre fenêtre s'ouvre alors et permet de naviguer jusqu'au fichier de la base. Par exemple, sur Linux, le chemin de ce fichier est :
~/.config/duniter/duniter_default/duniter.db
Lors de la première ouverture de WotWizard, une partie des données de Duniter sont recopiées pour accélérer ensuite leur traitement. Cette opération peut être assez longue, et on peut voir, en bas de l'application, défiler les numéros des blocs copiés.
Vous pouvez :
- choisir la façon dont la liste est affichée (par noms ou par dates)
- mettre à jour la liste manuellement (elle est mise à jour automatiquement toutes les cinq minutes)
Lorque la liste change, deux astérisques apparaissent, une de chaque côté du titre, et un nouveau bouton "Vérifié" est créé. En cliquant sur le bouton, on fait disparaître les marques.
Vous pouvez enregistrer la liste avec "Fichier->Enregistrer" ou "Fichier->Enregistrer sous...", et la réouvrir grace à "Fichier->Ouvrir". Contrairement à la commande "Duniter->Nouvelle fenêtre WotWizard", cette méthode permet de faire apparaître les marques si un changement a eu lieu depuis la dernière commande d'enregistrement, même si WotWizard a été éteint entretemps.
Si le temps de calcul de la liste est trop long, celle-ci peut ne pas s'afficher. Dans ce cas, on peut augmenter le temps maximal de calcul avec "Édition->Changer le temps de calcul maximal".
Dans de rares cas, on peut vouloir changer le chemin vers la base de données de Duniter. Utiliser alors "Édition->Changer la base de données Duniter".
On peut aussi, rarement, vouloir remettre à zéro la base de données que WotWizard construit à partir de celle de Duniter. Dans ce cas, on utilise "Édition->Réinitialiser la base de données de WotWizard". Attention : cette opération peut être longue.
Use it and enjoy! - ¡Úsalos y disfrútalos! - Bonne utilisation - Приятного использованияn - Powodzenia - Viel Spaß
Gérard Meunier
See one of the manuals in the Help directory.
# WotWizard
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
This diff is collapsed.
(*
Util: Utility tools.
Copyright (C) 2001…2006 Gérard Meunier
This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*)
MODULE UtilBBTree;
(* Implementation of BArbre for BlackBox. For use in BlackBox, this module should be imported in place of UtilBTree. *)
IMPORT
B := UtilBTree, SYSTEM, Files, HostFiles, Strings, WinApi;
CONST
bNil* = B.bNil;
lt* = B.lt;
eq* = B.eq;
gt* = B.gt;
BOS* = B.BOS;
SCS* = B.SCS;
CHS* = B.CHS;
BYS* = B.BYS;
SIS* = B.SIS;
INS* = B.INS;
LIS* = B.LIS;
SRS* = B.SRS;
RES* = B.RES;
SES* = B.SES;
TYPE
Factory = POINTER TO RECORD (B.Factory)
END;
RealArray = ARRAY RES OF BYTE;
SRealArray = ARRAY SRS OF BYTE;
File = POINTER TO RECORD (B.File)
h: WinApi.HANDLE;
rPos, wPos: INTEGER;
END;
KeyManager* = B.KeyManager;
String* = B.String;
StringFac* = B.StringFac;
StringKeyManager* = B.StringKeyManager;
Database* = B.Database;
IndexPos* = B.IndexPos;
Index* = B.Index;
Data* = B.Data;
DataFac* = B.DataFac;
DataMan* = B.DataMan;
Reader* = B.Reader;
Writer* = B.Writer;
VAR
fac-: B.Factory;
PROCEDURE SplitName (full: ARRAY OF CHAR; OUT path, name: ARRAY OF CHAR): BOOLEAN;
VAR
res, drive, p: INTEGER;
ok: BOOLEAN;
loc: Files.Locator;
BEGIN (*SplitName*)
Strings.Find(full, ':', 0, res);
ok := (res = - 1) OR (res = 1);
IF ok THEN
drive := res;
Strings.Find(full, '/', res + 1, p);
WHILE p >= 0 DO
res := p;
Strings.Find(full, '/', res + 1, p);
END;
IF res < 0 THEN
path := "";
name := full$;
ELSE
IF res <= drive + 1 THEN
Strings.Extract(full, 0, res + 1, path);
ELSE
Strings.Extract(full, 0, res, path);
END;
Strings.Extract(full, res + 1, LEN(full), name);
END;
ok := LEN(name$) > 0;