mirrors/hdf5
2
0
Fork 0
mirror of https://github.com/HDFGroup/hdf5.git synced 2026-09-25 04:09:44 +03:00
Code Issues Packages Projects Releases Wiki Activity

Don't use quotes with html formatting constructs (#5542)

Browse Source
This commit is contained in:
Allen Byrne
2025-05-21 09:33:15 -05:00
committed by GitHub
parent 0802170065
commit e0ad5477f7
4 changed files with 8 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files
doxygen/dox/H5.format.1.0.dox
+2 -2
View File
@@ -558,8 +558,8 @@ where child[<i>i</i>] is a pointer to a sub-tree (at a level above Level 0) or t
Each key[<i>i</i>] describes an <i>item</i> stored by the B-tree (a chunk or an object of a group node).
The range of values represented by child[<i>i</i>] are indicated by key[<i>i</i>] and key[<i>i</i>+1].
The following question must next be answered: "Is the value described by key[<i>i</i>] contained in
child[<i>i</i>-1] or in child[<i>i</i>]?" The answer depends on the type of tree. In trees for groups (node
The following question must next be answered: &ldquo;Is the value described by key[<i>i</i>] contained in
child[<i>i</i>-1] or in child[<i>i</i>]?&rdquo; The answer depends on the type of tree. In trees for groups (node
type 0) the object described by key[<i>i</i>] is the greatest object contained in child[<i>i</i>-1] while
in chunk trees (node type 1) the chunk described by key[<i>i</i>] is the least chunk in child[<i>i</i>].
doxygen/dox/H5.format.1.1.dox
+2 -2
View File
@@ -741,8 +741,8 @@ where child[<i>i</i>] is a pointer to a sub-tree (at a level above Level 0) or t
Each key[<i>i</i>] describes an <i>item</i> stored by the B-tree (a chunk or an object of a group node).
The range of values represented by child[<i>i</i>] is indicated by key[<i>i</i>] and key[<i>i</i>+1].
The following question must next be answered: "Is the value described by key[<i>i</i>] contained in
child[<i>i</i>-1] or in child[<i>i</i>]?" The answer depends on the type of tree. In trees for groups (node
The following question must next be answered: &ldquo;Is the value described by key[<i>i</i>] contained in
child[<i>i</i>-1] or in child[<i>i</i>]?&rdquo; The answer depends on the type of tree. In trees for groups (node
type 0) the object described by key[<i>i</i>] is the greatest object contained in child[<i>i</i>-1] while
in chunk trees (node type 1) the chunk described by key[<i>i</i>] is the least chunk in child[<i>i</i>].
doxygen/dox/H5.format.2.0.dox
+2 -2
View File
@@ -934,8 +934,8 @@ where child[<i>i</i>] is a pointer to a sub-tree (at a level above Level 0) or t
Each key[<i>i</i>] describes an <i>item</i> stored by the B-tree (a chunk or an object of a group node).
The range of values represented by child[<i>i</i>] is indicated by key[<i>i</i>] and key[<i>i</i>+1].
The following question must next be answered: "Is the value described by key[<i>i</i>] contained in
child[<i>i</i>-1] or in child[<i>i</i>]?" The answer depends on the type of tree. In trees for groups (node
The following question must next be answered: &ldquo;Is the value described by key[<i>i</i>] contained in
child[<i>i</i>-1] or in child[<i>i</i>]?&rdquo; The answer depends on the type of tree. In trees for groups (node
type 0) the object described by key[<i>i</i>] is the greatest object contained in child[<i>i</i>-1] while
in chunk trees (node type 1) the chunk described by key[<i>i</i>] is the least chunk in child[<i>i</i>].
doxygen/dox/H5.format.3.0.dox
+2 -2
View File
@@ -999,8 +999,8 @@ where child[<i>i</i>] is a pointer to a sub-tree (at a level above Level 0) or t
Each key[<i>i</i>] describes an <i>item</i> stored by the B-tree (a chunk or an object of a group node).
The range of values represented by child[<i>i</i>] is indicated by key[<i>i</i>] and key[<i>i</i>+1].
The following question must next be answered: "Is the value described by key[<i>i</i>] contained in
child[<i>i</i>-1] or in child[<i>i</i>]?" The answer depends on the type of tree. In trees for groups (node
The following question must next be answered: &ldquo;Is the value described by key[<i>i</i>] contained in
child[<i>i</i>-1] or in child[<i>i</i>]?&rdquo; The answer depends on the type of tree. In trees for groups (node
type 0) the object described by key[<i>i</i>] is the greatest object contained in child[<i>i</i>-1] while
in chunk trees (node type 1) the chunk described by key[<i>i</i>] is the least chunk in child[<i>i</i>].