Skip to content
Snippets Groups Projects
Commit e84e046e authored by MIRANDA GONZALES Marcelo's avatar MIRANDA GONZALES Marcelo
Browse files

Delete Dijkstra.html

parent c0643c78
No related branches found
No related tags found
No related merge requests found
Hide whitespace changes
Inline Side-by-side
Showing
with 0 additions and 236 deletions
Dijkstra.html deleted 100644 → 0
+ 0
− 236
View file @ c0643c78
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<html><head><title>Python: module Dijkstra</title>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
</head><body bgcolor="#f0f0f8">
<table width="100%" cellspacing=0 cellpadding=2 border=0 summary="heading">
<tr bgcolor="#7799ee">
<td valign=bottom>&nbsp;<br>
<font color="#ffffff" face="helvetica, arial">&nbsp;<br><big><big><strong>Dijkstra</strong></big></big></font></td
><td align=right valign=bottom
><font color="#ffffff" face="helvetica, arial"><a href=".">index</a><br><a href="file:c%3A%5Cusers%5Cgauti%5Conedrive%5Cdocuments%5Cimt%20atlantique%5Ca1%5Ccours%5Cinformatique%5Cs5%5Cpyrat_workspace%5Cplayers%5Cdijkstra.py">c:\users\gauti\onedrive\documents\imt atlantique\a1\cours\informatique\s5\pyrat_workspace\players\dijkstra.py</a></font></td></tr></table>
<p><tt>This&nbsp;file&nbsp;contains&nbsp;useful&nbsp;elements&nbsp;to&nbsp;define&nbsp;a&nbsp;particular&nbsp;player.<br>
In&nbsp;order&nbsp;to&nbsp;use&nbsp;this&nbsp;player,&nbsp;you&nbsp;need&nbsp;to&nbsp;instanciate&nbsp;it&nbsp;and&nbsp;add&nbsp;it&nbsp;to&nbsp;a&nbsp;game.<br>
Please&nbsp;refer&nbsp;to&nbsp;example&nbsp;games&nbsp;to&nbsp;see&nbsp;how&nbsp;to&nbsp;do&nbsp;it&nbsp;properly.</tt></p>
<p>
<table width="100%" cellspacing=0 cellpadding=2 border=0 summary="section">
<tr bgcolor="#ee77aa">
<td colspan=3 valign=bottom>&nbsp;<br>
<font color="#ffffff" face="helvetica, arial"><big><strong>Classes</strong></big></font></td></tr>
<tr><td bgcolor="#ee77aa"><tt>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</tt></td><td>&nbsp;</td>
<td width="100%"><dl>
<dt><font face="helvetica, arial"><a href="pyrat.src.Player.html#Player">pyrat.src.Player.Player</a>(<a href="abc.html#ABC">abc.ABC</a>)
</font></dt><dd>
<dl>
<dt><font face="helvetica, arial"><a href="Dijkstra.html#Dijkstra">Dijkstra</a>
</font></dt></dl>
</dd>
</dl>
<p>
<table width="100%" cellspacing=0 cellpadding=2 border=0 summary="section">
<tr bgcolor="#ffc8d8">
<td colspan=3 valign=bottom>&nbsp;<br>
<font color="#000000" face="helvetica, arial"><a name="Dijkstra">class <strong>Dijkstra</strong></a>(<a href="pyrat.src.Player.html#Player">pyrat.src.Player.Player</a>)</font></td></tr>
<tr bgcolor="#ffc8d8"><td rowspan=2><tt>&nbsp;&nbsp;&nbsp;</tt></td>
<td colspan=2><tt><a href="#Dijkstra">Dijkstra</a>(*args:&nbsp;typing_extensions.Any,&nbsp;**kwargs:&nbsp;typing_extensions.Any)&nbsp;-&amp;gt;&nbsp;typing_extensions.Self<br>
&nbsp;<br>
This&nbsp;player&nbsp;is&nbsp;basically&nbsp;a&nbsp;player&nbsp;that&nbsp;does&nbsp;nothing&nbsp;except&nbsp;printing&nbsp;the&nbsp;phase&nbsp;of&nbsp;the&nbsp;game.<br>
It&nbsp;is&nbsp;meant&nbsp;to&nbsp;be&nbsp;used&nbsp;as&nbsp;a&nbsp;template&nbsp;to&nbsp;create&nbsp;new&nbsp;players.<br>
Methods&nbsp;"preprocessing"&nbsp;and&nbsp;"postprocessing"&nbsp;are&nbsp;optional.<br>
Method&nbsp;"turn"&nbsp;is&nbsp;mandatory.<br>&nbsp;</tt></td></tr>
<tr><td>&nbsp;</td>
<td width="100%"><dl><dt>Method resolution order:</dt>
<dd><a href="Dijkstra.html#Dijkstra">Dijkstra</a></dd>
<dd><a href="pyrat.src.Player.html#Player">pyrat.src.Player.Player</a></dd>
<dd><a href="abc.html#ABC">abc.ABC</a></dd>
<dd><a href="builtins.html#object">builtins.object</a></dd>
</dl>
<hr>
Methods defined here:<br>
<dl><dt><a name="Dijkstra-__init__"><strong>__init__</strong></a>(self: typing_extensions.Self, *args: typing_extensions.Any, **kwargs: typing_extensions.Any) -&gt; typing_extensions.Self</dt><dd><tt>This&nbsp;function&nbsp;is&nbsp;the&nbsp;constructor&nbsp;of&nbsp;the&nbsp;class.<br>
When&nbsp;an&nbsp;object&nbsp;is&nbsp;instantiated,&nbsp;this&nbsp;method&nbsp;is&nbsp;called&nbsp;to&nbsp;initialize&nbsp;the&nbsp;object.<br>
This&nbsp;is&nbsp;where&nbsp;you&nbsp;should&nbsp;define&nbsp;the&nbsp;attributes&nbsp;of&nbsp;the&nbsp;object&nbsp;and&nbsp;set&nbsp;their&nbsp;initial&nbsp;values.<br>
Arguments&nbsp;*args&nbsp;and&nbsp;**kwargs&nbsp;are&nbsp;used&nbsp;to&nbsp;pass&nbsp;arguments&nbsp;to&nbsp;the&nbsp;parent&nbsp;constructor.<br>
This&nbsp;is&nbsp;useful&nbsp;not&nbsp;to&nbsp;declare&nbsp;again&nbsp;all&nbsp;the&nbsp;parent's&nbsp;attributes&nbsp;in&nbsp;the&nbsp;child&nbsp;class.<br>
In:<br>
&nbsp;&nbsp;&nbsp;&nbsp;*&nbsp;self:&nbsp;&nbsp;&nbsp;Reference&nbsp;to&nbsp;the&nbsp;current&nbsp;object.<br>
&nbsp;&nbsp;&nbsp;&nbsp;*&nbsp;args:&nbsp;&nbsp;&nbsp;Arguments&nbsp;to&nbsp;pass&nbsp;to&nbsp;the&nbsp;parent&nbsp;constructor.<br>
&nbsp;&nbsp;&nbsp;&nbsp;*&nbsp;kwargs:&nbsp;Keyword&nbsp;arguments&nbsp;to&nbsp;pass&nbsp;to&nbsp;the&nbsp;parent&nbsp;constructor.<br>
Out:<br>
&nbsp;&nbsp;&nbsp;&nbsp;*&nbsp;A&nbsp;new&nbsp;instance&nbsp;of&nbsp;the&nbsp;class.</tt></dd></dl>
<dl><dt><a name="Dijkstra-find_route"><strong>find_route</strong></a>(self: typing_extensions.Self, routing_table: Dict[numbers.Integral, Optional[numbers.Integral]], source: numbers.Integral, target: numbers.Integral) -&gt; List[numbers.Integral]</dt><dd><tt>This&nbsp;method&nbsp;finds&nbsp;the&nbsp;route&nbsp;from&nbsp;the&nbsp;source&nbsp;to&nbsp;the&nbsp;target&nbsp;using&nbsp;the&nbsp;routing&nbsp;table.<br>
More&nbsp;precisely,&nbsp;it&nbsp;takes&nbsp;the&nbsp;routing&nbsp;table&nbsp;and&nbsp;reconstructs&nbsp;the&nbsp;shortest&nbsp;path&nbsp;from&nbsp;<br>
source&nbsp;to&nbsp;target&nbsp;by&nbsp;backtracking&nbsp;through&nbsp;each&nbsp;node's&nbsp;predecessor.&nbsp;The&nbsp;output&nbsp;is&nbsp;a&nbsp;<br>
list&nbsp;of&nbsp;nodes&nbsp;representing&nbsp;the&nbsp;shortest&nbsp;path&nbsp;from&nbsp;the&nbsp;source&nbsp;to&nbsp;the&nbsp;target.<br>
In:<br>
&nbsp;&nbsp;&nbsp;&nbsp;*&nbsp;self:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Reference&nbsp;to&nbsp;the&nbsp;current&nbsp;object.<br>
&nbsp;&nbsp;&nbsp;&nbsp;*&nbsp;routing_table:&nbsp;The&nbsp;routing&nbsp;table.<br>
&nbsp;&nbsp;&nbsp;&nbsp;*&nbsp;source:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;The&nbsp;source&nbsp;vertex.<br>
&nbsp;&nbsp;&nbsp;&nbsp;*&nbsp;target:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;The&nbsp;target&nbsp;vertex.<br>
Out:<br>
&nbsp;&nbsp;&nbsp;&nbsp;*&nbsp;route:&nbsp;The&nbsp;route&nbsp;from&nbsp;the&nbsp;source&nbsp;to&nbsp;the&nbsp;target.</tt></dd></dl>
<dl><dt><a name="Dijkstra-postprocessing"><strong>postprocessing</strong></a>(self: typing_extensions.Self, maze: pyrat.src.Maze.Maze, game_state: pyrat.src.GameState.GameState, stats: Dict[str, typing_extensions.Any]) -&gt; None</dt><dd><tt>This&nbsp;method&nbsp;redefines&nbsp;the&nbsp;method&nbsp;of&nbsp;the&nbsp;parent&nbsp;class.<br>
It&nbsp;is&nbsp;called&nbsp;once&nbsp;at&nbsp;the&nbsp;end&nbsp;of&nbsp;the&nbsp;game.<br>
In:<br>
&nbsp;&nbsp;&nbsp;&nbsp;*&nbsp;self:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Reference&nbsp;to&nbsp;the&nbsp;current&nbsp;object.<br>
&nbsp;&nbsp;&nbsp;&nbsp;*&nbsp;maze:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;An&nbsp;object&nbsp;representing&nbsp;the&nbsp;maze&nbsp;in&nbsp;which&nbsp;the&nbsp;player&nbsp;plays.<br>
&nbsp;&nbsp;&nbsp;&nbsp;*&nbsp;game_state:&nbsp;An&nbsp;object&nbsp;representing&nbsp;the&nbsp;state&nbsp;of&nbsp;the&nbsp;game.<br>
&nbsp;&nbsp;&nbsp;&nbsp;*&nbsp;stats:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Statistics&nbsp;about&nbsp;the&nbsp;game.<br>
Out:<br>
&nbsp;&nbsp;&nbsp;&nbsp;*&nbsp;None.</tt></dd></dl>
<dl><dt><a name="Dijkstra-preprocessing"><strong>preprocessing</strong></a>(self: typing_extensions.Self, maze: pyrat.src.Maze.Maze, game_state: pyrat.src.GameState.GameState) -&gt; None</dt><dd><tt>This&nbsp;method&nbsp;redefines&nbsp;the&nbsp;method&nbsp;of&nbsp;the&nbsp;parent&nbsp;class.<br>
It&nbsp;is&nbsp;called&nbsp;once&nbsp;at&nbsp;the&nbsp;beginning&nbsp;of&nbsp;the&nbsp;game.<br>
In:<br>
&nbsp;&nbsp;&nbsp;&nbsp;*&nbsp;self:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Reference&nbsp;to&nbsp;the&nbsp;current&nbsp;object.<br>
&nbsp;&nbsp;&nbsp;&nbsp;*&nbsp;maze:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;An&nbsp;object&nbsp;representing&nbsp;the&nbsp;maze&nbsp;in&nbsp;which&nbsp;the&nbsp;player&nbsp;plays.<br>
&nbsp;&nbsp;&nbsp;&nbsp;*&nbsp;game_state:&nbsp;An&nbsp;object&nbsp;representing&nbsp;the&nbsp;state&nbsp;of&nbsp;the&nbsp;game.<br>
Out:<br>
&nbsp;&nbsp;&nbsp;&nbsp;*&nbsp;None.</tt></dd></dl>
<dl><dt><a name="Dijkstra-traversal"><strong>traversal</strong></a>(self: typing_extensions.Self, graph: pyrat.src.Graph.Graph, source: numbers.Integral) -&gt; Tuple[Dict[numbers.Integral, numbers.Integral], Dict[numbers.Integral, Optional[numbers.Integral]]]</dt><dd><tt>Performs&nbsp;<a href="#Dijkstra">Dijkstra</a>'s&nbsp;algorithm&nbsp;traversal&nbsp;from&nbsp;a&nbsp;source&nbsp;vertex.&nbsp;More&nbsp;precisely,&nbsp;it&nbsp;starts&nbsp;<br>
from&nbsp;a&nbsp;source&nbsp;node&nbsp;and&nbsp;sets&nbsp;distances&nbsp;to&nbsp;all&nbsp;other&nbsp;nodes&nbsp;as&nbsp;infinity.&nbsp;Then,&nbsp;it&nbsp;explores&nbsp;<br>
the&nbsp;closest&nbsp;unexplored&nbsp;nodes&nbsp;first,&nbsp;updating&nbsp;distances&nbsp;as&nbsp;shorter&nbsp;paths&nbsp;are&nbsp;found.&nbsp;It&nbsp;<br>
uses&nbsp;a&nbsp;priority&nbsp;queue&nbsp;to&nbsp;always&nbsp;process&nbsp;the&nbsp;closest&nbsp;node&nbsp;first.<br>
In:<br>
&nbsp;&nbsp;&nbsp;&nbsp;*&nbsp;self:&nbsp;&nbsp;&nbsp;Reference&nbsp;to&nbsp;the&nbsp;current&nbsp;object<br>
&nbsp;&nbsp;&nbsp;&nbsp;*&nbsp;maze:&nbsp;&nbsp;&nbsp;An&nbsp;object&nbsp;representing&nbsp;the&nbsp;maze&nbsp;in&nbsp;which&nbsp;the&nbsp;player&nbsp;plays<br>
&nbsp;&nbsp;&nbsp;&nbsp;*&nbsp;source:&nbsp;The&nbsp;source&nbsp;vertex<br>
Out:<br>
&nbsp;&nbsp;&nbsp;&nbsp;*&nbsp;The&nbsp;routing&nbsp;table&nbsp;and&nbsp;distances</tt></dd></dl>
<dl><dt><a name="Dijkstra-turn"><strong>turn</strong></a>(self: typing_extensions.Self, maze: pyrat.src.Maze.Maze, game_state: pyrat.src.GameState.GameState) -&gt; pyrat.src.enums.Action</dt><dd><tt>This&nbsp;method&nbsp;redefines&nbsp;the&nbsp;abstract&nbsp;method&nbsp;of&nbsp;the&nbsp;parent&nbsp;class.<br>
It&nbsp;is&nbsp;called&nbsp;at&nbsp;each&nbsp;turn&nbsp;of&nbsp;the&nbsp;game.<br>
It&nbsp;returns&nbsp;an&nbsp;action&nbsp;to&nbsp;perform&nbsp;among&nbsp;the&nbsp;possible&nbsp;actions,&nbsp;defined&nbsp;in&nbsp;the&nbsp;Action&nbsp;enumeration.<br>
In:<br>
&nbsp;&nbsp;&nbsp;&nbsp;*&nbsp;self:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Reference&nbsp;to&nbsp;the&nbsp;current&nbsp;object.<br>
&nbsp;&nbsp;&nbsp;&nbsp;*&nbsp;maze:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;An&nbsp;object&nbsp;representing&nbsp;the&nbsp;maze&nbsp;in&nbsp;which&nbsp;the&nbsp;player&nbsp;plays.<br>
&nbsp;&nbsp;&nbsp;&nbsp;*&nbsp;game_state:&nbsp;An&nbsp;object&nbsp;representing&nbsp;the&nbsp;state&nbsp;of&nbsp;the&nbsp;game.<br>
Out:<br>
&nbsp;&nbsp;&nbsp;&nbsp;*&nbsp;action:&nbsp;One&nbsp;of&nbsp;the&nbsp;possible&nbsp;actions.</tt></dd></dl>
<hr>
Data and other attributes defined here:<br>
<dl><dt><strong>__abstractmethods__</strong> = frozenset()</dl>
<dl><dt><strong>path</strong> = []</dl>
<hr>
Readonly properties inherited from <a href="pyrat.src.Player.html#Player">pyrat.src.Player.Player</a>:<br>
<dl><dt><strong>name</strong></dt>
<dd><tt>Getter&nbsp;for&nbsp;__name.<br>
In:<br>
&nbsp;&nbsp;&nbsp;&nbsp;*&nbsp;self:&nbsp;Reference&nbsp;to&nbsp;the&nbsp;current&nbsp;object.<br>
Out:<br>
&nbsp;&nbsp;&nbsp;&nbsp;*&nbsp;self.<strong>__name</strong>:&nbsp;The&nbsp;__name&nbsp;attribute.</tt></dd>
</dl>
<hr>
Data descriptors inherited from <a href="pyrat.src.Player.html#Player">pyrat.src.Player.Player</a>:<br>
<dl><dt><strong>__dict__</strong></dt>
<dd><tt>dictionary&nbsp;for&nbsp;instance&nbsp;variables&nbsp;(if&nbsp;defined)</tt></dd>
</dl>
<dl><dt><strong>__weakref__</strong></dt>
<dd><tt>list&nbsp;of&nbsp;weak&nbsp;references&nbsp;to&nbsp;the&nbsp;object&nbsp;(if&nbsp;defined)</tt></dd>
</dl>
<dl><dt><strong>skin</strong></dt>
<dd><tt>Getter&nbsp;for&nbsp;__skin.<br>
In:<br>
&nbsp;&nbsp;&nbsp;&nbsp;*&nbsp;self:&nbsp;Reference&nbsp;to&nbsp;the&nbsp;current&nbsp;object.<br>
Out:<br>
&nbsp;&nbsp;&nbsp;&nbsp;*&nbsp;self.<strong>__skin</strong>:&nbsp;The&nbsp;__skin&nbsp;attribute.</tt></dd>
</dl>
</td></tr></table></td></tr></table><p>
<table width="100%" cellspacing=0 cellpadding=2 border=0 summary="section">
<tr bgcolor="#eeaa77">
<td colspan=3 valign=bottom>&nbsp;<br>
<font color="#ffffff" face="helvetica, arial"><big><strong>Functions</strong></big></font></td></tr>
<tr><td bgcolor="#eeaa77"><tt>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</tt></td><td>&nbsp;</td>
<td width="100%"><dl><dt><a name="-heapify"><strong>heapify</strong></a>(heap, /)</dt><dd><tt>Transform&nbsp;list&nbsp;into&nbsp;a&nbsp;heap,&nbsp;in-place,&nbsp;in&nbsp;O(len(heap))&nbsp;time.</tt></dd></dl>
<dl><dt><a name="-heappop"><strong>heappop</strong></a>(heap, /)</dt><dd><tt>Pop&nbsp;the&nbsp;smallest&nbsp;item&nbsp;off&nbsp;the&nbsp;heap,&nbsp;maintaining&nbsp;the&nbsp;heap&nbsp;invariant.</tt></dd></dl>
<dl><dt><a name="-heappush"><strong>heappush</strong></a>(heap, item, /)</dt><dd><tt>Push&nbsp;item&nbsp;onto&nbsp;heap,&nbsp;maintaining&nbsp;the&nbsp;heap&nbsp;invariant.</tt></dd></dl>
<dl><dt><a name="-heappushpop"><strong>heappushpop</strong></a>(heap, item, /)</dt><dd><tt>Push&nbsp;item&nbsp;on&nbsp;the&nbsp;heap,&nbsp;then&nbsp;pop&nbsp;and&nbsp;return&nbsp;the&nbsp;smallest&nbsp;item&nbsp;from&nbsp;the&nbsp;heap.<br>
&nbsp;<br>
The&nbsp;combined&nbsp;action&nbsp;runs&nbsp;more&nbsp;efficiently&nbsp;than&nbsp;<a href="#-heappush">heappush</a>()&nbsp;followed&nbsp;by<br>
a&nbsp;separate&nbsp;call&nbsp;to&nbsp;<a href="#-heappop">heappop</a>().</tt></dd></dl>
<dl><dt><a name="-heapreplace"><strong>heapreplace</strong></a>(heap, item, /)</dt><dd><tt>Pop&nbsp;and&nbsp;return&nbsp;the&nbsp;current&nbsp;smallest&nbsp;value,&nbsp;and&nbsp;add&nbsp;the&nbsp;new&nbsp;item.<br>
&nbsp;<br>
This&nbsp;is&nbsp;more&nbsp;efficient&nbsp;than&nbsp;<a href="#-heappop">heappop</a>()&nbsp;followed&nbsp;by&nbsp;<a href="#-heappush">heappush</a>(),&nbsp;and&nbsp;can&nbsp;be<br>
more&nbsp;appropriate&nbsp;when&nbsp;using&nbsp;a&nbsp;fixed-size&nbsp;heap.&nbsp;&nbsp;Note&nbsp;that&nbsp;the&nbsp;value<br>
returned&nbsp;may&nbsp;be&nbsp;larger&nbsp;than&nbsp;item!&nbsp;&nbsp;That&nbsp;constrains&nbsp;reasonable&nbsp;uses&nbsp;of<br>
this&nbsp;routine&nbsp;unless&nbsp;written&nbsp;as&nbsp;part&nbsp;of&nbsp;a&nbsp;conditional&nbsp;replacement:<br>
&nbsp;<br>
&nbsp;&nbsp;&nbsp;&nbsp;if&nbsp;item&nbsp;&gt;&nbsp;heap[0]:<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;item&nbsp;=&nbsp;<a href="#-heapreplace">heapreplace</a>(heap,&nbsp;item)</tt></dd></dl>
</td></tr></table><p>
<table width="100%" cellspacing=0 cellpadding=2 border=0 summary="section">
<tr bgcolor="#55aa55">
<td colspan=3 valign=bottom>&nbsp;<br>
<font color="#ffffff" face="helvetica, arial"><big><strong>Data</strong></big></font></td></tr>
<tr><td bgcolor="#55aa55"><tt>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</tt></td><td>&nbsp;</td>
<td width="100%"><strong>AbstractSet</strong> = typing.AbstractSet<br>
<strong>AnyStr</strong> = ~AnyStr<br>
<strong>AsyncContextManager</strong> = typing.AsyncContextManager<br>
<strong>AsyncGenerator</strong> = typing.AsyncGenerator<br>
<strong>AsyncIterable</strong> = typing.AsyncIterable<br>
<strong>AsyncIterator</strong> = typing.AsyncIterator<br>
<strong>Awaitable</strong> = typing.Awaitable<br>
<strong>ByteString</strong> = typing.ByteString<br>
<strong>Callable</strong> = typing.Callable<br>
<strong>ChainMap</strong> = typing.ChainMap<br>
<strong>ClassVar</strong> = typing.ClassVar<br>
<strong>Collection</strong> = typing.Collection<br>
<strong>Concatenate</strong> = typing.Concatenate<br>
<strong>Container</strong> = typing.Container<br>
<strong>ContextManager</strong> = typing.ContextManager<br>
<strong>Coroutine</strong> = typing.Coroutine<br>
<strong>Counter</strong> = typing.Counter<br>
<strong>DefaultDict</strong> = typing.DefaultDict<br>
<strong>Deque</strong> = typing.Deque<br>
<strong>Dict</strong> = typing.Dict<br>
<strong>Final</strong> = typing.Final<br>
<strong>FrozenSet</strong> = typing.FrozenSet<br>
<strong>Generator</strong> = typing.Generator<br>
<strong>Hashable</strong> = typing.Hashable<br>
<strong>ItemsView</strong> = typing.ItemsView<br>
<strong>Iterable</strong> = typing.Iterable<br>
<strong>Iterator</strong> = typing.Iterator<br>
<strong>KeysView</strong> = typing.KeysView<br>
<strong>List</strong> = typing.List<br>
<strong>Literal</strong> = typing.Literal<br>
<strong>LiteralString</strong> = typing_extensions.LiteralString<br>
<strong>Mapping</strong> = typing.Mapping<br>
<strong>MappingView</strong> = typing.MappingView<br>
<strong>Match</strong> = typing.Match<br>
<strong>MutableMapping</strong> = typing.MutableMapping<br>
<strong>MutableSequence</strong> = typing.MutableSequence<br>
<strong>MutableSet</strong> = typing.MutableSet<br>
<strong>Never</strong> = typing_extensions.Never<br>
<strong>NoDefault</strong> = typing_extensions.NoDefault<br>
<strong>NoReturn</strong> = typing.NoReturn<br>
<strong>NotRequired</strong> = typing_extensions.NotRequired<br>
<strong>Optional</strong> = typing.Optional<br>
<strong>OrderedDict</strong> = typing.OrderedDict<br>
<strong>Pattern</strong> = typing.Pattern<br>
<strong>ReadOnly</strong> = typing_extensions.ReadOnly<br>
<strong>Required</strong> = typing_extensions.Required<br>
<strong>Reversible</strong> = typing.Reversible<br>
<strong>Self</strong> = typing_extensions.Self<br>
<strong>Sequence</strong> = typing.Sequence<br>
<strong>Set</strong> = typing.Set<br>
<strong>Sized</strong> = typing.Sized<br>
<strong>TYPE_CHECKING</strong> = False<br>
<strong>Tuple</strong> = typing.Tuple<br>
<strong>Type</strong> = typing.Type<br>
<strong>TypeAlias</strong> = typing.TypeAlias<br>
<strong>TypeGuard</strong> = typing.TypeGuard<br>
<strong>TypeIs</strong> = typing_extensions.TypeIs<br>
<strong>Union</strong> = typing.Union<br>
<strong>Unpack</strong> = typing_extensions.Unpack<br>
<strong>ValuesView</strong> = typing.ValuesView</td></tr></table>
</body></html>
\ No newline at end of file
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Please register or to comment