Skip to content

Commit 2d04dba

Browse files
committed
modified doc gen
1 parent 9e94370 commit 2d04dba

File tree

17 files changed

+103
-214
lines changed

17 files changed

+103
-214
lines changed

docs/sphinx_doc/stdlib/action.md

Lines changed: 4 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -10,10 +10,9 @@
1010

1111
```text
1212
parses actions taking only one byte and by taking taking the reminder of the parsed number divided by the number of actions, so that no action is ever marked as invalid
13-
1413
```
1514

16-
- **Function**: `parse_actions<AllActionsVariant>(AllActionsVariant variant, Vector<Byte> input) -> Vector<AllActionsVariant>`
15+
- **Function**: `parse_actions<AllActionsVariant>(AllActionsVariant variant, Vector<Byte> input) -> Vector<AllActionsVariant>`
1716
- **Function**: `parse_and_execute<FrameType, AllActionsVariant>(FrameType state, AllActionsVariant variant, Vector<Byte> input) `
1817
- **Function**: `make_valid_actions_vector<FrameType, ActionType>(Vector<ActionType> all_actions, FrameType state) -> Vector<Byte>`
1918
- **Function**: `get_valid_actions<FrameType, ActionType>(Vector<Byte> valid_actions, Vector<ActionType> all_actions, FrameType state) `
@@ -22,10 +21,9 @@
2221
```text
2322
method that bust be present in binary to ensure that all methods
2423
required by rlc-learn are available
25-
2624
```
2725

28-
- **Function**: `load_action_vector_file<ActionType>(String file_name, Vector<ActionType> out) -> Bool`
26+
- **Function**: `load_action_vector_file<ActionType>(String file_name, Vector<ActionType> out) -> Bool`
2927
- **Function**: `enumerate(Bool b, Vector<Bool> output) `
3028
- **Function**: `enumeration_error(Int x, String out, Vector<String> context) `
3129
- **Function**: `enumeration_error(Float x, String out, Vector<String> context) `
@@ -85,10 +83,9 @@
8583
8684
this is used by machine learning techniques that need to
8785
enumerate all possible actions.
88-
8986
```
9087

91-
- **Function**: `enumerate(T obj, Vector<T> output) `
88+
- **Function**: `enumerate(T obj, Vector<T> output) `
9289

9390
## Trait CustomEnumerationError
9491

@@ -102,10 +99,9 @@
10299
a given type is to be converted into a tensor
103100
for machine learning consumptions. The encoding
104101
should be, when possible, one-hot encoding.
105-
106102
```
107103

108-
- **Function**: `write_in_observation_tensor(T obj, Int observer_id, Vector<Float> output, Int counter) `
104+
- **Function**: `write_in_observation_tensor(T obj, Int observer_id, Vector<Float> output, Int counter) `
109105
- **Function**: `size_as_observation_tensor(T obj) -> Int`
110106

111107
## Trait CustomTensorWarnings

docs/sphinx_doc/stdlib/algorithms/equal.md

Lines changed: 1 addition & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -11,10 +11,9 @@
1111

1212
```text
1313
Nof fully impelemted, do not use
14-
1514
```
1615

17-
16+
1817
## Traits
1918

2019
## Trait Comparable

docs/sphinx_doc/stdlib/bounded_arg.md

Lines changed: 2 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -8,10 +8,9 @@
88
enumerate will return the range of values
99
between the two. Machine learning serialization
1010
will serialize this class as a one-hot vector
11-
1211
```
1312

14-
### Fields
13+
### Fields
1514
- `Int value`
1615

1716
### Methods
@@ -50,10 +49,9 @@
5049
This class makes sense when it is used to rappresent
5150
integers that appear with the same frequency for
5251
each possible value.
53-
5452
```
5553

56-
### Fields
54+
### Fields
5755
- `Int value`
5856

5957
### Methods

docs/sphinx_doc/stdlib/collections/dictionary.md

Lines changed: 3 additions & 57 deletions
Original file line numberDiff line numberDiff line change
@@ -16,86 +16,32 @@
1616
- **Function**: `init() `
1717
- **Function**: `insert(KeyType key, ValueType value) -> Bool`
1818
- **Function**: `get(KeyType key) -> ValueType`
19-
20-
```text
21-
Add safety counter
22-
Create local copies of key and value to avoid modifying the input parameters
23-
Add safety check to prevent infinite loops
24-
Update the actual entry in entries
25-
Update the actual entry in entries
26-
Update the swapped entry
27-
28-
```
29-
3019
- **Function**: `contains(KeyType key) -> Bool`
31-
32-
```text
33-
Quick return for empty dictionary
34-
Add safety counter
35-
Add safety check to prevent infinite loops
36-
37-
```
38-
3920
- **Function**: `remove(KeyType key) -> Bool`
40-
41-
```text
42-
Quick return for empty dictionary
43-
Add safety counter
44-
Add safety check to prevent infinite loops
45-
46-
```
47-
4821
- **Function**: `keys() -> Vector<KeyType>`
49-
50-
```text
51-
Add safety counter
52-
Add safety check to prevent infinite loops
53-
Perform backward-shift operation
54-
Shift elements until we find an empty slot or an element with probe distance 0
55-
Calculate probe distance of the next element
56-
If probe distance is 0, it's already at its ideal position
57-
Move the element back
58-
Move to next positions
59-
60-
```
61-
6222
- **Function**: `values() -> Vector<ValueType>`
6323
- **Function**: `empty() -> Bool`
6424

6525
```text
6626
returns true if the
6727
size of the dictionary is equal
6828
to zero
69-
7029
```
7130

72-
- **Function**: `size() -> Int`
31+
- **Function**: `size() -> Int`
7332

7433
```text
7534
returns true if the
7635
size of the dictionary is equal
7736
to zero
78-
7937
```
8038

81-
- **Function**: `clear() `
39+
- **Function**: `clear() `
8240

8341
```text
8442
erases all the elements
8543
of the dictionary
86-
87-
```
88-
89-
- **Function**: `drop() `
90-
91-
```text
92-
Create new, larger entries array
93-
Ensures growth by at least 1
94-
Initialize new entries
95-
Copy old entries to new array, but only scan up to old_capacity
96-
Insert directly without triggering another growth
97-
Clean up old entries
98-
9944
```
10045

46+
- **Function**: `drop() `
10147

docs/sphinx_doc/stdlib/collections/pair.md

Lines changed: 2 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -5,10 +5,9 @@
55

66
```text
77
A parameterized container with two fields, first and second
8-
98
```
109

11-
### Fields
10+
### Fields
1211
- `T1 first`
1312
- `T2 second`
1413

@@ -21,7 +20,6 @@
2120
a vector with length equal to the shortest of the lengths of the
2221
two input vectors. output.get(i).first == x.get(i) and
2322
output.get(i).second == y.get(i) for all i from 0 to output.length()
24-
2523
```
2624

27-
25+

0 commit comments

Comments
 (0)