Module stac_fastapi.types.stac¶

STAC types.

Variables¶

NumType

Classes¶

Catalog¶

class Catalog(
    /,
    *args,
    **kwargs
)

STAC Catalog.

Ancestors (in MRO)¶

builtins.dict

Methods¶

clear¶

def clear(
    ...
)

D.clear() -> None. Remove all items from D.

copy¶

def copy(
    ...
)

D.copy() -> a shallow copy of D

fromkeys¶

def fromkeys(
    iterable,
    value=None,
    /
)

Create a new dictionary with keys from iterable and values set to value.

get¶

def get(
    self,
    key,
    default=None,
    /
)

Return the value for key if key is in the dictionary, else default.

items¶

def items(
    ...
)

D.items() -> a set-like object providing a view on D's items

keys¶

def keys(
    ...
)

D.keys() -> a set-like object providing a view on D's keys

pop¶

def pop(
    ...
)

D.pop(k[,d]) -> v, remove specified key and return the corresponding value.

If the key is not found, return the default if given; otherwise, raise a KeyError.

popitem¶

def popitem(
    self,
    /
)

Remove and return a (key, value) pair as a 2-tuple.

Pairs are returned in LIFO (last-in, first-out) order. Raises KeyError if the dict is empty.

setdefault¶

def setdefault(
    self,
    key,
    default=None,
    /
)

Insert key with a value of default if key is not in the dictionary.

Return the value for key if key is in the dictionary, else default.

update¶

def update(
    ...
)

D.update([E, ]**F) -> None. Update D from dict/iterable E and F.

If E is present and has a .keys() method, then does: for k in E: D[k] = E[k] If E is present and lacks a .keys() method, then does: for k, v in E: D[k] = v In either case, this is followed by: for k in F: D[k] = F[k]

values¶

def values(
    ...
)

D.values() -> an object providing a view on D's values

Collection¶

class Collection(
    /,
    *args,
    **kwargs
)

STAC Collection.

Ancestors (in MRO)¶

builtins.dict

Methods¶

clear¶

def clear(
    ...
)

D.clear() -> None. Remove all items from D.

copy¶

def copy(
    ...
)

D.copy() -> a shallow copy of D

fromkeys¶

def fromkeys(
    iterable,
    value=None,
    /
)

Create a new dictionary with keys from iterable and values set to value.

get¶

def get(
    self,
    key,
    default=None,
    /
)

Return the value for key if key is in the dictionary, else default.

items¶

def items(
    ...
)

D.items() -> a set-like object providing a view on D's items

keys¶

def keys(
    ...
)

D.keys() -> a set-like object providing a view on D's keys

pop¶

def pop(
    ...
)

D.pop(k[,d]) -> v, remove specified key and return the corresponding value.

If the key is not found, return the default if given; otherwise, raise a KeyError.

popitem¶

def popitem(
    self,
    /
)

Remove and return a (key, value) pair as a 2-tuple.

Pairs are returned in LIFO (last-in, first-out) order. Raises KeyError if the dict is empty.

setdefault¶

def setdefault(
    self,
    key,
    default=None,
    /
)

Insert key with a value of default if key is not in the dictionary.

Return the value for key if key is in the dictionary, else default.

update¶

def update(
    ...
)

D.update([E, ]**F) -> None. Update D from dict/iterable E and F.

If E is present and has a .keys() method, then does: for k in E: D[k] = E[k] If E is present and lacks a .keys() method, then does: for k, v in E: D[k] = v In either case, this is followed by: for k in F: D[k] = F[k]

values¶

def values(
    ...
)

D.values() -> an object providing a view on D's values

Collections¶

class Collections(
    /,
    *args,
    **kwargs
)

All collections endpoint.

github.com/radiantearth/stac-api-spec/tree/master/collections

Ancestors (in MRO)¶

builtins.dict

Class variables¶

numberMatched

numberReturned

Methods¶

clear¶

def clear(
    ...
)

D.clear() -> None. Remove all items from D.

copy¶

def copy(
    ...
)

D.copy() -> a shallow copy of D

fromkeys¶

def fromkeys(
    iterable,
    value=None,
    /
)

Create a new dictionary with keys from iterable and values set to value.

