This repository has been archived by the owner on Oct 24, 2024. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 42
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
* terminology page * added to index * whatsnew * clarifications
1 parent
f2fbf44
commit f50f1a0
Showing
3 changed files
with
36 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,33 @@ | ||
.. currentmodule:: datatree | ||
.. _terminology: | ||
|
||
This page extends `xarray's page on terminology <https://docs.xarray.dev/en/stable/user-guide/terminology.html>`_. | ||
|
||
Terminology | ||
=========== | ||
|
||
.. glossary:: | ||
|
||
DataTree | ||
A tree-like collection of ``Dataset`` objects. A *tree* is made up of one or more *nodes*, | ||
each of which can store the same information as a single ``Dataset`` (accessed via `.ds`). | ||
This data is stored in the same way as in a ``Dataset``, i.e. in the form of data variables | ||
(see **Variable** in the `corresponding xarray terminology page <https://docs.xarray.dev/en/stable/user-guide/terminology.html>`_), | ||
dimensions, coordinates, and attributes. | ||
|
||
The nodes in a tree are linked to one another, and each node is it's own instance of ``DataTree`` object. | ||
Each node can have zero or more *children* (stored in a dictionary-like manner under their corresponding *names*), | ||
and those child nodes can themselves have children. | ||
If a node is a child of another node that other node is said to be its *parent*. Nodes can have a maximum of one parent, | ||
and if a node has no parent it is said to be the *root* node of that *tree*. | ||
|
||
Subtree | ||
A section of a *tree*, consisting of a *node* along with all the child nodes below it | ||
(and the child nodes below them, i.e. all so-called *descendant* nodes). | ||
Excludes the parent node and all nodes above. | ||
|
||
Group | ||
Another word for a subtree, reflecting how the hierarchical structure of a ``DataTree`` allows for grouping related data together. | ||
Analogous to a single | ||
`netCDF group <https://www.unidata.ucar.edu/software/netcdf/workshops/2011/groups-types/GroupsIntro.html>`_ or | ||
`Zarr group <https://zarr.readthedocs.io/en/stable/tutorial.html#groups>`_. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters