siibra 1.0.1a0__py3-none-any.whl → 1.0.1a1__py3-none-any.whl

siibra/VERSION

@@ -1 +1 @@
-1.0.1-alpha.0
+1.0.1-alpha.1

siibra/__init__.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2024
+# Copyright 2018-2025
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");
@@ -108,7 +108,7 @@ def set_feasible_download_size(maxsize_gbyte):
 
 def set_cache_size(maxsize_gbyte: int):
     """
-    siibra runs maintainance on its local cache to keep it under a predetermined
+    siibra runs maintenance on its local cache to keep it under a predetermined
     size of 2 gigabytes. This method changes the cache size.
 
     Parameters
@@ -129,9 +129,9 @@ def warm_cache(level=WarmupLevel.INSTANCE):
     Preload preconfigured siibra concepts.
 
     Siibra relies on preconfigurations that simplify integrating various
-    concepts such as parcellations, refernce spaces, and multimodal data
+    concepts such as parcellations, reference spaces, and multimodal data
     features. By preloading the instances, siibra commits all preconfigurations
-    to the memory at once instead of commiting them when required.
+    to the memory at once instead of committing them when required.
     """
     Warmup.warmup(level)
 

siibra/commons.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2024
+# Copyright 2018-2025
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");
@@ -139,7 +139,7 @@ class InstanceTable(Generic[T], Iterable):
         return (w for w in self._elements.values())
 
     def __contains__(self, key: Union[str, T]) -> bool:
-        """Test wether the given key or element is defined by the registry."""
+        """Test whether the given key or element is defined by the registry."""
         if isinstance(key, str):
             return key in self._elements
         return key in [item for _, item in self._elements.values()]