get¶

def get(
    self,
    key,
    default=None,
    /
)

Return the value for key if key is in the dictionary, else default.

items¶

def items(
    ...
)

D.items() -> a set-like object providing a view on D's items

keys¶

def keys(
    ...
)

D.keys() -> a set-like object providing a view on D's keys

pop¶

def pop(
    ...
)

D.pop(k[,d]) -> v, remove specified key and return the corresponding value.

If the key is not found, return the default if given; otherwise, raise a KeyError.

popitem¶

def popitem(
    self,
    /
)

Remove and return a (key, value) pair as a 2-tuple.

Pairs are returned in LIFO (last-in, first-out) order. Raises KeyError if the dict is empty.

setdefault¶

def setdefault(
    self,
    key,
    default=None,
    /
)

Insert key with a value of default if key is not in the dictionary.

Return the value for key if key is in the dictionary, else default.

update¶

def update(
    ...
)

D.update([E, ]**F) -> None. Update D from dict/iterable E and F.

If E is present and has a .keys() method, then does: for k in E: D[k] = E[k] If E is present and lacks a .keys() method, then does: for k, v in E: D[k] = v In either case, this is followed by: for k in F: D[k] = F[k]

values¶

def values(
    ...
)

D.values() -> an object providing a view on D's values

Conformance¶

class Conformance(
    /,
    *args,
    **kwargs
)

STAC Conformance Classes.

Ancestors (in MRO)¶

builtins.dict

Methods¶

clear¶

def clear(
    ...
)

D.clear() -> None. Remove all items from D.

copy¶

def copy(
    ...
)

D.copy() -> a shallow copy of D

fromkeys¶

def fromkeys(
    iterable,
    value=None,
    /
)

Create a new dictionary with keys from iterable and values set to value.

get¶

def get(
    self,
    key,
    default=None,
    /
)

Return the value for key if key is in the dictionary, else default.

items¶

def items(
    ...
)

D.items() -> a set-like object providing a view on D's items

keys¶

def keys(
    ...
)

D.keys() -> a set-like object providing a view on D's keys

pop¶

def pop(
    ...
)

D.pop(k[,d]) -> v, remove specified key and return the corresponding value.

If the key is not found, return the default if given; otherwise, raise a KeyError.

popitem¶

def popitem(
    self,
    /
)

Remove and return a (key, value) pair as a 2-tuple.

Pairs are returned in LIFO (last-in, first-out) order. Raises KeyError if the dict is empty.

setdefault¶

def setdefault(
    self,
    key,
    default=None,
    /
)

Insert key with a value of default if key is not in the dictionary.

Return the value for key if key is in the dictionary, else default.

update¶

def update(
    ...
)

D.update([E, ]**F) -> None. Update D from dict/iterable E and F.

If E is present and has a .keys() method, then does: for k in E: D[k] = E[k] If E is present and lacks a .keys() method, then does: for k, v in E: D[k] = v In either case, this is followed by: for k in F: D[k] = F[k]

values¶

def values(
    ...
)

D.values() -> an object providing a view on D's values

Item¶

class Item(
    /,
    *args,
    **kwargs
)

STAC Item.

Ancestors (in MRO)¶

builtins.dict

Methods¶

clear¶

def clear(
    ...
)

D.clear() -> None. Remove all items from D.

copy¶

def copy(
    ...
)

D.copy() -> a shallow copy of D

fromkeys¶

def fromkeys(
    iterable,
    value=None,
    /
)

Create a new dictionary with keys from iterable and values set to value.

get¶

def get(
    self,
    key,
    default=None,
    /
)

Return the value for key if key is in the dictionary, else default.

items¶

def items(
    ...
)

D.items() -> a set-like object providing a view on D's items

keys¶

def keys(
    ...
)

D.keys() -> a set-like object providing a view on D's keys

pop¶

def pop(
    ...
)

D.pop(k[,d]) -> v, remove specified key and return the corresponding value.

If the key is not found, return the default if given; otherwise, raise a KeyError.

popitem¶

def popitem(
    self,
    /
)

Remove and return a (key, value) pair as a 2-tuple.

Pairs are returned in LIFO (last-in, first-out) order. Raises KeyError if the dict is empty.