@@ -536,7 +536,8 @@ def resample_img_to_img(
     resampled_img = resample_to_img(
         source_img=source_img,
         target_img=target_img,
-        interpolation=interpolation
+        interpolation=interpolation,
+        force_resample=True,  # False is intended for testing. see nilearn docs
     )
     return resampled_img
 
@@ -554,7 +555,7 @@ def connected_components(
 
     Note
     ----
-    `Uses skimage.measure.label()` to determine foreground compenents.
+    `Uses skimage.measure.label()` to determine foreground components.
 
     Parameters
     ----------
@@ -568,7 +569,7 @@ def connected_components(
     Yields
     ------
     Generator[Tuple[int, np.ndarray], None, None]
-        tuple of integer label of the component and component as an nd.array in
+        tuple of integer label of the component and component as an ndarray in
         the shape of the original image.
     """
     from skimage import measure
@@ -644,11 +645,11 @@ def MI(arr1, arr2, nbins=100, normalized=True):
     assert (all(arr.size > 0) for arr in [arr1, arr2])
 
     # compute the normalized joint 2D histogram as an
-    # empirical measure of the joint probabily of arr1 and arr2
+    # empirical measure of the joint probability of arr1 and arr2
     pxy, _, _ = np.histogram2d(arr1.ravel(), arr2.ravel(), bins=nbins)
     pxy /= pxy.sum()
 
-    # extract the empirical propabilities of intensities
+    # extract the empirical probabilities of intensities
     # from the joint histogram
     px = np.sum(pxy, axis=1)  # marginal for x over y
     py = np.sum(pxy, axis=0)  # marginal for y over x

siibra/configuration/__init__.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2024
+# Copyright 2018-2025
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");

siibra/configuration/configuration.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2024
+# Copyright 2018-2025
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");

siibra/configuration/factory.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2024
+# Copyright 2018-2025
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");

siibra/core/__init__.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2024
+# Copyright 2018-2025
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");

siibra/core/assignment.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2024
+# Copyright 2018-2025
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");

siibra/core/atlas.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2024
+# Copyright 2018-2025
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");

siibra/core/concept.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2024
+# Copyright 2018-2025
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");
@@ -145,9 +145,9 @@ class AtlasConcept:
     @property
     def authors(self):
         return [
-            contributer['name']
+            contributor['name']
             for ds in self.datasets
-            for contributer in ds.contributors
+            for contributor in ds.contributors
         ]
 
     @property

siibra/core/parcellation.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2024
+# Copyright 2018-2025
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");
@@ -17,7 +17,7 @@ from . import region
 
 from ..commons import logger, MapType, Species
 from ..volumes import parcellationmap
-from ..exceptions import NoMapMatchingValues
+from ..exceptions import MapNotFound
 
 from functools import lru_cache
 import re
@@ -193,13 +193,13 @@ class Parcellation(region.Region, configuration_folder="parcellations"):
             and m.parcellation.matches(self)
         ]
         if len(candidates) == 0:
-            raise NoMapMatchingValues(f"No '{maptype}' map in '{space}' available for {str(self)}")
+            raise MapNotFound(f"No '{maptype}' map in '{space}' available for {str(self)}")
         if len(candidates) > 1:
             spec_candidates = [
                 c for c in candidates if all(w.lower() in c.id.lower() for w in spec.split())
             ]
             if len(spec_candidates) == 0:
-                raise NoMapMatchingValues(f"'{spec}' does not match any options from {[c.name for c in candidates]}.")
+                raise MapNotFound(f"'{spec}' does not match any options from {[c.name for c in candidates]}.")
             if len(spec_candidates) > 1:
                 logger.warning(
                     f"Multiple maps are available in this specification of space, parcellation, and map type.\n"
@@ -221,7 +221,7 @@ class Parcellation(region.Region, configuration_folder="parcellations"):
         """
         spec = re.sub(r'Group: *', '', spec)
         for substr in re.findall(r'\(.*?\)', spec):
-            # temporarilty replace commas inside brackets with a placeholder
+            # temporarily replace commas inside brackets with a placeholder
             # because these are not region spec delimiters
             spec = spec.replace(substr, re.sub(r', *', '##', substr))
         # process the comma separated substrings
@@ -354,7 +354,7 @@ def find_regions(
 ):
     """
     Find regions matching the given region specification across all parcellation
-    instances in the registery.
+    instances in the registry.
 
     Parameters
     ----------

siibra/core/region.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2024
+# Copyright 2018-2025
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");
@@ -31,7 +31,7 @@ from ..exceptions import NoMapAvailableError, SpaceWarpingFailedError
 
 import re
 import anytree
-from typing import List, Union, Iterable, Dict, Callable, Tuple
+from typing import List, Union, Iterable, Dict, Callable, Tuple, Set
 from difflib import SequenceMatcher
 from ebrains_drive import BucketApiClient
 import json
@@ -53,8 +53,8 @@ class Region(anytree.NodeMixin, concept.AtlasConcept, structure.BrainStructure):
     _regex_re = re.compile(r'^\/(?P<expression>.+)\/(?P<flags>[a-zA-Z]*)$')
     _accepted_flags = "aiLmsux"
 
-    _GETMAP_CACHE = {}
-    _GETMAP_CACHE_MAX_ENTRIES = 1
+    _GETMASK_CACHE = {}
+    _GETMASK_CACHE_MAX_ENTRIES = 1
 
     def __init__(
         self,
@@ -111,20 +111,20 @@ class Region(anytree.NodeMixin, concept.AtlasConcept, structure.BrainStructure):
         )
 
         # anytree node will take care to use this appropriately
-        self.parent = parent
-        self.children = children
+        self.parent: "Region" = parent
+        self.children: List["Region"] = children
         # convert hex to int tuple if rgb is given
         self.rgb = (
             None if rgb is None
             else tuple(int(rgb[p:p + 2], 16) for p in [1, 3, 5])
         )
-        self._supported_spaces = None  # computed on 1st call of self.supported_spaces
+        self._supported_spaces: Set[_space.Space] = None  # computed on 1st call of self.supported_spaces
         self._str_aliases = None
         self.find = lru_cache(maxsize=3)(self.find)
 
     def get_related_regions(self) -> Iterable["RegionRelationAssessments"]:
         """
-        Get assements on relations of this region to others defined on EBRAINS.
+        Get assessments on relations of this region to others defined on EBRAINS.
 
         Yields
         ------
@@ -133,8 +133,8 @@ class Region(anytree.NodeMixin, concept.AtlasConcept, structure.BrainStructure):
         Example
         -------
         >>> region = siibra.get_region("monkey", "PG")
-        >>> for assesment in region.get_related_regions():
-        >>>    print(assesment)
+        >>> for assessment in region.get_related_regions():
+        >>>    print(assessment)
         'PG' is homologous to 'Area PGa (IPL)'
         'PG' is homologous to 'Area PGa (IPL) left'
         'PG' is homologous to 'Area PGa (IPL) right'
@@ -441,12 +441,21 @@ class Region(anytree.NodeMixin, concept.AtlasConcept, structure.BrainStructure):
             maptype = MapType[maptype.upper()]
 
         threshold_info = "" if maptype == MapType.LABELLED else f"(threshold: {threshold}) "
+        # check cache
+        getmask_hash = hash(f"{self.id} - {space} - {maptype}{threshold_info}")
+        if getmask_hash in self._GETMASK_CACHE:
+            return self._GETMASK_CACHE[getmask_hash]
+
         name = f"Mask {threshold_info}of '{self.name} ({self.parcellation})' in "
         try:
             regional_map = self.get_regional_map(space=space, maptype=maptype)
             if maptype == MapType.LABELLED:
                 assert threshold == 0.0, f"threshold can only be set for {MapType.STATISTICAL} maps."
-                result = regional_map
+                result = volume.FilteredVolume(
+                    parent_volume=regional_map,
+                    label=regional_map.label,
+                    fragment=regional_map.fragment
+                )
                 result._boundingbox = None
             if maptype == MapType.STATISTICAL:
                 result = volume.FilteredVolume(
@@ -456,21 +465,30 @@ class Region(anytree.NodeMixin, concept.AtlasConcept, structure.BrainStructure):
                 if threshold == 0.0:
                     result._boundingbox = regional_map._boundingbox
             name += f"'{result.space}'"
-        except NoMapAvailableError:
+        except NoMapAvailableError as e:
             # This region is not mapped directly in any map in the registry.
             # Try building a map from the child regions
-            if (len(self.children) > 0) and all(c.mapped_in_space(space) for c in self.children):
-                logger.info(f"{self.name} is not mapped in {space}. Merging the masks of its {len(self.children)} child regions.")
-                child_volumes = [
-                    child.get_regional_mask(space=space, maptype=maptype, threshold=threshold)
-                    for child in self.children
+            if (len(self.children) > 0) and self.mapped_in_space(space, recurse=True):
+                mapped_descendants: List[Region] = [
+                    d for d in self.descendants if d.mapped_in_space(space, recurse=False)
+                ]
+                logger.info(f"{self.name} is not mapped in {space}. Merging the masks of its {len(mapped_descendants)} map descendants.")
+                descendant_volumes = [
+                    descendant.get_regional_mask(space=space, maptype=maptype, threshold=threshold)
+                    for descendant in mapped_descendants
                 ]
                 result = volume.FilteredVolume(
-                    volume.merge(child_volumes),
+                    volume.merge(descendant_volumes),
                     label=1
                 )
-                name += f"'{result.space}' (built by merging the mask {threshold_info} of its decendants)"
+                name += f"'{result.space}' (built by merging the mask {threshold_info} of its descendants)"
+            else:
+                raise e
         result._name = name
+
+        while len(self._GETMASK_CACHE) > self._GETMASK_CACHE_MAX_ENTRIES:
+            self._GETMASK_CACHE.pop(next(iter(self._GETMASK_CACHE)))
+        self._GETMASK_CACHE[getmask_hash] = result
         return result
 
     def get_regional_map(
@@ -479,7 +497,7 @@ class Region(anytree.NodeMixin, concept.AtlasConcept, structure.BrainStructure):
         maptype: MapType = MapType.LABELLED,
     ) -> Union[volume.FilteredVolume, volume.Volume, volume.Subvolume]:
         """
-        Get a volume reprsenting this region in the given space and MapType.
+        Get a volume representing this region in the given space and MapType.
 
         Note
         ----
@@ -515,34 +533,31 @@ class Region(anytree.NodeMixin, concept.AtlasConcept, structure.BrainStructure):
                 and self.name in m.regions
             ):
                 return m.get_volume(region=self)
-        else:
-            raise NoMapAvailableError(
-                f"{self.name} is not mapped in {space} as a {str(maptype)} map."
-                " Please try getting the children or getting the mask."
-            )
+        raise NoMapAvailableError(
+            f"{self.name} is not mapped in {space} as a {str(maptype)} map."
+            " Please try getting the children or getting the mask."
+        )
 
-    def mapped_in_space(self, space, recurse: bool = True) -> bool:
+    def mapped_in_space(self, space, recurse: bool = False) -> bool:
         """
-        Verifies wether this region is defined by an explicit map in the given space.
+        Verifies whether this region is defined by an explicit map in the given space.
 
         Parameters
         ----------
         space: Space or str
             reference space
-        recurse: bool, default: True
-            If True, check if all child regions are mapped instead
+        recurse: bool, default: False
+            If True, check if itself or all child regions are mapped instead recursively.
         Returns
         -------
         bool
         """
         from ..volumes.parcellationmap import Map
         for m in Map.registry():
-            # Use and operant for efficiency (short circuiting logic)
-            # Put the most inexpensive logic first
             if (
-                self.name in m.regions
-                and m.space.matches(space)
+                m.space.matches(space)
                 and m.parcellation.matches(self.parcellation)
+                and self.name in m.regions
             ):
                 return True
         if recurse and not self.is_leaf:
@@ -553,21 +568,16 @@ class Region(anytree.NodeMixin, concept.AtlasConcept, structure.BrainStructure):
     @property
     def supported_spaces(self) -> List[_space.Space]:
         """
-        The set of spaces for which a mask could be extracted.
-        Overwrites the corresponding method of AtlasConcept.
+        The list of spaces for which a mask could be extracted from an existing
+        map or combination of masks of its children.
         """
         if self._supported_spaces is None:
-            self._supported_spaces = sorted(
-                {s for s in _space.Space.registry() if self.mapped_in_space(s)}
-            )
+            self._supported_spaces = sorted({
+                s for s in _space.Space.registry()
+                if self.mapped_in_space(s, recurse=True)
+            })
         return self._supported_spaces
 
-    def supports_space(self, space: _space.Space):
-        """
-        Return true if this region supports the given space, else False.
-        """
-        return any(s.matches(space) for s in self.supported_spaces)
-
     @property
     def spaces(self):
         return InstanceTable(
@@ -610,7 +620,7 @@ class Region(anytree.NodeMixin, concept.AtlasConcept, structure.BrainStructure):
             return self._ASSIGNMENT_CACHE[other, self].invert()
 
         if isinstance(other, (location.Location, volume.Volume)):
-            if self.mapped_in_space(other.space):
+            if self.mapped_in_space(other.space, recurse=True):
                 regionmap = self.get_regional_mask(other.space)
                 self._ASSIGNMENT_CACHE[self, other] = regionmap.assign(other)
                 return self._ASSIGNMENT_CACHE[self, other]
@@ -842,7 +852,7 @@ class Region(anytree.NodeMixin, concept.AtlasConcept, structure.BrainStructure):
     def intersection(self, other: "location.Location") -> "location.Location":
         """Use this region for filtering a location object."""
 
-        if self.supports_space(other.space):
+        if self.mapped_in_space(other.space, recurse=True):
             try:
                 volume = self.get_regional_mask(other.space)
                 if volume is not None:
@@ -908,7 +918,7 @@ def get_peid_from_region(region: Region) -> str:
 
 def get_related_regions(region: Region) -> Iterable["RegionRelationAssessments"]:
     """
-    Get assements on relations of a region to others defined on EBRAINS.
+    Get assessments on relations of a region to others defined on EBRAINS.
 
     Parameters
     ----------
@@ -921,8 +931,8 @@ def get_related_regions(region: Region) -> Iterable["RegionRelationAssessments"]
     Example
     -------
     >>> region = siibra.get_region("monkey", "PG")
-    >>> for assesment in siibra.core.region.get_related_regions(region):
-    >>>    print(assesment)
+    >>> for assessment in siibra.core.region.get_related_regions(region):
+    >>>    print(assessment)
     'PG' is homologous to 'Area PGa (IPL)'
     'PG' is homologous to 'Area PGa (IPL) left'
     'PG' is homologous to 'Area PGa (IPL) right'

siibra/core/space.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2024
+# Copyright 2018-2025
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");

siibra/core/structure.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2024
+# Copyright 2018-2025
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");
@@ -76,7 +76,7 @@ class BrainStructure(ABC):
         # Two cases:
         # 1) self is location, other is location -> look at spatial intersection/relationship, do it here
         # 2) self is location, other is region -> get region map, then call again. do it here
-        # If self is region -> Region overwrite this method, adressed there
+        # If self is region -> Region overwrite this method, addressed there
 
         assert not isinstance(self, _region.Region)  # method is overwritten by Region!
         if (self, other) in self._ASSIGNMENT_CACHE:

siibra/exceptions.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2024
+# Copyright 2018-2025
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");
@@ -55,9 +55,13 @@ class NoneCoordinateSuppliedError(ValueError):
     pass
 
 
-class NoMapMatchingValues(ValueError):
+class MapNotFound(ValueError):
     pass
 
 
 class EmptyPointCloudError(ValueError):
     pass
+
+
+class NoPredifinedColormapException(ValueError):
+    pass

siibra/experimental/__init__.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2024
+# Copyright 2018-2025
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");

siibra/experimental/contour.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2024
+# Copyright 2018-2025
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");
@@ -46,7 +46,7 @@ class Contour(pointcloud.PointCloud):
 
         if cropped is not None and not isinstance(cropped, point.Point):
             assert isinstance(cropped, pointcloud.PointCloud)
-            # Identifiy contour splits are by discontinuouities ("jumps")
+            # Identify contour splits are by discontinuouities ("jumps")
             # of their labels, which denote positions in the original contour
             jumps = np.diff([self.labels.index(lb) for lb in cropped.labels])
             splits = [0] + list(np.where(jumps > 1)[0] + 1) + [len(cropped)]

siibra/experimental/cortical_profile_sampler.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2024
+# Copyright 2018-2025
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");

siibra/experimental/patch.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2024
+# Copyright 2018-2025
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");

siibra/experimental/plane3d.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2024
+# Copyright 2018-2025
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");
@@ -33,7 +33,7 @@ class Plane3D:
         The plane's reference space is defined by the first point.
         """
         self.space = point1.space
-        # normal is the cross product of two arbitray in-plane vectors
+        # normal is the cross product of two arbitrary in-plane vectors
         n = np.cross(
             (point2.warp(self.space) - point1).coordinate,
             (point3.warp(self.space) - point1).coordinate,
@@ -107,7 +107,7 @@ class Plane3D:
         )[0]
         faces = mesh["faces"][face_indices]
 
-        # for each of N selected faces, indicate wether we cross the plane
+        # for each of N selected faces, indicate whether we cross the plane
         # as we go from vertex 2->0, 0->1, 1->2, respectively.
         # This gives us an Nx3 array, where forward crossings are identified by 1,
         # and backward crossings by -1.
@@ -160,7 +160,7 @@ class Plane3D:
         face_id = 0  # index of the mesh face to consider
         while len(face_indices) > 0:
 
-            # continue the contour with the next foward edge intersection
+            # continue the contour with the next forward edge intersection
             p = fwd_intersections[face_id]
             points.append(p)
             # Remember the ids of the face and start-/end vertices for the point

siibra/explorer/__init__.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2024
+# Copyright 2018-2025
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");

siibra/explorer/url.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2024
+# Copyright 2018-2025
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");
@@ -211,7 +211,7 @@ def get_hash(full_string: str):
         for char in full_string:
             # overflowing is expected and in fact the whole reason why convert number to int32
 
-            # in windows, int32((0 - min_int32) << 5), rather than overflow to wraper around, raises OverflowError
+            # in windows, int32((0 - min_int32) << 5), rather than overflow to wrapper around, raises OverflowError
             shifted_5 = int32(
                 (return_val - min_int32) if return_val > max_int32 else return_val << 5
             )

siibra/explorer/util.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2024
+# Copyright 2018-2025
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");

siibra/features/__init__.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2024
+# Copyright 2018-2025
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");

siibra/features/anchor.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2024
+# Copyright 2018-2025
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");
@@ -88,7 +88,7 @@ class AnatomicalAnchor:
 
     @property
     def space(self) -> Space:
-        # may be overriden by derived classes, e.g. in features.VolumeOfInterest
+        # may be overridden by derived classes, e.g. in features.VolumeOfInterest
         return None if self.location is None else self.location.space
 
     @property

siibra/features/connectivity/__init__.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2024
+# Copyright 2018-2025
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");

siibra/features/connectivity/functional_connectivity.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2024
+# Copyright 2018-2025
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");

siibra/features/connectivity/regional_connectivity.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2024
+# Copyright 2018-2025
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");
@@ -275,7 +275,7 @@ class RegionalConnectivity(Feature, Compoundable):
 
         regions = [r for r in matrix.index if matches(r, region)]
         if len(regions) == 0:
-            raise ValueError(f"Invalid region specificiation: {region}")
+            raise ValueError(f"Invalid region specification: {region}")
         elif len(regions) > 1:
             raise ValueError(f"Region specification {region} matched more than one profile: {regions}")
         else:

siibra/features/connectivity/streamline_counts.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2024
+# Copyright 2018-2025
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");

siibra/features/connectivity/streamline_lengths.py

@@ -1,4 +1,4 @@
-# Copyright 2018-2024
+# Copyright 2018-2025
 # Institute of Neuroscience and Medicine (INM-1), Forschungszentrum Jülich GmbH
 
 # Licensed under the Apache License, Version 2.0 (the "License");