setdefault¶

def setdefault(
    self,
    key,
    default=None,
    /
)

Insert key with a value of default if key is not in the dictionary.

Return the value for key if key is in the dictionary, else default.

update¶

def update(
    ...
)

D.update([E, ]**F) -> None. Update D from dict/iterable E and F.

If E is present and has a .keys() method, then does: for k in E: D[k] = E[k] If E is present and lacks a .keys() method, then does: for k, v in E: D[k] = v In either case, this is followed by: for k in F: D[k] = F[k]

values¶

def values(
    ...
)

D.values() -> an object providing a view on D's values

ItemCollection¶

class ItemCollection(
    /,
    *args,
    **kwargs
)

STAC Item Collection.

Ancestors (in MRO)¶

builtins.dict

Methods¶

clear¶

def clear(
    ...
)

D.clear() -> None. Remove all items from D.

copy¶

def copy(
    ...
)

D.copy() -> a shallow copy of D

fromkeys¶

def fromkeys(
    iterable,
    value=None,
    /
)

Create a new dictionary with keys from iterable and values set to value.

get¶

def get(
    self,
    key,
    default=None,
    /
)

Return the value for key if key is in the dictionary, else default.

items¶

def items(
    ...
)

D.items() -> a set-like object providing a view on D's items

keys¶

def keys(
    ...
)

D.keys() -> a set-like object providing a view on D's keys

pop¶

def pop(
    ...
)

D.pop(k[,d]) -> v, remove specified key and return the corresponding value.

If the key is not found, return the default if given; otherwise, raise a KeyError.

popitem¶

def popitem(
    self,
    /
)

Remove and return a (key, value) pair as a 2-tuple.

Pairs are returned in LIFO (last-in, first-out) order. Raises KeyError if the dict is empty.

setdefault¶

def setdefault(
    self,
    key,
    default=None,
    /
)

Insert key with a value of default if key is not in the dictionary.

Return the value for key if key is in the dictionary, else default.

update¶

def update(
    ...
)

D.update([E, ]**F) -> None. Update D from dict/iterable E and F.

If E is present and has a .keys() method, then does: for k in E: D[k] = E[k] If E is present and lacks a .keys() method, then does: for k, v in E: D[k] = v In either case, this is followed by: for k in F: D[k] = F[k]

values¶

def values(
    ...
)

D.values() -> an object providing a view on D's values

LandingPage¶

class LandingPage(
    /,
    *args,
    **kwargs
)

STAC Landing Page.

Ancestors (in MRO)¶

builtins.dict

Methods¶

clear¶

def clear(
    ...
)

D.clear() -> None. Remove all items from D.

copy¶

def copy(
    ...
)

D.copy() -> a shallow copy of D

fromkeys¶

def fromkeys(
    iterable,
    value=None,
    /
)

Create a new dictionary with keys from iterable and values set to value.

get¶

def get(
    self,
    key,
    default=None,
    /
)

Return the value for key if key is in the dictionary, else default.

items¶

def items(
    ...
)

D.items() -> a set-like object providing a view on D's items

keys¶

def keys(
    ...
)

D.keys() -> a set-like object providing a view on D's keys

pop¶

def pop(
    ...
)

D.pop(k[,d]) -> v, remove specified key and return the corresponding value.

If the key is not found, return the default if given; otherwise, raise a KeyError.

popitem¶

def popitem(
    self,
    /
)

Remove and return a (key, value) pair as a 2-tuple.

Pairs are returned in LIFO (last-in, first-out) order. Raises KeyError if the dict is empty.

setdefault¶

def setdefault(
    self,
    key,
    default=None,
    /
)

Insert key with a value of default if key is not in the dictionary.

Return the value for key if key is in the dictionary, else default.

update¶

def update(
    ...
)

D.update([E, ]**F) -> None. Update D from dict/iterable E and F.

If E is present and has a .keys() method, then does: for k in E: D[k] = E[k] If E is present and lacks a .keys() method, then does: for k, v in E: D[k] = v In either case, this is followed by: for k in F: D[k] = F[k]

values¶

def values(
    ...
)

D.values() -> an object providing a view on D's values