diff --git a/.nojekyll b/.nojekyll new file mode 100644 index 0000000..e69de29 diff --git a/404.html b/404.html new file mode 100644 index 0000000..673471f --- /dev/null +++ b/404.html @@ -0,0 +1,310 @@ + + + + + + + + + + + + + + + + + + + tspwplib + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ +
+
+ +
+ + + + + + +
+ + +
+ +
+ + + + + + +
+
+ + + +
+
+
+ + + + + +
+
+
+ + + +
+
+
+ + + +
+
+
+ + + +
+
+ +

404 - Not found

+ +
+
+ + + +
+ +
+ + + +
+
+
+
+ + + + + + + + + + \ No newline at end of file diff --git a/api/index.html b/api/index.html new file mode 100644 index 0000000..953cbb9 --- /dev/null +++ b/api/index.html @@ -0,0 +1,13070 @@ + + + + + + + + + + + + + + + + + + + + + + + API - tspwplib + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + + Skip to content + + +
+
+ +
+ + + + + + +
+ + +
+ +
+ + + + + + +
+
+ + + +
+
+
+ + + + + +
+
+
+ + + +
+
+
+ + + +
+
+
+ + + +
+
+ + + + +

API

+ + +
+ + + + +
+ +

Travelling Salesman Problem with Profits library

+ + + +
+ + + + + + + + +
+ + + +

+ Alpha + + +

+ + +
+

+ Bases: IntEnum

+ + +

Ratio between profit/cost limit and profit/cost of TSP solution

+ +
+ Source code in tspwplib/types.py + 
304
+305
+306
+307
class Alpha(IntEnum):
+    """Ratio between profit/cost limit and profit/cost of TSP solution"""
+
+    fifty = 50
+
+
+ + + +
+ + + + + + + + + + + +
+ +
+ + +
+ +
+ + + +

+ BaseTSP + + +

+ + +
+

+ Bases: BaseModel

+ + +

A pydantic model for tsplib95.

+

Each field is validated with type hinting.

+ +
+ Source code in tspwplib/problem.py + 
 47
+ 48
+ 49
+ 50
+ 51
+ 52
+ 53
+ 54
+ 55
+ 56
+ 57
+ 58
+ 59
+ 60
+ 61
+ 62
+ 63
+ 64
+ 65
+ 66
+ 67
+ 68
+ 69
+ 70
+ 71
+ 72
+ 73
+ 74
+ 75
+ 76
+ 77
+ 78
+ 79
+ 80
+ 81
+ 82
+ 83
+ 84
+ 85
+ 86
+ 87
+ 88
+ 89
+ 90
+ 91
+ 92
+ 93
+ 94
+ 95
+ 96
+ 97
+ 98
+ 99
+100
+101
+102
+103
+104
+105
+106
+107
+108
+109
+110
+111
+112
+113
+114
+115
+116
+117
+118
+119
+120
+121
+122
+123
+124
+125
+126
+127
+128
+129
+130
+131
+132
+133
+134
+135
+136
+137
+138
+139
+140
+141
+142
+143
+144
+145
+146
+147
+148
+149
+150
+151
+152
+153
+154
+155
+156
+157
+158
+159
+160
+161
+162
+163
+164
+165
+166
+167
+168
+169
+170
+171
+172
+173
+174
+175
+176
+177
+178
+179
+180
+181
+182
+183
+184
+185
+186
+187
+188
+189
+190
+191
+192
+193
+194
+195
+196
+197
+198
+199
+200
+201
+202
+203
+204
+205
+206
+207
+208
+209
+210
+211
+212
+213
+214
+215
+216
+217
+218
+219
+220
+221
+222
+223
+224
+225
+226
+227
+228
+229
+230
+231
+232
+233
+234
+235
+236
+237
+238
+239
+240
+241
+242
+243
+244
+245
+246
+247
+248
+249
+250
+251
+252
+253
+254
+255
+256
+257
+258
+259
+260
+261
+262
+263
+264
+265
+266
+267
+268
+269
+270
+271
+272
+273
+274
+275
+276
+277
+278
+279
+280
+281
+282
+283
+284
+285
+286
+287
+288
+289
+290
+291
+292
+293
+294
+295
+296
+297
+298
+299
+300
+301
+302
+303
+304
+305
+306
+307
+308
+309
+310
+311
+312
+313
+314
+315
+316
+317
+318
+319
+320
+321
+322
+323
+324
+325
+326
+327
+328
+329
+330
+331
+332
+333
+334
+335
+336
+337
+338
+339
+340
+341
+342
+343
+344
+345
+346
+347
+348
+349
+350
+351
+352
+353
+354
+355
+356
+357
+358
+359
+360
+361
+362
+363
+364
+365
+366
+367
+368
+369
+370
+371
+372
+373
+374
+375
+376
+377
+378
+379
+380
+381
+382
+383
+384
+385
+386
+387
+388
+389
+390
+391
+392
+393
+394
+395
+396
+397
+398
+399
+400
+401
+402
+403
+404
+405
+406
+407
+408
+409
+410
+411
+412
+413
+414
+415
+416
+417
+418
+419
+420
+421
+422
+423
+424
+425
+426
+427
+428
+429
+430
+431
+432
+433
+434
+435
+436
+437
+438
+439
+440
+441
+442
+443
+444
class BaseTSP(pydantic.BaseModel):
+    """A pydantic model for tsplib95.
+
+    Each field is validated with type hinting.
+    """
+
+    # pylint: disable=too-many-arguments
+
+    capacity: Optional[Union[int, float]] = None
+    comment: str
+    demands: Optional[VertexFunction]
+    depots: VertexList
+    dimension: int
+    display_data: Optional[NodeCoords] = None
+    display_data_type: DisplayDataType
+    edge_data: SimpleEdgeList
+    edge_data_format: EdgeDataFormat
+    edge_weights: Optional[SimpleEdgeFunction] = None
+    edge_weight_format: EdgeWeightFormat
+    edge_weight_type: EdgeWeightType
+    fixed_edges: SimpleEdgeList
+    name: str
+    node_coords: Optional[NodeCoords] = None
+    node_coord_type: NodeCoordType
+    problem_type: str
+    tours: Optional[List[VertexList]] = None
+
+    class Config:
+        """Pydantic configuration"""
+
+        arbitrary_types_allowed = True
+
+    @classmethod
+    def from_networkx(
+        cls,
+        name: str,
+        comment: str,
+        problem_type: str,
+        G: nx.Graph,
+        capacity: Optional[Union[int, float]] = None,
+        display_data: Optional[NodeCoords] = None,
+        display_data_type: DisplayDataType = DisplayDataType.NO_DISPLAY,
+        edge_weight_format: EdgeWeightFormat = EdgeWeightFormat.FULL_MATRIX,
+        weight_attr_name: str = "weight",
+    ):
+        """Get a base TSP model from a networkx graph"""
+        edge_attr_names = edge_attribute_names(G)
+        node_attr_names = node_attribute_names(G)
+        if weight_attr_name not in edge_attr_names:
+            message = f"{weight_attr_name} is required to be an edge attribute, "
+            message += "but was not found in graph. "
+            message += "This function only supports an explicit weight function. "
+            raise NotImplementedError(message)
+        is_2d = "x" in node_attr_names and "y" in node_attr_names
+        is_3d = is_2d and "z" in node_attr_names
+        if is_3d:
+            raise NotImplementedError("3D coords are not supported")
+            # node_coord_type = NodeCoordType.THREED_COORDS
+            # node_coords = {
+            #     node: (float(data["x"]), float(data["y"]), float(data["z"]))
+            #     for node, data in G.nodes(data=True)
+            # }
+        if is_2d:
+            node_coord_type = NodeCoordType.TWOD_COORDS
+            node_coords = {
+                node: (float(data["x"]), float(data["y"]))
+                for node, data in G.nodes(data=True)
+            }
+        else:
+            node_coord_type = NodeCoordType.NO_COORDS
+            node_coords = {}
+
+        demands = None
+        if "demand" in node_attr_names:
+            demands = nx.get_node_attributes(G, "demand")
+        if display_data_type == DisplayDataType.COORD_DISPLAY:
+            display_data = node_coords
+
+        fixed_edges = []
+        if "is_fixed" in edge_attr_names:
+            fixed_edges = [
+                (u, v) for u, v, data in G.edges(data=True) if data["is_fixed"]
+            ]
+
+        depots = []
+        if "is_depot" in node_attr_names:
+            depots = [node for node, data in G.nodes(data=True) if data["is_depot"]]
+        edge_data = list(G.edges())
+        edge_weights = nx.get_edge_attributes(G, weight_attr_name)
+        return cls(
+            capacity=capacity,
+            comment=comment,
+            demands=demands,
+            depots=depots,
+            dimension=G.number_of_nodes(),
+            display_data=display_data,
+            display_data_type=display_data_type,
+            edge_data=edge_data,
+            edge_data_format=EdgeDataFormat.EDGE_LIST,
+            edge_weights=edge_weights,
+            edge_weight_format=edge_weight_format,
+            edge_weight_type=EdgeWeightType.EXPLICIT,
+            fixed_edges=fixed_edges,
+            name=name,
+            node_coords=node_coords,
+            node_coord_type=node_coord_type,
+            problem_type=problem_type,
+            tours=None,
+        )
+
+    @classmethod
+    def from_dataframes(
+        cls,
+        name: str,
+        comment: str,
+        problem_type: str,
+        edges_df: pd.DataFrame,
+        nodes_df: pd.DataFrame,
+        capacity: Optional[Union[int, float]] = None,
+        display_data: Optional[NodeCoords] = None,
+        display_data_type: DisplayDataType = DisplayDataType.NO_DISPLAY,
+        edge_weight_format: EdgeWeightFormat = EdgeWeightFormat.FULL_MATRIX,
+    ):
+        """Get a TSP base model from edge and node dataframes
+
+        Notes:
+            Essential edge columns: [source, target, weight].
+            Optional edge columns: [is_fixed].
+            Essential node columns: [node, is_depot].
+            Optional node columns: [x, y, z, demand].
+            The edge weight function is explicitly given by the 'weight' column.
+        """
+        if "weight" not in edges_df:
+            message = "'weight' is not a column in edges_df. "
+            message += "This function only supports an explicit weight function. "
+            message += "If you have a column that can be used as the weight function, "
+            message += "please rename the column to 'weight'."
+            raise NotImplementedError(message)
+        is_2d = "x" in nodes_df.columns and "y" in nodes_df.columns
+        is_3d = is_2d and "z" in nodes_df.columns
+        if is_3d:
+            raise NotImplementedError("3D coords not supported")
+        if is_2d:
+            node_coord_type = NodeCoordType.TWOD_COORDS
+            node_coords = dict(zip(nodes_df["node"], zip(nodes_df["x"], nodes_df["y"])))
+        else:
+            node_coord_type = NodeCoordType.NO_COORDS
+            node_coords = {}
+
+        demands = None
+        if "demand" in nodes_df.columns:
+            demands = dict(zip(nodes_df["node"], nodes_df["demand"]))
+
+        if display_data_type == DisplayDataType.COORD_DISPLAY:
+            display_data = node_coords
+
+        fixed_edges = []
+        if "is_fixed" in edges_df.columns:
+            fixed_edges_df = edges_df.loc[edges_df["is_fixed"]]
+            fixed_edges = list(zip(fixed_edges_df["source"], fixed_edges_df["target"]))
+
+        depots = nodes_df.loc[nodes_df["is_depot"]]["node"].to_list()
+        edge_data = list(zip(edges_df["source"], edges_df["target"]))
+        edge_weights = dict(zip(edge_data, edges_df["weight"]))
+        return cls(
+            capacity=capacity,
+            comment=comment,
+            demands=demands,
+            depots=depots,
+            dimension=len(nodes_df["node"]),
+            display_data=display_data,
+            display_data_type=display_data_type,
+            edge_data=edge_data,
+            edge_data_format=EdgeDataFormat.EDGE_LIST,
+            edge_weights=edge_weights,
+            edge_weight_format=edge_weight_format,
+            edge_weight_type=EdgeWeightType.EXPLICIT,
+            fixed_edges=fixed_edges,
+            name=name,
+            node_coords=node_coords,
+            node_coord_type=node_coord_type,
+            problem_type=problem_type,
+            tours=None,
+        )
+
+    @classmethod
+    def from_tsplib95(cls, problem: tsplib95.models.StandardProblem):
+        """Get a TSP base model from a StandardProblem object"""
+
+        display_data_type = (
+            problem.display_data_type
+            if problem.display_data_type
+            else DisplayDataType.NO_DISPLAY
+        )
+        edge_data_format = (
+            problem.edge_data_format
+            if problem.edge_data_format
+            else EdgeDataFormat.EDGE_LIST
+        )
+        edge_weight_type = problem.edge_weight_type
+
+        # edge weight format
+        edge_weight_format = problem.edge_weight_format
+        if edge_weight_type == EdgeWeightType.UNIFORM_RANDOM:
+            edge_weight_format = EdgeWeightFormat.FUNCTION
+            weights = uniform_random_cost(list(problem.get_edges()))
+        elif (
+            not edge_weight_format
+            and edge_weight_type in EdgeWeightType.__members__
+            and edge_weight_type != EdgeWeightType.EXPLICIT
+        ):
+            edge_weight_format = EdgeWeightFormat.FUNCTION
+            weights = {(i, j): problem.get_weight(i, j) for i, j in problem.get_edges()}
+        elif not edge_weight_format and edge_weight_type == EdgeWeightType.EXPLICIT:
+            raise ValueError(
+                "Edge weight type is set to EXPLICIT but no edge weight format is given"
+            )
+        elif not edge_weight_format:
+            raise ValueError(
+                "Edge weight format in StandardProblem is not set - cannot assign edge weights."
+            )
+        else:
+            weights = {(i, j): problem.get_weight(i, j) for i, j in problem.get_edges()}
+
+        node_coord_type = (
+            problem.node_coord_type
+            if problem.node_coord_type
+            else NodeCoordType.NO_COORDS
+        )
+        node_coords = None
+        if node_coord_type == NodeCoordType.TWOD_COORDS:
+            node_coords = {i: problem.node_coords.get(i) for i in problem.get_nodes()}
+        elif node_coord_type == NodeCoordType.THREED_COORDS:
+            raise NotImplementedError("3D coords not yet supported")
+
+        return cls(
+            capacity=problem.capacity,
+            comment=problem.comment if problem.comment else "",
+            demands=problem.demands,
+            depots=problem.depots,
+            dimension=problem.dimension,
+            display_data=problem.display_data,
+            display_data_type=display_data_type,
+            edge_data=list(problem.get_edges()),
+            edge_data_format=edge_data_format,
+            edge_weights=weights,
+            edge_weight_format=edge_weight_format,
+            edge_weight_type=edge_weight_type,
+            fixed_edges=problem.fixed_edges,
+            name=problem.name,
+            node_coords=node_coords,
+            node_coord_type=node_coord_type,
+            problem_type=problem.type,
+            tours=problem.tours,
+        )
+
+    @no_type_check
+    def to_tsplib95(self) -> tsplib95.models.StandardProblem:
+        """Convert to a tsplib95 standard model"""
+        weights = None
+        if self.edge_weight_type == EdgeWeightType.EXPLICIT:
+            weights = self.get_weighted_full_matrix()
+
+        optional_kwargs = {}
+        if not self.capacity is None:
+            optional_kwargs["capacity"] = self.capacity
+        if self.display_data:
+            optional_kwargs["display_data"] = self.display_data
+        if self.fixed_edges:
+            optional_kwargs["fixed_edges"] = self.fixed_edges
+        if self.tours:
+            optional_kwargs["tours"] = self.tours
+        return tsplib95.models.StandardProblem(
+            comment=self.comment,
+            demands=self.demands,
+            depots=self.depots,
+            dimension=self.dimension,
+            display_data_type=self.display_data_type,
+            edge_data=self.edge_data,
+            edge_data_format=self.edge_data_format,
+            edge_weights=weights,
+            edge_weight_format=self.edge_weight_format,
+            edge_weight_type=self.edge_weight_type,
+            name=self.name,
+            node_coords=self.node_coords,
+            node_coord_type=self.node_coord_type,
+            type=self.problem_type,
+            **optional_kwargs,
+        )
+
+    @classmethod
+    def from_yaml(cls, yaml_filepath: Path):
+        """Load from a yaml file"""
+        with open(yaml_filepath, "r", encoding="utf-8") as yaml_file:
+            yaml_dict = yaml.load(yaml_file, Loader=yaml.FullLoader)
+        edge_data = edge_list_from_adjacency_list(yaml_dict.pop("edge_data"))
+        edge_weights = edge_dict_from_adjacency_weights(yaml_dict.pop("edge_weights"))
+        fixed_edges = edge_list_from_adjacency_list(yaml_dict.pop("fixed_edges"))
+        return cls(
+            **yaml_dict,
+            edge_data=edge_data,
+            edge_weights=edge_weights,
+            fixed_edges=fixed_edges,
+        )
+
+    def to_yaml(self, yaml_filepath: Path) -> None:
+        """Dump the TSP to a YAML file"""
+        yaml_dict = dict(
+            comment=self.comment,
+            demands=self.demands,
+            depots=self.depots,
+            dimension=self.dimension,
+            display_data_type=self.display_data_type.value,
+            edge_data=adjacency_list_from_edge_list(self.edge_data),
+            edge_data_format=self.edge_data_format.value,
+            edge_weight_format=self.edge_weight_format.value,
+            edge_weight_type=self.edge_weight_type.value,
+            fixed_edges=adjacency_list_from_edge_list(self.fixed_edges),
+            name=self.name,
+            node_coords=self.node_coords,
+            node_coord_type=self.node_coord_type.value,
+            problem_type=self.problem_type,
+            tours=self.tours,
+        )
+        if self.edge_weights:
+            weights: AdjWeights = adjacency_weights_from_edge_dict(self.edge_weights)
+            yaml_dict["edge_weights"] = weights  # type: ignore
+        else:
+            yaml_dict["edge_weights"] = None
+        with open(yaml_filepath, "w", encoding="utf-8") as yaml_file:
+            yaml.dump(yaml_dict, yaml_file)
+
+    def get_weighted_full_matrix(self) -> npt.NDArray[np.int_]:
+        """Get a square weighted adjacency matrix, sorted by node ID"""
+        # create a graph
+        G = self.get_graph()
+        # sort the node list (ascending)
+        sorted_node_list = list(G.nodes())
+        sorted_node_list.sort()
+        # then get the weighted adjacency matrix
+        return nx.to_numpy_array(
+            G, nodelist=sorted_node_list, weight="weight", dtype=int
+        )
+
+    def __set_graph_attributes(self, graph: nx.Graph) -> None:
+        """Set graph attributes such as 'name' and 'comment'"""
+        graph.graph["name"] = self.name
+        graph.graph["comment"] = self.comment
+        graph.graph["problem_type"] = self.problem_type
+        graph.graph["dimension"] = self.dimension
+        if not self.capacity is None:
+            graph.graph["capacity"] = self.capacity
+
+    def __set_node_attributes(self, graph: nx.Graph) -> None:
+        """Set node attributes"""
+        for vertex in graph.nodes():
+            graph.nodes[vertex]["is_depot"] = vertex in self.depots
+            if self.demands:
+                graph.nodes[vertex]["demand"] = self.demands[vertex]
+            if self.display_data:
+                graph.nodes[vertex]["display"] = self.display_data[vertex]
+            if self.node_coords:
+                coords = self.node_coords[vertex]
+                graph.nodes[vertex]["x"] = coords[0]
+                graph.nodes[vertex]["y"] = coords[1]
+
+    def __add_edges(self, graph: nx.Graph) -> None:
+        """Add edges from edge data
+
+        Args:
+            graph: Input graph
+        """
+        for edge in self.edge_data:
+            graph.add_edge(edge[0], edge[1])
+
+    def __set_edge_attributes(self, graph: nx.Graph) -> None:
+        """Set edge attributes for 'weight' and 'is_fixed'
+
+        Args:
+            graph: Input graph
+        """
+        nx.set_edge_attributes(graph, self.edge_weights, name="weight")
+        fixed = {(u, v): (u, v) in self.fixed_edges for u, v in graph.edges()}
+        nx.set_edge_attributes(graph, fixed, name="is_fixed")
+
+    def get_graph(self) -> nx.Graph:
+        """Get a networkx graph
+
+        Returns:
+            Undirected networkx graph with node attributes such as 'is_depot'
+            and edge attributes such as 'weight' and 'is_fixed'.
+        """
+        G = nx.Graph()
+        self.__set_graph_attributes(G)
+        self.__add_edges(G)
+        self.__set_edge_attributes(G)
+        self.__set_node_attributes(G)
+        return G
+
+
+ + + +
+ + + + + + + + +
+ + + +

+ Config + + +

+ + +
+ + +

Pydantic configuration

+ +
+ Source code in tspwplib/problem.py + 
74
+75
+76
+77
class Config:
+    """Pydantic configuration"""
+
+    arbitrary_types_allowed = True
+
+
+ + + +
+ + + + + + + + + + + +
+ +
+ + +
+ + + +
+ + + +

+ __add_edges(graph) + +

+ + +
+ +

Add edges from edge data

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
graph + Graph + +
+

Input graph

+
+ 		+ required +
+ +
+ Source code in tspwplib/problem.py + 
413
+414
+415
+416
+417
+418
+419
+420
def __add_edges(self, graph: nx.Graph) -> None:
+    """Add edges from edge data
+
+    Args:
+        graph: Input graph
+    """
+    for edge in self.edge_data:
+        graph.add_edge(edge[0], edge[1])
+
+
+
+ +
+ + +
+ + + +

+ __set_edge_attributes(graph) + +

+ + +
+ +

Set edge attributes for 'weight' and 'is_fixed'

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
graph + Graph + +
+

Input graph

+
+ 		+ required +
+ +
+ Source code in tspwplib/problem.py + 
422
+423
+424
+425
+426
+427
+428
+429
+430
def __set_edge_attributes(self, graph: nx.Graph) -> None:
+    """Set edge attributes for 'weight' and 'is_fixed'
+
+    Args:
+        graph: Input graph
+    """
+    nx.set_edge_attributes(graph, self.edge_weights, name="weight")
+    fixed = {(u, v): (u, v) in self.fixed_edges for u, v in graph.edges()}
+    nx.set_edge_attributes(graph, fixed, name="is_fixed")
+
+
+
+ +
+ + +
+ + + +

+ __set_graph_attributes(graph) + +

+ + +
+ +

Set graph attributes such as 'name' and 'comment'

+ +
+ Source code in tspwplib/problem.py + 
391
+392
+393
+394
+395
+396
+397
+398
def __set_graph_attributes(self, graph: nx.Graph) -> None:
+    """Set graph attributes such as 'name' and 'comment'"""
+    graph.graph["name"] = self.name
+    graph.graph["comment"] = self.comment
+    graph.graph["problem_type"] = self.problem_type
+    graph.graph["dimension"] = self.dimension
+    if not self.capacity is None:
+        graph.graph["capacity"] = self.capacity
+
+
+
+ +
+ + +
+ + + +

+ __set_node_attributes(graph) + +

+ + +
+ +

Set node attributes

+ +
+ Source code in tspwplib/problem.py + 
400
+401
+402
+403
+404
+405
+406
+407
+408
+409
+410
+411
def __set_node_attributes(self, graph: nx.Graph) -> None:
+    """Set node attributes"""
+    for vertex in graph.nodes():
+        graph.nodes[vertex]["is_depot"] = vertex in self.depots
+        if self.demands:
+            graph.nodes[vertex]["demand"] = self.demands[vertex]
+        if self.display_data:
+            graph.nodes[vertex]["display"] = self.display_data[vertex]
+        if self.node_coords:
+            coords = self.node_coords[vertex]
+            graph.nodes[vertex]["x"] = coords[0]
+            graph.nodes[vertex]["y"] = coords[1]
+
+
+
+ +
+ + +
+ + + +

+ from_dataframes(name, comment, problem_type, edges_df, nodes_df, capacity=None, display_data=None, display_data_type=DisplayDataType.NO_DISPLAY, edge_weight_format=EdgeWeightFormat.FULL_MATRIX) + + + classmethod + + +

+ + +
+ +

Get a TSP base model from edge and node dataframes

+ +
+ Notes +

Essential edge columns: [source, target, weight]. +Optional edge columns: [is_fixed]. +Essential node columns: [node, is_depot]. +Optional node columns: [x, y, z, demand]. +The edge weight function is explicitly given by the 'weight' column.

+
+
+ Source code in tspwplib/problem.py + 
157
+158
+159
+160
+161
+162
+163
+164
+165
+166
+167
+168
+169
+170
+171
+172
+173
+174
+175
+176
+177
+178
+179
+180
+181
+182
+183
+184
+185
+186
+187
+188
+189
+190
+191
+192
+193
+194
+195
+196
+197
+198
+199
+200
+201
+202
+203
+204
+205
+206
+207
+208
+209
+210
+211
+212
+213
+214
+215
+216
+217
+218
+219
+220
+221
+222
+223
+224
+225
+226
+227
+228
+229
+230
@classmethod
+def from_dataframes(
+    cls,
+    name: str,
+    comment: str,
+    problem_type: str,
+    edges_df: pd.DataFrame,
+    nodes_df: pd.DataFrame,
+    capacity: Optional[Union[int, float]] = None,
+    display_data: Optional[NodeCoords] = None,
+    display_data_type: DisplayDataType = DisplayDataType.NO_DISPLAY,
+    edge_weight_format: EdgeWeightFormat = EdgeWeightFormat.FULL_MATRIX,
+):
+    """Get a TSP base model from edge and node dataframes
+
+    Notes:
+        Essential edge columns: [source, target, weight].
+        Optional edge columns: [is_fixed].
+        Essential node columns: [node, is_depot].
+        Optional node columns: [x, y, z, demand].
+        The edge weight function is explicitly given by the 'weight' column.
+    """
+    if "weight" not in edges_df:
+        message = "'weight' is not a column in edges_df. "
+        message += "This function only supports an explicit weight function. "
+        message += "If you have a column that can be used as the weight function, "
+        message += "please rename the column to 'weight'."
+        raise NotImplementedError(message)
+    is_2d = "x" in nodes_df.columns and "y" in nodes_df.columns
+    is_3d = is_2d and "z" in nodes_df.columns
+    if is_3d:
+        raise NotImplementedError("3D coords not supported")
+    if is_2d:
+        node_coord_type = NodeCoordType.TWOD_COORDS
+        node_coords = dict(zip(nodes_df["node"], zip(nodes_df["x"], nodes_df["y"])))
+    else:
+        node_coord_type = NodeCoordType.NO_COORDS
+        node_coords = {}
+
+    demands = None
+    if "demand" in nodes_df.columns:
+        demands = dict(zip(nodes_df["node"], nodes_df["demand"]))
+
+    if display_data_type == DisplayDataType.COORD_DISPLAY:
+        display_data = node_coords
+
+    fixed_edges = []
+    if "is_fixed" in edges_df.columns:
+        fixed_edges_df = edges_df.loc[edges_df["is_fixed"]]
+        fixed_edges = list(zip(fixed_edges_df["source"], fixed_edges_df["target"]))
+
+    depots = nodes_df.loc[nodes_df["is_depot"]]["node"].to_list()
+    edge_data = list(zip(edges_df["source"], edges_df["target"]))
+    edge_weights = dict(zip(edge_data, edges_df["weight"]))
+    return cls(
+        capacity=capacity,
+        comment=comment,
+        demands=demands,
+        depots=depots,
+        dimension=len(nodes_df["node"]),
+        display_data=display_data,
+        display_data_type=display_data_type,
+        edge_data=edge_data,
+        edge_data_format=EdgeDataFormat.EDGE_LIST,
+        edge_weights=edge_weights,
+        edge_weight_format=edge_weight_format,
+        edge_weight_type=EdgeWeightType.EXPLICIT,
+        fixed_edges=fixed_edges,
+        name=name,
+        node_coords=node_coords,
+        node_coord_type=node_coord_type,
+        problem_type=problem_type,
+        tours=None,
+    )
+
+
+
+ +
+ + +
+ + + +

+ from_networkx(name, comment, problem_type, G, capacity=None, display_data=None, display_data_type=DisplayDataType.NO_DISPLAY, edge_weight_format=EdgeWeightFormat.FULL_MATRIX, weight_attr_name='weight') + + + classmethod + + +

+ + +
+ +

Get a base TSP model from a networkx graph

+ +
+ Source code in tspwplib/problem.py + 
 79
+ 80
+ 81
+ 82
+ 83
+ 84
+ 85
+ 86
+ 87
+ 88
+ 89
+ 90
+ 91
+ 92
+ 93
+ 94
+ 95
+ 96
+ 97
+ 98
+ 99
+100
+101
+102
+103
+104
+105
+106
+107
+108
+109
+110
+111
+112
+113
+114
+115
+116
+117
+118
+119
+120
+121
+122
+123
+124
+125
+126
+127
+128
+129
+130
+131
+132
+133
+134
+135
+136
+137
+138
+139
+140
+141
+142
+143
+144
+145
+146
+147
+148
+149
+150
+151
+152
+153
+154
+155
@classmethod
+def from_networkx(
+    cls,
+    name: str,
+    comment: str,
+    problem_type: str,
+    G: nx.Graph,
+    capacity: Optional[Union[int, float]] = None,
+    display_data: Optional[NodeCoords] = None,
+    display_data_type: DisplayDataType = DisplayDataType.NO_DISPLAY,
+    edge_weight_format: EdgeWeightFormat = EdgeWeightFormat.FULL_MATRIX,
+    weight_attr_name: str = "weight",
+):
+    """Get a base TSP model from a networkx graph"""
+    edge_attr_names = edge_attribute_names(G)
+    node_attr_names = node_attribute_names(G)
+    if weight_attr_name not in edge_attr_names:
+        message = f"{weight_attr_name} is required to be an edge attribute, "
+        message += "but was not found in graph. "
+        message += "This function only supports an explicit weight function. "
+        raise NotImplementedError(message)
+    is_2d = "x" in node_attr_names and "y" in node_attr_names
+    is_3d = is_2d and "z" in node_attr_names
+    if is_3d:
+        raise NotImplementedError("3D coords are not supported")
+        # node_coord_type = NodeCoordType.THREED_COORDS
+        # node_coords = {
+        #     node: (float(data["x"]), float(data["y"]), float(data["z"]))
+        #     for node, data in G.nodes(data=True)
+        # }
+    if is_2d:
+        node_coord_type = NodeCoordType.TWOD_COORDS
+        node_coords = {
+            node: (float(data["x"]), float(data["y"]))
+            for node, data in G.nodes(data=True)
+        }
+    else:
+        node_coord_type = NodeCoordType.NO_COORDS
+        node_coords = {}
+
+    demands = None
+    if "demand" in node_attr_names:
+        demands = nx.get_node_attributes(G, "demand")
+    if display_data_type == DisplayDataType.COORD_DISPLAY:
+        display_data = node_coords
+
+    fixed_edges = []
+    if "is_fixed" in edge_attr_names:
+        fixed_edges = [
+            (u, v) for u, v, data in G.edges(data=True) if data["is_fixed"]
+        ]
+
+    depots = []
+    if "is_depot" in node_attr_names:
+        depots = [node for node, data in G.nodes(data=True) if data["is_depot"]]
+    edge_data = list(G.edges())
+    edge_weights = nx.get_edge_attributes(G, weight_attr_name)
+    return cls(
+        capacity=capacity,
+        comment=comment,
+        demands=demands,
+        depots=depots,
+        dimension=G.number_of_nodes(),
+        display_data=display_data,
+        display_data_type=display_data_type,
+        edge_data=edge_data,
+        edge_data_format=EdgeDataFormat.EDGE_LIST,
+        edge_weights=edge_weights,
+        edge_weight_format=edge_weight_format,
+        edge_weight_type=EdgeWeightType.EXPLICIT,
+        fixed_edges=fixed_edges,
+        name=name,
+        node_coords=node_coords,
+        node_coord_type=node_coord_type,
+        problem_type=problem_type,
+        tours=None,
+    )
+
+
+
+ +
+ + +
+ + + +

+ from_tsplib95(problem) + + + classmethod + + +

+ + +
+ +

Get a TSP base model from a StandardProblem object

+ +
+ Source code in tspwplib/problem.py + 
232
+233
+234
+235
+236
+237
+238
+239
+240
+241
+242
+243
+244
+245
+246
+247
+248
+249
+250
+251
+252
+253
+254
+255
+256
+257
+258
+259
+260
+261
+262
+263
+264
+265
+266
+267
+268
+269
+270
+271
+272
+273
+274
+275
+276
+277
+278
+279
+280
+281
+282
+283
+284
+285
+286
+287
+288
+289
+290
+291
+292
+293
+294
+295
+296
+297
+298
+299
+300
+301
@classmethod
+def from_tsplib95(cls, problem: tsplib95.models.StandardProblem):
+    """Get a TSP base model from a StandardProblem object"""
+
+    display_data_type = (
+        problem.display_data_type
+        if problem.display_data_type
+        else DisplayDataType.NO_DISPLAY
+    )
+    edge_data_format = (
+        problem.edge_data_format
+        if problem.edge_data_format
+        else EdgeDataFormat.EDGE_LIST
+    )
+    edge_weight_type = problem.edge_weight_type
+
+    # edge weight format
+    edge_weight_format = problem.edge_weight_format
+    if edge_weight_type == EdgeWeightType.UNIFORM_RANDOM:
+        edge_weight_format = EdgeWeightFormat.FUNCTION
+        weights = uniform_random_cost(list(problem.get_edges()))
+    elif (
+        not edge_weight_format
+        and edge_weight_type in EdgeWeightType.__members__
+        and edge_weight_type != EdgeWeightType.EXPLICIT
+    ):
+        edge_weight_format = EdgeWeightFormat.FUNCTION
+        weights = {(i, j): problem.get_weight(i, j) for i, j in problem.get_edges()}
+    elif not edge_weight_format and edge_weight_type == EdgeWeightType.EXPLICIT:
+        raise ValueError(
+            "Edge weight type is set to EXPLICIT but no edge weight format is given"
+        )
+    elif not edge_weight_format:
+        raise ValueError(
+            "Edge weight format in StandardProblem is not set - cannot assign edge weights."
+        )
+    else:
+        weights = {(i, j): problem.get_weight(i, j) for i, j in problem.get_edges()}
+
+    node_coord_type = (
+        problem.node_coord_type
+        if problem.node_coord_type
+        else NodeCoordType.NO_COORDS
+    )
+    node_coords = None
+    if node_coord_type == NodeCoordType.TWOD_COORDS:
+        node_coords = {i: problem.node_coords.get(i) for i in problem.get_nodes()}
+    elif node_coord_type == NodeCoordType.THREED_COORDS:
+        raise NotImplementedError("3D coords not yet supported")
+
+    return cls(
+        capacity=problem.capacity,
+        comment=problem.comment if problem.comment else "",
+        demands=problem.demands,
+        depots=problem.depots,
+        dimension=problem.dimension,
+        display_data=problem.display_data,
+        display_data_type=display_data_type,
+        edge_data=list(problem.get_edges()),
+        edge_data_format=edge_data_format,
+        edge_weights=weights,
+        edge_weight_format=edge_weight_format,
+        edge_weight_type=edge_weight_type,
+        fixed_edges=problem.fixed_edges,
+        name=problem.name,
+        node_coords=node_coords,
+        node_coord_type=node_coord_type,
+        problem_type=problem.type,
+        tours=problem.tours,
+    )
+
+
+
+ +
+ + +
+ + + +

+ from_yaml(yaml_filepath) + + + classmethod + + +

+ + +
+ +

Load from a yaml file

+ +
+ Source code in tspwplib/problem.py + 
337
+338
+339
+340
+341
+342
+343
+344
+345
+346
+347
+348
+349
+350
@classmethod
+def from_yaml(cls, yaml_filepath: Path):
+    """Load from a yaml file"""
+    with open(yaml_filepath, "r", encoding="utf-8") as yaml_file:
+        yaml_dict = yaml.load(yaml_file, Loader=yaml.FullLoader)
+    edge_data = edge_list_from_adjacency_list(yaml_dict.pop("edge_data"))
+    edge_weights = edge_dict_from_adjacency_weights(yaml_dict.pop("edge_weights"))
+    fixed_edges = edge_list_from_adjacency_list(yaml_dict.pop("fixed_edges"))
+    return cls(
+        **yaml_dict,
+        edge_data=edge_data,
+        edge_weights=edge_weights,
+        fixed_edges=fixed_edges,
+    )
+
+
+
+ +
+ + +
+ + + +

+ get_graph() + +

+ + +
+ +

Get a networkx graph

+ + + +

Returns:

+ + + + + + + + + + + + + + + + + +
TypeDescription
+ Graph + +
+

Undirected networkx graph with node attributes such as 'is_depot'

+
+
+ Graph + +
+

and edge attributes such as 'weight' and 'is_fixed'.

+
+
+ +
+ Source code in tspwplib/problem.py + 
432
+433
+434
+435
+436
+437
+438
+439
+440
+441
+442
+443
+444
def get_graph(self) -> nx.Graph:
+    """Get a networkx graph
+
+    Returns:
+        Undirected networkx graph with node attributes such as 'is_depot'
+        and edge attributes such as 'weight' and 'is_fixed'.
+    """
+    G = nx.Graph()
+    self.__set_graph_attributes(G)
+    self.__add_edges(G)
+    self.__set_edge_attributes(G)
+    self.__set_node_attributes(G)
+    return G
+
+
+
+ +
+ + +
+ + + +

+ get_weighted_full_matrix() + +

+ + +
+ +

Get a square weighted adjacency matrix, sorted by node ID

+ +
+ Source code in tspwplib/problem.py + 
379
+380
+381
+382
+383
+384
+385
+386
+387
+388
+389
def get_weighted_full_matrix(self) -> npt.NDArray[np.int_]:
+    """Get a square weighted adjacency matrix, sorted by node ID"""
+    # create a graph
+    G = self.get_graph()
+    # sort the node list (ascending)
+    sorted_node_list = list(G.nodes())
+    sorted_node_list.sort()
+    # then get the weighted adjacency matrix
+    return nx.to_numpy_array(
+        G, nodelist=sorted_node_list, weight="weight", dtype=int
+    )
+
+
+
+ +
+ + +
+ + + +

+ to_tsplib95() + +

+ + +
+ +

Convert to a tsplib95 standard model

+ +
+ Source code in tspwplib/problem.py + 
303
+304
+305
+306
+307
+308
+309
+310
+311
+312
+313
+314
+315
+316
+317
+318
+319
+320
+321
+322
+323
+324
+325
+326
+327
+328
+329
+330
+331
+332
+333
+334
+335
@no_type_check
+def to_tsplib95(self) -> tsplib95.models.StandardProblem:
+    """Convert to a tsplib95 standard model"""
+    weights = None
+    if self.edge_weight_type == EdgeWeightType.EXPLICIT:
+        weights = self.get_weighted_full_matrix()
+
+    optional_kwargs = {}
+    if not self.capacity is None:
+        optional_kwargs["capacity"] = self.capacity
+    if self.display_data:
+        optional_kwargs["display_data"] = self.display_data
+    if self.fixed_edges:
+        optional_kwargs["fixed_edges"] = self.fixed_edges
+    if self.tours:
+        optional_kwargs["tours"] = self.tours
+    return tsplib95.models.StandardProblem(
+        comment=self.comment,
+        demands=self.demands,
+        depots=self.depots,
+        dimension=self.dimension,
+        display_data_type=self.display_data_type,
+        edge_data=self.edge_data,
+        edge_data_format=self.edge_data_format,
+        edge_weights=weights,
+        edge_weight_format=self.edge_weight_format,
+        edge_weight_type=self.edge_weight_type,
+        name=self.name,
+        node_coords=self.node_coords,
+        node_coord_type=self.node_coord_type,
+        type=self.problem_type,
+        **optional_kwargs,
+    )
+
+
+
+ +
+ + +
+ + + +

+ to_yaml(yaml_filepath) + +

+ + +
+ +

Dump the TSP to a YAML file

+ +
+ Source code in tspwplib/problem.py + 
352
+353
+354
+355
+356
+357
+358
+359
+360
+361
+362
+363
+364
+365
+366
+367
+368
+369
+370
+371
+372
+373
+374
+375
+376
+377
def to_yaml(self, yaml_filepath: Path) -> None:
+    """Dump the TSP to a YAML file"""
+    yaml_dict = dict(
+        comment=self.comment,
+        demands=self.demands,
+        depots=self.depots,
+        dimension=self.dimension,
+        display_data_type=self.display_data_type.value,
+        edge_data=adjacency_list_from_edge_list(self.edge_data),
+        edge_data_format=self.edge_data_format.value,
+        edge_weight_format=self.edge_weight_format.value,
+        edge_weight_type=self.edge_weight_type.value,
+        fixed_edges=adjacency_list_from_edge_list(self.fixed_edges),
+        name=self.name,
+        node_coords=self.node_coords,
+        node_coord_type=self.node_coord_type.value,
+        problem_type=self.problem_type,
+        tours=self.tours,
+    )
+    if self.edge_weights:
+        weights: AdjWeights = adjacency_weights_from_edge_dict(self.edge_weights)
+        yaml_dict["edge_weights"] = weights  # type: ignore
+    else:
+        yaml_dict["edge_weights"] = None
+    with open(yaml_filepath, "w", encoding="utf-8") as yaml_file:
+        yaml.dump(yaml_dict, yaml_file)
+
+
+
+ +
+ + + +
+ +
+ + +
+ +
+ + + +

+ EdgeFunctionName + + +

+ + +
+

+ Bases: StrEnumMixin, str, Enum

+ + +

Valid names of functions on edges

+ +
+ Source code in tspwplib/types.py + 
128
+129
+130
+131
+132
class EdgeFunctionName(StrEnumMixin, str, Enum):
+    """Valid names of functions on edges"""
+
+    cost = "cost"
+    weight = "weight"
+
+
+ + + +
+ + + + + + + + + + + +
+ +
+ + +
+ +
+ + + +

+ EdgeNotFoundException + + +

+ + +
+

+ Bases: NetworkXException

+ + +

An edge could not be found in the graph

+ +
+ Source code in tspwplib/exception.py + 
6
+7
class EdgeNotFoundException(ex.NetworkXException):
+    """An edge could not be found in the graph"""
+
+
+ +
+ + +
+ +
+ + + +

+ EdgeWeightType + + +

+ + +
+

+ Bases: StrEnumMixin, str, Enum

+ + +

Specifies how the edge weights (or distances) are given

+ +
+ Source code in tspwplib/types.py + 
42
+43
+44
+45
+46
+47
+48
+49
+50
+51
+52
+53
+54
+55
+56
+57
+58
+59
+60
+61
+62
+63
+64
class EdgeWeightType(StrEnumMixin, str, Enum):
+    """Specifies how the edge weights (or distances) are given"""
+
+    EXPLICIT = "EXPLICIT"  # Weights are listed explicitly in the corresponding section
+    EUC_2D = "EUC_2D"  # Weights are Euclidean distances in 2-D
+    EUC_3D = "EUC_3D"  # Weights are Euclidean distances in 3-D
+    MAX_2D = "MAX_2D"  # Weights are maximum distances in 2-D
+    MAX_3D = "MAX_3D"  # Weights are maximum distances in 3-D
+    MAN_2D = "MAN_2D"  # Weights are Manhattan distances in 2-D
+    MAN_3D = "MAN_3D"  # Weights are Manhattan distances in 3-D
+    CEIL_2D = "CEIL_2D"  # Weights are Euclidean distances in 2-D rounded up
+    GEO = "GEO"  # Weights are geographical distances
+    ATT = "ATT"  # Special distance function for problems att48 and att532
+    XRAY1 = (
+        "XRAY1"  # Special distance function for crystallography problems (Version 1)
+    )
+    XRAY2 = (
+        "XRAY2"  # Special distance function for crystallography problems (Version 2)
+    )
+    SPECIAL = "SPECIAL"  # There is a special distance function documented elsewhere
+    UNIFORM_RANDOM = "UNIFORM_RANDOM"
+    MST = "MST"
+    SEMI_MST = "SEMI_MST"
+
+
+ + + +
+ + + + + + + + + + + +
+ +
+ + +
+ +
+ + + +

+ EdgesNotAdjacentException + + +

+ + +
+

+ Bases: AmbiguousSolution

+ + +

An edge list has been given non-adjacent edges which is ambiguous

+ +
+ Source code in tspwplib/exception.py + 
10
+11
class EdgesNotAdjacentException(ex.AmbiguousSolution):
+    """An edge list has been given non-adjacent edges which is ambiguous"""
+
+
+ +
+ + +
+ +
+ + + +

+ Generation + + +

+ + +
+

+ Bases: StrEnumMixin, str, Enum

+ + +

Generations of TSPwP problem instances

+ +
+ Source code in tspwplib/types.py + 
296
+297
+298
+299
+300
+301
class Generation(StrEnumMixin, str, Enum):
+    """Generations of TSPwP problem instances"""
+
+    gen1 = "gen1"
+    gen2 = "gen2"
+    gen3 = "gen3"
+
+
+ + + +
+ + + + + + + + + + + +
+ +
+ + +
+ +
+ + + +

+ GraphName + + +

+ + +
+

+ Bases: StrEnumMixin, str, Enum

+ + +

Names of TSPlib instances

+ +
+ Source code in tspwplib/types.py + 
135
+136
+137
+138
+139
+140
+141
+142
+143
+144
+145
+146
+147
+148
+149
+150
+151
+152
+153
+154
+155
+156
+157
+158
+159
+160
+161
+162
+163
+164
+165
+166
+167
+168
+169
+170
+171
+172
+173
+174
+175
+176
+177
+178
+179
+180
+181
+182
+183
+184
+185
+186
+187
+188
+189
+190
+191
+192
+193
+194
+195
+196
+197
+198
+199
+200
+201
+202
+203
+204
+205
+206
+207
+208
+209
+210
+211
+212
+213
+214
+215
+216
+217
+218
+219
+220
+221
+222
+223
+224
+225
+226
+227
+228
+229
+230
+231
+232
+233
+234
+235
+236
+237
+238
+239
+240
+241
+242
+243
+244
+245
+246
+247
+248
class GraphName(StrEnumMixin, str, Enum):
+    """Names of TSPlib instances"""
+
+    a280 = "a280"
+    ali535 = "ali535"
+    att48 = "att48"
+    att532 = "att532"
+    bayg29 = "bayg29"
+    bays29 = "bays29"
+    berlin52 = "berlin52"
+    bier127 = "bier127"
+    brazil58 = "brazil58"
+    brd14051 = "brd14051"
+    brg180 = "brg180"
+    burma14 = "burma14"
+    ch130 = "ch130"
+    ch150 = "ch150"
+    d198 = "d198"
+    d493 = "d493"
+    d657 = "d657"
+    d1291 = "d1291"
+    d1655 = "d1655"
+    d2103 = "d2103"
+    d15112 = "d15112"
+    d18512 = "d18512"
+    dantzig42 = "dantzig42"
+    dsj1000 = "dsj1000"
+    eil51 = "eil51"
+    eil76 = "eil76"
+    eil101 = "eil101"
+    fl417 = "fl417"
+    fl1400 = "fl1400"
+    fl1577 = "fl1577"
+    fl3795 = "fl3795"
+    fnl4461 = "fnl4461"
+    fri26 = "fri26"
+    gil262 = "gil262"
+    gr17 = "gr17"
+    gr21 = "gr21"
+    gr24 = "gr24"
+    gr48 = "gr48"
+    gr96 = "gr96"
+    gr120 = "gr120"
+    gr137 = "gr137"
+    gr202 = "gr202"
+    gr229 = "gr229"
+    gr431 = "gr431"
+    gr666 = "gr666"
+    hk48 = "hk48"
+    kroA100 = "kroA100"
+    kroB100 = "kroB100"
+    kroC100 = "kroC100"
+    kroD100 = "kroD100"
+    kroE100 = "kroE100"
+    kroA150 = "kroA150"
+    kroB150 = "kroB150"
+    kroA200 = "kroA200"
+    kroB200 = "kroB200"
+    lin105 = "lin105"
+    lin318 = "lin318"
+    linhp318 = "linhp318"
+    nrw1379 = "nrw1379"
+    p654 = "p654"
+    pa561 = "pa561"
+    pcb442 = "pcb442"
+    pcb1173 = "pcb1173"
+    pcb3038 = "pcb3038"
+    pla7397 = "pla7397"
+    pla33810 = "pla33810"
+    pla85900 = "pla85900"
+    pr76 = "pr76"
+    pr107 = "pr107"
+    pr124 = "pr124"
+    pr136 = "pr136"
+    pr144 = "pr144"
+    pr152 = "pr152"
+    pr226 = "pr226"
+    pr264 = "pr264"
+    pr299 = "pr299"
+    pr439 = "pr439"
+    pr1002 = "pr1002"
+    pr2392 = "pr2392"
+    rat99 = "rat99"
+    rat195 = "rat195"
+    rat575 = "rat575"
+    rat783 = "rat783"
+    rd100 = "rd100"
+    rd400 = "rd400"
+    rl1304 = "rl1304"
+    rl1323 = "rl1323"
+    rl1889 = "rl1889"
+    rl5915 = "rl5915"
+    rl5934 = "rl5934"
+    rl11849 = "rl11849"
+    si175 = "si175"
+    si535 = "si535"
+    si1032 = "si1032"
+    st70 = "st70"
+    swiss42 = "swiss42"
+    ts225 = "ts225"
+    tsp225 = "tsp225"
+    u159 = "u159"
+    u574 = "u574"
+    u724 = "u724"
+    u1060 = "u1060"
+    u1432 = "u1432"
+    u1817 = "u1817"
+    u2152 = "u2152"
+    u2319 = "u2319"
+    ulysses16 = "ulysses16"
+    ulysses22 = "ulysses22"
+    usa13509 = "usa13509"
+    vm1084 = "vm1084"
+    vm1748 = "vm1748"
+
+
+ + + +
+ + + + + + + + + + + +
+ +
+ + +
+ +
+ + + +

+ LondonaqGraphName + + +

+ + +
+

+ Bases: StrEnumMixin, str, Enum

+ + +

Names of graphs with London air quality forecasts

+ +
+ Source code in tspwplib/types.py + 
251
+252
+253
+254
+255
+256
+257
+258
class LondonaqGraphName(StrEnumMixin, str, Enum):
+    """Names of graphs with London air quality forecasts"""
+
+    laqkxA = "laqkxA"
+    laqtinyA = "laqtinyA"
+    laqbbA = "laqbbA"
+    laqidA = "laqidA"
+    laqwsA = "laqwsA"
+
+
+ + + +
+ + + + + + + + + + + +
+ +
+ + +
+ +
+ + + +

+ LondonaqLocation + + +

+ + +
+

+ Bases: StrEnumMixin, str, Enum

+ + +

Names of locations that the London air quality graph is centered upon

+ +
+ Source code in tspwplib/types.py + 
276
+277
+278
+279
+280
+281
+282
+283
class LondonaqLocation(StrEnumMixin, str, Enum):
+    """Names of locations that the London air quality graph is centered upon"""
+
+    bb = "Big Ben"
+    kx = "King's Cross"
+    tiny = "Camden Town"
+    id = "Isle of Dogs"
+    ws = "Wembley Stadium"
+
+
+ + + +
+ + + + + + + + + + + +
+ +
+ + +
+ +
+ + + +

+ LondonaqLocationShort + + +

+ + +
+

+ Bases: StrEnumMixin, str, Enum

+ + +

Short codes for londonaq locations

+ +
+ Source code in tspwplib/types.py + 
286
+287
+288
+289
+290
+291
+292
+293
class LondonaqLocationShort(StrEnumMixin, str, Enum):
+    """Short codes for londonaq locations"""
+
+    bb = "bb"
+    kx = "kx"
+    tiny = "tiny"
+    id = "id"
+    ws = "ws"
+
+
+ + + +
+ + + + + + + + + + + +
+ +
+ + +
+ +
+ + + +

+ LondonaqTimestamp + + +

+ + +
+

+ Bases: Enum

+ + +

Timestamps of the forecasts for London air quality forecasts

+ +
+ Source code in tspwplib/types.py + 
261
+262
+263
+264
class LondonaqTimestamp(Enum):
+    """Timestamps of the forecasts for London air quality forecasts"""
+
+    A = datetime(2021, 10, 13, 8, 0, 0, tzinfo=timezone.utc)  # 9am BST
+
+
+ + + +
+ + + + + + + + + + + +
+ +
+ + +
+ +
+ + + +

+ LondonaqTimestampId + + +

+ + +
+

+ Bases: StrEnumMixin, str, Enum

+ + +

Timestamp IDs for CLI

+ +
+ Source code in tspwplib/types.py + 
267
+268
+269
+270
class LondonaqTimestampId(StrEnumMixin, str, Enum):
+    """Timestamp IDs for CLI"""
+
+    A = "A"
+
+
+ + + +
+ + + + + + + + + + + +
+ +
+ + +
+ +
+ + + +

+ NotSimpleCycleException + + +

+ + +
+

+ Bases: NotSimpleException

+ + +

The walk was not a simple cycle

+ +
+ Source code in tspwplib/exception.py + 
18
+19
class NotSimpleCycleException(NotSimpleException):
+    """The walk was not a simple cycle"""
+
+
+ +
+ + +
+ +
+ + + +

+ NotSimpleException + + +

+ + +
+

+ Bases: NetworkXException

+ + +

A path, cycle or walk is not simple

+ +
+ Source code in tspwplib/exception.py + 
14
+15
class NotSimpleException(ex.NetworkXException):
+    """A path, cycle or walk is not simple"""
+
+
+ +
+ + +
+ +
+ + + +

+ NotSimplePathException + + +

+ + +
+

+ Bases: NotSimpleException

+ + +

The walk was not a simple path

+ +
+ Source code in tspwplib/exception.py + 
22
+23
class NotSimplePathException(NotSimpleException):
+    """The walk was not a simple path"""
+
+
+ +
+ + +
+ +
+ + + +

+ OptimalSolutionTSP + + +

+ + +
+

+ Bases: IntEnum

+ + +

Value of optimal solutions to TSP instances

+ +
+ Source code in tspwplib/types.py + 
310
+311
+312
+313
+314
+315
+316
+317
+318
+319
+320
+321
+322
+323
+324
+325
+326
+327
+328
+329
+330
+331
+332
+333
+334
+335
+336
+337
+338
+339
+340
+341
+342
+343
+344
+345
+346
+347
+348
+349
+350
+351
+352
+353
+354
+355
+356
+357
+358
+359
+360
+361
+362
+363
+364
+365
+366
+367
+368
+369
+370
+371
+372
+373
+374
+375
+376
+377
+378
+379
+380
+381
+382
+383
+384
+385
+386
+387
+388
+389
+390
+391
+392
+393
+394
+395
+396
+397
+398
+399
+400
+401
+402
+403
+404
+405
+406
+407
+408
+409
+410
+411
+412
+413
+414
+415
+416
+417
+418
+419
+420
+421
+422
+423
+424
class OptimalSolutionTSP(IntEnum):
+    """Value of optimal solutions to TSP instances"""
+
+    a280 = 2579
+    ali535 = 202339
+    att48 = 10628
+    att532 = 27686
+    bayg29 = 1610
+    bays29 = 2020
+    berlin52 = 7542
+    bier127 = 118282
+    brazil58 = 25395
+    brd14051 = 469385
+    brg180 = 1950
+    burma14 = 3323
+    ch130 = 6110
+    ch150 = 6528
+    d198 = 15780
+    d493 = 35002
+    d657 = 48912
+    d1291 = 50801
+    d1655 = 62128
+    d2103 = 80450
+    d15112 = 1573084
+    d18512 = 645238
+    dantzig42 = 699
+    dsj1000 = 18659688  # (EUC_2D)
+    # dsj1000 = 18660188 # (CEIL_2D)    # NOTE breaks keys
+    eil51 = 426
+    eil76 = 538
+    eil101 = 629
+    fl417 = 11861
+    fl1400 = 20127
+    fl1577 = 22249
+    fl3795 = 28772
+    fnl4461 = 182566
+    fri26 = 937
+    gil262 = 2378
+    gr17 = 2085
+    gr21 = 2707
+    gr24 = 1272
+    gr48 = 5046
+    gr96 = 55209
+    gr120 = 6942
+    gr137 = 69853
+    gr202 = 40160
+    gr229 = 134602
+    gr431 = 171414
+    gr666 = 294358
+    hk48 = 11461
+    kroA100 = 21282
+    kroB100 = 22141
+    kroC100 = 20749
+    kroD100 = 21294
+    kroE100 = 22068
+    kroA150 = 26524
+    kroB150 = 26130
+    kroA200 = 29368
+    kroB200 = 29437
+    lin105 = 14379
+    lin318 = 42029
+    linhp318 = 41345
+    nrw1379 = 56638
+    p654 = 34643
+    pa561 = 2763
+    pcb442 = 50778
+    pcb1173 = 56892
+    pcb3038 = 137694
+    pla7397 = 23260728
+    pla33810 = 66048945
+    pla85900 = 142382641
+    pr76 = 108159
+    pr107 = 44303
+    pr124 = 59030
+    pr136 = 96772
+    pr144 = 58537
+    pr152 = 73682
+    pr226 = 80369
+    pr264 = 49135
+    pr299 = 48191
+    pr439 = 107217
+    pr1002 = 259045
+    pr2392 = 378032
+    rat99 = 1211
+    rat195 = 2323
+    rat575 = 6773
+    rat783 = 8806
+    rd100 = 7910
+    rd400 = 15281
+    rl1304 = 252948
+    rl1323 = 270199
+    rl1889 = 316536
+    rl5915 = 565530
+    rl5934 = 556045
+    rl11849 = 923288
+    si175 = 21407
+    si535 = 48450
+    si1032 = 92650
+    st70 = 675
+    swiss42 = 1273
+    ts225 = 126643
+    tsp225 = 3916
+    u159 = 42080
+    u574 = 36905
+    u724 = 41910
+    u1060 = 224094
+    u1432 = 152970
+    u1817 = 57201
+    u2152 = 64253
+    u2319 = 234256
+    ulysses16 = 6859
+    ulysses22 = 7013
+    usa13509 = 19982859
+    vm1084 = 239297
+    vm1748 = 336556
+
+
+ + + +
+ + + + + + + + + + + +
+ +
+ + +
+ +
+ + + +

+ ProfitsProblem + + +

+ + +
+

+ Bases: StandardProblem

+ + +

TSP with Profits Problem

+ +
+ Source code in tspwplib/problem.py + 
487
+488
+489
+490
+491
+492
+493
+494
+495
+496
+497
+498
+499
+500
+501
+502
+503
+504
+505
+506
+507
+508
+509
+510
+511
+512
+513
+514
+515
+516
+517
+518
+519
+520
+521
+522
+523
+524
+525
+526
+527
+528
+529
+530
+531
+532
+533
+534
+535
+536
+537
+538
+539
+540
+541
+542
+543
+544
+545
+546
+547
+548
+549
+550
+551
+552
+553
+554
+555
+556
+557
+558
+559
+560
+561
+562
+563
+564
+565
+566
+567
+568
+569
+570
+571
+572
+573
+574
+575
+576
+577
+578
+579
+580
+581
+582
+583
+584
+585
+586
+587
+588
+589
+590
+591
+592
+593
+594
+595
+596
+597
+598
+599
+600
+601
+602
+603
+604
+605
+606
+607
+608
+609
+610
+611
+612
+613
+614
+615
+616
+617
+618
+619
+620
+621
+622
+623
+624
+625
+626
+627
+628
+629
+630
+631
+632
+633
+634
+635
+636
+637
+638
+639
+640
+641
+642
+643
+644
+645
+646
+647
+648
+649
+650
+651
+652
+653
+654
+655
+656
+657
+658
+659
+660
+661
+662
+663
+664
+665
+666
+667
+668
+669
+670
+671
+672
+673
+674
+675
+676
+677
class ProfitsProblem(tsplib95.models.StandardProblem):
+    """TSP with Profits Problem"""
+
+    # overwrite edge data to fix bugs
+    edge_data = TempEdgeDataField("EDGE_DATA")
+    # Maximum distance of the total route in a OP.
+    cost_limit = tsplib95.fields.IntegerField("COST_LIMIT")
+    # The scores of the nodes of a OP are given in the form (per line)
+    node_score = tsplib95.fields.DemandsField("NODE_SCORE_SECTION")
+    # The optimal solution to the TSP
+    tspsol = tsplib95.fields.IntegerField("TSPSOL")
+
+    def __init__(self, special=None, **data):
+        super().__init__(special=special, **data)
+
+    def __set_edge_attributes(self, graph: nx.Graph, names: VertexLookup) -> None:
+        """Set edge attributes"""
+        # add every edge with some associated metadata
+        for edge in self.get_edges():
+            cost: int = self.get_weight(edge[0], edge[1])
+            # pylint: disable=unsupported-membership-test
+            # is_fixed: bool = (u, v) in self.fixed_edges
+            graph.add_edge(names[edge[0]], names[edge[1]], cost=cost)
+
+    def __set_graph_attributes(self, graph: nx.Graph) -> None:
+        """Set attributes of the graph such as the name"""
+        graph.graph["name"] = self.name
+        graph.graph["comment"] = self.comment
+        graph.graph["type"] = self.type
+        graph.graph["dimension"] = self.dimension
+        graph.graph["capacity"] = self.capacity
+        graph.graph["root"] = self.get_root_vertex()
+
+    def __set_node_attributes(self, graph: nx.Graph, names: VertexLookup) -> None:
+        """Add node attributes"""
+        node_score = self.get_node_score()
+        for vertex in list(self.get_nodes()):
+            # pylint: disable=unsupported-membership-test,no-member
+            is_depot = vertex in self.depots
+            graph.add_node(
+                names[vertex],
+                prize=node_score[vertex],
+                is_depot=is_depot,
+            )
+            demand: int = self.demands.get(vertex)
+            display = self.display_data.get(vertex)
+            if not demand is None:
+                graph[vertex]["demand"] = demand
+            if not display is None:
+                graph[vertex]["display"] = display
+            if self.node_coords:
+                coord = self.node_coords.get(vertex)
+                graph.nodes[names[vertex]]["x"] = coord[0]
+                graph.nodes[names[vertex]]["y"] = coord[1]
+
+    def get_weight(self, start: int, end: int) -> int:
+        """Return the weight of the edge between start and end.
+
+        This method provides a single way to obtain edge weights regardless of
+        whether the problem uses an explicit matrix or a distance function.
+
+        Args:
+            start: starting node index
+            end: ending node index
+
+        Returns:
+            Weight of edge
+
+        Notes:
+            Over-rides euclidean weight to ensure the costs are metric
+        """
+        if self.edge_weight_type == EdgeWeightType.EUC_2D:
+            return tsplib95.distances.euclidean(
+                self.node_coords.get(start), self.node_coords.get(end), round=math.ceil
+            )
+        return super().get_weight(start, end)
+
+    def get_graph(self, normalize: bool = False) -> nx.Graph:
+        """Return a networkx graph instance representing the problem.
+
+        Args:
+            normalize: rename nodes to be zero-indexed
+        """
+        # directed graphs are fundamentally different
+        graph: nx.Graph = nx.Graph() if self.is_symmetric() else nx.DiGraph()
+
+        # set up a map from original node name to new node name
+        nodes: List[Vertex] = list(self.get_nodes())
+        if normalize:
+            names = {n: i for i, n in enumerate(nodes)}
+        else:
+            names = {n: n for n in nodes}
+
+        self.__set_node_attributes(graph, names)
+        self.__set_edge_attributes(graph, names)
+
+        # add basic graph metadata
+        self.__set_graph_attributes(graph)
+        return graph
+
+    def get_total_prize(self) -> int:
+        """Get the sum of prize over all vertices
+
+        Returns:
+            Total prize
+        """
+        # pylint: disable=no-member
+        return sum([value for _, value in self.get_node_score().items()])
+
+    def get_quota(self, alpha: int) -> int:
+        """The quota is alpha percent of the total prize
+
+        Args:
+            alpha: Percent of the total prize
+
+        Returns:
+            quota
+        """
+        return get_quota_from_alpha(alpha, self.get_total_prize())
+
+    def number_of_nodes(self) -> int:
+        """Get the number of nodes in the problem
+
+        Returns:
+            Number of nodes in graph
+        """
+        return len(list(self.get_nodes()))
+
+    def get_cost_limit(self) -> int:
+        """Get the cost limit for a TSP with Profits problem
+
+        Returns:
+            Cost limit
+        """
+        return self.cost_limit
+
+    def get_node_score(self) -> VertexLookup:
+        """Get the node scores (profits)
+
+        Returns:
+            Mapping from node to node score (profit)
+        """
+        score_dict: VertexLookup = {}
+        for key, value in self.node_score.items():  # pylint: disable=no-member
+            score_dict[key] = value
+        return score_dict
+
+    def get_tsp_optimal_value(self) -> int:
+        """Get the value of the optimal solution to TSP
+
+        Returns:
+            TSP optimal value
+        """
+        return self.tspsol
+
+    def get_root_vertex(self, normalize: bool = False) -> Vertex:
+        """Get the root vertex
+
+        Args:
+            normalize: If true, vertices start at index 0
+
+        Returns:
+            The first depot in the list
+
+        Raises:
+            ValueError: If the list of depots is empty
+        """
+        nodes: List[Vertex] = list(self.get_nodes())
+        if normalize:
+            names = {n: i for i, n in enumerate(nodes)}
+        else:
+            names = {n: n for n in nodes}
+        try:
+            # pylint: disable=unsubscriptable-object
+            return names[self.depots[0]]
+        except KeyError as key_error:
+            raise ValueError("The list of depots is empty") from key_error
+
+    # pylint: disable=arguments-differ
+    def get_edges(self, normalize: bool = False) -> EdgeList:
+        """Get a list of edges in the graph
+
+        Args:
+            normalize: If true use the normalized vertex ids
+
+        Returns:
+            List of edges in the graph
+        """
+        if normalize:
+            raise NotImplementedError("Normalizing edges not yet implemented")
+        return list(super().get_edges())
+
+
+ + + +
+ + + + + + + + + + +
+ + + +

+ __set_edge_attributes(graph, names) + +

+ + +
+ +

Set edge attributes

+ +
+ Source code in tspwplib/problem.py + 
502
+503
+504
+505
+506
+507
+508
+509
def __set_edge_attributes(self, graph: nx.Graph, names: VertexLookup) -> None:
+    """Set edge attributes"""
+    # add every edge with some associated metadata
+    for edge in self.get_edges():
+        cost: int = self.get_weight(edge[0], edge[1])
+        # pylint: disable=unsupported-membership-test
+        # is_fixed: bool = (u, v) in self.fixed_edges
+        graph.add_edge(names[edge[0]], names[edge[1]], cost=cost)
+
+
+
+ +
+ + +
+ + + +

+ __set_graph_attributes(graph) + +

+ + +
+ +

Set attributes of the graph such as the name

+ +
+ Source code in tspwplib/problem.py + 
511
+512
+513
+514
+515
+516
+517
+518
def __set_graph_attributes(self, graph: nx.Graph) -> None:
+    """Set attributes of the graph such as the name"""
+    graph.graph["name"] = self.name
+    graph.graph["comment"] = self.comment
+    graph.graph["type"] = self.type
+    graph.graph["dimension"] = self.dimension
+    graph.graph["capacity"] = self.capacity
+    graph.graph["root"] = self.get_root_vertex()
+
+
+
+ +
+ + +
+ + + +

+ __set_node_attributes(graph, names) + +

+ + +
+ +

Add node attributes

+ +
+ Source code in tspwplib/problem.py + 
520
+521
+522
+523
+524
+525
+526
+527
+528
+529
+530
+531
+532
+533
+534
+535
+536
+537
+538
+539
+540
def __set_node_attributes(self, graph: nx.Graph, names: VertexLookup) -> None:
+    """Add node attributes"""
+    node_score = self.get_node_score()
+    for vertex in list(self.get_nodes()):
+        # pylint: disable=unsupported-membership-test,no-member
+        is_depot = vertex in self.depots
+        graph.add_node(
+            names[vertex],
+            prize=node_score[vertex],
+            is_depot=is_depot,
+        )
+        demand: int = self.demands.get(vertex)
+        display = self.display_data.get(vertex)
+        if not demand is None:
+            graph[vertex]["demand"] = demand
+        if not display is None:
+            graph[vertex]["display"] = display
+        if self.node_coords:
+            coord = self.node_coords.get(vertex)
+            graph.nodes[names[vertex]]["x"] = coord[0]
+            graph.nodes[names[vertex]]["y"] = coord[1]
+
+
+
+ +
+ + +
+ + + +

+ get_cost_limit() + +

+ + +
+ +

Get the cost limit for a TSP with Profits problem

+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ int + +
+

Cost limit

+
+
+ +
+ Source code in tspwplib/problem.py + 
615
+616
+617
+618
+619
+620
+621
def get_cost_limit(self) -> int:
+    """Get the cost limit for a TSP with Profits problem
+
+    Returns:
+        Cost limit
+    """
+    return self.cost_limit
+
+
+
+ +
+ + +
+ + + +

+ get_edges(normalize=False) + +

+ + +
+ +

Get a list of edges in the graph

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
normalize + bool + +
+

If true use the normalized vertex ids

+
+ 		+ False +
+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ EdgeList + +
+

List of edges in the graph

+
+
+ +
+ Source code in tspwplib/problem.py + 
666
+667
+668
+669
+670
+671
+672
+673
+674
+675
+676
+677
def get_edges(self, normalize: bool = False) -> EdgeList:
+    """Get a list of edges in the graph
+
+    Args:
+        normalize: If true use the normalized vertex ids
+
+    Returns:
+        List of edges in the graph
+    """
+    if normalize:
+        raise NotImplementedError("Normalizing edges not yet implemented")
+    return list(super().get_edges())
+
+
+
+ +
+ + +
+ + + +

+ get_graph(normalize=False) + +

+ + +
+ +

Return a networkx graph instance representing the problem.

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
normalize + bool + +
+

rename nodes to be zero-indexed

+
+ 		+ False +
+ +
+ Source code in tspwplib/problem.py + 
564
+565
+566
+567
+568
+569
+570
+571
+572
+573
+574
+575
+576
+577
+578
+579
+580
+581
+582
+583
+584
+585
def get_graph(self, normalize: bool = False) -> nx.Graph:
+    """Return a networkx graph instance representing the problem.
+
+    Args:
+        normalize: rename nodes to be zero-indexed
+    """
+    # directed graphs are fundamentally different
+    graph: nx.Graph = nx.Graph() if self.is_symmetric() else nx.DiGraph()
+
+    # set up a map from original node name to new node name
+    nodes: List[Vertex] = list(self.get_nodes())
+    if normalize:
+        names = {n: i for i, n in enumerate(nodes)}
+    else:
+        names = {n: n for n in nodes}
+
+    self.__set_node_attributes(graph, names)
+    self.__set_edge_attributes(graph, names)
+
+    # add basic graph metadata
+    self.__set_graph_attributes(graph)
+    return graph
+
+
+
+ +
+ + +
+ + + +

+ get_node_score() + +

+ + +
+ +

Get the node scores (profits)

+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ VertexLookup + +
+

Mapping from node to node score (profit)

+
+
+ +
+ Source code in tspwplib/problem.py + 
623
+624
+625
+626
+627
+628
+629
+630
+631
+632
def get_node_score(self) -> VertexLookup:
+    """Get the node scores (profits)
+
+    Returns:
+        Mapping from node to node score (profit)
+    """
+    score_dict: VertexLookup = {}
+    for key, value in self.node_score.items():  # pylint: disable=no-member
+        score_dict[key] = value
+    return score_dict
+
+
+
+ +
+ + +
+ + + +

+ get_quota(alpha) + +

+ + +
+ +

The quota is alpha percent of the total prize

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
alpha + int + +
+

Percent of the total prize

+
+ 		+ required +
+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ int + +
+

quota

+
+
+ +
+ Source code in tspwplib/problem.py + 
596
+597
+598
+599
+600
+601
+602
+603
+604
+605
def get_quota(self, alpha: int) -> int:
+    """The quota is alpha percent of the total prize
+
+    Args:
+        alpha: Percent of the total prize
+
+    Returns:
+        quota
+    """
+    return get_quota_from_alpha(alpha, self.get_total_prize())
+
+
+
+ +
+ + +
+ + + +

+ get_root_vertex(normalize=False) + +

+ + +
+ +

Get the root vertex

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
normalize + bool + +
+

If true, vertices start at index 0

+
+ 		+ False +
+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ Vertex + +
+

The first depot in the list

+
+
+ + + +

Raises:

+ + + + + + + + + + + + + +
TypeDescription
+ ValueError + +
+

If the list of depots is empty

+
+
+ +
+ Source code in tspwplib/problem.py + 
642
+643
+644
+645
+646
+647
+648
+649
+650
+651
+652
+653
+654
+655
+656
+657
+658
+659
+660
+661
+662
+663
def get_root_vertex(self, normalize: bool = False) -> Vertex:
+    """Get the root vertex
+
+    Args:
+        normalize: If true, vertices start at index 0
+
+    Returns:
+        The first depot in the list
+
+    Raises:
+        ValueError: If the list of depots is empty
+    """
+    nodes: List[Vertex] = list(self.get_nodes())
+    if normalize:
+        names = {n: i for i, n in enumerate(nodes)}
+    else:
+        names = {n: n for n in nodes}
+    try:
+        # pylint: disable=unsubscriptable-object
+        return names[self.depots[0]]
+    except KeyError as key_error:
+        raise ValueError("The list of depots is empty") from key_error
+
+
+
+ +
+ + +
+ + + +

+ get_total_prize() + +

+ + +
+ +

Get the sum of prize over all vertices

+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ int + +
+

Total prize

+
+
+ +
+ Source code in tspwplib/problem.py + 
587
+588
+589
+590
+591
+592
+593
+594
def get_total_prize(self) -> int:
+    """Get the sum of prize over all vertices
+
+    Returns:
+        Total prize
+    """
+    # pylint: disable=no-member
+    return sum([value for _, value in self.get_node_score().items()])
+
+
+
+ +
+ + +
+ + + +

+ get_tsp_optimal_value() + +

+ + +
+ +

Get the value of the optimal solution to TSP

+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ int + +
+

TSP optimal value

+
+
+ +
+ Source code in tspwplib/problem.py + 
634
+635
+636
+637
+638
+639
+640
def get_tsp_optimal_value(self) -> int:
+    """Get the value of the optimal solution to TSP
+
+    Returns:
+        TSP optimal value
+    """
+    return self.tspsol
+
+
+
+ +
+ + +
+ + + +

+ get_weight(start, end) + +

+ + +
+ +

Return the weight of the edge between start and end.

+

This method provides a single way to obtain edge weights regardless of +whether the problem uses an explicit matrix or a distance function.

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
start + int + +
+

starting node index

+
+ 		+ required +
end + int + +
+

ending node index

+
+ 		+ required +
+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ int + +
+

Weight of edge

+
+
+ +
+ Notes +

Over-rides euclidean weight to ensure the costs are metric

+
+
+ Source code in tspwplib/problem.py + 
542
+543
+544
+545
+546
+547
+548
+549
+550
+551
+552
+553
+554
+555
+556
+557
+558
+559
+560
+561
+562
def get_weight(self, start: int, end: int) -> int:
+    """Return the weight of the edge between start and end.
+
+    This method provides a single way to obtain edge weights regardless of
+    whether the problem uses an explicit matrix or a distance function.
+
+    Args:
+        start: starting node index
+        end: ending node index
+
+    Returns:
+        Weight of edge
+
+    Notes:
+        Over-rides euclidean weight to ensure the costs are metric
+    """
+    if self.edge_weight_type == EdgeWeightType.EUC_2D:
+        return tsplib95.distances.euclidean(
+            self.node_coords.get(start), self.node_coords.get(end), round=math.ceil
+        )
+    return super().get_weight(start, end)
+
+
+
+ +
+ + +
+ + + +

+ number_of_nodes() + +

+ + +
+ +

Get the number of nodes in the problem

+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ int + +
+

Number of nodes in graph

+
+
+ +
+ Source code in tspwplib/problem.py + 
607
+608
+609
+610
+611
+612
+613
def number_of_nodes(self) -> int:
+    """Get the number of nodes in the problem
+
+    Returns:
+        Number of nodes in graph
+    """
+    return len(list(self.get_nodes()))
+
+
+
+ +
+ + + +
+ +
+ + +
+ +
+ + + +

+ VertexFunctionName + + +

+ + +
+

+ Bases: StrEnumMixin, str, Enum

+ + +

Valid names of functions on vertices

+ +
+ Source code in tspwplib/types.py + 
121
+122
+123
+124
+125
class VertexFunctionName(StrEnumMixin, str, Enum):
+    """Valid names of functions on vertices"""
+
+    demand = "demand"
+    prize = "prize"
+
+
+ + + +
+ + + + + + + + + + + +
+ +
+ + +
+ + + +
+ + + +

+ asymmetric_from_directed(G) + +

+ + +
+ +

Create asymmetric directed graph from directed graph

+

Split every node u two nodes u1 and u2. +We add a directed arc between u1 and u2. +Any previous inward edge v->u is now v->u1 and any outward edge from u is now u2->v.

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
G + DiGraph + +
+

Directed graph

+
+ 		+ required +
+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ DiGraph + +
+

Directed asymmetric graph

+
+
+ +
+ Source code in tspwplib/converter.py + 
38
+39
+40
+41
+42
+43
+44
+45
+46
+47
+48
+49
+50
+51
+52
+53
+54
+55
+56
+57
+58
+59
+60
+61
+62
+63
+64
+65
+66
+67
+68
+69
+70
+71
+72
+73
+74
+75
+76
+77
+78
+79
+80
+81
+82
+83
+84
+85
+86
+87
+88
+89
+90
+91
+92
def asymmetric_from_directed(G: nx.DiGraph) -> nx.DiGraph:
+    """Create asymmetric directed graph from directed graph
+
+    Split every node u two nodes u1 and u2.
+    We add a directed arc between u1 and u2.
+    Any previous inward edge v->u is now v->u1 and any outward edge from u is now u2->v.
+
+    Args:
+        G: Directed graph
+
+    Returns:
+        Directed asymmetric graph
+    """
+    asymmetric_graph = nx.DiGraph()
+    nodes_for_adding: List[Tuple[Vertex, Dict]] = []
+    edges_for_adding: List[Tuple[Vertex, Vertex, Dict]] = []
+    # deepcopy when not a view
+    asymmetric_graph.graph.update(deepcopy(G.graph))
+
+    # find the id of the biggest vertex
+    biggest_vertex = biggest_vertex_id_from_graph(G)
+
+    for vertex, data in G.nodes(data=True):
+        # split the vertex into two
+        head = split_head(biggest_vertex, vertex)
+        tail = split_tail(biggest_vertex, vertex)
+
+        # the data is copied to both vertices
+        tail_data = data.copy()
+        head_data = data.copy()
+
+        # split the value of the prize
+        prize: int = data.get(VertexFunctionName.prize, 0)
+        tail_data[VertexFunctionName.prize] = tail_prize(prize)
+        head_data[VertexFunctionName.prize] = head_prize(prize)
+
+        # add vertex to asymmetric graph with new data
+        nodes_for_adding.append((head, head_data))
+        nodes_for_adding.append((tail, tail_data))
+
+        # add zero-cost edge from tail to head
+        edge = (tail, head, {EdgeFunctionName.cost.value: 0})
+        edges_for_adding.append(edge)
+
+    for u, v, edge_data in G.edges(data=True):
+        # add edge from head of u to tail of v with data
+        u_head = split_head(biggest_vertex, u)
+        v_tail = split_tail(biggest_vertex, v)
+        edge_uv = (u_head, v_tail, edge_data)
+        edges_for_adding.append(edge_uv)
+
+    # add nodes and edges then return graph
+    asymmetric_graph.add_nodes_from(nodes_for_adding)
+    asymmetric_graph.add_edges_from(edges_for_adding)
+    return asymmetric_graph
+
+
+
+ +
+ + +
+ + + +

+ asymmetric_from_undirected(G) + +

+ + +
+ +

Create asymmetric directed graph from undirected graph

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
G + Graph + +
+

Undirected graph

+
+ 		+ required +
+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ DiGraph + +
+

Directed asymmetric graph

+
+
+ +
+ Source code in tspwplib/converter.py + 
 95
+ 96
+ 97
+ 98
+ 99
+100
+101
+102
+103
+104
+105
def asymmetric_from_undirected(G: nx.Graph) -> nx.DiGraph:
+    """Create asymmetric directed graph from undirected graph
+
+    Args:
+        G: Undirected graph
+
+    Returns:
+        Directed asymmetric graph
+    """
+    directed_graph = G.to_directed()
+    return asymmetric_from_directed(directed_graph)
+
+
+
+ +
+ + +
+ + + +

+ biggest_vertex_id_from_graph(G) + +

+ + +
+ +

Return the vertex with the largest integer id

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
G + Graph + +
+

Graph

+
+ 		+ required +
+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ Vertex + +
+

Vertex with biggest id

+
+
+ +
+ Source code in tspwplib/converter.py + 
108
+109
+110
+111
+112
+113
+114
+115
+116
+117
def biggest_vertex_id_from_graph(G: nx.Graph) -> Vertex:
+    """Return the vertex with the largest integer id
+
+    Args:
+        G: Graph
+
+    Returns:
+        Vertex with biggest id
+    """
+    return max(G)
+
+
+
+ +
+ + +
+ + + +

+ build_path_to_londonaq_instance(londonaq_root, name) + +

+ + +
+ +

Build a filepath to a londonaq instance

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
londonaq_root + Path + +
+

Root directory of the londonaq dataset

+
+ 		+ required +
name + LondonaqGraphName + +
+

Londonaq graph name

+
+ 		+ required +
+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ Path + +
+

Filepath to the londonaq txt

+
+
+ +
+ Source code in tspwplib/utils.py + 
34
+35
+36
+37
+38
+39
+40
+41
+42
+43
+44
+45
+46
+47
def build_path_to_londonaq_instance(
+    londonaq_root: Path,
+    name: LondonaqGraphName,
+) -> Path:
+    """Build a filepath to a londonaq instance
+
+    Args:
+        londonaq_root: Root directory of the londonaq dataset
+        name: Londonaq graph name
+
+    Returns:
+        Filepath to the londonaq txt
+    """
+    return londonaq_root / name.value / f"{name.value}.txt"
+
+
+
+ +
+ + +
+ + + +

+ build_path_to_londonaq_yaml(londonaq_root, name) + +

+ + +
+ +

Build a filepath to the londonaq yaml file

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
londonaq_root + Path + +
+

Root directory of the londonaq dataset

+
+ 		+ required +
name + LondonaqGraphName + +
+

Londonaq graph name

+
+ 		+ required +
+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ Path + +
+

Filepath to the londonaq yaml file

+
+
+ +
+ Source code in tspwplib/utils.py + 
21
+22
+23
+24
+25
+26
+27
+28
+29
+30
+31
def build_path_to_londonaq_yaml(londonaq_root: Path, name: LondonaqGraphName) -> Path:
+    """Build a filepath to the londonaq yaml file
+
+    Args:
+        londonaq_root: Root directory of the londonaq dataset
+        name: Londonaq graph name
+
+    Returns:
+        Filepath to the londonaq yaml file
+    """
+    return londonaq_root / name.value / f"{name.value}.yaml"
+
+
+
+ +
+ + +
+ + + +

+ build_path_to_oplib_instance(oplib_root, generation, name, alpha=Alpha.fifty.value) + +

+ + +
+ +

Build a filepath to a oplib instance

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
oplib_root + Path + +
+

The directory of the clones oplib

+
+ 		+ required +
generation + Generation + +
+

Generation of OPLib instance

+
+ 		+ required +
name + GraphName + +
+

Graph instance name

+
+ 		+ required +
alpha + int + +
+

Percent of the total cost to set the cost limit to. +Not useful for instances of Prize-collecting TSPs. +Default is 50. +Note if you change to a different value, make sure the file exists

+
+ 		+ value +
+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ Path + +
+

Path to the OPLib instance

+
+
+ +
+ Source code in tspwplib/utils.py + 
50
+51
+52
+53
+54
+55
+56
+57
+58
+59
+60
+61
+62
+63
+64
+65
+66
+67
+68
+69
+70
+71
def build_path_to_oplib_instance(
+    oplib_root: Path,
+    generation: Generation,
+    name: GraphName,
+    alpha: int = Alpha.fifty.value,
+) -> Path:
+    """Build a filepath to a oplib instance
+
+    Args:
+        oplib_root: The directory of the clones oplib
+        generation: Generation of OPLib instance
+        name: Graph instance name
+        alpha: Percent of the total cost to set the cost limit to.
+            Not useful for instances of Prize-collecting TSPs.
+            Default is 50.
+            Note if you change to a different value, make sure the file exists
+
+    Returns:
+        Path to the OPLib instance
+    """
+    filename: str = name + "-" + generation.value + "-" + str(alpha) + ".oplib"
+    return oplib_root / "instances" / generation.value / filename
+
+
+
+ +
+ + +
+ + + +

+ build_path_to_tsplib_instance(tsplib_root, name) + +

+ + +
+ +

Build a filepath to a tsplib instance

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
tsplib_root + Path + +
+

Directory containing TSP txt instances

+
+ 		+ required +
name + GraphName + +
+

Name of the instance

+
+ 		+ required +
+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ Path + +
+

Filepath to the TSP instance

+
+
+ +
+ Source code in tspwplib/utils.py + 
74
+75
+76
+77
+78
+79
+80
+81
+82
+83
+84
+85
def build_path_to_tsplib_instance(tsplib_root: Path, name: GraphName) -> Path:
+    """Build a filepath to a tsplib instance
+
+    Args:
+        tsplib_root: Directory containing TSP txt instances
+        name: Name of the instance
+
+    Returns:
+        Filepath to the TSP instance
+    """
+    filename = name.value + ".tsp"
+    return tsplib_root / filename
+
+
+
+ +
+ + +
+ + + +

+ edge_list_from_walk(walk) + +

+ + +
+ +

Get ordered list of edges from an ordered list of vertices

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
walk + VertexList + +
+

Ordered list of vertices that represent a walk in the graph

+
+ 		+ required +
+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ EdgeList + +
+

List of edges in the same order as the walk

+
+
+ +
+ Source code in tspwplib/walk.py + 
22
+23
+24
+25
+26
+27
+28
+29
+30
+31
+32
+33
+34
+35
+36
+37
+38
def edge_list_from_walk(walk: VertexList) -> EdgeList:
+    """Get ordered list of edges from an ordered list of vertices
+
+    Args:
+        walk: Ordered list of vertices that represent a walk in the graph
+
+    Returns:
+        List of edges in the same order as the walk
+    """
+    edge_list: EdgeList = []
+    if len(walk) <= 1:
+        return edge_list
+    for i in range(len(walk) - 1):
+        vertex = walk[i]
+        next_vertex = walk[i + 1]
+        edge_list.append((vertex, next_vertex))
+    return edge_list
+
+
+
+ +
+ + +
+ + + +

+ get_original_from_split_vertex(biggest_vertex, split_vertex) + +

+ + +
+ +

Return the original vertex id given a split vertex (may be head or tail)

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
biggest_vertex + Vertex + +
+

The vertex with the biggest id in the original graph

+
+ 		+ required +
split_vertex + Vertex + +
+

A split vertex in asymmetric graph

+
+ 		+ required +
+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ Vertex + +
+

ID of the vertex in the original graph

+
+
+ +
+ Source code in tspwplib/converter.py + 
120
+121
+122
+123
+124
+125
+126
+127
+128
+129
+130
+131
+132
+133
+134
+135
def get_original_from_split_vertex(
+    biggest_vertex: Vertex, split_vertex: Vertex
+) -> Vertex:
+    """Return the original vertex id given a split vertex (may be head or tail)
+
+    Args:
+        biggest_vertex: The vertex with the biggest id in the original graph
+        split_vertex: A split vertex in asymmetric graph
+
+    Returns:
+        ID of the vertex in the original graph
+    """
+    if is_vertex_split_head(biggest_vertex, split_vertex):
+        return split_vertex - 2 * (biggest_vertex + 1)
+    # else split tail
+    return split_vertex - biggest_vertex - 1
+
+
+
+ +
+ + +
+ + + +

+ get_original_path_from_split_path(biggest_vertex, split_path) + +

+ + +
+ +

Get the path in the original graph given a path of split vertices in the asymmetric graph

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
biggest_vertex + Vertex + +
+

The vertex with the biggest id in the original graph

+
+ 		+ required +
split_path + VertexList + +
+

A path of split vertices in the asymmetric directed graph

+
+ 		+ required +
+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ VertexList + +
+

A path of vertices in the original graph

+
+
+ +
+ Source code in tspwplib/converter.py + 
138
+139
+140
+141
+142
+143
+144
+145
+146
+147
+148
+149
+150
+151
+152
+153
+154
+155
+156
+157
+158
+159
+160
+161
+162
def get_original_path_from_split_path(
+    biggest_vertex: Vertex, split_path: VertexList
+) -> VertexList:
+    """Get the path in the original graph given a path of split vertices in the asymmetric graph
+
+    Args:
+        biggest_vertex: The vertex with the biggest id in the original graph
+        split_path: A path of split vertices in the asymmetric directed graph
+
+    Returns:
+        A path of vertices in the original graph
+    """
+    original_path = []
+    previous_vertex = -1
+    for split_vertex in split_path:
+        original_vertex = get_original_from_split_vertex(biggest_vertex, split_vertex)
+        if is_vertex_split_tail(biggest_vertex, split_vertex):
+            original_path.append(original_vertex)
+        elif (
+            is_vertex_split_head(biggest_vertex, split_vertex)
+            and previous_vertex != original_vertex
+        ):
+            original_path.append(original_vertex)
+        previous_vertex = original_vertex
+    return original_path
+
+
+
+ +
+ + +
+ + + +

+ get_quota_from_alpha(alpha, total_prize) + +

+ + +
+ +

The quota is alpha percent of the total prize

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
alpha + int + +
+

Percent of the total prize

+
+ 		+ required +
total_prize + int + +
+

Total prize of the graph

+
+ 		+ required +
+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ int + +
+

quota as an integer

+
+
+ +
+ Source code in tspwplib/problem.py + 
680
+681
+682
+683
+684
+685
+686
+687
+688
+689
+690
+691
+692
+693
+694
def get_quota_from_alpha(alpha: int, total_prize: int) -> int:
+    """The quota is alpha percent of the total prize
+
+    Args:
+        alpha: Percent of the total prize
+        total_prize: Total prize of the graph
+
+    Returns:
+        quota as an integer
+    """
+    if alpha > 100:
+        raise ValueError("Cannot have a percent over 100 for alpha")
+    if alpha < 0:
+        raise ValueError("Cannot have a negative percent for alpha")
+    return int(float(alpha * total_prize) / 100.0)
+
+
+
+ +
+ + +
+ + + +

+ head_prize(prize) + +

+ + +
+ +

Get the prize of the split head

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
prize + int + +
+

The prize of a vertex

+
+ 		+ required +
+

Returns + Split head prize

+ +
+ Source code in tspwplib/converter.py + 
235
+236
+237
+238
+239
+240
+241
+242
+243
+244
+245
+246
def head_prize(prize: int) -> int:
+    """Get the prize of the split head
+
+    Args:
+        prize: The prize of a vertex
+
+    Returns
+        Split head prize
+    """
+    if prize % 2 == 1:
+        return math.ceil(prize / 2.0)
+    return int(prize / 2)
+
+
+
+ +
+ + +
+ + + +

+ is_complete(G) + +

+ + +
+ +

Check if the graph is complete

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
G + Graph + +
+

Simple graph

+
+ 		+ required +
+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ bool + +
+

True if the graph is complete, false otherwise

+
+
+ +
+ Note +

Assumes no self loops

+
+
+ Source code in tspwplib/complete.py + 
 6
+ 7
+ 8
+ 9
+10
+11
+12
+13
+14
+15
+16
+17
+18
+19
+20
+21
+22
def is_complete(G: nx.Graph) -> bool:
+    """Check if the graph is complete
+
+    Args:
+        G: Simple graph
+
+    Returns:
+        True if the graph is complete, false otherwise
+
+    Note:
+        Assumes no self loops
+    """
+    for u in G:
+        for v in G:
+            if not G.has_edge(u, v) and u != v:
+                return False
+    return True
+
+
+
+ +
+ + +
+ + + +

+ is_complete_with_self_loops(G) + +

+ + +
+ +

Check if the graph is complete, and every vertex has a self loop

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
G + Graph + +
+

Simple graph

+
+ 		+ required +
+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ bool + +
+

True if the graph is complete, false otherwise

+
+
+ +
+ Source code in tspwplib/complete.py + 
25
+26
+27
+28
+29
+30
+31
+32
+33
+34
+35
+36
+37
def is_complete_with_self_loops(G: nx.Graph) -> bool:
+    """Check if the graph is complete, and every vertex has a self loop
+
+    Args:
+        G: Simple graph
+
+    Returns:
+        True if the graph is complete, false otherwise
+    """
+    for u in G:
+        if not G.has_edge(u, u):
+            return False
+    return is_complete(G)
+
+
+
+ +
+ + +
+ + + +

+ is_pctsp_yes_instance(graph, quota, root_vertex, edge_list) + +

+ + +
+ +

Returns true if the list of edges is a solution to the instance +of the Prize collecting Travelling Salesman Problem.

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
graph + Graph + +
+

Undirected graph with cost function on edges and prize function on vertices

+
+ 		+ required +
quota + int + +
+

The salesman must collect at least the quota in prize money

+
+ 		+ required +
root_vertex + Vertex + +
+

Start and finish vertex of the tour

+
+ 		+ required +
edge_list + EdgeList + +
+

Edges in the solution of the instance

+
+ 		+ required +
+ + + +

Returns:

+ + + + + + + + + + + + + + + + + +
TypeDescription
+ bool + +
+

True if the total prize of the tour is at least the quota and the tour is a simple

+
+
+ bool + +
+

cycle that starts and ends at the root vertex. False otherwise.

+
+
+ +
+ Source code in tspwplib/problem.py + 
697
+698
+699
+700
+701
+702
+703
+704
+705
+706
+707
+708
+709
+710
+711
+712
+713
+714
+715
+716
+717
+718
+719
+720
+721
+722
+723
+724
+725
def is_pctsp_yes_instance(
+    graph: nx.Graph, quota: int, root_vertex: Vertex, edge_list: EdgeList
+) -> bool:
+    """Returns true if the list of edges is a solution to the instance
+    of the Prize collecting Travelling Salesman Problem.
+
+    Args:
+        graph: Undirected graph with cost function on edges and prize function on vertices
+        quota: The salesman must collect at least the quota in prize money
+        root_vertex: Start and finish vertex of the tour
+        edge_list: Edges in the solution of the instance
+
+    Returns:
+        True if the total prize of the tour is at least the quota and the tour is a simple
+        cycle that starts and ends at the root vertex. False otherwise.
+    """
+    if len(edge_list) < 3:
+        return False
+    walk = walk_from_edge_list(edge_list)
+    vertex_set = set(walk)
+    return (
+        is_simple_cycle(graph, walk)
+        and total_prize(
+            nx.get_node_attributes(graph, VertexFunctionName.prize.value), vertex_set
+        )
+        >= quota
+        and root_vertex == walk[0]
+        and root_vertex == walk[len(walk) - 1]
+    )
+
+
+
+ +
+ + +
+ + + +

+ is_simple_cycle(G, cycle) + +

+ + +
+ +

Is the cycle simple in the graph?

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
G + Graph + +
+

input graph

+
+ 		+ required +
cycle + VertexList + +
+

Ordered sequence of vertices

+
+ 		+ required +
+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ bool + +
+

True if the cycle is simple in the graph

+
+
+ +
+ Source code in tspwplib/walk.py + 
246
+247
+248
+249
+250
+251
+252
+253
+254
+255
+256
+257
+258
+259
+260
+261
+262
+263
def is_simple_cycle(G: nx.Graph, cycle: VertexList) -> bool:
+    """Is the cycle simple in the graph?
+
+    Args:
+        G: input graph
+        cycle: Ordered sequence of vertices
+
+    Returns:
+        True if the cycle is simple in the graph
+    """
+    cycle_length = len(cycle)
+    if cycle_length <= 1:
+        return True
+    return (
+        is_walk(G, cycle)
+        and cycle_length == len(set(cycle)) + 1
+        and cycle[0] == cycle[cycle_length - 1]
+    )
+
+
+
+ +
+ + +
+ + + +

+ is_simple_path(G, path) + +

+ + +
+ +

Is the path simple in the graph?

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
G + Graph + +
+

input graph

+
+ 		+ required +
path + VertexList + +
+

Ordered sequence of vertices

+
+ 		+ required +
+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ bool + +
+

True if the path is simple in the graph

+
+
+ +
+ Source code in tspwplib/walk.py + 
266
+267
+268
+269
+270
+271
+272
+273
+274
+275
+276
def is_simple_path(G: nx.Graph, path: VertexList) -> bool:
+    """Is the path simple in the graph?
+
+    Args:
+        G: input graph
+        path: Ordered sequence of vertices
+
+    Returns:
+        True if the path is simple in the graph
+    """
+    return is_walk(G, path) and len(path) == len(set(path))
+
+
+
+ +
+ + +
+ + + +

+ is_split_vertex_pair(biggest_vertex, tail, head) + +

+ + +
+ +

Does the arc (tail, head) represent a split vertex in the original graph?

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
biggest_vertex + Vertex + +
+

The vertex with the biggest id in the original graph

+
+ 		+ required +
tail + Vertex + +
+

Tail of edge in directed graph

+
+ 		+ required +
head + Vertex + +
+

Head of edge in directed graph

+
+ 		+ required +
+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ bool + +
+

True if the arc (tail, head) represents a split vertex in the original graph

+
+
+ +
+ Source code in tspwplib/converter.py + 
165
+166
+167
+168
+169
+170
+171
+172
+173
+174
+175
+176
+177
+178
+179
+180
def is_split_vertex_pair(biggest_vertex: Vertex, tail: Vertex, head: Vertex) -> bool:
+    """Does the arc (tail, head) represent a split vertex in the original graph?
+
+    Args:
+        biggest_vertex: The vertex with the biggest id in the original graph
+        tail: Tail of edge in directed graph
+        head: Head of edge in directed graph
+
+    Returns:
+        True if the arc (tail, head) represents a split vertex in the original graph
+    """
+    return (
+        head - tail == biggest_vertex + 1
+        and is_vertex_split_head(biggest_vertex, head)
+        and is_vertex_split_tail(biggest_vertex, tail)
+    )
+
+
+
+ +
+ + +
+ + + +

+ is_vertex_split_head(biggest_vertex, split_vertex) + +

+ + +
+ +

Is the vertex a head in the asymmetric graph?

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
biggest_vertex + Vertex + +
+

The vertex with the biggest id in the original graph

+
+ 		+ required +
split_vertex + Vertex + +
+

A potential head of an edge in directed graph

+
+ 		+ required +
+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ bool + +
+

True if the vertex is a head

+
+
+ +
+ Source code in tspwplib/converter.py + 
196
+197
+198
+199
+200
+201
+202
+203
+204
+205
+206
def is_vertex_split_head(biggest_vertex: Vertex, split_vertex: Vertex) -> bool:
+    """Is the vertex a head in the asymmetric graph?
+
+    Args:
+        biggest_vertex: The vertex with the biggest id in the original graph
+        split_vertex: A potential head of an edge in directed graph
+
+    Returns:
+        True if the vertex is a head
+    """
+    return 2 * (biggest_vertex + 1) <= split_vertex < 3 * (biggest_vertex + 1)
+
+
+
+ +
+ + +
+ + + +

+ is_vertex_split_tail(biggest_vertex, vertex) + +

+ + +
+ +

Is the vertex a tail in the asymmetric graph?

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
biggest_vertex + Vertex + +
+

The vertex with the biggest id in the original graph

+
+ 		+ required +
vertex + Vertex + +
+

A potential tail of an edge in directed graph

+
+ 		+ required +
+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ bool + +
+

True if the vertex is a tail

+
+
+ +
+ Source code in tspwplib/converter.py + 
183
+184
+185
+186
+187
+188
+189
+190
+191
+192
+193
def is_vertex_split_tail(biggest_vertex: Vertex, vertex: Vertex) -> bool:
+    """Is the vertex a tail in the asymmetric graph?
+
+    Args:
+        biggest_vertex: The vertex with the biggest id in the original graph
+        vertex: A potential tail of an edge in directed graph
+
+    Returns:
+        True if the vertex is a tail
+    """
+    return biggest_vertex + 1 <= vertex < 2 * (biggest_vertex + 1)
+
+
+
+ +
+ + +
+ + + +

+ is_walk(G, walk) + +

+ + +
+ +

Is the walk a sequence of adjacent vertices in the graph?

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
G + Graph + +
+

input graph

+
+ 		+ required +
walk + VertexList + +
+

Ordered sequence of vertices

+
+ 		+ required +
+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ bool + +
+

True if all vertices are adjacent in the graph

+
+
+ +
+ Source code in tspwplib/walk.py + 
232
+233
+234
+235
+236
+237
+238
+239
+240
+241
+242
+243
def is_walk(G: nx.Graph, walk: VertexList) -> bool:
+    """Is the walk a sequence of adjacent vertices in the graph?
+
+    Args:
+        G: input graph
+        walk: Ordered sequence of vertices
+
+    Returns:
+        True if all vertices are adjacent in the graph
+    """
+    edge_list = edge_list_from_walk(walk)
+    return all(G.has_edge(edge[0], edge[1]) for edge in edge_list)
+
+
+
+ +
+ + +
+ + + +

+ londonaq_comment(location_id, timestamp_id) + +

+ + +
+ +

Get a comment for a londonaq dataset

+ +
+ Source code in tspwplib/utils.py + 
119
+120
+121
+122
+123
+124
+125
def londonaq_comment(
+    location_id: LondonaqLocation, timestamp_id: LondonaqTimestamp
+) -> str:
+    """Get a comment for a londonaq dataset"""
+    comment = f"A London air quality dataset starting at {location_id.value}. "
+    comment += f"The UTC timestamp for the air quality forecast is {timestamp_id.value.isoformat()}"
+    return comment
+
+
+
+ +
+ + +
+ + + +

+ londonaq_graph_name(location_id, timestamp_id) + +

+ + +
+ +

Get a londonaq graph name

+ +
+ Source code in tspwplib/utils.py + 
112
+113
+114
+115
+116
def londonaq_graph_name(
+    location_id: LondonaqLocation, timestamp_id: LondonaqTimestamp
+) -> LondonaqGraphName:
+    """Get a londonaq graph name"""
+    return LondonaqGraphName["laq" + location_id.name + timestamp_id.name]
+
+
+
+ +
+ + +
+ + + +

+ metricness(graph, cost_attr='cost') + +

+ + +
+ +

Measures how metric a cost function is

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
graph + Graph + +
+

Must be undirected, connected and not a tree

+
+ 		+ required +
cost_attr + str + +
+

Name of cost attribute

+
+ 		+ 'cost' +
+ + + +

Returns:

+ + + + + + + + + + + + + + + + + +
TypeDescription
+ float + +
+

If a cost function is metric, return 1.0.

+
+
+ float + +
+

If n-1 edges are metric and the remaining edges are non-metric, return 0.0.

+
+
+ + + +

Raises:

+ + + + + + + + + + + + + + + + + +
TypeDescription
+ NotConnectedException + +
+

If the graph is not connected

+
+
+ NoTreesException + +
+

If the graph is a tree

+
+
+ +
+ Notes +

Self loops are ignored from the metricness

+
+
+ Source code in tspwplib/metric.py + 
10
+11
+12
+13
+14
+15
+16
+17
+18
+19
+20
+21
+22
+23
+24
+25
+26
+27
+28
+29
+30
+31
+32
+33
+34
+35
+36
+37
+38
+39
+40
+41
+42
+43
+44
+45
+46
+47
+48
def metricness(graph: nx.Graph, cost_attr: str = "cost") -> float:
+    """Measures how metric a cost function is
+
+    Args:
+        graph: Must be undirected, connected and not a tree
+        cost_attr: Name of cost attribute
+
+    Returns:
+        If a cost function is metric, return 1.0.
+        If n-1 edges are metric and the remaining edges are non-metric, return 0.0.
+
+    Raises:
+        NotConnectedException: If the graph is not connected
+        NoTreesException: If the graph is a tree
+
+    Notes:
+        Self loops are ignored from the metricness
+    """
+    if not nx.is_connected(graph):
+        raise NotConnectedException("Make sure your graph is connected")
+    if nx.is_tree(graph):
+        raise NoTreesException("Make sure your graph is not a tree")
+    path_cost = dict(nx.all_pairs_bellman_ford_path_length(graph, weight=cost_attr))
+    num_metric = 0
+    num_non_metric = 0
+    num_self_loops = 0
+    for (u, v), cost in nx.get_edge_attributes(graph, cost_attr).items():
+        if u == v:
+            num_self_loops += 1
+        elif cost <= path_cost[u][v]:
+            num_metric += 1
+        else:
+            num_non_metric += 1
+    print(num_metric, "metric edges and", num_non_metric, "non metric edges")
+    numerator = (float)(num_metric - graph.number_of_nodes() + 1)
+    denominator = (float)(
+        graph.number_of_edges() - graph.number_of_nodes() - num_self_loops + 1
+    )
+    return numerator / denominator
+
+
+
+ +
+ + +
+ + + +

+ mst_cost(G, cost_attr='cost') + +

+ + +
+ +

Find the minimum spanning tree of G. +The cost of edges in the tree remains unchanged. +The cost of edges not in the tree is equal to the cost of the minimum spanning tree +plus the original cost of the edges.

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
G + Graph + +
+

Undirected, simple graph

+
+ 		+ required +
cost_attr + str + +
+

Name of the cost attribute of edges

+
+ 		+ 'cost' +
+

Returns + A new cost function

+ +
+ Source code in tspwplib/metric.py + 
72
+73
+74
+75
+76
+77
+78
+79
+80
+81
+82
+83
+84
+85
+86
+87
+88
+89
+90
+91
+92
+93
+94
+95
+96
def mst_cost(G: nx.Graph, cost_attr: str = "cost") -> SimpleEdgeFunction:
+    """Find the minimum spanning tree of G.
+    The cost of edges in the tree remains unchanged.
+    The cost of edges not in the tree is equal to the cost of the minimum spanning tree
+    plus the original cost of the edges.
+
+    Args:
+        G: Undirected, simple graph
+        cost_attr: Name of the cost attribute of edges
+
+    Returns
+        A new cost function
+    """
+    # find the cost of the minimum spanning tree in G
+    T = nx.minimum_spanning_tree(G, weight=cost_attr)
+    tree_cost = dict(nx.all_pairs_bellman_ford_path_length(T, weight=cost_attr))
+
+    # set the cost of the new edges
+    new_cost: SimpleEdgeFunction = {}
+    for (u, v), cost in nx.get_edge_attributes(G, cost_attr).items():
+        if T.has_edge(u, v):
+            new_cost[(u, v)] = cost
+        else:
+            new_cost[(u, v)] = cost + tree_cost[u][v]
+    return new_cost
+
+
+
+ +
+ + +
+ + + +

+ order_edge_list(unordered_edges) + +

+ + +
+ +

Given a list of unordered edges, return an ordered edge list +such that every two adjacent edge in the list are also adjacent in +the input graph.

+

Note that the list of edges should form a simple path or cycle.

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
unordered_edges + EdgeList + +
+

List of unique edges in no particular order

+
+ 		+ required +
+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ EdgeList + +
+

List of unique edges that are adjacent in the graph

+
+
+ + + +

Raises:

+ + + + + + + + + + + + + +
TypeDescription
+ NotSimpleException + +
+

If the list of edges is not a simple path or cycle

+
+
+ +
+ Source code in tspwplib/walk.py + 
 69
+ 70
+ 71
+ 72
+ 73
+ 74
+ 75
+ 76
+ 77
+ 78
+ 79
+ 80
+ 81
+ 82
+ 83
+ 84
+ 85
+ 86
+ 87
+ 88
+ 89
+ 90
+ 91
+ 92
+ 93
+ 94
+ 95
+ 96
+ 97
+ 98
+ 99
+100
+101
+102
+103
+104
+105
+106
+107
+108
+109
+110
+111
+112
+113
+114
+115
+116
+117
+118
+119
+120
+121
+122
+123
+124
+125
+126
+127
+128
+129
+130
+131
+132
+133
+134
+135
+136
+137
+138
+139
+140
+141
+142
+143
+144
+145
+146
+147
+148
+149
+150
def order_edge_list(unordered_edges: EdgeList) -> EdgeList:
+    """Given a list of unordered edges, return an ordered edge list
+    such that every two adjacent edge in the list are also adjacent in
+    the input graph.
+
+    Note that the list of edges should form a simple path or cycle.
+
+    Args:
+        unordered_edges: List of unique edges in no particular order
+
+    Returns:
+        List of unique edges that are adjacent in the graph
+
+    Raises:
+        NotSimpleException: If the list of edges is not a simple path or cycle
+    """
+    if not unordered_edges:
+        return []
+    # create a lookup table of the first and second occurence of each vertex in the edge list
+    first_occurence: VertexLookup = {}
+    second_occurence: VertexLookup = {}
+    for i, edge in enumerate(unordered_edges):
+        __add_vertex_to_occurence(first_occurence, second_occurence, edge[0], i)
+        __add_vertex_to_occurence(first_occurence, second_occurence, edge[1], i)
+
+    for u in first_occurence:
+        if u not in second_occurence:
+            message = f"Vertex {u} does not appear in two edges. Walk must be closed."
+            raise NotSimpleCycleException(message)
+
+    # use the lookup tables to place the edges in the correct order in the edge list
+    ordered_edges = []
+    j = 0
+    target_index = -1
+    found_source = False
+    first_vertex = 0
+    for i, edge in enumerate(unordered_edges):
+        u = edge[0]
+        v = edge[1]
+        if not found_source and u not in second_occurence:
+            j = i
+            found_source = True
+        elif found_source and u not in second_occurence:
+            target_index = i
+            break
+        elif not found_source and v not in second_occurence:
+            j = i
+            found_source = True
+            first_vertex = 1
+        elif found_source and v not in second_occurence:
+            target_index = i
+            break
+    prev = unordered_edges[j][first_vertex]
+    visited = [False] * len(unordered_edges)
+
+    for i in range(len(unordered_edges)):
+        edge = unordered_edges[j]
+        if visited[j]:
+            raise NotSimpleException()
+        visited[j] = True
+        u = edge[0]
+        v = edge[1]
+        ordered_edges.append(edge)
+        if j == target_index:
+            break
+
+        # if u == prev then follow v
+        if u == prev and j == first_occurence[v]:
+            j = second_occurence[v]
+            prev = v
+        elif u == prev and j == second_occurence[v]:
+            j = first_occurence[v]
+            prev = v
+        # if v == prev then follow u
+        elif v == prev and j == first_occurence[u]:
+            j = second_occurence[u]
+            prev = u
+        elif v == prev and j == second_occurence[u]:
+            j = first_occurence[u]
+            prev = u
+
+    return ordered_edges
+
+
+
+ +
+ + +
+ + + +

+ remove_self_loops_from_edge_list(edge_list) + +

+ + +
+ +

Return a new edge list with no self loops

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
edge_list + EdgeList + +
+

List of edges

+
+ 		+ required +
+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ EdgeList + +
+

Edge list with no self loops

+
+
+ +
+ Source code in tspwplib/walk.py + 
353
+354
+355
+356
+357
+358
+359
+360
+361
+362
def remove_self_loops_from_edge_list(edge_list: EdgeList) -> EdgeList:
+    """Return a new edge list with no self loops
+
+    Args:
+        edge_list: List of edges
+
+    Returns:
+        Edge list with no self loops
+    """
+    return [edge for edge in edge_list if edge[0] != edge[1]]
+
+
+
+ +
+ + +
+ + + +

+ rename_edge_attributes(graph, renaming, copy_graph=False, del_old_attr=False) + +

+ + +
+ +

Rename edge attributes

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
graph + Graph + +
+

Networkx graph

+
+ 		+ required +
renaming + Dict[str, str] + +
+

Keys are current attribute names. Values are new attribute names.

+
+ 		+ required +
copy_graph + bool + +
+

If true, copy the graph before renaming attributes.

+
+ 		+ False +
del_old_attr + bool + +
+

If true, delete the old edge attribute.

+
+ 		+ False +
+ + + +

Returns:

+ + + + + + + + + + + + + + + + + +
TypeDescription
+ Graph + +
+

Graph with renamed attributes. If copy_graph is True, then the copied graph is returned.

+
+
+ Graph + +
+

Otherwise the original graph is returned.

+
+
+ +
+ Source code in tspwplib/utils.py + 
128
+129
+130
+131
+132
+133
+134
+135
+136
+137
+138
+139
+140
+141
+142
+143
+144
+145
+146
+147
+148
+149
+150
+151
+152
def rename_edge_attributes(
+    graph: nx.Graph,
+    renaming: Dict[str, str],
+    copy_graph: bool = False,
+    del_old_attr: bool = False,
+) -> nx.Graph:
+    """Rename edge attributes
+
+    Args:
+        graph: Networkx graph
+        renaming: Keys are current attribute names. Values are new attribute names.
+        copy_graph: If true, copy the graph before renaming attributes.
+        del_old_attr: If true, delete the old edge attribute.
+
+    Returns:
+        Graph with renamed attributes. If `copy_graph` is `True`, then the copied graph is returned.
+        Otherwise the original graph is returned.
+    """
+    G = graph.copy() if copy_graph else graph
+    for u, v, data in G.edges(data=True):
+        for old_name, new_name in renaming.items():
+            G.edges[u, v][new_name] = data[old_name]
+            if del_old_attr:  # delete the old attribute
+                data.pop(old_name)
+    return G
+
+
+
+ +
+ + +
+ + + +

+ rename_node_attributes(graph, renaming, copy_graph=False, del_old_attr=False) + +

+ + +
+ +

Rename node attributes

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
graph + Graph + +
+

Networkx graph

+
+ 		+ required +
renaming + Dict[str, str] + +
+

Keys are current attribute names. Values are new attribute names.

+
+ 		+ required +
copy_graph + bool + +
+

If true, copy the graph before renaming attributes.

+
+ 		+ False +
del_old_attr + bool + +
+

If true, delete the old node attribute.

+
+ 		+ False +
+ + + +

Returns:

+ + + + + + + + + + + + + + + + + +
TypeDescription
+ Graph + +
+

Graph with renamed attributes. If copy_graph is True, then the copied graph is returned.

+
+
+ Graph + +
+

Otherwise the original graph is returned.

+
+
+ +
+ Source code in tspwplib/utils.py + 
155
+156
+157
+158
+159
+160
+161
+162
+163
+164
+165
+166
+167
+168
+169
+170
+171
+172
+173
+174
+175
+176
+177
+178
+179
def rename_node_attributes(
+    graph: nx.Graph,
+    renaming: Dict[str, str],
+    copy_graph: bool = False,
+    del_old_attr: bool = False,
+) -> nx.Graph:
+    """Rename node attributes
+
+    Args:
+        graph: Networkx graph
+        renaming: Keys are current attribute names. Values are new attribute names.
+        copy_graph: If true, copy the graph before renaming attributes.
+        del_old_attr: If true, delete the old node attribute.
+
+    Returns:
+        Graph with renamed attributes. If `copy_graph` is `True`, then the copied graph is returned.
+        Otherwise the original graph is returned.
+    """
+    G = graph.copy() if copy_graph else graph
+    for u, data in G.nodes(data=True):
+        for old_name, new_name in renaming.items():
+            G.nodes[u][new_name] = data[old_name]
+            if del_old_attr:  # delete the old attribute
+                data.pop(old_name)
+    return G
+
+
+
+ +
+ + +
+ + + +

+ reorder_edge_list_from_root(edge_list, root) + +

+ + +
+ +

Reorder a list of edges such that the root vertex is in the first (and last) edge

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
edge_list + EdgeList + +
+

List of unique, adjacent edges

+
+ 		+ required +
root + Vertex + +
+

Root vertex

+
+ 		+ required +
+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ EdgeList + +
+

List of edges. The first (and last) edge will contain the root vertex.

+
+
+ + + +

Raises:

+ + + + + + + + + + + + + +
TypeDescription
+ NodeNotFound + +
+

If the root vertex is not in any edges.

+
+
+ +
+ Source code in tspwplib/walk.py + 
153
+154
+155
+156
+157
+158
+159
+160
+161
+162
+163
+164
+165
+166
+167
+168
+169
+170
+171
+172
+173
+174
+175
+176
+177
+178
+179
+180
def reorder_edge_list_from_root(edge_list: EdgeList, root: Vertex) -> EdgeList:
+    """Reorder a list of edges such that the root vertex is in the first (and last) edge
+
+    Args:
+        edge_list: List of unique, adjacent edges
+        root: Root vertex
+
+    Returns:
+        List of edges. The first (and last) edge will contain the root vertex.
+
+    Raises:
+        nx.NodeNotFound: If the root vertex is not in any edges.
+    """
+    root_index = -1
+    not_found = nx.NodeNotFound(f"Root vertex {root} not found in edge list")
+    n = len(edge_list)
+    if n == 0:
+        raise not_found
+    if n > 1 and root in edge_list[0] and root in edge_list[n - 1]:
+        return edge_list
+    for i in range(n):
+        edge = edge_list[i]
+        if root in edge:
+            root_index = i
+    if root_index == -1:
+        raise not_found
+    reordered_edges = edge_list[root_index:] + edge_list[:root_index]
+    return reordered_edges
+
+
+
+ +
+ + +
+ + + +

+ semi_mst_cost(G, cost_attr='cost', seed=0) + +

+ + +
+ +

Half of the non-MST-tree edges are left unchanged. +The other half are assigned cost as described in mst_cost.

+

The half of edges are chosen with uniform and independent probability.

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
G + Graph + +
+

Undirected, simple graph

+
+ 		+ required +
cost_attr + str + +
+

Name of the cost attribute of edges

+
+ 		+ 'cost' +
seed + int + +
+

Set the seed of the random number generator

+
+ 		+ 0 +
+

Returns + A new cost function

+ +
+ Source code in tspwplib/metric.py + 
 99
+100
+101
+102
+103
+104
+105
+106
+107
+108
+109
+110
+111
+112
+113
+114
+115
+116
+117
+118
+119
+120
+121
+122
+123
+124
+125
+126
+127
+128
+129
+130
+131
+132
+133
+134
+135
+136
+137
+138
+139
+140
+141
+142
def semi_mst_cost(
+    G: nx.Graph, cost_attr: str = "cost", seed: int = 0
+) -> SimpleEdgeFunction:
+    """Half of the non-MST-tree edges are left unchanged.
+    The other half are assigned cost as described in mst_cost.
+
+    The half of edges are chosen with uniform and independent probability.
+
+    Args:
+        G: Undirected, simple graph
+        cost_attr: Name of the cost attribute of edges
+        seed: Set the seed of the random number generator
+
+    Returns
+        A new cost function
+    """
+    # find the cost of the minimum spanning tree in G
+    T = nx.minimum_spanning_tree(G, weight=cost_attr)
+    tree_cost = dict(nx.all_pairs_bellman_ford_path_length(T, weight=cost_attr))
+
+    # get edges not in the tree
+    non_tree_edges = [(u, v) for u, v in G.edges() if not T.has_edge(u, v)]
+    num_non_tree_edges = len(non_tree_edges)
+
+    gen = np.random.default_rng(seed=seed)
+    donot_change_edge_cost = set()
+    while len(non_tree_edges) >= float(num_non_tree_edges) * 0.5:
+        index = gen.integers(0, len(non_tree_edges) - 1)  # get random index
+        donot_change_edge_cost.add(
+            non_tree_edges.pop(index)
+        )  # remove item at random index, add to set
+
+    # set the cost of the new edges
+    new_cost: SimpleEdgeFunction = {}
+    for (u, v), cost in nx.get_edge_attributes(G, cost_attr).items():
+        if (
+            T.has_edge(u, v)
+            or (u, v) in donot_change_edge_cost
+            or (v, u) in donot_change_edge_cost
+        ):
+            new_cost[(u, v)] = cost
+        else:
+            new_cost[(u, v)] = cost + tree_cost[u][v]
+    return new_cost
+
+
+
+ +
+ + +
+ + + +

+ sparsify_by_cost(G, kappa, cost_attr='cost', seed=0, remove_self_loops=False) + +

+ + +
+ +

Given vertex i, remove an edge e=(i,j) with probability P[i,j] +where the probability function is weighted according to the cost function:

+

$P[i,j] = c(i,j) / C_i$

+

where $C_i$ is the total cost of all edges adjacent to vertex i.

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
G + Graph + +
+

Graph

+
+ 		+ required +
kappa + int + +
+

Parameter independent of the input size

+
+ 		+ required +
cost_attr + str + +
+

Name of the cost attribute on edges

+
+ 		+ 'cost' +
remove_self_loops + bool + +
+

Should self loops have a change of being removed?

+
+ 		+ False +
seed + int + +
+

Set the random seed for reproducibility of graphs

+
+ 		+ 0 +
+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ Graph + +
+

A deep copy of the original graph with edges removed

+
+
+ +
+ Source code in tspwplib/sparse.py + 
 55
+ 56
+ 57
+ 58
+ 59
+ 60
+ 61
+ 62
+ 63
+ 64
+ 65
+ 66
+ 67
+ 68
+ 69
+ 70
+ 71
+ 72
+ 73
+ 74
+ 75
+ 76
+ 77
+ 78
+ 79
+ 80
+ 81
+ 82
+ 83
+ 84
+ 85
+ 86
+ 87
+ 88
+ 89
+ 90
+ 91
+ 92
+ 93
+ 94
+ 95
+ 96
+ 97
+ 98
+ 99
+100
+101
+102
+103
+104
+105
+106
+107
+108
+109
+110
+111
+112
+113
+114
+115
+116
+117
+118
+119
+120
+121
def sparsify_by_cost(
+    G: nx.Graph,
+    kappa: int,
+    cost_attr: str = "cost",
+    seed: int = 0,
+    remove_self_loops: bool = False,
+) -> nx.Graph:
+    """Given vertex i, remove an edge e=(i,j) with probability P[i,j]
+    where the probability function is weighted according to the cost function:
+
+    $P[i,j] = c(i,j) / C_i$
+
+    where $C_i$ is the total cost of all edges adjacent to vertex i.
+
+    Args:
+        G: Graph
+        kappa: Parameter independent of the input size
+        cost_attr: Name of the cost attribute on edges
+        remove_self_loops: Should self loops have a change of being removed?
+        seed: Set the random seed for reproducibility of graphs
+
+    Returns:
+        A deep copy of the original graph with edges removed
+    """
+    random.seed(seed)
+    graph_copy = deepcopy(G)
+    vertex_list = list(graph_copy.nodes())
+    while graph_copy.number_of_edges() > graph_copy.number_of_nodes() * kappa:
+        # choose vertex randomly
+        u = random.choice(vertex_list)
+        u_has_self_loop = graph_copy.has_edge(u, u)
+        u_neighbors = list(graph_copy.neighbors(u))
+        if u_has_self_loop and not remove_self_loops:
+            u_neighbors.remove(u)
+        if len(u_neighbors) > 0:
+            # draw a random number from uniform and independent distribution (UID)
+            threshold = random.random()
+
+            # the total cost of all adjacent edges is the denominator
+            cost_of_edges = float(
+                total_cost_of_adjacent_edges(graph_copy, u, cost_attr=cost_attr)
+            )
+            chosen_vertex = None
+
+            if u_has_self_loop and not remove_self_loops:
+                cost_of_edges -= graph_copy.get_edge_data(u, u)[cost_attr]
+
+            if cost_of_edges == 0:
+                chosen_vertex = random.choice(u_neighbors)
+
+            else:
+                # iterate over neighbors to check if the edge has been selected
+                probability_so_far = 0.0
+                for v in u_neighbors:
+                    # weight probability of choosing an edges by the cost
+                    edge_prob = (
+                        float(graph_copy.get_edge_data(u, v)[cost_attr]) / cost_of_edges
+                    )
+                    if probability_so_far + edge_prob >= threshold and (
+                        remove_self_loops or u != v
+                    ):
+                        # edge found! break here
+                        chosen_vertex = v
+                        break
+                    probability_so_far += edge_prob
+            graph_copy.remove_edge(u, chosen_vertex)
+    return graph_copy
+
+
+
+ +
+ + +
+ + + +

+ sparsify_uid(G, kappa, remove_self_loops=False, seed=0) + +

+ + +
+ +

Remove edges with uniform and independent (uid) probability until +the number of edges equals kappa * number of nodes

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
G + Graph + +
+

Graph

+
+ 		+ required +
kappa + int + +
+

Parameter independent of the input size

+
+ 		+ required +
remove_self_loops + bool + +
+

Should self loops have a change of being removed?

+
+ 		+ False +
seed + int + +
+

Set the random seed

+
+ 		+ 0 +
+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ Graph + +
+

Graph with kappa * V edges where V is the number of nodes

+
+
+ +
+ Notes +

A copy of the graph is made and returned. The original graph is unedited.

+
+
+ Source code in tspwplib/sparse.py + 
 9
+10
+11
+12
+13
+14
+15
+16
+17
+18
+19
+20
+21
+22
+23
+24
+25
+26
+27
+28
+29
+30
+31
+32
+33
+34
+35
+36
+37
+38
+39
+40
+41
+42
def sparsify_uid(
+    G: nx.Graph,
+    kappa: int,
+    remove_self_loops: bool = False,
+    seed: int = 0,
+) -> nx.Graph:
+    """Remove edges with uniform and independent (uid) probability until
+    the number of edges equals kappa * number of nodes
+
+    Args:
+        G: Graph
+        kappa: Parameter independent of the input size
+        remove_self_loops: Should self loops have a change of being removed?
+        seed: Set the random seed
+
+    Returns:
+        Graph with kappa * V edges where V is the number of nodes
+
+    Notes:
+        A copy of the graph is made and returned. The original graph is unedited.
+    """
+    random.seed(seed)
+    graph_copy = deepcopy(G)
+    vertex_list = list(graph_copy.nodes())
+    while graph_copy.number_of_edges() > graph_copy.number_of_nodes() * kappa:
+        # choose vertex randomly
+        u = random.choice(vertex_list)
+        if graph_copy.degree(u) > 0:
+            # choose a neighbor randomly
+            v = random.choice(list(graph_copy.neighbors(u)))
+            # remove edge if it is not a self loop
+            if remove_self_loops or u != v:
+                graph_copy.remove_edge(u, v)
+    return graph_copy
+
+
+
+ +
+ + +
+ + + +

+ split_graph_from_properties(edge_properties, edge_attr_to_split='cost', edge_attr_to_vertex='length', new_vertex_attr='prize', old_edge_attr='old_edge') + +

+ + +
+ +

Split edges with properties and create undirected simple graph.

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
edge_properties + EdgeProperties + +
+

Keys are edges. Values are dicts of edge attributes.

+
+ 		+ required +
edge_attr_to_split + str + +
+

Name of edge attribute. Assign half the value to each split edge.

+
+ 		+ 'cost' +
edge_attr_to_vertex + str + +
+

Name of edge attribute. Assign edge value to a new vertex attribute.

+
+ 		+ 'length' +
new_vertex_attr + str + +
+

Name of the newly created vertex attribute.

+
+ 		+ 'prize' +
old_edge_attr + str + +
+

Name of the newly created attribute for the old edge ID.

+
+ 		+ 'old_edge' +
+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ Graph + +
+

Undirected simple graph with edge attributes for cost, prize and old_edge

+
+
+ +
+ Notes +

To get the original_edge that a split edge represents, access the 'old_edge' attribute

+
+
+ Source code in tspwplib/converter.py + 
443
+444
+445
+446
+447
+448
+449
+450
+451
+452
+453
+454
+455
+456
+457
+458
+459
+460
+461
+462
+463
+464
+465
+466
+467
+468
+469
+470
+471
+472
+473
+474
+475
+476
+477
+478
+479
+480
+481
+482
+483
+484
+485
+486
+487
+488
+489
+490
+491
+492
+493
+494
+495
+496
+497
+498
+499
def split_graph_from_properties(
+    edge_properties: EdgeProperties,
+    edge_attr_to_split: str = "cost",
+    edge_attr_to_vertex: str = "length",
+    new_vertex_attr: str = "prize",
+    old_edge_attr: str = "old_edge",
+) -> nx.Graph:
+    """Split edges with properties and create undirected simple graph.
+
+    Args:
+        edge_properties: Keys are edges. Values are dicts of edge attributes.
+        edge_attr_to_split: Name of edge attribute. Assign half the value to each split edge.
+        edge_attr_to_vertex: Name of edge attribute. Assign edge value to a new vertex attribute.
+        new_vertex_attr: Name of the newly created vertex attribute.
+        old_edge_attr: Name of the newly created attribute for the old edge ID.
+
+    Returns:
+        Undirected simple graph with edge attributes for cost, prize and old_edge
+
+    Notes:
+        To get the original_edge that a split edge represents, access the 'old_edge' attribute
+    """
+    # check that every edge has an attribute to split and an attr to move to vertex
+    is_edge_attr_to_split = True
+    is_edge_attr_to_vertex = True
+    for data in edge_properties.values():
+        if not edge_attr_to_split in data:
+            is_edge_attr_to_split = False
+        if not edge_attr_to_vertex in data:
+            is_edge_attr_to_vertex = False
+
+    # split edges and create lookups
+    edge_list = list(edge_properties.keys())
+    splits = split_edges(edge_list)
+    to_split = lookup_to_split(edge_list, splits)
+    from_split = lookup_from_split(edge_list, splits)
+
+    # create graph and assign prizes and costs
+    G = nx.Graph()
+    G.add_edges_from(splits)
+    if is_edge_attr_to_vertex:
+        prize = prize_from_weighted_edges(
+            {edge: item[edge_attr_to_vertex] for edge, item in edge_properties.items()},
+            to_split,
+        )
+        nx.set_node_attributes(G, 0.0, name=new_vertex_attr)
+        nx.set_node_attributes(G, prize, name=new_vertex_attr)
+
+    if is_edge_attr_to_split:
+        cost = split_edge_cost(
+            {edge: item[edge_attr_to_split] for edge, item in edge_properties.items()},
+            to_split,
+        )
+        nx.set_edge_attributes(G, 0.0, name=edge_attr_to_split)
+        nx.set_edge_attributes(G, cost, name=edge_attr_to_split)
+    nx.set_edge_attributes(G, from_split, name=old_edge_attr)
+    return G
+
+
+
+ +
+ + +
+ + + +

+ split_head(biggest_vertex, original_vertex) + +

+ + +
+ +

Get the split head of the vertex

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
biggest_vertex + Vertex + +
+

The vertex with the biggest id in the original graph

+
+ 		+ required +
original_vertex + Vertex + +
+

Vertex in the original graph

+
+ 		+ required +
+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ Vertex + +
+

New split vertex that is a head of all arcs in the asymmetric graph

+
+
+ +
+ Source code in tspwplib/converter.py + 
209
+210
+211
+212
+213
+214
+215
+216
+217
+218
+219
def split_head(biggest_vertex: Vertex, original_vertex: Vertex) -> Vertex:
+    """Get the split head of the vertex
+
+    Args:
+        biggest_vertex: The vertex with the biggest id in the original graph
+        original_vertex: Vertex in the original graph
+
+    Returns:
+        New split vertex that is a head of all arcs in the asymmetric graph
+    """
+    return 2 * (biggest_vertex + 1) + original_vertex
+
+
+
+ +
+ + +
+ + + +

+ split_tail(biggest_vertex, original_vertex) + +

+ + +
+ +

Get the split tail of the vertex

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
biggest_vertex + Vertex + +
+

The vertex with the biggest id in the original graph

+
+ 		+ required +
original_vertex + Vertex + +
+

Vertex in the original graph

+
+ 		+ required +
+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ Vertex + +
+

New split vertex that is a tail of all arcs in the asymmetric graph

+
+
+ +
+ Source code in tspwplib/converter.py + 
222
+223
+224
+225
+226
+227
+228
+229
+230
+231
+232
def split_tail(biggest_vertex: Vertex, original_vertex: Vertex) -> Vertex:
+    """Get the split tail of the vertex
+
+    Args:
+        biggest_vertex: The vertex with the biggest id in the original graph
+        original_vertex: Vertex in the original graph
+
+    Returns:
+        New split vertex that is a tail of all arcs in the asymmetric graph
+    """
+    return biggest_vertex + 1 + original_vertex
+
+
+
+ +
+ + +
+ + + +

+ tail_prize(prize) + +

+ + +
+ +

Get the prize of the split tail

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
prize + int + +
+

The prize of a vertex

+
+ 		+ required +
+

Returns + Split tail prize

+ +
+ Source code in tspwplib/converter.py + 
249
+250
+251
+252
+253
+254
+255
+256
+257
+258
def tail_prize(prize: int) -> int:
+    """Get the prize of the split tail
+
+    Args:
+        prize: The prize of a vertex
+
+    Returns
+        Split tail prize
+    """
+    return math.floor(prize / 2.0)
+
+
+
+ +
+ + +
+ + + +

+ to_simple_undirected(G) + +

+ + +
+ +

Given an undirected multigraph, multi edges to create a simple undirected graph.

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
G + MultiGraph + +
+

Undirected networkx multi graph.

+
+ 		+ required +
+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ Graph + +
+

Undirected networkx simple graph with no multi edges.

+
+
+ +
+ Notes +

Assumes the vertex ids are integers.

+
+
+ Source code in tspwplib/converter.py + 
285
+286
+287
+288
+289
+290
+291
+292
+293
+294
+295
+296
+297
+298
+299
+300
+301
+302
+303
+304
+305
+306
+307
+308
+309
+310
+311
+312
+313
+314
+315
+316
+317
+318
+319
+320
+321
+322
+323
+324
+325
+326
+327
+328
+329
+330
+331
+332
+333
def to_simple_undirected(G: nx.MultiGraph) -> nx.Graph:
+    """Given an undirected multigraph, multi edges to create a simple undirected graph.
+
+    Args:
+        G: Undirected networkx multi graph.
+
+    Returns:
+        Undirected networkx simple graph with no multi edges.
+
+    Notes:
+        Assumes the vertex ids are integers.
+    """
+    if not isinstance(G, nx.MultiGraph) and isinstance(G, nx.Graph):
+        return G
+    if isinstance(G, nx.DiGraph):
+        raise TypeError("Directed graphs are not valid for this method")
+    simple_graph = nx.Graph()
+
+    # copy graph attributes to new graph
+    for key, value in simple_graph.graph.items():
+        simple_graph.graph[key] = value
+
+    # copy vertex attributes
+    for v, data in G.nodes(data=True):
+        simple_graph.add_node(v, **data)
+
+    biggest = biggest_vertex_id_from_graph(G)
+
+    for u, v, k, data in G.edges.data(keys=True):
+        if u == v and k > 0:
+            message = "Self loop found with key greater than zero: "
+            message += "implies there is more than one self loop on this vertex."
+            raise UnexpectedSelfLoopException(message)
+
+        # the first multi edge - add all data to new graph edge
+        if k == 0:
+            simple_graph.add_edge(u, v, **data)
+
+        # multi edge - create new vertex for the source if it does not yet exist
+        elif k > 0:
+            vertex_data = G.nodes[u]
+            dummy = new_dummy_vertex(u, k, biggest)
+            simple_graph.add_node(dummy, **vertex_data)
+            simple_graph.add_edge(u, dummy, **data)
+            simple_graph.add_edge(dummy, v, **data)
+        else:
+            raise ValueError("Negative key for edge.")
+
+    return simple_graph
+
+
+
+ +
+ + +
+ + + +

+ to_vertex_dataframe(graph) + +

+ + +
+ +

Convert graph vertices to pandas dataframe

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
graph + Graph + +
+

Input graph

+
+ 		+ required +
+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ DataFrame + +
+

pandas dataframe with vertex set as index

+
+
+ +
+ Source code in tspwplib/converter.py + 
23
+24
+25
+26
+27
+28
+29
+30
+31
+32
+33
+34
+35
def to_vertex_dataframe(graph: nx.Graph) -> pd.DataFrame:
+    """Convert graph vertices to pandas dataframe
+
+    Args:
+        graph: Input graph
+
+    Returns:
+        pandas dataframe with vertex set as index
+    """
+    vertex_data = list(map(lambda x: dict(vertex=x[0], **x[1]), graph.nodes(data=True)))
+    vertex_df = pd.DataFrame(vertex_data)
+    vertex_df = vertex_df.set_index("vertex")
+    return vertex_df
+
+
+
+ +
+ + +
+ + + +

+ total_cost(costs, edges) + +

+ + +
+ +

Total cost of edges

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
costs + EdgeFunction + +
+

Mapping from edges to costs

+
+ 		+ required +
edges + EdgeList + +
+

List of edges

+
+ 		+ required +
+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ int + +
+

Total cost of edges

+
+
+ +
+ Source code in tspwplib/walk.py + 
308
+309
+310
+311
+312
+313
+314
+315
+316
+317
+318
+319
+320
+321
+322
+323
+324
+325
+326
+327
+328
+329
+330
+331
+332
+333
+334
+335
def total_cost(costs: EdgeFunction, edges: EdgeList) -> int:
+    """Total cost of edges
+
+    Args:
+        costs: Mapping from edges to costs
+        edges: List of edges
+
+    Returns:
+        Total cost of edges
+    """
+    sum_cost = 0
+    for edge in edges:
+        try:
+            sum_cost += costs[edge]
+        except KeyError:
+            try:
+                u = edge[0]
+                v = edge[1]
+                sum_cost += costs[(v, u)]
+            except KeyError as second_key_error:
+                raise KeyError(
+                    "Edge ({u},{v}) or ({v},{u}) do not exist in costs map".format(
+                        u=u, v=v
+                    )
+                ) from second_key_error
+        except Exception as error:
+            raise KeyError(f"{edge} does not exist in cost map") from error
+    return sum_cost
+
+
+
+ +
+ + +
+ + + +

+ total_cost_networkx(graph, walk) + +

+ + +
+ +

Get the total cost of edges in a walk of the networkx graph

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
graph + Graph + +
+

Undirected input graph with cost attribute

+
+ 		+ required +
walk + VertexList + +
+

A sequence of adjacent vertices

+
+ 		+ required +
+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ int + +
+

Total cost of edges in the walk

+
+
+ +
+ Source code in tspwplib/walk.py + 
338
+339
+340
+341
+342
+343
+344
+345
+346
+347
+348
+349
+350
def total_cost_networkx(graph: nx.Graph, walk: VertexList) -> int:
+    """Get the total cost of edges in a walk of the networkx graph
+
+    Args:
+        graph: Undirected input graph with cost attribute
+        walk: A sequence of adjacent vertices
+
+    Returns:
+        Total cost of edges in the walk
+    """
+    edges_in_tour = edge_list_from_walk(walk)
+    cost_attr = nx.get_edge_attributes(graph, EdgeFunctionName.cost.value)
+    return total_cost(cost_attr, edges_in_tour)
+
+
+
+ +
+ + +
+ + + +

+ total_prize(prizes, vertices) + +

+ + +
+ +

Total prize of vertices

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
prizes + Mapping[Vertex, int] + +
+

A mapping from vertices to prizes, e.g. dict, property map

+
+ 		+ required +
vertices + Iterable[Vertex] + +
+

List of vertices in the prizes map

+
+ 		+ required +
+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ int + +
+

Total prize of vertices

+
+
+ +
+ Source code in tspwplib/walk.py + 
279
+280
+281
+282
+283
+284
+285
+286
+287
+288
+289
+290
+291
+292
def total_prize(prizes: Mapping[Vertex, int], vertices: Iterable[Vertex]) -> int:
+    """Total prize of vertices
+
+    Args:
+        prizes: A mapping from vertices to prizes, e.g. dict, property map
+        vertices: List of vertices in the prizes map
+
+    Returns:
+        Total prize of vertices
+    """
+    sum_prize: int = 0
+    for vertex in vertices:
+        sum_prize += prizes[vertex]
+    return sum_prize
+
+
+
+ +
+ + +
+ + + +

+ total_prize_of_tour(prizes, tour) + +

+ + +
+ +

Total prize of unique vertices in the tour

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
prizes + Mapping[Vertex, int] + +
+

A mapping from vertices to prizes, e.g. dict, property map

+
+ 		+ required +
tour + VertexList + +
+

List of vertices in the prizes map

+
+ 		+ required +
+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ int + +
+

Total prize of the tour

+
+
+ +
+ Source code in tspwplib/walk.py + 
295
+296
+297
+298
+299
+300
+301
+302
+303
+304
+305
def total_prize_of_tour(prizes: Mapping[Vertex, int], tour: VertexList) -> int:
+    """Total prize of unique vertices in the tour
+
+    Args:
+        prizes: A mapping from vertices to prizes, e.g. dict, property map
+        tour: List of vertices in the prizes map
+
+    Returns:
+        Total prize of the tour
+    """
+    return total_prize(prizes, set(tour))
+
+
+
+ +
+ + +
+ + + +

+ uniform_random_cost(edge_list, min_value=1, max_value=100, seed=0) + +

+ + +
+ +

Generate a cost function for each edge drawn from a uniform and independant probability

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
edge_list + SimpleEdgeList + +
+

List of edges in graph

+
+ 		+ required +
min_value + int + +
+

Minimum value the cost can take (inclusive)

+
+ 		+ 1 +
max_value + int + +
+

Maximum value the cost can take (inclusive)

+
+ 		+ 100 +
seed + int + +
+

Set the seed of the random number generator

+
+ 		+ 0 +
+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ SimpleEdgeFunction + +
+

Edge cost function

+
+
+ +
+ Source code in tspwplib/metric.py + 
51
+52
+53
+54
+55
+56
+57
+58
+59
+60
+61
+62
+63
+64
+65
+66
+67
+68
+69
def uniform_random_cost(
+    edge_list: SimpleEdgeList, min_value: int = 1, max_value: int = 100, seed: int = 0
+) -> SimpleEdgeFunction:
+    """Generate a cost function for each edge drawn from a uniform and independant probability
+
+    Args:
+        edge_list: List of edges in graph
+        min_value: Minimum value the cost can take (inclusive)
+        max_value: Maximum value the cost can take (inclusive)
+        seed: Set the seed of the random number generator
+
+    Returns:
+        Edge cost function
+    """
+    cost: SimpleEdgeFunction = {}
+    random.seed(seed)
+    for u, v in edge_list:
+        cost[(u, v)] = random.randint(min_value, max_value)
+    return cost
+
+
+
+ +
+ + +
+ + + +

+ vertex_set_from_edge_list(edge_list) + +

+ + +
+ +

Get a set of vertices from a list of edges

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
edge_list + EdgeList + +
+

List of edges

+
+ 		+ required +
+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ Set[Vertex] + +
+

Set of vertices in the edge list

+
+
+ +
+ Source code in tspwplib/walk.py + 
41
+42
+43
+44
+45
+46
+47
+48
+49
+50
def vertex_set_from_edge_list(edge_list: EdgeList) -> Set[Vertex]:
+    """Get a set of vertices from a list of edges
+
+    Args:
+        edge_list: List of edges
+
+    Returns:
+        Set of vertices in the edge list
+    """
+    return set(itertools.chain.from_iterable(edge_list))
+
+
+
+ +
+ + +
+ + + +

+ walk_from_edge_list(edge_list) + +

+ + +
+ +

Get a walk from a list of unique, adjacent edges

+ + + +

Parameters:

+ + + + + + + + + + + + + + + + + +
NameTypeDescriptionDefault
edge_list + EdgeList + +
+

List of unique edges that are adjacent in the graph

+
+ 		+ required +
+ + + +

Returns:

+ + + + + + + + + + + + + +
TypeDescription
+ VertexList + +
+

List of vertices in walk of edges

+
+
+ + + +

Raises:

+ + + + + + + + + + + + + +
TypeDescription
+ EdgesNotAdjacentException + +
+

When two edges in the walk are not adjacent

+
+
+ +
+ Source code in tspwplib/walk.py + 
183
+184
+185
+186
+187
+188
+189
+190
+191
+192
+193
+194
+195
+196
+197
+198
+199
+200
+201
+202
+203
+204
+205
+206
+207
+208
+209
+210
+211
+212
+213
+214
+215
+216
+217
+218
+219
+220
+221
+222
+223
+224
+225
+226
+227
+228
+229
def walk_from_edge_list(edge_list: EdgeList) -> VertexList:
+    """Get a walk from a list of unique, adjacent edges
+
+    Args:
+        edge_list: List of unique edges that are adjacent in the graph
+
+    Returns:
+        List of vertices in walk of edges
+
+    Raises:
+        EdgesNotAdjacentException: When two edges in the walk are not adjacent
+    """
+    walk: VertexList = []
+    if len(edge_list) == 0:
+        return walk
+
+    first_edge = edge_list[0]
+    if len(edge_list) == 1:
+        walk.append(first_edge[0])
+        walk.append(first_edge[1])
+        return walk
+
+    second_edge = edge_list[1]
+    if first_edge[0] == second_edge[0] or first_edge[0] == second_edge[1]:
+        current = first_edge[0]
+        walk.append(first_edge[1])
+    else:
+        current = first_edge[1]
+        walk.append(first_edge[0])
+
+    for i in range(1, len(edge_list)):
+        walk.append(current)
+        edge = edge_list[i]
+        u = edge[0]
+        v = edge[1]
+        if u == current:
+            current = v
+        elif v == current:
+            current = u
+        else:
+            message = f"Edges in the edge list must be adjacent, but edge {u} - {v}"
+            message += (
+                f" is not adjacent to vertex {current} from previous edge in list."
+            )
+            raise EdgesNotAdjacentException(message)
+    walk.append(current)
+    return walk
+
+
+
+ +
+ + + +
+ +
+ +
+ + + + + + + + + + + + + +
+
+ + + +
+ +
+ + + +
+
+
+
+ + + + + + + + + + \ No newline at end of file diff --git a/assets/_mkdocstrings.css b/assets/_mkdocstrings.css new file mode 100644 index 0000000..4b7d98b --- /dev/null +++ b/assets/_mkdocstrings.css @@ -0,0 +1,109 @@ + +/* Avoid breaking parameter names, etc. in table cells. */ +.doc-contents td code { + word-break: normal !important; +} + +/* No line break before first paragraph of descriptions. */ +.doc-md-description, +.doc-md-description>p:first-child { + display: inline; +} + +/* Max width for docstring sections tables. */ +.doc .md-typeset__table, +.doc .md-typeset__table table { + display: table !important; + width: 100%; +} + +.doc .md-typeset__table tr { + display: table-row; +} + +/* Defaults in Spacy table style. */ +.doc-param-default { + float: right; +} + +/* Symbols in Navigation and ToC. */ +:root, +[data-md-color-scheme="default"] { + --doc-symbol-attribute-fg-color: #953800; + --doc-symbol-function-fg-color: #8250df; + --doc-symbol-method-fg-color: #8250df; + --doc-symbol-class-fg-color: #0550ae; + --doc-symbol-module-fg-color: #5cad0f; + + --doc-symbol-attribute-bg-color: #9538001a; + --doc-symbol-function-bg-color: #8250df1a; + --doc-symbol-method-bg-color: #8250df1a; + --doc-symbol-class-bg-color: #0550ae1a; + --doc-symbol-module-bg-color: #5cad0f1a; +} + +[data-md-color-scheme="slate"] { + --doc-symbol-attribute-fg-color: #ffa657; + --doc-symbol-function-fg-color: #d2a8ff; + --doc-symbol-method-fg-color: #d2a8ff; + --doc-symbol-class-fg-color: #79c0ff; + --doc-symbol-module-fg-color: #baff79; + + --doc-symbol-attribute-bg-color: #ffa6571a; + --doc-symbol-function-bg-color: #d2a8ff1a; + --doc-symbol-method-bg-color: #d2a8ff1a; + --doc-symbol-class-bg-color: #79c0ff1a; + --doc-symbol-module-bg-color: #baff791a; +} + +code.doc-symbol { + border-radius: .1rem; + font-size: .85em; + padding: 0 .3em; + font-weight: bold; +} + +code.doc-symbol-attribute { + color: var(--doc-symbol-attribute-fg-color); + background-color: var(--doc-symbol-attribute-bg-color); +} + +code.doc-symbol-attribute::after { + content: "attr"; +} + +code.doc-symbol-function { + color: var(--doc-symbol-function-fg-color); + background-color: var(--doc-symbol-function-bg-color); +} + +code.doc-symbol-function::after { + content: "func"; +} + +code.doc-symbol-method { + color: var(--doc-symbol-method-fg-color); + background-color: var(--doc-symbol-method-bg-color); +} + +code.doc-symbol-method::after { + content: "meth"; +} + +code.doc-symbol-class { + color: var(--doc-symbol-class-fg-color); + background-color: var(--doc-symbol-class-bg-color); +} + +code.doc-symbol-class::after { + content: "class"; +} + +code.doc-symbol-module { + color: var(--doc-symbol-module-fg-color); + background-color: var(--doc-symbol-module-bg-color); +} + +code.doc-symbol-module::after { + content: "mod"; +} \ No newline at end of file diff --git a/assets/images/favicon.png b/assets/images/favicon.png new file mode 100644 index 0000000..1cf13b9 Binary files /dev/null and b/assets/images/favicon.png differ diff --git a/assets/javascripts/bundle.bd41221c.min.js b/assets/javascripts/bundle.bd41221c.min.js new file mode 100644 index 0000000..70bcbf1 --- /dev/null +++ b/assets/javascripts/bundle.bd41221c.min.js @@ -0,0 +1,29 @@ +"use strict";(()=>{var _i=Object.create;var br=Object.defineProperty;var Ai=Object.getOwnPropertyDescriptor;var Ci=Object.getOwnPropertyNames,Ft=Object.getOwnPropertySymbols,ki=Object.getPrototypeOf,vr=Object.prototype.hasOwnProperty,eo=Object.prototype.propertyIsEnumerable;var Zr=(e,t,r)=>t in e?br(e,t,{enumerable:!0,configurable:!0,writable:!0,value:r}):e[t]=r,F=(e,t)=>{for(var r in t||(t={}))vr.call(t,r)&&Zr(e,r,t[r]);if(Ft)for(var r of Ft(t))eo.call(t,r)&&Zr(e,r,t[r]);return e};var to=(e,t)=>{var r={};for(var o in e)vr.call(e,o)&&t.indexOf(o)<0&&(r[o]=e[o]);if(e!=null&&Ft)for(var o of Ft(e))t.indexOf(o)<0&&eo.call(e,o)&&(r[o]=e[o]);return r};var gr=(e,t)=>()=>(t||e((t={exports:{}}).exports,t),t.exports);var Hi=(e,t,r,o)=>{if(t&&typeof t=="object"||typeof t=="function")for(let n of Ci(t))!vr.call(e,n)&&n!==r&&br(e,n,{get:()=>t[n],enumerable:!(o=Ai(t,n))||o.enumerable});return e};var jt=(e,t,r)=>(r=e!=null?_i(ki(e)):{},Hi(t||!e||!e.__esModule?br(r,"default",{value:e,enumerable:!0}):r,e));var ro=(e,t,r)=>new Promise((o,n)=>{var i=c=>{try{a(r.next(c))}catch(p){n(p)}},s=c=>{try{a(r.throw(c))}catch(p){n(p)}},a=c=>c.done?o(c.value):Promise.resolve(c.value).then(i,s);a((r=r.apply(e,t)).next())});var no=gr((xr,oo)=>{(function(e,t){typeof xr=="object"&&typeof oo!="undefined"?t():typeof define=="function"&&define.amd?define(t):t()})(xr,function(){"use strict";function e(r){var o=!0,n=!1,i=null,s={text:!0,search:!0,url:!0,tel:!0,email:!0,password:!0,number:!0,date:!0,month:!0,week:!0,time:!0,datetime:!0,"datetime-local":!0};function a(C){return!!(C&&C!==document&&C.nodeName!=="HTML"&&C.nodeName!=="BODY"&&"classList"in C&&"contains"in C.classList)}function c(C){var ct=C.type,Ne=C.tagName;return!!(Ne==="INPUT"&&s[ct]&&!C.readOnly||Ne==="TEXTAREA"&&!C.readOnly||C.isContentEditable)}function p(C){C.classList.contains("focus-visible")||(C.classList.add("focus-visible"),C.setAttribute("data-focus-visible-added",""))}function l(C){C.hasAttribute("data-focus-visible-added")&&(C.classList.remove("focus-visible"),C.removeAttribute("data-focus-visible-added"))}function f(C){C.metaKey||C.altKey||C.ctrlKey||(a(r.activeElement)&&p(r.activeElement),o=!0)}function u(C){o=!1}function h(C){a(C.target)&&(o||c(C.target))&&p(C.target)}function w(C){a(C.target)&&(C.target.classList.contains("focus-visible")||C.target.hasAttribute("data-focus-visible-added"))&&(n=!0,window.clearTimeout(i),i=window.setTimeout(function(){n=!1},100),l(C.target))}function A(C){document.visibilityState==="hidden"&&(n&&(o=!0),Z())}function Z(){document.addEventListener("mousemove",J),document.addEventListener("mousedown",J),document.addEventListener("mouseup",J),document.addEventListener("pointermove",J),document.addEventListener("pointerdown",J),document.addEventListener("pointerup",J),document.addEventListener("touchmove",J),document.addEventListener("touchstart",J),document.addEventListener("touchend",J)}function te(){document.removeEventListener("mousemove",J),document.removeEventListener("mousedown",J),document.removeEventListener("mouseup",J),document.removeEventListener("pointermove",J),document.removeEventListener("pointerdown",J),document.removeEventListener("pointerup",J),document.removeEventListener("touchmove",J),document.removeEventListener("touchstart",J),document.removeEventListener("touchend",J)}function J(C){C.target.nodeName&&C.target.nodeName.toLowerCase()==="html"||(o=!1,te())}document.addEventListener("keydown",f,!0),document.addEventListener("mousedown",u,!0),document.addEventListener("pointerdown",u,!0),document.addEventListener("touchstart",u,!0),document.addEventListener("visibilitychange",A,!0),Z(),r.addEventListener("focus",h,!0),r.addEventListener("blur",w,!0),r.nodeType===Node.DOCUMENT_FRAGMENT_NODE&&r.host?r.host.setAttribute("data-js-focus-visible",""):r.nodeType===Node.DOCUMENT_NODE&&(document.documentElement.classList.add("js-focus-visible"),document.documentElement.setAttribute("data-js-focus-visible",""))}if(typeof window!="undefined"&&typeof document!="undefined"){window.applyFocusVisiblePolyfill=e;var t;try{t=new CustomEvent("focus-visible-polyfill-ready")}catch(r){t=document.createEvent("CustomEvent"),t.initCustomEvent("focus-visible-polyfill-ready",!1,!1,{})}window.dispatchEvent(t)}typeof document!="undefined"&&e(document)})});var zr=gr((kt,Vr)=>{/*! + * clipboard.js v2.0.11 + * https://clipboardjs.com/ + * + * Licensed MIT © Zeno Rocha + */(function(t,r){typeof kt=="object"&&typeof Vr=="object"?Vr.exports=r():typeof define=="function"&&define.amd?define([],r):typeof kt=="object"?kt.ClipboardJS=r():t.ClipboardJS=r()})(kt,function(){return function(){var e={686:function(o,n,i){"use strict";i.d(n,{default:function(){return Li}});var s=i(279),a=i.n(s),c=i(370),p=i.n(c),l=i(817),f=i.n(l);function u(D){try{return document.execCommand(D)}catch(M){return!1}}var h=function(M){var O=f()(M);return u("cut"),O},w=h;function A(D){var M=document.documentElement.getAttribute("dir")==="rtl",O=document.createElement("textarea");O.style.fontSize="12pt",O.style.border="0",O.style.padding="0",O.style.margin="0",O.style.position="absolute",O.style[M?"right":"left"]="-9999px";var I=window.pageYOffset||document.documentElement.scrollTop;return O.style.top="".concat(I,"px"),O.setAttribute("readonly",""),O.value=D,O}var Z=function(M,O){var I=A(M);O.container.appendChild(I);var W=f()(I);return u("copy"),I.remove(),W},te=function(M){var O=arguments.length>1&&arguments[1]!==void 0?arguments[1]:{container:document.body},I="";return typeof M=="string"?I=Z(M,O):M instanceof HTMLInputElement&&!["text","search","url","tel","password"].includes(M==null?void 0:M.type)?I=Z(M.value,O):(I=f()(M),u("copy")),I},J=te;function C(D){"@babel/helpers - typeof";return typeof Symbol=="function"&&typeof Symbol.iterator=="symbol"?C=function(O){return typeof O}:C=function(O){return O&&typeof Symbol=="function"&&O.constructor===Symbol&&O!==Symbol.prototype?"symbol":typeof O},C(D)}var ct=function(){var M=arguments.length>0&&arguments[0]!==void 0?arguments[0]:{},O=M.action,I=O===void 0?"copy":O,W=M.container,K=M.target,Ce=M.text;if(I!=="copy"&&I!=="cut")throw new Error('Invalid "action" value, use either "copy" or "cut"');if(K!==void 0)if(K&&C(K)==="object"&&K.nodeType===1){if(I==="copy"&&K.hasAttribute("disabled"))throw new Error('Invalid "target" attribute. Please use "readonly" instead of "disabled" attribute');if(I==="cut"&&(K.hasAttribute("readonly")||K.hasAttribute("disabled")))throw new Error(`Invalid "target" attribute. You can't cut text from elements with "readonly" or "disabled" attributes`)}else throw new Error('Invalid "target" value, use a valid Element');if(Ce)return J(Ce,{container:W});if(K)return I==="cut"?w(K):J(K,{container:W})},Ne=ct;function Pe(D){"@babel/helpers - typeof";return typeof Symbol=="function"&&typeof Symbol.iterator=="symbol"?Pe=function(O){return typeof O}:Pe=function(O){return O&&typeof Symbol=="function"&&O.constructor===Symbol&&O!==Symbol.prototype?"symbol":typeof O},Pe(D)}function xi(D,M){if(!(D instanceof M))throw new TypeError("Cannot call a class as a function")}function Xr(D,M){for(var O=0;O0&&arguments[0]!==void 0?arguments[0]:{};this.action=typeof W.action=="function"?W.action:this.defaultAction,this.target=typeof W.target=="function"?W.target:this.defaultTarget,this.text=typeof W.text=="function"?W.text:this.defaultText,this.container=Pe(W.container)==="object"?W.container:document.body}},{key:"listenClick",value:function(W){var K=this;this.listener=p()(W,"click",function(Ce){return K.onClick(Ce)})}},{key:"onClick",value:function(W){var K=W.delegateTarget||W.currentTarget,Ce=this.action(K)||"copy",It=Ne({action:Ce,container:this.container,target:this.target(K),text:this.text(K)});this.emit(It?"success":"error",{action:Ce,text:It,trigger:K,clearSelection:function(){K&&K.focus(),window.getSelection().removeAllRanges()}})}},{key:"defaultAction",value:function(W){return hr("action",W)}},{key:"defaultTarget",value:function(W){var K=hr("target",W);if(K)return document.querySelector(K)}},{key:"defaultText",value:function(W){return hr("text",W)}},{key:"destroy",value:function(){this.listener.destroy()}}],[{key:"copy",value:function(W){var K=arguments.length>1&&arguments[1]!==void 0?arguments[1]:{container:document.body};return J(W,K)}},{key:"cut",value:function(W){return w(W)}},{key:"isSupported",value:function(){var W=arguments.length>0&&arguments[0]!==void 0?arguments[0]:["copy","cut"],K=typeof W=="string"?[W]:W,Ce=!!document.queryCommandSupported;return K.forEach(function(It){Ce=Ce&&!!document.queryCommandSupported(It)}),Ce}}]),O}(a()),Li=Mi},828:function(o){var n=9;if(typeof Element!="undefined"&&!Element.prototype.matches){var i=Element.prototype;i.matches=i.matchesSelector||i.mozMatchesSelector||i.msMatchesSelector||i.oMatchesSelector||i.webkitMatchesSelector}function s(a,c){for(;a&&a.nodeType!==n;){if(typeof a.matches=="function"&&a.matches(c))return a;a=a.parentNode}}o.exports=s},438:function(o,n,i){var s=i(828);function a(l,f,u,h,w){var A=p.apply(this,arguments);return l.addEventListener(u,A,w),{destroy:function(){l.removeEventListener(u,A,w)}}}function c(l,f,u,h,w){return typeof l.addEventListener=="function"?a.apply(null,arguments):typeof u=="function"?a.bind(null,document).apply(null,arguments):(typeof l=="string"&&(l=document.querySelectorAll(l)),Array.prototype.map.call(l,function(A){return a(A,f,u,h,w)}))}function p(l,f,u,h){return function(w){w.delegateTarget=s(w.target,f),w.delegateTarget&&h.call(l,w)}}o.exports=c},879:function(o,n){n.node=function(i){return i!==void 0&&i instanceof HTMLElement&&i.nodeType===1},n.nodeList=function(i){var s=Object.prototype.toString.call(i);return i!==void 0&&(s==="[object NodeList]"||s==="[object HTMLCollection]")&&"length"in i&&(i.length===0||n.node(i[0]))},n.string=function(i){return typeof i=="string"||i instanceof String},n.fn=function(i){var s=Object.prototype.toString.call(i);return s==="[object Function]"}},370:function(o,n,i){var s=i(879),a=i(438);function c(u,h,w){if(!u&&!h&&!w)throw new Error("Missing required arguments");if(!s.string(h))throw new TypeError("Second argument must be a String");if(!s.fn(w))throw new TypeError("Third argument must be a Function");if(s.node(u))return p(u,h,w);if(s.nodeList(u))return l(u,h,w);if(s.string(u))return f(u,h,w);throw new TypeError("First argument must be a String, HTMLElement, HTMLCollection, or NodeList")}function p(u,h,w){return u.addEventListener(h,w),{destroy:function(){u.removeEventListener(h,w)}}}function l(u,h,w){return Array.prototype.forEach.call(u,function(A){A.addEventListener(h,w)}),{destroy:function(){Array.prototype.forEach.call(u,function(A){A.removeEventListener(h,w)})}}}function f(u,h,w){return a(document.body,u,h,w)}o.exports=c},817:function(o){function n(i){var s;if(i.nodeName==="SELECT")i.focus(),s=i.value;else if(i.nodeName==="INPUT"||i.nodeName==="TEXTAREA"){var a=i.hasAttribute("readonly");a||i.setAttribute("readonly",""),i.select(),i.setSelectionRange(0,i.value.length),a||i.removeAttribute("readonly"),s=i.value}else{i.hasAttribute("contenteditable")&&i.focus();var c=window.getSelection(),p=document.createRange();p.selectNodeContents(i),c.removeAllRanges(),c.addRange(p),s=c.toString()}return s}o.exports=n},279:function(o){function n(){}n.prototype={on:function(i,s,a){var c=this.e||(this.e={});return(c[i]||(c[i]=[])).push({fn:s,ctx:a}),this},once:function(i,s,a){var c=this;function p(){c.off(i,p),s.apply(a,arguments)}return p._=s,this.on(i,p,a)},emit:function(i){var s=[].slice.call(arguments,1),a=((this.e||(this.e={}))[i]||[]).slice(),c=0,p=a.length;for(c;c{"use strict";/*! + * escape-html + * Copyright(c) 2012-2013 TJ Holowaychuk + * Copyright(c) 2015 Andreas Lubbe + * Copyright(c) 2015 Tiancheng "Timothy" Gu + * MIT Licensed + */var Va=/["'&<>]/;qn.exports=za;function za(e){var t=""+e,r=Va.exec(t);if(!r)return t;var o,n="",i=0,s=0;for(i=r.index;i0&&i[i.length-1])&&(p[0]===6||p[0]===2)){r=0;continue}if(p[0]===3&&(!i||p[1]>i[0]&&p[1]=e.length&&(e=void 0),{value:e&&e[o++],done:!e}}};throw new TypeError(t?"Object is not iterable.":"Symbol.iterator is not defined.")}function V(e,t){var r=typeof Symbol=="function"&&e[Symbol.iterator];if(!r)return e;var o=r.call(e),n,i=[],s;try{for(;(t===void 0||t-- >0)&&!(n=o.next()).done;)i.push(n.value)}catch(a){s={error:a}}finally{try{n&&!n.done&&(r=o.return)&&r.call(o)}finally{if(s)throw s.error}}return i}function z(e,t,r){if(r||arguments.length===2)for(var o=0,n=t.length,i;o1||a(u,h)})})}function a(u,h){try{c(o[u](h))}catch(w){f(i[0][3],w)}}function c(u){u.value instanceof ot?Promise.resolve(u.value.v).then(p,l):f(i[0][2],u)}function p(u){a("next",u)}function l(u){a("throw",u)}function f(u,h){u(h),i.shift(),i.length&&a(i[0][0],i[0][1])}}function so(e){if(!Symbol.asyncIterator)throw new TypeError("Symbol.asyncIterator is not defined.");var t=e[Symbol.asyncIterator],r;return t?t.call(e):(e=typeof ue=="function"?ue(e):e[Symbol.iterator](),r={},o("next"),o("throw"),o("return"),r[Symbol.asyncIterator]=function(){return this},r);function o(i){r[i]=e[i]&&function(s){return new Promise(function(a,c){s=e[i](s),n(a,c,s.done,s.value)})}}function n(i,s,a,c){Promise.resolve(c).then(function(p){i({value:p,done:a})},s)}}function k(e){return typeof e=="function"}function pt(e){var t=function(o){Error.call(o),o.stack=new Error().stack},r=e(t);return r.prototype=Object.create(Error.prototype),r.prototype.constructor=r,r}var Wt=pt(function(e){return function(r){e(this),this.message=r?r.length+` errors occurred during unsubscription: +`+r.map(function(o,n){return n+1+") "+o.toString()}).join(` + `):"",this.name="UnsubscriptionError",this.errors=r}});function Ve(e,t){if(e){var r=e.indexOf(t);0<=r&&e.splice(r,1)}}var Ie=function(){function e(t){this.initialTeardown=t,this.closed=!1,this._parentage=null,this._finalizers=null}return e.prototype.unsubscribe=function(){var t,r,o,n,i;if(!this.closed){this.closed=!0;var s=this._parentage;if(s)if(this._parentage=null,Array.isArray(s))try{for(var a=ue(s),c=a.next();!c.done;c=a.next()){var p=c.value;p.remove(this)}}catch(A){t={error:A}}finally{try{c&&!c.done&&(r=a.return)&&r.call(a)}finally{if(t)throw t.error}}else s.remove(this);var l=this.initialTeardown;if(k(l))try{l()}catch(A){i=A instanceof Wt?A.errors:[A]}var f=this._finalizers;if(f){this._finalizers=null;try{for(var u=ue(f),h=u.next();!h.done;h=u.next()){var w=h.value;try{co(w)}catch(A){i=i!=null?i:[],A instanceof Wt?i=z(z([],V(i)),V(A.errors)):i.push(A)}}}catch(A){o={error:A}}finally{try{h&&!h.done&&(n=u.return)&&n.call(u)}finally{if(o)throw o.error}}}if(i)throw new Wt(i)}},e.prototype.add=function(t){var r;if(t&&t!==this)if(this.closed)co(t);else{if(t instanceof e){if(t.closed||t._hasParent(this))return;t._addParent(this)}(this._finalizers=(r=this._finalizers)!==null&&r!==void 0?r:[]).push(t)}},e.prototype._hasParent=function(t){var r=this._parentage;return r===t||Array.isArray(r)&&r.includes(t)},e.prototype._addParent=function(t){var r=this._parentage;this._parentage=Array.isArray(r)?(r.push(t),r):r?[r,t]:t},e.prototype._removeParent=function(t){var r=this._parentage;r===t?this._parentage=null:Array.isArray(r)&&Ve(r,t)},e.prototype.remove=function(t){var r=this._finalizers;r&&Ve(r,t),t instanceof e&&t._removeParent(this)},e.EMPTY=function(){var t=new e;return t.closed=!0,t}(),e}();var Er=Ie.EMPTY;function Dt(e){return e instanceof Ie||e&&"closed"in e&&k(e.remove)&&k(e.add)&&k(e.unsubscribe)}function co(e){k(e)?e():e.unsubscribe()}var ke={onUnhandledError:null,onStoppedNotification:null,Promise:void 0,useDeprecatedSynchronousErrorHandling:!1,useDeprecatedNextContext:!1};var lt={setTimeout:function(e,t){for(var r=[],o=2;o0},enumerable:!1,configurable:!0}),t.prototype._trySubscribe=function(r){return this._throwIfClosed(),e.prototype._trySubscribe.call(this,r)},t.prototype._subscribe=function(r){return this._throwIfClosed(),this._checkFinalizedStatuses(r),this._innerSubscribe(r)},t.prototype._innerSubscribe=function(r){var o=this,n=this,i=n.hasError,s=n.isStopped,a=n.observers;return i||s?Er:(this.currentObservers=null,a.push(r),new Ie(function(){o.currentObservers=null,Ve(a,r)}))},t.prototype._checkFinalizedStatuses=function(r){var o=this,n=o.hasError,i=o.thrownError,s=o.isStopped;n?r.error(i):s&&r.complete()},t.prototype.asObservable=function(){var r=new j;return r.source=this,r},t.create=function(r,o){return new vo(r,o)},t}(j);var vo=function(e){se(t,e);function t(r,o){var n=e.call(this)||this;return n.destination=r,n.source=o,n}return t.prototype.next=function(r){var o,n;(n=(o=this.destination)===null||o===void 0?void 0:o.next)===null||n===void 0||n.call(o,r)},t.prototype.error=function(r){var o,n;(n=(o=this.destination)===null||o===void 0?void 0:o.error)===null||n===void 0||n.call(o,r)},t.prototype.complete=function(){var r,o;(o=(r=this.destination)===null||r===void 0?void 0:r.complete)===null||o===void 0||o.call(r)},t.prototype._subscribe=function(r){var o,n;return(n=(o=this.source)===null||o===void 0?void 0:o.subscribe(r))!==null&&n!==void 0?n:Er},t}(v);var St={now:function(){return(St.delegate||Date).now()},delegate:void 0};var Ot=function(e){se(t,e);function t(r,o,n){r===void 0&&(r=1/0),o===void 0&&(o=1/0),n===void 0&&(n=St);var i=e.call(this)||this;return i._bufferSize=r,i._windowTime=o,i._timestampProvider=n,i._buffer=[],i._infiniteTimeWindow=!0,i._infiniteTimeWindow=o===1/0,i._bufferSize=Math.max(1,r),i._windowTime=Math.max(1,o),i}return t.prototype.next=function(r){var o=this,n=o.isStopped,i=o._buffer,s=o._infiniteTimeWindow,a=o._timestampProvider,c=o._windowTime;n||(i.push(r),!s&&i.push(a.now()+c)),this._trimBuffer(),e.prototype.next.call(this,r)},t.prototype._subscribe=function(r){this._throwIfClosed(),this._trimBuffer();for(var o=this._innerSubscribe(r),n=this,i=n._infiniteTimeWindow,s=n._buffer,a=s.slice(),c=0;c0?e.prototype.requestAsyncId.call(this,r,o,n):(r.actions.push(this),r._scheduled||(r._scheduled=ut.requestAnimationFrame(function(){return r.flush(void 0)})))},t.prototype.recycleAsyncId=function(r,o,n){var i;if(n===void 0&&(n=0),n!=null?n>0:this.delay>0)return e.prototype.recycleAsyncId.call(this,r,o,n);var s=r.actions;o!=null&&((i=s[s.length-1])===null||i===void 0?void 0:i.id)!==o&&(ut.cancelAnimationFrame(o),r._scheduled=void 0)},t}(zt);var yo=function(e){se(t,e);function t(){return e!==null&&e.apply(this,arguments)||this}return t.prototype.flush=function(r){this._active=!0;var o=this._scheduled;this._scheduled=void 0;var n=this.actions,i;r=r||n.shift();do if(i=r.execute(r.state,r.delay))break;while((r=n[0])&&r.id===o&&n.shift());if(this._active=!1,i){for(;(r=n[0])&&r.id===o&&n.shift();)r.unsubscribe();throw i}},t}(qt);var de=new yo(xo);var L=new j(function(e){return e.complete()});function Kt(e){return e&&k(e.schedule)}function _r(e){return e[e.length-1]}function Je(e){return k(_r(e))?e.pop():void 0}function Ae(e){return Kt(_r(e))?e.pop():void 0}function Qt(e,t){return typeof _r(e)=="number"?e.pop():t}var dt=function(e){return e&&typeof e.length=="number"&&typeof e!="function"};function Yt(e){return k(e==null?void 0:e.then)}function Bt(e){return k(e[ft])}function Gt(e){return Symbol.asyncIterator&&k(e==null?void 0:e[Symbol.asyncIterator])}function Jt(e){return new TypeError("You provided "+(e!==null&&typeof e=="object"?"an invalid object":"'"+e+"'")+" where a stream was expected. You can provide an Observable, Promise, ReadableStream, Array, AsyncIterable, or Iterable.")}function Di(){return typeof Symbol!="function"||!Symbol.iterator?"@@iterator":Symbol.iterator}var Xt=Di();function Zt(e){return k(e==null?void 0:e[Xt])}function er(e){return ao(this,arguments,function(){var r,o,n,i;return Ut(this,function(s){switch(s.label){case 0:r=e.getReader(),s.label=1;case 1:s.trys.push([1,,9,10]),s.label=2;case 2:return[4,ot(r.read())];case 3:return o=s.sent(),n=o.value,i=o.done,i?[4,ot(void 0)]:[3,5];case 4:return[2,s.sent()];case 5:return[4,ot(n)];case 6:return[4,s.sent()];case 7:return s.sent(),[3,2];case 8:return[3,10];case 9:return r.releaseLock(),[7];case 10:return[2]}})})}function tr(e){return k(e==null?void 0:e.getReader)}function N(e){if(e instanceof j)return e;if(e!=null){if(Bt(e))return Ni(e);if(dt(e))return Vi(e);if(Yt(e))return zi(e);if(Gt(e))return Eo(e);if(Zt(e))return qi(e);if(tr(e))return Ki(e)}throw Jt(e)}function Ni(e){return new j(function(t){var r=e[ft]();if(k(r.subscribe))return r.subscribe(t);throw new TypeError("Provided object does not correctly implement Symbol.observable")})}function Vi(e){return new j(function(t){for(var r=0;r=2;return function(o){return o.pipe(e?g(function(n,i){return e(n,i,o)}):ce,ye(1),r?Qe(t):jo(function(){return new or}))}}function $r(e){return e<=0?function(){return L}:x(function(t,r){var o=[];t.subscribe(S(r,function(n){o.push(n),e=2,!0))}function le(e){e===void 0&&(e={});var t=e.connector,r=t===void 0?function(){return new v}:t,o=e.resetOnError,n=o===void 0?!0:o,i=e.resetOnComplete,s=i===void 0?!0:i,a=e.resetOnRefCountZero,c=a===void 0?!0:a;return function(p){var l,f,u,h=0,w=!1,A=!1,Z=function(){f==null||f.unsubscribe(),f=void 0},te=function(){Z(),l=u=void 0,w=A=!1},J=function(){var C=l;te(),C==null||C.unsubscribe()};return x(function(C,ct){h++,!A&&!w&&Z();var Ne=u=u!=null?u:r();ct.add(function(){h--,h===0&&!A&&!w&&(f=Pr(J,c))}),Ne.subscribe(ct),!l&&h>0&&(l=new it({next:function(Pe){return Ne.next(Pe)},error:function(Pe){A=!0,Z(),f=Pr(te,n,Pe),Ne.error(Pe)},complete:function(){w=!0,Z(),f=Pr(te,s),Ne.complete()}}),N(C).subscribe(l))})(p)}}function Pr(e,t){for(var r=[],o=2;oe.next(document)),e}function R(e,t=document){return Array.from(t.querySelectorAll(e))}function P(e,t=document){let r=me(e,t);if(typeof r=="undefined")throw new ReferenceError(`Missing element: expected "${e}" to be present`);return r}function me(e,t=document){return t.querySelector(e)||void 0}function Re(){var e,t,r,o;return(o=(r=(t=(e=document.activeElement)==null?void 0:e.shadowRoot)==null?void 0:t.activeElement)!=null?r:document.activeElement)!=null?o:void 0}var la=T(d(document.body,"focusin"),d(document.body,"focusout")).pipe(be(1),q(void 0),m(()=>Re()||document.body),B(1));function vt(e){return la.pipe(m(t=>e.contains(t)),Y())}function Vo(e,t){return T(d(e,"mouseenter").pipe(m(()=>!0)),d(e,"mouseleave").pipe(m(()=>!1))).pipe(t?be(t):ce,q(!1))}function Ue(e){return{x:e.offsetLeft,y:e.offsetTop}}function zo(e){return T(d(window,"load"),d(window,"resize")).pipe(Me(0,de),m(()=>Ue(e)),q(Ue(e)))}function ir(e){return{x:e.scrollLeft,y:e.scrollTop}}function et(e){return T(d(e,"scroll"),d(window,"resize")).pipe(Me(0,de),m(()=>ir(e)),q(ir(e)))}function qo(e,t){if(typeof t=="string"||typeof t=="number")e.innerHTML+=t.toString();else if(t instanceof Node)e.appendChild(t);else if(Array.isArray(t))for(let r of t)qo(e,r)}function E(e,t,...r){let o=document.createElement(e);if(t)for(let n of Object.keys(t))typeof t[n]!="undefined"&&(typeof t[n]!="boolean"?o.setAttribute(n,t[n]):o.setAttribute(n,""));for(let n of r)qo(o,n);return o}function ar(e){if(e>999){let t=+((e-950)%1e3>99);return`${((e+1e-6)/1e3).toFixed(t)}k`}else return e.toString()}function gt(e){let t=E("script",{src:e});return H(()=>(document.head.appendChild(t),T(d(t,"load"),d(t,"error").pipe(b(()=>Ar(()=>new ReferenceError(`Invalid script: ${e}`))))).pipe(m(()=>{}),_(()=>document.head.removeChild(t)),ye(1))))}var Ko=new v,ma=H(()=>typeof ResizeObserver=="undefined"?gt("https://unpkg.com/resize-observer-polyfill"):$(void 0)).pipe(m(()=>new ResizeObserver(e=>{for(let t of e)Ko.next(t)})),b(e=>T(qe,$(e)).pipe(_(()=>e.disconnect()))),B(1));function pe(e){return{width:e.offsetWidth,height:e.offsetHeight}}function Ee(e){return ma.pipe(y(t=>t.observe(e)),b(t=>Ko.pipe(g(({target:r})=>r===e),_(()=>t.unobserve(e)),m(()=>pe(e)))),q(pe(e)))}function xt(e){return{width:e.scrollWidth,height:e.scrollHeight}}function sr(e){let t=e.parentElement;for(;t&&(e.scrollWidth<=t.scrollWidth&&e.scrollHeight<=t.scrollHeight);)t=(e=t).parentElement;return t?e:void 0}var Qo=new v,fa=H(()=>$(new IntersectionObserver(e=>{for(let t of e)Qo.next(t)},{threshold:0}))).pipe(b(e=>T(qe,$(e)).pipe(_(()=>e.disconnect()))),B(1));function yt(e){return fa.pipe(y(t=>t.observe(e)),b(t=>Qo.pipe(g(({target:r})=>r===e),_(()=>t.unobserve(e)),m(({isIntersecting:r})=>r))))}function Yo(e,t=16){return et(e).pipe(m(({y:r})=>{let o=pe(e),n=xt(e);return r>=n.height-o.height-t}),Y())}var cr={drawer:P("[data-md-toggle=drawer]"),search:P("[data-md-toggle=search]")};function Bo(e){return cr[e].checked}function Be(e,t){cr[e].checked!==t&&cr[e].click()}function We(e){let t=cr[e];return d(t,"change").pipe(m(()=>t.checked),q(t.checked))}function ua(e,t){switch(e.constructor){case HTMLInputElement:return e.type==="radio"?/^Arrow/.test(t):!0;case HTMLSelectElement:case HTMLTextAreaElement:return!0;default:return e.isContentEditable}}function da(){return T(d(window,"compositionstart").pipe(m(()=>!0)),d(window,"compositionend").pipe(m(()=>!1))).pipe(q(!1))}function Go(){let e=d(window,"keydown").pipe(g(t=>!(t.metaKey||t.ctrlKey)),m(t=>({mode:Bo("search")?"search":"global",type:t.key,claim(){t.preventDefault(),t.stopPropagation()}})),g(({mode:t,type:r})=>{if(t==="global"){let o=Re();if(typeof o!="undefined")return!ua(o,r)}return!0}),le());return da().pipe(b(t=>t?L:e))}function ve(){return new URL(location.href)}function st(e,t=!1){if(G("navigation.instant")&&!t){let r=E("a",{href:e.href});document.body.appendChild(r),r.click(),r.remove()}else location.href=e.href}function Jo(){return new v}function Xo(){return location.hash.slice(1)}function Zo(e){let t=E("a",{href:e});t.addEventListener("click",r=>r.stopPropagation()),t.click()}function ha(e){return T(d(window,"hashchange"),e).pipe(m(Xo),q(Xo()),g(t=>t.length>0),B(1))}function en(e){return ha(e).pipe(m(t=>me(`[id="${t}"]`)),g(t=>typeof t!="undefined"))}function At(e){let t=matchMedia(e);return nr(r=>t.addListener(()=>r(t.matches))).pipe(q(t.matches))}function tn(){let e=matchMedia("print");return T(d(window,"beforeprint").pipe(m(()=>!0)),d(window,"afterprint").pipe(m(()=>!1))).pipe(q(e.matches))}function Ur(e,t){return e.pipe(b(r=>r?t():L))}function Wr(e,t){return new j(r=>{let o=new XMLHttpRequest;return o.open("GET",`${e}`),o.responseType="blob",o.addEventListener("load",()=>{o.status>=200&&o.status<300?(r.next(o.response),r.complete()):r.error(new Error(o.statusText))}),o.addEventListener("error",()=>{r.error(new Error("Network error"))}),o.addEventListener("abort",()=>{r.complete()}),typeof(t==null?void 0:t.progress$)!="undefined"&&(o.addEventListener("progress",n=>{var i;if(n.lengthComputable)t.progress$.next(n.loaded/n.total*100);else{let s=(i=o.getResponseHeader("Content-Length"))!=null?i:0;t.progress$.next(n.loaded/+s*100)}}),t.progress$.next(5)),o.send(),()=>o.abort()})}function De(e,t){return Wr(e,t).pipe(b(r=>r.text()),m(r=>JSON.parse(r)),B(1))}function rn(e,t){let r=new DOMParser;return Wr(e,t).pipe(b(o=>o.text()),m(o=>r.parseFromString(o,"text/html")),B(1))}function on(e,t){let r=new DOMParser;return Wr(e,t).pipe(b(o=>o.text()),m(o=>r.parseFromString(o,"text/xml")),B(1))}function nn(){return{x:Math.max(0,scrollX),y:Math.max(0,scrollY)}}function an(){return T(d(window,"scroll",{passive:!0}),d(window,"resize",{passive:!0})).pipe(m(nn),q(nn()))}function sn(){return{width:innerWidth,height:innerHeight}}function cn(){return d(window,"resize",{passive:!0}).pipe(m(sn),q(sn()))}function pn(){return Q([an(),cn()]).pipe(m(([e,t])=>({offset:e,size:t})),B(1))}function pr(e,{viewport$:t,header$:r}){let o=t.pipe(X("size")),n=Q([o,r]).pipe(m(()=>Ue(e)));return Q([r,t,n]).pipe(m(([{height:i},{offset:s,size:a},{x:c,y:p}])=>({offset:{x:s.x-c,y:s.y-p+i},size:a})))}function ba(e){return d(e,"message",t=>t.data)}function va(e){let t=new v;return t.subscribe(r=>e.postMessage(r)),t}function ln(e,t=new Worker(e)){let r=ba(t),o=va(t),n=new v;n.subscribe(o);let i=o.pipe(ee(),oe(!0));return n.pipe(ee(),$e(r.pipe(U(i))),le())}var ga=P("#__config"),Et=JSON.parse(ga.textContent);Et.base=`${new URL(Et.base,ve())}`;function we(){return Et}function G(e){return Et.features.includes(e)}function ge(e,t){return typeof t!="undefined"?Et.translations[e].replace("#",t.toString()):Et.translations[e]}function Te(e,t=document){return P(`[data-md-component=${e}]`,t)}function ne(e,t=document){return R(`[data-md-component=${e}]`,t)}function xa(e){let t=P(".md-typeset > :first-child",e);return d(t,"click",{once:!0}).pipe(m(()=>P(".md-typeset",e)),m(r=>({hash:__md_hash(r.innerHTML)})))}function mn(e){if(!G("announce.dismiss")||!e.childElementCount)return L;if(!e.hidden){let t=P(".md-typeset",e);__md_hash(t.innerHTML)===__md_get("__announce")&&(e.hidden=!0)}return H(()=>{let t=new v;return t.subscribe(({hash:r})=>{e.hidden=!0,__md_set("__announce",r)}),xa(e).pipe(y(r=>t.next(r)),_(()=>t.complete()),m(r=>F({ref:e},r)))})}function ya(e,{target$:t}){return t.pipe(m(r=>({hidden:r!==e})))}function fn(e,t){let r=new v;return r.subscribe(({hidden:o})=>{e.hidden=o}),ya(e,t).pipe(y(o=>r.next(o)),_(()=>r.complete()),m(o=>F({ref:e},o)))}function Ct(e,t){return t==="inline"?E("div",{class:"md-tooltip md-tooltip--inline",id:e,role:"tooltip"},E("div",{class:"md-tooltip__inner md-typeset"})):E("div",{class:"md-tooltip",id:e,role:"tooltip"},E("div",{class:"md-tooltip__inner md-typeset"}))}function un(e,t){if(t=t?`${t}_annotation_${e}`:void 0,t){let r=t?`#${t}`:void 0;return E("aside",{class:"md-annotation",tabIndex:0},Ct(t),E("a",{href:r,class:"md-annotation__index",tabIndex:-1},E("span",{"data-md-annotation-id":e})))}else return E("aside",{class:"md-annotation",tabIndex:0},Ct(t),E("span",{class:"md-annotation__index",tabIndex:-1},E("span",{"data-md-annotation-id":e})))}function dn(e){return E("button",{class:"md-clipboard md-icon",title:ge("clipboard.copy"),"data-clipboard-target":`#${e} > code`})}function Dr(e,t){let r=t&2,o=t&1,n=Object.keys(e.terms).filter(c=>!e.terms[c]).reduce((c,p)=>[...c,E("del",null,p)," "],[]).slice(0,-1),i=we(),s=new URL(e.location,i.base);G("search.highlight")&&s.searchParams.set("h",Object.entries(e.terms).filter(([,c])=>c).reduce((c,[p])=>`${c} ${p}`.trim(),""));let{tags:a}=we();return E("a",{href:`${s}`,class:"md-search-result__link",tabIndex:-1},E("article",{class:"md-search-result__article md-typeset","data-md-score":e.score.toFixed(2)},r>0&&E("div",{class:"md-search-result__icon md-icon"}),r>0&&E("h1",null,e.title),r<=0&&E("h2",null,e.title),o>0&&e.text.length>0&&e.text,e.tags&&e.tags.map(c=>{let p=a?c in a?`md-tag-icon md-tag--${a[c]}`:"md-tag-icon":"";return E("span",{class:`md-tag ${p}`},c)}),o>0&&n.length>0&&E("p",{class:"md-search-result__terms"},ge("search.result.term.missing"),": ",...n)))}function hn(e){let t=e[0].score,r=[...e],o=we(),n=r.findIndex(l=>!`${new URL(l.location,o.base)}`.includes("#")),[i]=r.splice(n,1),s=r.findIndex(l=>l.scoreDr(l,1)),...c.length?[E("details",{class:"md-search-result__more"},E("summary",{tabIndex:-1},E("div",null,c.length>0&&c.length===1?ge("search.result.more.one"):ge("search.result.more.other",c.length))),...c.map(l=>Dr(l,1)))]:[]];return E("li",{class:"md-search-result__item"},p)}function bn(e){return E("ul",{class:"md-source__facts"},Object.entries(e).map(([t,r])=>E("li",{class:`md-source__fact md-source__fact--${t}`},typeof r=="number"?ar(r):r)))}function Nr(e){let t=`tabbed-control tabbed-control--${e}`;return E("div",{class:t,hidden:!0},E("button",{class:"tabbed-button",tabIndex:-1,"aria-hidden":"true"}))}function vn(e){return E("div",{class:"md-typeset__scrollwrap"},E("div",{class:"md-typeset__table"},e))}function Ea(e){let t=we(),r=new URL(`../${e.version}/`,t.base);return E("li",{class:"md-version__item"},E("a",{href:`${r}`,class:"md-version__link"},e.title))}function gn(e,t){return e=e.filter(r=>{var o;return!((o=r.properties)!=null&&o.hidden)}),E("div",{class:"md-version"},E("button",{class:"md-version__current","aria-label":ge("select.version")},t.title),E("ul",{class:"md-version__list"},e.map(Ea)))}var wa=0;function Ta(e,t){document.body.append(e);let{width:r}=pe(e);e.style.setProperty("--md-tooltip-width",`${r}px`),e.remove();let o=sr(t),n=typeof o!="undefined"?et(o):$({x:0,y:0}),i=T(vt(t),Vo(t)).pipe(Y());return Q([i,n]).pipe(m(([s,a])=>{let{x:c,y:p}=Ue(t),l=pe(t),f=t.closest("table");return f&&t.parentElement&&(c+=f.offsetLeft+t.parentElement.offsetLeft,p+=f.offsetTop+t.parentElement.offsetTop),{active:s,offset:{x:c-a.x+l.width/2-r/2,y:p-a.y+l.height+8}}}))}function Ge(e){let t=e.title;if(!t.length)return L;let r=`__tooltip_${wa++}`,o=Ct(r,"inline"),n=P(".md-typeset",o);return n.innerHTML=t,H(()=>{let i=new v;return i.subscribe({next({offset:s}){o.style.setProperty("--md-tooltip-x",`${s.x}px`),o.style.setProperty("--md-tooltip-y",`${s.y}px`)},complete(){o.style.removeProperty("--md-tooltip-x"),o.style.removeProperty("--md-tooltip-y")}}),T(i.pipe(g(({active:s})=>s)),i.pipe(be(250),g(({active:s})=>!s))).subscribe({next({active:s}){s?(e.insertAdjacentElement("afterend",o),e.setAttribute("aria-describedby",r),e.removeAttribute("title")):(o.remove(),e.removeAttribute("aria-describedby"),e.setAttribute("title",t))},complete(){o.remove(),e.removeAttribute("aria-describedby"),e.setAttribute("title",t)}}),i.pipe(Me(16,de)).subscribe(({active:s})=>{o.classList.toggle("md-tooltip--active",s)}),i.pipe(_t(125,de),g(()=>!!e.offsetParent),m(()=>e.offsetParent.getBoundingClientRect()),m(({x:s})=>s)).subscribe({next(s){s?o.style.setProperty("--md-tooltip-0",`${-s}px`):o.style.removeProperty("--md-tooltip-0")},complete(){o.style.removeProperty("--md-tooltip-0")}}),Ta(o,e).pipe(y(s=>i.next(s)),_(()=>i.complete()),m(s=>F({ref:e},s)))}).pipe(ze(ie))}function Sa(e,t){let r=H(()=>Q([zo(e),et(t)])).pipe(m(([{x:o,y:n},i])=>{let{width:s,height:a}=pe(e);return{x:o-i.x+s/2,y:n-i.y+a/2}}));return vt(e).pipe(b(o=>r.pipe(m(n=>({active:o,offset:n})),ye(+!o||1/0))))}function xn(e,t,{target$:r}){let[o,n]=Array.from(e.children);return H(()=>{let i=new v,s=i.pipe(ee(),oe(!0));return i.subscribe({next({offset:a}){e.style.setProperty("--md-tooltip-x",`${a.x}px`),e.style.setProperty("--md-tooltip-y",`${a.y}px`)},complete(){e.style.removeProperty("--md-tooltip-x"),e.style.removeProperty("--md-tooltip-y")}}),yt(e).pipe(U(s)).subscribe(a=>{e.toggleAttribute("data-md-visible",a)}),T(i.pipe(g(({active:a})=>a)),i.pipe(be(250),g(({active:a})=>!a))).subscribe({next({active:a}){a?e.prepend(o):o.remove()},complete(){e.prepend(o)}}),i.pipe(Me(16,de)).subscribe(({active:a})=>{o.classList.toggle("md-tooltip--active",a)}),i.pipe(_t(125,de),g(()=>!!e.offsetParent),m(()=>e.offsetParent.getBoundingClientRect()),m(({x:a})=>a)).subscribe({next(a){a?e.style.setProperty("--md-tooltip-0",`${-a}px`):e.style.removeProperty("--md-tooltip-0")},complete(){e.style.removeProperty("--md-tooltip-0")}}),d(n,"click").pipe(U(s),g(a=>!(a.metaKey||a.ctrlKey))).subscribe(a=>{a.stopPropagation(),a.preventDefault()}),d(n,"mousedown").pipe(U(s),ae(i)).subscribe(([a,{active:c}])=>{var p;if(a.button!==0||a.metaKey||a.ctrlKey)a.preventDefault();else if(c){a.preventDefault();let l=e.parentElement.closest(".md-annotation");l instanceof HTMLElement?l.focus():(p=Re())==null||p.blur()}}),r.pipe(U(s),g(a=>a===o),Ye(125)).subscribe(()=>e.focus()),Sa(e,t).pipe(y(a=>i.next(a)),_(()=>i.complete()),m(a=>F({ref:e},a)))})}function Oa(e){return e.tagName==="CODE"?R(".c, .c1, .cm",e):[e]}function Ma(e){let t=[];for(let r of Oa(e)){let o=[],n=document.createNodeIterator(r,NodeFilter.SHOW_TEXT);for(let i=n.nextNode();i;i=n.nextNode())o.push(i);for(let i of o){let s;for(;s=/(\(\d+\))(!)?/.exec(i.textContent);){let[,a,c]=s;if(typeof c=="undefined"){let p=i.splitText(s.index);i=p.splitText(a.length),t.push(p)}else{i.textContent=a,t.push(i);break}}}}return t}function yn(e,t){t.append(...Array.from(e.childNodes))}function lr(e,t,{target$:r,print$:o}){let n=t.closest("[id]"),i=n==null?void 0:n.id,s=new Map;for(let a of Ma(t)){let[,c]=a.textContent.match(/\((\d+)\)/);me(`:scope > li:nth-child(${c})`,e)&&(s.set(c,un(c,i)),a.replaceWith(s.get(c)))}return s.size===0?L:H(()=>{let a=new v,c=a.pipe(ee(),oe(!0)),p=[];for(let[l,f]of s)p.push([P(".md-typeset",f),P(`:scope > li:nth-child(${l})`,e)]);return o.pipe(U(c)).subscribe(l=>{e.hidden=!l,e.classList.toggle("md-annotation-list",l);for(let[f,u]of p)l?yn(f,u):yn(u,f)}),T(...[...s].map(([,l])=>xn(l,t,{target$:r}))).pipe(_(()=>a.complete()),le())})}function En(e){if(e.nextElementSibling){let t=e.nextElementSibling;if(t.tagName==="OL")return t;if(t.tagName==="P"&&!t.children.length)return En(t)}}function wn(e,t){return H(()=>{let r=En(e);return typeof r!="undefined"?lr(r,e,t):L})}var Tn=jt(zr());var La=0;function Sn(e){if(e.nextElementSibling){let t=e.nextElementSibling;if(t.tagName==="OL")return t;if(t.tagName==="P"&&!t.children.length)return Sn(t)}}function _a(e){return Ee(e).pipe(m(({width:t})=>({scrollable:xt(e).width>t})),X("scrollable"))}function On(e,t){let{matches:r}=matchMedia("(hover)"),o=H(()=>{let n=new v,i=n.pipe($r(1));n.subscribe(({scrollable:c})=>{c&&r?e.setAttribute("tabindex","0"):e.removeAttribute("tabindex")});let s=[];if(Tn.default.isSupported()&&(e.closest(".copy")||G("content.code.copy")&&!e.closest(".no-copy"))){let c=e.closest("pre");c.id=`__code_${La++}`;let p=dn(c.id);c.insertBefore(p,e),G("content.tooltips")&&s.push(Ge(p))}let a=e.closest(".highlight");if(a instanceof HTMLElement){let c=Sn(a);if(typeof c!="undefined"&&(a.classList.contains("annotate")||G("content.code.annotate"))){let p=lr(c,e,t);s.push(Ee(a).pipe(U(i),m(({width:l,height:f})=>l&&f),Y(),b(l=>l?p:L)))}}return _a(e).pipe(y(c=>n.next(c)),_(()=>n.complete()),m(c=>F({ref:e},c)),$e(...s))});return G("content.lazy")?yt(e).pipe(g(n=>n),ye(1),b(()=>o)):o}function Aa(e,{target$:t,print$:r}){let o=!0;return T(t.pipe(m(n=>n.closest("details:not([open])")),g(n=>e===n),m(()=>({action:"open",reveal:!0}))),r.pipe(g(n=>n||!o),y(()=>o=e.open),m(n=>({action:n?"open":"close"}))))}function Mn(e,t){return H(()=>{let r=new v;return r.subscribe(({action:o,reveal:n})=>{e.toggleAttribute("open",o==="open"),n&&e.scrollIntoView()}),Aa(e,t).pipe(y(o=>r.next(o)),_(()=>r.complete()),m(o=>F({ref:e},o)))})}var Ln=".node circle,.node ellipse,.node path,.node polygon,.node rect{fill:var(--md-mermaid-node-bg-color);stroke:var(--md-mermaid-node-fg-color)}marker{fill:var(--md-mermaid-edge-color)!important}.edgeLabel .label rect{fill:#0000}.label{color:var(--md-mermaid-label-fg-color);font-family:var(--md-mermaid-font-family)}.label foreignObject{line-height:normal;overflow:visible}.label div .edgeLabel{color:var(--md-mermaid-label-fg-color)}.edgeLabel,.edgeLabel rect,.label div .edgeLabel{background-color:var(--md-mermaid-label-bg-color)}.edgeLabel,.edgeLabel rect{fill:var(--md-mermaid-label-bg-color);color:var(--md-mermaid-edge-color)}.edgePath .path,.flowchart-link{stroke:var(--md-mermaid-edge-color);stroke-width:.05rem}.edgePath .arrowheadPath{fill:var(--md-mermaid-edge-color);stroke:none}.cluster rect{fill:var(--md-default-fg-color--lightest);stroke:var(--md-default-fg-color--lighter)}.cluster span{color:var(--md-mermaid-label-fg-color);font-family:var(--md-mermaid-font-family)}g #flowchart-circleEnd,g #flowchart-circleStart,g #flowchart-crossEnd,g #flowchart-crossStart,g #flowchart-pointEnd,g #flowchart-pointStart{stroke:none}g.classGroup line,g.classGroup rect{fill:var(--md-mermaid-node-bg-color);stroke:var(--md-mermaid-node-fg-color)}g.classGroup text{fill:var(--md-mermaid-label-fg-color);font-family:var(--md-mermaid-font-family)}.classLabel .box{fill:var(--md-mermaid-label-bg-color);background-color:var(--md-mermaid-label-bg-color);opacity:1}.classLabel .label{fill:var(--md-mermaid-label-fg-color);font-family:var(--md-mermaid-font-family)}.node .divider{stroke:var(--md-mermaid-node-fg-color)}.relation{stroke:var(--md-mermaid-edge-color)}.cardinality{fill:var(--md-mermaid-label-fg-color);font-family:var(--md-mermaid-font-family)}.cardinality text{fill:inherit!important}defs #classDiagram-compositionEnd,defs #classDiagram-compositionStart,defs #classDiagram-dependencyEnd,defs #classDiagram-dependencyStart,defs #classDiagram-extensionEnd,defs #classDiagram-extensionStart{fill:var(--md-mermaid-edge-color)!important;stroke:var(--md-mermaid-edge-color)!important}defs #classDiagram-aggregationEnd,defs #classDiagram-aggregationStart{fill:var(--md-mermaid-label-bg-color)!important;stroke:var(--md-mermaid-edge-color)!important}g.stateGroup rect{fill:var(--md-mermaid-node-bg-color);stroke:var(--md-mermaid-node-fg-color)}g.stateGroup .state-title{fill:var(--md-mermaid-label-fg-color)!important;font-family:var(--md-mermaid-font-family)}g.stateGroup .composit{fill:var(--md-mermaid-label-bg-color)}.nodeLabel,.nodeLabel p{color:var(--md-mermaid-label-fg-color);font-family:var(--md-mermaid-font-family)}.node circle.state-end,.node circle.state-start,.start-state{fill:var(--md-mermaid-edge-color);stroke:none}.end-state-inner,.end-state-outer{fill:var(--md-mermaid-edge-color)}.end-state-inner,.node circle.state-end{stroke:var(--md-mermaid-label-bg-color)}.transition{stroke:var(--md-mermaid-edge-color)}[id^=state-fork] rect,[id^=state-join] rect{fill:var(--md-mermaid-edge-color)!important;stroke:none!important}.statediagram-cluster.statediagram-cluster .inner{fill:var(--md-default-bg-color)}.statediagram-cluster rect{fill:var(--md-mermaid-node-bg-color);stroke:var(--md-mermaid-node-fg-color)}.statediagram-state rect.divider{fill:var(--md-default-fg-color--lightest);stroke:var(--md-default-fg-color--lighter)}defs #statediagram-barbEnd{stroke:var(--md-mermaid-edge-color)}.attributeBoxEven,.attributeBoxOdd{fill:var(--md-mermaid-node-bg-color);stroke:var(--md-mermaid-node-fg-color)}.entityBox{fill:var(--md-mermaid-label-bg-color);stroke:var(--md-mermaid-node-fg-color)}.entityLabel{fill:var(--md-mermaid-label-fg-color);font-family:var(--md-mermaid-font-family)}.relationshipLabelBox{fill:var(--md-mermaid-label-bg-color);fill-opacity:1;background-color:var(--md-mermaid-label-bg-color);opacity:1}.relationshipLabel{fill:var(--md-mermaid-label-fg-color)}.relationshipLine{stroke:var(--md-mermaid-edge-color)}defs #ONE_OR_MORE_END *,defs #ONE_OR_MORE_START *,defs #ONLY_ONE_END *,defs #ONLY_ONE_START *,defs #ZERO_OR_MORE_END *,defs #ZERO_OR_MORE_START *,defs #ZERO_OR_ONE_END *,defs #ZERO_OR_ONE_START *{stroke:var(--md-mermaid-edge-color)!important}defs #ZERO_OR_MORE_END circle,defs #ZERO_OR_MORE_START circle{fill:var(--md-mermaid-label-bg-color)}.actor{fill:var(--md-mermaid-sequence-actor-bg-color);stroke:var(--md-mermaid-sequence-actor-border-color)}text.actor>tspan{fill:var(--md-mermaid-sequence-actor-fg-color);font-family:var(--md-mermaid-font-family)}line{stroke:var(--md-mermaid-sequence-actor-line-color)}.actor-man circle,.actor-man line{fill:var(--md-mermaid-sequence-actorman-bg-color);stroke:var(--md-mermaid-sequence-actorman-line-color)}.messageLine0,.messageLine1{stroke:var(--md-mermaid-sequence-message-line-color)}.note{fill:var(--md-mermaid-sequence-note-bg-color);stroke:var(--md-mermaid-sequence-note-border-color)}.loopText,.loopText>tspan,.messageText,.noteText>tspan{stroke:none;font-family:var(--md-mermaid-font-family)!important}.messageText{fill:var(--md-mermaid-sequence-message-fg-color)}.loopText,.loopText>tspan{fill:var(--md-mermaid-sequence-loop-fg-color)}.noteText>tspan{fill:var(--md-mermaid-sequence-note-fg-color)}#arrowhead path{fill:var(--md-mermaid-sequence-message-line-color);stroke:none}.loopLine{fill:var(--md-mermaid-sequence-loop-bg-color);stroke:var(--md-mermaid-sequence-loop-border-color)}.labelBox{fill:var(--md-mermaid-sequence-label-bg-color);stroke:none}.labelText,.labelText>span{fill:var(--md-mermaid-sequence-label-fg-color);font-family:var(--md-mermaid-font-family)}.sequenceNumber{fill:var(--md-mermaid-sequence-number-fg-color)}rect.rect{fill:var(--md-mermaid-sequence-box-bg-color);stroke:none}rect.rect+text.text{fill:var(--md-mermaid-sequence-box-fg-color)}defs #sequencenumber{fill:var(--md-mermaid-sequence-number-bg-color)!important}";var qr,ka=0;function Ha(){return typeof mermaid=="undefined"||mermaid instanceof Element?gt("https://unpkg.com/mermaid@10.7.0/dist/mermaid.min.js"):$(void 0)}function _n(e){return e.classList.remove("mermaid"),qr||(qr=Ha().pipe(y(()=>mermaid.initialize({startOnLoad:!1,themeCSS:Ln,sequence:{actorFontSize:"16px",messageFontSize:"16px",noteFontSize:"16px"}})),m(()=>{}),B(1))),qr.subscribe(()=>ro(this,null,function*(){e.classList.add("mermaid");let t=`__mermaid_${ka++}`,r=E("div",{class:"mermaid"}),o=e.textContent,{svg:n,fn:i}=yield mermaid.render(t,o),s=r.attachShadow({mode:"closed"});s.innerHTML=n,e.replaceWith(r),i==null||i(s)})),qr.pipe(m(()=>({ref:e})))}var An=E("table");function Cn(e){return e.replaceWith(An),An.replaceWith(vn(e)),$({ref:e})}function $a(e){let t=e.find(r=>r.checked)||e[0];return T(...e.map(r=>d(r,"change").pipe(m(()=>P(`label[for="${r.id}"]`))))).pipe(q(P(`label[for="${t.id}"]`)),m(r=>({active:r})))}function kn(e,{viewport$:t,target$:r}){let o=P(".tabbed-labels",e),n=R(":scope > input",e),i=Nr("prev");e.append(i);let s=Nr("next");return e.append(s),H(()=>{let a=new v,c=a.pipe(ee(),oe(!0));Q([a,Ee(e)]).pipe(U(c),Me(1,de)).subscribe({next([{active:p},l]){let f=Ue(p),{width:u}=pe(p);e.style.setProperty("--md-indicator-x",`${f.x}px`),e.style.setProperty("--md-indicator-width",`${u}px`);let h=ir(o);(f.xh.x+l.width)&&o.scrollTo({left:Math.max(0,f.x-16),behavior:"smooth"})},complete(){e.style.removeProperty("--md-indicator-x"),e.style.removeProperty("--md-indicator-width")}}),Q([et(o),Ee(o)]).pipe(U(c)).subscribe(([p,l])=>{let f=xt(o);i.hidden=p.x<16,s.hidden=p.x>f.width-l.width-16}),T(d(i,"click").pipe(m(()=>-1)),d(s,"click").pipe(m(()=>1))).pipe(U(c)).subscribe(p=>{let{width:l}=pe(o);o.scrollBy({left:l*p,behavior:"smooth"})}),r.pipe(U(c),g(p=>n.includes(p))).subscribe(p=>p.click()),o.classList.add("tabbed-labels--linked");for(let p of n){let l=P(`label[for="${p.id}"]`);l.replaceChildren(E("a",{href:`#${l.htmlFor}`,tabIndex:-1},...Array.from(l.childNodes))),d(l.firstElementChild,"click").pipe(U(c),g(f=>!(f.metaKey||f.ctrlKey)),y(f=>{f.preventDefault(),f.stopPropagation()})).subscribe(()=>{history.replaceState({},"",`#${l.htmlFor}`),l.click()})}return G("content.tabs.link")&&a.pipe(Le(1),ae(t)).subscribe(([{active:p},{offset:l}])=>{let f=p.innerText.trim();if(p.hasAttribute("data-md-switching"))p.removeAttribute("data-md-switching");else{let u=e.offsetTop-l.y;for(let w of R("[data-tabs]"))for(let A of R(":scope > input",w)){let Z=P(`label[for="${A.id}"]`);if(Z!==p&&Z.innerText.trim()===f){Z.setAttribute("data-md-switching",""),A.click();break}}window.scrollTo({top:e.offsetTop-u});let h=__md_get("__tabs")||[];__md_set("__tabs",[...new Set([f,...h])])}}),a.pipe(U(c)).subscribe(()=>{for(let p of R("audio, video",e))p.pause()}),$a(n).pipe(y(p=>a.next(p)),_(()=>a.complete()),m(p=>F({ref:e},p)))}).pipe(ze(ie))}function Hn(e,{viewport$:t,target$:r,print$:o}){return T(...R(".annotate:not(.highlight)",e).map(n=>wn(n,{target$:r,print$:o})),...R("pre:not(.mermaid) > code",e).map(n=>On(n,{target$:r,print$:o})),...R("pre.mermaid",e).map(n=>_n(n)),...R("table:not([class])",e).map(n=>Cn(n)),...R("details",e).map(n=>Mn(n,{target$:r,print$:o})),...R("[data-tabs]",e).map(n=>kn(n,{viewport$:t,target$:r})),...R("[title]",e).filter(()=>G("content.tooltips")).map(n=>Ge(n)))}function Ra(e,{alert$:t}){return t.pipe(b(r=>T($(!0),$(!1).pipe(Ye(2e3))).pipe(m(o=>({message:r,active:o})))))}function $n(e,t){let r=P(".md-typeset",e);return H(()=>{let o=new v;return o.subscribe(({message:n,active:i})=>{e.classList.toggle("md-dialog--active",i),r.textContent=n}),Ra(e,t).pipe(y(n=>o.next(n)),_(()=>o.complete()),m(n=>F({ref:e},n)))})}function Pa({viewport$:e}){if(!G("header.autohide"))return $(!1);let t=e.pipe(m(({offset:{y:n}})=>n),Ke(2,1),m(([n,i])=>[nMath.abs(i-n.y)>100),m(([,[n]])=>n),Y()),o=We("search");return Q([e,o]).pipe(m(([{offset:n},i])=>n.y>400&&!i),Y(),b(n=>n?r:$(!1)),q(!1))}function Rn(e,t){return H(()=>Q([Ee(e),Pa(t)])).pipe(m(([{height:r},o])=>({height:r,hidden:o})),Y((r,o)=>r.height===o.height&&r.hidden===o.hidden),B(1))}function Pn(e,{header$:t,main$:r}){return H(()=>{let o=new v,n=o.pipe(ee(),oe(!0));o.pipe(X("active"),je(t)).subscribe(([{active:s},{hidden:a}])=>{e.classList.toggle("md-header--shadow",s&&!a),e.hidden=a});let i=fe(R("[title]",e)).pipe(g(()=>G("content.tooltips")),re(s=>Ge(s)));return r.subscribe(o),t.pipe(U(n),m(s=>F({ref:e},s)),$e(i.pipe(U(n))))})}function Ia(e,{viewport$:t,header$:r}){return pr(e,{viewport$:t,header$:r}).pipe(m(({offset:{y:o}})=>{let{height:n}=pe(e);return{active:o>=n}}),X("active"))}function In(e,t){return H(()=>{let r=new v;r.subscribe({next({active:n}){e.classList.toggle("md-header__title--active",n)},complete(){e.classList.remove("md-header__title--active")}});let o=me(".md-content h1");return typeof o=="undefined"?L:Ia(o,t).pipe(y(n=>r.next(n)),_(()=>r.complete()),m(n=>F({ref:e},n)))})}function Fn(e,{viewport$:t,header$:r}){let o=r.pipe(m(({height:i})=>i),Y()),n=o.pipe(b(()=>Ee(e).pipe(m(({height:i})=>({top:e.offsetTop,bottom:e.offsetTop+i})),X("bottom"))));return Q([o,n,t]).pipe(m(([i,{top:s,bottom:a},{offset:{y:c},size:{height:p}}])=>(p=Math.max(0,p-Math.max(0,s-c,i)-Math.max(0,p+c-a)),{offset:s-i,height:p,active:s-i<=c})),Y((i,s)=>i.offset===s.offset&&i.height===s.height&&i.active===s.active))}function Fa(e){let t=__md_get("__palette")||{index:e.findIndex(o=>matchMedia(o.getAttribute("data-md-color-media")).matches)},r=Math.max(0,Math.min(t.index,e.length-1));return $(...e).pipe(re(o=>d(o,"change").pipe(m(()=>o))),q(e[r]),m(o=>({index:e.indexOf(o),color:{media:o.getAttribute("data-md-color-media"),scheme:o.getAttribute("data-md-color-scheme"),primary:o.getAttribute("data-md-color-primary"),accent:o.getAttribute("data-md-color-accent")}})),B(1))}function jn(e){let t=R("input",e),r=E("meta",{name:"theme-color"});document.head.appendChild(r);let o=E("meta",{name:"color-scheme"});document.head.appendChild(o);let n=At("(prefers-color-scheme: light)");return H(()=>{let i=new v;return i.subscribe(s=>{if(document.body.setAttribute("data-md-color-switching",""),s.color.media==="(prefers-color-scheme)"){let a=matchMedia("(prefers-color-scheme: light)"),c=document.querySelector(a.matches?"[data-md-color-media='(prefers-color-scheme: light)']":"[data-md-color-media='(prefers-color-scheme: dark)']");s.color.scheme=c.getAttribute("data-md-color-scheme"),s.color.primary=c.getAttribute("data-md-color-primary"),s.color.accent=c.getAttribute("data-md-color-accent")}for(let[a,c]of Object.entries(s.color))document.body.setAttribute(`data-md-color-${a}`,c);for(let a=0;a{let s=Te("header"),a=window.getComputedStyle(s);return o.content=a.colorScheme,a.backgroundColor.match(/\d+/g).map(c=>(+c).toString(16).padStart(2,"0")).join("")})).subscribe(s=>r.content=`#${s}`),i.pipe(Oe(ie)).subscribe(()=>{document.body.removeAttribute("data-md-color-switching")}),Fa(t).pipe(U(n.pipe(Le(1))),at(),y(s=>i.next(s)),_(()=>i.complete()),m(s=>F({ref:e},s)))})}function Un(e,{progress$:t}){return H(()=>{let r=new v;return r.subscribe(({value:o})=>{e.style.setProperty("--md-progress-value",`${o}`)}),t.pipe(y(o=>r.next({value:o})),_(()=>r.complete()),m(o=>({ref:e,value:o})))})}var Kr=jt(zr());function ja(e){e.setAttribute("data-md-copying","");let t=e.closest("[data-copy]"),r=t?t.getAttribute("data-copy"):e.innerText;return e.removeAttribute("data-md-copying"),r.trimEnd()}function Wn({alert$:e}){Kr.default.isSupported()&&new j(t=>{new Kr.default("[data-clipboard-target], [data-clipboard-text]",{text:r=>r.getAttribute("data-clipboard-text")||ja(P(r.getAttribute("data-clipboard-target")))}).on("success",r=>t.next(r))}).pipe(y(t=>{t.trigger.focus()}),m(()=>ge("clipboard.copied"))).subscribe(e)}function Dn(e,t){return e.protocol=t.protocol,e.hostname=t.hostname,e}function Ua(e,t){let r=new Map;for(let o of R("url",e)){let n=P("loc",o),i=[Dn(new URL(n.textContent),t)];r.set(`${i[0]}`,i);for(let s of R("[rel=alternate]",o)){let a=s.getAttribute("href");a!=null&&i.push(Dn(new URL(a),t))}}return r}function mr(e){return on(new URL("sitemap.xml",e)).pipe(m(t=>Ua(t,new URL(e))),he(()=>$(new Map)))}function Wa(e,t){if(!(e.target instanceof Element))return L;let r=e.target.closest("a");if(r===null)return L;if(r.target||e.metaKey||e.ctrlKey)return L;let o=new URL(r.href);return o.search=o.hash="",t.has(`${o}`)?(e.preventDefault(),$(new URL(r.href))):L}function Nn(e){let t=new Map;for(let r of R(":scope > *",e.head))t.set(r.outerHTML,r);return t}function Vn(e){for(let t of R("[href], [src]",e))for(let r of["href","src"]){let o=t.getAttribute(r);if(o&&!/^(?:[a-z]+:)?\/\//i.test(o)){t[r]=t[r];break}}return $(e)}function Da(e){for(let o of["[data-md-component=announce]","[data-md-component=container]","[data-md-component=header-topic]","[data-md-component=outdated]","[data-md-component=logo]","[data-md-component=skip]",...G("navigation.tabs.sticky")?["[data-md-component=tabs]"]:[]]){let n=me(o),i=me(o,e);typeof n!="undefined"&&typeof i!="undefined"&&n.replaceWith(i)}let t=Nn(document);for(let[o,n]of Nn(e))t.has(o)?t.delete(o):document.head.appendChild(n);for(let o of t.values()){let n=o.getAttribute("name");n!=="theme-color"&&n!=="color-scheme"&&o.remove()}let r=Te("container");return Fe(R("script",r)).pipe(b(o=>{let n=e.createElement("script");if(o.src){for(let i of o.getAttributeNames())n.setAttribute(i,o.getAttribute(i));return o.replaceWith(n),new j(i=>{n.onload=()=>i.complete()})}else return n.textContent=o.textContent,o.replaceWith(n),L}),ee(),oe(document))}function zn({location$:e,viewport$:t,progress$:r}){let o=we();if(location.protocol==="file:")return L;let n=mr(o.base);$(document).subscribe(Vn);let i=d(document.body,"click").pipe(je(n),b(([c,p])=>Wa(c,p)),le()),s=d(window,"popstate").pipe(m(ve),le());i.pipe(ae(t)).subscribe(([c,{offset:p}])=>{history.replaceState(p,""),history.pushState(null,"",c)}),T(i,s).subscribe(e);let a=e.pipe(X("pathname"),b(c=>rn(c,{progress$:r}).pipe(he(()=>(st(c,!0),L)))),b(Vn),b(Da),le());return T(a.pipe(ae(e,(c,p)=>p)),e.pipe(X("pathname"),b(()=>e),X("hash")),e.pipe(Y((c,p)=>c.pathname===p.pathname&&c.hash===p.hash),b(()=>i),y(()=>history.back()))).subscribe(c=>{var p,l;history.state!==null||!c.hash?window.scrollTo(0,(l=(p=history.state)==null?void 0:p.y)!=null?l:0):(history.scrollRestoration="auto",Zo(c.hash),history.scrollRestoration="manual")}),e.subscribe(()=>{history.scrollRestoration="manual"}),d(window,"beforeunload").subscribe(()=>{history.scrollRestoration="auto"}),t.pipe(X("offset"),be(100)).subscribe(({offset:c})=>{history.replaceState(c,"")}),a}var Qn=jt(Kn());function Yn(e){let t=e.separator.split("|").map(n=>n.replace(/(\(\?[!=<][^)]+\))/g,"").length===0?"\uFFFD":n).join("|"),r=new RegExp(t,"img"),o=(n,i,s)=>`${i}${s}`;return n=>{n=n.replace(/[\s*+\-:~^]+/g," ").trim();let i=new RegExp(`(^|${e.separator}|)(${n.replace(/[|\\{}()[\]^$+*?.-]/g,"\\$&").replace(r,"|")})`,"img");return s=>(0,Qn.default)(s).replace(i,o).replace(/<\/mark>(\s+)]*>/img,"$1")}}function Ht(e){return e.type===1}function fr(e){return e.type===3}function Bn(e,t){let r=ln(e);return T($(location.protocol!=="file:"),We("search")).pipe(He(o=>o),b(()=>t)).subscribe(({config:o,docs:n})=>r.next({type:0,data:{config:o,docs:n,options:{suggest:G("search.suggest")}}})),r}function Gn({document$:e}){let t=we(),r=De(new URL("../versions.json",t.base)).pipe(he(()=>L)),o=r.pipe(m(n=>{let[,i]=t.base.match(/([^/]+)\/?$/);return n.find(({version:s,aliases:a})=>s===i||a.includes(i))||n[0]}));r.pipe(m(n=>new Map(n.map(i=>[`${new URL(`../${i.version}/`,t.base)}`,i]))),b(n=>d(document.body,"click").pipe(g(i=>!i.metaKey&&!i.ctrlKey),ae(o),b(([i,s])=>{if(i.target instanceof Element){let a=i.target.closest("a");if(a&&!a.target&&n.has(a.href)){let c=a.href;return!i.target.closest(".md-version")&&n.get(c)===s?L:(i.preventDefault(),$(c))}}return L}),b(i=>{let{version:s}=n.get(i);return mr(new URL(i)).pipe(m(a=>{let p=ve().href.replace(t.base,"");return a.has(p.split("#")[0])?new URL(`../${s}/${p}`,t.base):new URL(i)}))})))).subscribe(n=>st(n,!0)),Q([r,o]).subscribe(([n,i])=>{P(".md-header__topic").appendChild(gn(n,i))}),e.pipe(b(()=>o)).subscribe(n=>{var s;let i=__md_get("__outdated",sessionStorage);if(i===null){i=!0;let a=((s=t.version)==null?void 0:s.default)||"latest";Array.isArray(a)||(a=[a]);e:for(let c of a)for(let p of n.aliases.concat(n.version))if(new RegExp(c,"i").test(p)){i=!1;break e}__md_set("__outdated",i,sessionStorage)}if(i)for(let a of ne("outdated"))a.hidden=!1})}function Ka(e,{worker$:t}){let{searchParams:r}=ve();r.has("q")&&(Be("search",!0),e.value=r.get("q"),e.focus(),We("search").pipe(He(i=>!i)).subscribe(()=>{let i=ve();i.searchParams.delete("q"),history.replaceState({},"",`${i}`)}));let o=vt(e),n=T(t.pipe(He(Ht)),d(e,"keyup"),o).pipe(m(()=>e.value),Y());return Q([n,o]).pipe(m(([i,s])=>({value:i,focus:s})),B(1))}function Jn(e,{worker$:t}){let r=new v,o=r.pipe(ee(),oe(!0));Q([t.pipe(He(Ht)),r],(i,s)=>s).pipe(X("value")).subscribe(({value:i})=>t.next({type:2,data:i})),r.pipe(X("focus")).subscribe(({focus:i})=>{i&&Be("search",i)}),d(e.form,"reset").pipe(U(o)).subscribe(()=>e.focus());let n=P("header [for=__search]");return d(n,"click").subscribe(()=>e.focus()),Ka(e,{worker$:t}).pipe(y(i=>r.next(i)),_(()=>r.complete()),m(i=>F({ref:e},i)),B(1))}function Xn(e,{worker$:t,query$:r}){let o=new v,n=Yo(e.parentElement).pipe(g(Boolean)),i=e.parentElement,s=P(":scope > :first-child",e),a=P(":scope > :last-child",e);We("search").subscribe(l=>a.setAttribute("role",l?"list":"presentation")),o.pipe(ae(r),Ir(t.pipe(He(Ht)))).subscribe(([{items:l},{value:f}])=>{switch(l.length){case 0:s.textContent=f.length?ge("search.result.none"):ge("search.result.placeholder");break;case 1:s.textContent=ge("search.result.one");break;default:let u=ar(l.length);s.textContent=ge("search.result.other",u)}});let c=o.pipe(y(()=>a.innerHTML=""),b(({items:l})=>T($(...l.slice(0,10)),$(...l.slice(10)).pipe(Ke(4),jr(n),b(([f])=>f)))),m(hn),le());return c.subscribe(l=>a.appendChild(l)),c.pipe(re(l=>{let f=me("details",l);return typeof f=="undefined"?L:d(f,"toggle").pipe(U(o),m(()=>f))})).subscribe(l=>{l.open===!1&&l.offsetTop<=i.scrollTop&&i.scrollTo({top:l.offsetTop})}),t.pipe(g(fr),m(({data:l})=>l)).pipe(y(l=>o.next(l)),_(()=>o.complete()),m(l=>F({ref:e},l)))}function Qa(e,{query$:t}){return t.pipe(m(({value:r})=>{let o=ve();return o.hash="",r=r.replace(/\s+/g,"+").replace(/&/g,"%26").replace(/=/g,"%3D"),o.search=`q=${r}`,{url:o}}))}function Zn(e,t){let r=new v,o=r.pipe(ee(),oe(!0));return r.subscribe(({url:n})=>{e.setAttribute("data-clipboard-text",e.href),e.href=`${n}`}),d(e,"click").pipe(U(o)).subscribe(n=>n.preventDefault()),Qa(e,t).pipe(y(n=>r.next(n)),_(()=>r.complete()),m(n=>F({ref:e},n)))}function ei(e,{worker$:t,keyboard$:r}){let o=new v,n=Te("search-query"),i=T(d(n,"keydown"),d(n,"focus")).pipe(Oe(ie),m(()=>n.value),Y());return o.pipe(je(i),m(([{suggest:a},c])=>{let p=c.split(/([\s-]+)/);if(a!=null&&a.length&&p[p.length-1]){let l=a[a.length-1];l.startsWith(p[p.length-1])&&(p[p.length-1]=l)}else p.length=0;return p})).subscribe(a=>e.innerHTML=a.join("").replace(/\s/g," ")),r.pipe(g(({mode:a})=>a==="search")).subscribe(a=>{switch(a.type){case"ArrowRight":e.innerText.length&&n.selectionStart===n.value.length&&(n.value=e.innerText);break}}),t.pipe(g(fr),m(({data:a})=>a)).pipe(y(a=>o.next(a)),_(()=>o.complete()),m(()=>({ref:e})))}function ti(e,{index$:t,keyboard$:r}){let o=we();try{let n=Bn(o.search,t),i=Te("search-query",e),s=Te("search-result",e);d(e,"click").pipe(g(({target:c})=>c instanceof Element&&!!c.closest("a"))).subscribe(()=>Be("search",!1)),r.pipe(g(({mode:c})=>c==="search")).subscribe(c=>{let p=Re();switch(c.type){case"Enter":if(p===i){let l=new Map;for(let f of R(":first-child [href]",s)){let u=f.firstElementChild;l.set(f,parseFloat(u.getAttribute("data-md-score")))}if(l.size){let[[f]]=[...l].sort(([,u],[,h])=>h-u);f.click()}c.claim()}break;case"Escape":case"Tab":Be("search",!1),i.blur();break;case"ArrowUp":case"ArrowDown":if(typeof p=="undefined")i.focus();else{let l=[i,...R(":not(details) > [href], summary, details[open] [href]",s)],f=Math.max(0,(Math.max(0,l.indexOf(p))+l.length+(c.type==="ArrowUp"?-1:1))%l.length);l[f].focus()}c.claim();break;default:i!==Re()&&i.focus()}}),r.pipe(g(({mode:c})=>c==="global")).subscribe(c=>{switch(c.type){case"f":case"s":case"/":i.focus(),i.select(),c.claim();break}});let a=Jn(i,{worker$:n});return T(a,Xn(s,{worker$:n,query$:a})).pipe($e(...ne("search-share",e).map(c=>Zn(c,{query$:a})),...ne("search-suggest",e).map(c=>ei(c,{worker$:n,keyboard$:r}))))}catch(n){return e.hidden=!0,qe}}function ri(e,{index$:t,location$:r}){return Q([t,r.pipe(q(ve()),g(o=>!!o.searchParams.get("h")))]).pipe(m(([o,n])=>Yn(o.config)(n.searchParams.get("h"))),m(o=>{var s;let n=new Map,i=document.createNodeIterator(e,NodeFilter.SHOW_TEXT);for(let a=i.nextNode();a;a=i.nextNode())if((s=a.parentElement)!=null&&s.offsetHeight){let c=a.textContent,p=o(c);p.length>c.length&&n.set(a,p)}for(let[a,c]of n){let{childNodes:p}=E("span",null,c);a.replaceWith(...Array.from(p))}return{ref:e,nodes:n}}))}function Ya(e,{viewport$:t,main$:r}){let o=e.closest(".md-grid"),n=o.offsetTop-o.parentElement.offsetTop;return Q([r,t]).pipe(m(([{offset:i,height:s},{offset:{y:a}}])=>(s=s+Math.min(n,Math.max(0,a-i))-n,{height:s,locked:a>=i+n})),Y((i,s)=>i.height===s.height&&i.locked===s.locked))}function Qr(e,o){var n=o,{header$:t}=n,r=to(n,["header$"]);let i=P(".md-sidebar__scrollwrap",e),{y:s}=Ue(i);return H(()=>{let a=new v,c=a.pipe(ee(),oe(!0)),p=a.pipe(Me(0,de));return p.pipe(ae(t)).subscribe({next([{height:l},{height:f}]){i.style.height=`${l-2*s}px`,e.style.top=`${f}px`},complete(){i.style.height="",e.style.top=""}}),p.pipe(He()).subscribe(()=>{for(let l of R(".md-nav__link--active[href]",e)){if(!l.clientHeight)continue;let f=l.closest(".md-sidebar__scrollwrap");if(typeof f!="undefined"){let u=l.offsetTop-f.offsetTop,{height:h}=pe(f);f.scrollTo({top:u-h/2})}}}),fe(R("label[tabindex]",e)).pipe(re(l=>d(l,"click").pipe(Oe(ie),m(()=>l),U(c)))).subscribe(l=>{let f=P(`[id="${l.htmlFor}"]`);P(`[aria-labelledby="${l.id}"]`).setAttribute("aria-expanded",`${f.checked}`)}),Ya(e,r).pipe(y(l=>a.next(l)),_(()=>a.complete()),m(l=>F({ref:e},l)))})}function oi(e,t){if(typeof t!="undefined"){let r=`https://api.github.com/repos/${e}/${t}`;return Lt(De(`${r}/releases/latest`).pipe(he(()=>L),m(o=>({version:o.tag_name})),Qe({})),De(r).pipe(he(()=>L),m(o=>({stars:o.stargazers_count,forks:o.forks_count})),Qe({}))).pipe(m(([o,n])=>F(F({},o),n)))}else{let r=`https://api.github.com/users/${e}`;return De(r).pipe(m(o=>({repositories:o.public_repos})),Qe({}))}}function ni(e,t){let r=`https://${e}/api/v4/projects/${encodeURIComponent(t)}`;return De(r).pipe(he(()=>L),m(({star_count:o,forks_count:n})=>({stars:o,forks:n})),Qe({}))}function ii(e){let t=e.match(/^.+github\.com\/([^/]+)\/?([^/]+)?/i);if(t){let[,r,o]=t;return oi(r,o)}if(t=e.match(/^.+?([^/]*gitlab[^/]+)\/(.+?)\/?$/i),t){let[,r,o]=t;return ni(r,o)}return L}var Ba;function Ga(e){return Ba||(Ba=H(()=>{let t=__md_get("__source",sessionStorage);if(t)return $(t);if(ne("consent").length){let o=__md_get("__consent");if(!(o&&o.github))return L}return ii(e.href).pipe(y(o=>__md_set("__source",o,sessionStorage)))}).pipe(he(()=>L),g(t=>Object.keys(t).length>0),m(t=>({facts:t})),B(1)))}function ai(e){let t=P(":scope > :last-child",e);return H(()=>{let r=new v;return r.subscribe(({facts:o})=>{t.appendChild(bn(o)),t.classList.add("md-source__repository--active")}),Ga(e).pipe(y(o=>r.next(o)),_(()=>r.complete()),m(o=>F({ref:e},o)))})}function Ja(e,{viewport$:t,header$:r}){return Ee(document.body).pipe(b(()=>pr(e,{header$:r,viewport$:t})),m(({offset:{y:o}})=>({hidden:o>=10})),X("hidden"))}function si(e,t){return H(()=>{let r=new v;return r.subscribe({next({hidden:o}){e.hidden=o},complete(){e.hidden=!1}}),(G("navigation.tabs.sticky")?$({hidden:!1}):Ja(e,t)).pipe(y(o=>r.next(o)),_(()=>r.complete()),m(o=>F({ref:e},o)))})}function Xa(e,{viewport$:t,header$:r}){let o=new Map,n=R(".md-nav__link",e);for(let a of n){let c=decodeURIComponent(a.hash.substring(1)),p=me(`[id="${c}"]`);typeof p!="undefined"&&o.set(a,p)}let i=r.pipe(X("height"),m(({height:a})=>{let c=Te("main"),p=P(":scope > :first-child",c);return a+.8*(p.offsetTop-c.offsetTop)}),le());return Ee(document.body).pipe(X("height"),b(a=>H(()=>{let c=[];return $([...o].reduce((p,[l,f])=>{for(;c.length&&o.get(c[c.length-1]).tagName>=f.tagName;)c.pop();let u=f.offsetTop;for(;!u&&f.parentElement;)f=f.parentElement,u=f.offsetTop;let h=f.offsetParent;for(;h;h=h.offsetParent)u+=h.offsetTop;return p.set([...c=[...c,l]].reverse(),u)},new Map))}).pipe(m(c=>new Map([...c].sort(([,p],[,l])=>p-l))),je(i),b(([c,p])=>t.pipe(Rr(([l,f],{offset:{y:u},size:h})=>{let w=u+h.height>=Math.floor(a.height);for(;f.length;){let[,A]=f[0];if(A-p=u&&!w)f=[l.pop(),...f];else break}return[l,f]},[[],[...c]]),Y((l,f)=>l[0]===f[0]&&l[1]===f[1])))))).pipe(m(([a,c])=>({prev:a.map(([p])=>p),next:c.map(([p])=>p)})),q({prev:[],next:[]}),Ke(2,1),m(([a,c])=>a.prev.length{let i=new v,s=i.pipe(ee(),oe(!0));if(i.subscribe(({prev:a,next:c})=>{for(let[p]of c)p.classList.remove("md-nav__link--passed"),p.classList.remove("md-nav__link--active");for(let[p,[l]]of a.entries())l.classList.add("md-nav__link--passed"),l.classList.toggle("md-nav__link--active",p===a.length-1)}),G("toc.follow")){let a=T(t.pipe(be(1),m(()=>{})),t.pipe(be(250),m(()=>"smooth")));i.pipe(g(({prev:c})=>c.length>0),je(o.pipe(Oe(ie))),ae(a)).subscribe(([[{prev:c}],p])=>{let[l]=c[c.length-1];if(l.offsetHeight){let f=sr(l);if(typeof f!="undefined"){let u=l.offsetTop-f.offsetTop,{height:h}=pe(f);f.scrollTo({top:u-h/2,behavior:p})}}})}return G("navigation.tracking")&&t.pipe(U(s),X("offset"),be(250),Le(1),U(n.pipe(Le(1))),at({delay:250}),ae(i)).subscribe(([,{prev:a}])=>{let c=ve(),p=a[a.length-1];if(p&&p.length){let[l]=p,{hash:f}=new URL(l.href);c.hash!==f&&(c.hash=f,history.replaceState({},"",`${c}`))}else c.hash="",history.replaceState({},"",`${c}`)}),Xa(e,{viewport$:t,header$:r}).pipe(y(a=>i.next(a)),_(()=>i.complete()),m(a=>F({ref:e},a)))})}function Za(e,{viewport$:t,main$:r,target$:o}){let n=t.pipe(m(({offset:{y:s}})=>s),Ke(2,1),m(([s,a])=>s>a&&a>0),Y()),i=r.pipe(m(({active:s})=>s));return Q([i,n]).pipe(m(([s,a])=>!(s&&a)),Y(),U(o.pipe(Le(1))),oe(!0),at({delay:250}),m(s=>({hidden:s})))}function pi(e,{viewport$:t,header$:r,main$:o,target$:n}){let i=new v,s=i.pipe(ee(),oe(!0));return i.subscribe({next({hidden:a}){e.hidden=a,a?(e.setAttribute("tabindex","-1"),e.blur()):e.removeAttribute("tabindex")},complete(){e.style.top="",e.hidden=!0,e.removeAttribute("tabindex")}}),r.pipe(U(s),X("height")).subscribe(({height:a})=>{e.style.top=`${a+16}px`}),d(e,"click").subscribe(a=>{a.preventDefault(),window.scrollTo({top:0})}),Za(e,{viewport$:t,main$:o,target$:n}).pipe(y(a=>i.next(a)),_(()=>i.complete()),m(a=>F({ref:e},a)))}function li({document$:e}){e.pipe(b(()=>R(".md-ellipsis")),re(t=>yt(t).pipe(U(e.pipe(Le(1))),g(r=>r),m(()=>t),ye(1))),g(t=>t.offsetWidth{let r=t.innerText,o=t.closest("a")||t;return o.title=r,Ge(o).pipe(U(e.pipe(Le(1))),_(()=>o.removeAttribute("title")))})).subscribe(),e.pipe(b(()=>R(".md-status")),re(t=>Ge(t))).subscribe()}function mi({document$:e,tablet$:t}){e.pipe(b(()=>R(".md-toggle--indeterminate")),y(r=>{r.indeterminate=!0,r.checked=!1}),re(r=>d(r,"change").pipe(Fr(()=>r.classList.contains("md-toggle--indeterminate")),m(()=>r))),ae(t)).subscribe(([r,o])=>{r.classList.remove("md-toggle--indeterminate"),o&&(r.checked=!1)})}function es(){return/(iPad|iPhone|iPod)/.test(navigator.userAgent)}function fi({document$:e}){e.pipe(b(()=>R("[data-md-scrollfix]")),y(t=>t.removeAttribute("data-md-scrollfix")),g(es),re(t=>d(t,"touchstart").pipe(m(()=>t)))).subscribe(t=>{let r=t.scrollTop;r===0?t.scrollTop=1:r+t.offsetHeight===t.scrollHeight&&(t.scrollTop=r-1)})}function ui({viewport$:e,tablet$:t}){Q([We("search"),t]).pipe(m(([r,o])=>r&&!o),b(r=>$(r).pipe(Ye(r?400:100))),ae(e)).subscribe(([r,{offset:{y:o}}])=>{if(r)document.body.setAttribute("data-md-scrolllock",""),document.body.style.top=`-${o}px`;else{let n=-1*parseInt(document.body.style.top,10);document.body.removeAttribute("data-md-scrolllock"),document.body.style.top="",n&&window.scrollTo(0,n)}})}Object.entries||(Object.entries=function(e){let t=[];for(let r of Object.keys(e))t.push([r,e[r]]);return t});Object.values||(Object.values=function(e){let t=[];for(let r of Object.keys(e))t.push(e[r]);return t});typeof Element!="undefined"&&(Element.prototype.scrollTo||(Element.prototype.scrollTo=function(e,t){typeof e=="object"?(this.scrollLeft=e.left,this.scrollTop=e.top):(this.scrollLeft=e,this.scrollTop=t)}),Element.prototype.replaceWith||(Element.prototype.replaceWith=function(...e){let t=this.parentNode;if(t){e.length===0&&t.removeChild(this);for(let r=e.length-1;r>=0;r--){let o=e[r];typeof o=="string"?o=document.createTextNode(o):o.parentNode&&o.parentNode.removeChild(o),r?t.insertBefore(this.previousSibling,o):t.replaceChild(o,this)}}}));function ts(){return location.protocol==="file:"?gt(`${new URL("search/search_index.js",Yr.base)}`).pipe(m(()=>__index),B(1)):De(new URL("search/search_index.json",Yr.base))}document.documentElement.classList.remove("no-js");document.documentElement.classList.add("js");var rt=No(),Rt=Jo(),wt=en(Rt),Br=Go(),_e=pn(),ur=At("(min-width: 960px)"),hi=At("(min-width: 1220px)"),bi=tn(),Yr=we(),vi=document.forms.namedItem("search")?ts():qe,Gr=new v;Wn({alert$:Gr});var Jr=new v;G("navigation.instant")&&zn({location$:Rt,viewport$:_e,progress$:Jr}).subscribe(rt);var di;((di=Yr.version)==null?void 0:di.provider)==="mike"&&Gn({document$:rt});T(Rt,wt).pipe(Ye(125)).subscribe(()=>{Be("drawer",!1),Be("search",!1)});Br.pipe(g(({mode:e})=>e==="global")).subscribe(e=>{switch(e.type){case"p":case",":let t=me("link[rel=prev]");typeof t!="undefined"&&st(t);break;case"n":case".":let r=me("link[rel=next]");typeof r!="undefined"&&st(r);break;case"Enter":let o=Re();o instanceof HTMLLabelElement&&o.click()}});li({document$:rt});mi({document$:rt,tablet$:ur});fi({document$:rt});ui({viewport$:_e,tablet$:ur});var tt=Rn(Te("header"),{viewport$:_e}),$t=rt.pipe(m(()=>Te("main")),b(e=>Fn(e,{viewport$:_e,header$:tt})),B(1)),rs=T(...ne("consent").map(e=>fn(e,{target$:wt})),...ne("dialog").map(e=>$n(e,{alert$:Gr})),...ne("header").map(e=>Pn(e,{viewport$:_e,header$:tt,main$:$t})),...ne("palette").map(e=>jn(e)),...ne("progress").map(e=>Un(e,{progress$:Jr})),...ne("search").map(e=>ti(e,{index$:vi,keyboard$:Br})),...ne("source").map(e=>ai(e))),os=H(()=>T(...ne("announce").map(e=>mn(e)),...ne("content").map(e=>Hn(e,{viewport$:_e,target$:wt,print$:bi})),...ne("content").map(e=>G("search.highlight")?ri(e,{index$:vi,location$:Rt}):L),...ne("header-title").map(e=>In(e,{viewport$:_e,header$:tt})),...ne("sidebar").map(e=>e.getAttribute("data-md-type")==="navigation"?Ur(hi,()=>Qr(e,{viewport$:_e,header$:tt,main$:$t})):Ur(ur,()=>Qr(e,{viewport$:_e,header$:tt,main$:$t}))),...ne("tabs").map(e=>si(e,{viewport$:_e,header$:tt})),...ne("toc").map(e=>ci(e,{viewport$:_e,header$:tt,main$:$t,target$:wt})),...ne("top").map(e=>pi(e,{viewport$:_e,header$:tt,main$:$t,target$:wt})))),gi=rt.pipe(b(()=>os),$e(rs),B(1));gi.subscribe();window.document$=rt;window.location$=Rt;window.target$=wt;window.keyboard$=Br;window.viewport$=_e;window.tablet$=ur;window.screen$=hi;window.print$=bi;window.alert$=Gr;window.progress$=Jr;window.component$=gi;})(); +//# sourceMappingURL=bundle.bd41221c.min.js.map + diff --git a/assets/javascripts/bundle.bd41221c.min.js.map b/assets/javascripts/bundle.bd41221c.min.js.map new file mode 100644 index 0000000..1663dab --- /dev/null +++ b/assets/javascripts/bundle.bd41221c.min.js.map @@ -0,0 +1,7 @@ +{ + "version": 3, + "sources": ["node_modules/focus-visible/dist/focus-visible.js", "node_modules/clipboard/dist/clipboard.js", "node_modules/escape-html/index.js", "src/templates/assets/javascripts/bundle.ts", "node_modules/rxjs/node_modules/tslib/tslib.es6.js", "node_modules/rxjs/src/internal/util/isFunction.ts", "node_modules/rxjs/src/internal/util/createErrorClass.ts", "node_modules/rxjs/src/internal/util/UnsubscriptionError.ts", "node_modules/rxjs/src/internal/util/arrRemove.ts", "node_modules/rxjs/src/internal/Subscription.ts", "node_modules/rxjs/src/internal/config.ts", "node_modules/rxjs/src/internal/scheduler/timeoutProvider.ts", "node_modules/rxjs/src/internal/util/reportUnhandledError.ts", "node_modules/rxjs/src/internal/util/noop.ts", "node_modules/rxjs/src/internal/NotificationFactories.ts", "node_modules/rxjs/src/internal/util/errorContext.ts", "node_modules/rxjs/src/internal/Subscriber.ts", "node_modules/rxjs/src/internal/symbol/observable.ts", "node_modules/rxjs/src/internal/util/identity.ts", "node_modules/rxjs/src/internal/util/pipe.ts", "node_modules/rxjs/src/internal/Observable.ts", "node_modules/rxjs/src/internal/util/lift.ts", "node_modules/rxjs/src/internal/operators/OperatorSubscriber.ts", "node_modules/rxjs/src/internal/scheduler/animationFrameProvider.ts", "node_modules/rxjs/src/internal/util/ObjectUnsubscribedError.ts", "node_modules/rxjs/src/internal/Subject.ts", "node_modules/rxjs/src/internal/scheduler/dateTimestampProvider.ts", "node_modules/rxjs/src/internal/ReplaySubject.ts", "node_modules/rxjs/src/internal/scheduler/Action.ts", "node_modules/rxjs/src/internal/scheduler/intervalProvider.ts", "node_modules/rxjs/src/internal/scheduler/AsyncAction.ts", "node_modules/rxjs/src/internal/Scheduler.ts", "node_modules/rxjs/src/internal/scheduler/AsyncScheduler.ts", "node_modules/rxjs/src/internal/scheduler/async.ts", "node_modules/rxjs/src/internal/scheduler/AnimationFrameAction.ts", "node_modules/rxjs/src/internal/scheduler/AnimationFrameScheduler.ts", "node_modules/rxjs/src/internal/scheduler/animationFrame.ts", "node_modules/rxjs/src/internal/observable/empty.ts", "node_modules/rxjs/src/internal/util/isScheduler.ts", "node_modules/rxjs/src/internal/util/args.ts", "node_modules/rxjs/src/internal/util/isArrayLike.ts", "node_modules/rxjs/src/internal/util/isPromise.ts", "node_modules/rxjs/src/internal/util/isInteropObservable.ts", "node_modules/rxjs/src/internal/util/isAsyncIterable.ts", "node_modules/rxjs/src/internal/util/throwUnobservableError.ts", "node_modules/rxjs/src/internal/symbol/iterator.ts", "node_modules/rxjs/src/internal/util/isIterable.ts", "node_modules/rxjs/src/internal/util/isReadableStreamLike.ts", "node_modules/rxjs/src/internal/observable/innerFrom.ts", "node_modules/rxjs/src/internal/util/executeSchedule.ts", "node_modules/rxjs/src/internal/operators/observeOn.ts", "node_modules/rxjs/src/internal/operators/subscribeOn.ts", "node_modules/rxjs/src/internal/scheduled/scheduleObservable.ts", "node_modules/rxjs/src/internal/scheduled/schedulePromise.ts", "node_modules/rxjs/src/internal/scheduled/scheduleArray.ts", "node_modules/rxjs/src/internal/scheduled/scheduleIterable.ts", "node_modules/rxjs/src/internal/scheduled/scheduleAsyncIterable.ts", "node_modules/rxjs/src/internal/scheduled/scheduleReadableStreamLike.ts", "node_modules/rxjs/src/internal/scheduled/scheduled.ts", "node_modules/rxjs/src/internal/observable/from.ts", "node_modules/rxjs/src/internal/observable/of.ts", "node_modules/rxjs/src/internal/observable/throwError.ts", "node_modules/rxjs/src/internal/util/EmptyError.ts", "node_modules/rxjs/src/internal/util/isDate.ts", "node_modules/rxjs/src/internal/operators/map.ts", "node_modules/rxjs/src/internal/util/mapOneOrManyArgs.ts", "node_modules/rxjs/src/internal/util/argsArgArrayOrObject.ts", "node_modules/rxjs/src/internal/util/createObject.ts", "node_modules/rxjs/src/internal/observable/combineLatest.ts", "node_modules/rxjs/src/internal/operators/mergeInternals.ts", "node_modules/rxjs/src/internal/operators/mergeMap.ts", "node_modules/rxjs/src/internal/operators/mergeAll.ts", "node_modules/rxjs/src/internal/operators/concatAll.ts", "node_modules/rxjs/src/internal/observable/concat.ts", "node_modules/rxjs/src/internal/observable/defer.ts", "node_modules/rxjs/src/internal/observable/fromEvent.ts", "node_modules/rxjs/src/internal/observable/fromEventPattern.ts", "node_modules/rxjs/src/internal/observable/timer.ts", "node_modules/rxjs/src/internal/observable/merge.ts", "node_modules/rxjs/src/internal/observable/never.ts", "node_modules/rxjs/src/internal/util/argsOrArgArray.ts", "node_modules/rxjs/src/internal/operators/filter.ts", "node_modules/rxjs/src/internal/observable/zip.ts", "node_modules/rxjs/src/internal/operators/audit.ts", "node_modules/rxjs/src/internal/operators/auditTime.ts", "node_modules/rxjs/src/internal/operators/bufferCount.ts", "node_modules/rxjs/src/internal/operators/catchError.ts", "node_modules/rxjs/src/internal/operators/scanInternals.ts", "node_modules/rxjs/src/internal/operators/combineLatest.ts", "node_modules/rxjs/src/internal/operators/combineLatestWith.ts", "node_modules/rxjs/src/internal/operators/debounceTime.ts", "node_modules/rxjs/src/internal/operators/defaultIfEmpty.ts", "node_modules/rxjs/src/internal/operators/take.ts", "node_modules/rxjs/src/internal/operators/ignoreElements.ts", "node_modules/rxjs/src/internal/operators/mapTo.ts", "node_modules/rxjs/src/internal/operators/delayWhen.ts", "node_modules/rxjs/src/internal/operators/delay.ts", "node_modules/rxjs/src/internal/operators/distinctUntilChanged.ts", "node_modules/rxjs/src/internal/operators/distinctUntilKeyChanged.ts", "node_modules/rxjs/src/internal/operators/throwIfEmpty.ts", "node_modules/rxjs/src/internal/operators/endWith.ts", "node_modules/rxjs/src/internal/operators/finalize.ts", "node_modules/rxjs/src/internal/operators/first.ts", "node_modules/rxjs/src/internal/operators/takeLast.ts", "node_modules/rxjs/src/internal/operators/merge.ts", "node_modules/rxjs/src/internal/operators/mergeWith.ts", "node_modules/rxjs/src/internal/operators/repeat.ts", "node_modules/rxjs/src/internal/operators/scan.ts", "node_modules/rxjs/src/internal/operators/share.ts", "node_modules/rxjs/src/internal/operators/shareReplay.ts", "node_modules/rxjs/src/internal/operators/skip.ts", "node_modules/rxjs/src/internal/operators/skipUntil.ts", "node_modules/rxjs/src/internal/operators/startWith.ts", "node_modules/rxjs/src/internal/operators/switchMap.ts", "node_modules/rxjs/src/internal/operators/takeUntil.ts", "node_modules/rxjs/src/internal/operators/takeWhile.ts", "node_modules/rxjs/src/internal/operators/tap.ts", "node_modules/rxjs/src/internal/operators/throttle.ts", "node_modules/rxjs/src/internal/operators/throttleTime.ts", "node_modules/rxjs/src/internal/operators/withLatestFrom.ts", "node_modules/rxjs/src/internal/operators/zip.ts", "node_modules/rxjs/src/internal/operators/zipWith.ts", "src/templates/assets/javascripts/browser/document/index.ts", "src/templates/assets/javascripts/browser/element/_/index.ts", "src/templates/assets/javascripts/browser/element/focus/index.ts", "src/templates/assets/javascripts/browser/element/hover/index.ts", "src/templates/assets/javascripts/browser/element/offset/_/index.ts", "src/templates/assets/javascripts/browser/element/offset/content/index.ts", "src/templates/assets/javascripts/utilities/h/index.ts", "src/templates/assets/javascripts/utilities/round/index.ts", "src/templates/assets/javascripts/browser/script/index.ts", "src/templates/assets/javascripts/browser/element/size/_/index.ts", "src/templates/assets/javascripts/browser/element/size/content/index.ts", "src/templates/assets/javascripts/browser/element/visibility/index.ts", "src/templates/assets/javascripts/browser/toggle/index.ts", "src/templates/assets/javascripts/browser/keyboard/index.ts", "src/templates/assets/javascripts/browser/location/_/index.ts", "src/templates/assets/javascripts/browser/location/hash/index.ts", "src/templates/assets/javascripts/browser/media/index.ts", "src/templates/assets/javascripts/browser/request/index.ts", "src/templates/assets/javascripts/browser/viewport/offset/index.ts", "src/templates/assets/javascripts/browser/viewport/size/index.ts", "src/templates/assets/javascripts/browser/viewport/_/index.ts", "src/templates/assets/javascripts/browser/viewport/at/index.ts", "src/templates/assets/javascripts/browser/worker/index.ts", "src/templates/assets/javascripts/_/index.ts", "src/templates/assets/javascripts/components/_/index.ts", "src/templates/assets/javascripts/components/announce/index.ts", "src/templates/assets/javascripts/components/consent/index.ts", "src/templates/assets/javascripts/templates/tooltip/index.tsx", "src/templates/assets/javascripts/templates/annotation/index.tsx", "src/templates/assets/javascripts/templates/clipboard/index.tsx", "src/templates/assets/javascripts/templates/search/index.tsx", "src/templates/assets/javascripts/templates/source/index.tsx", "src/templates/assets/javascripts/templates/tabbed/index.tsx", "src/templates/assets/javascripts/templates/table/index.tsx", "src/templates/assets/javascripts/templates/version/index.tsx", "src/templates/assets/javascripts/components/tooltip/index.ts", "src/templates/assets/javascripts/components/content/annotation/_/index.ts", "src/templates/assets/javascripts/components/content/annotation/list/index.ts", "src/templates/assets/javascripts/components/content/annotation/block/index.ts", "src/templates/assets/javascripts/components/content/code/_/index.ts", "src/templates/assets/javascripts/components/content/details/index.ts", "src/templates/assets/javascripts/components/content/mermaid/index.css", "src/templates/assets/javascripts/components/content/mermaid/index.ts", "src/templates/assets/javascripts/components/content/table/index.ts", "src/templates/assets/javascripts/components/content/tabs/index.ts", "src/templates/assets/javascripts/components/content/_/index.ts", "src/templates/assets/javascripts/components/dialog/index.ts", "src/templates/assets/javascripts/components/header/_/index.ts", "src/templates/assets/javascripts/components/header/title/index.ts", "src/templates/assets/javascripts/components/main/index.ts", "src/templates/assets/javascripts/components/palette/index.ts", "src/templates/assets/javascripts/components/progress/index.ts", "src/templates/assets/javascripts/integrations/clipboard/index.ts", "src/templates/assets/javascripts/integrations/sitemap/index.ts", "src/templates/assets/javascripts/integrations/instant/index.ts", "src/templates/assets/javascripts/integrations/search/highlighter/index.ts", "src/templates/assets/javascripts/integrations/search/worker/message/index.ts", "src/templates/assets/javascripts/integrations/search/worker/_/index.ts", "src/templates/assets/javascripts/integrations/version/index.ts", "src/templates/assets/javascripts/components/search/query/index.ts", "src/templates/assets/javascripts/components/search/result/index.ts", "src/templates/assets/javascripts/components/search/share/index.ts", "src/templates/assets/javascripts/components/search/suggest/index.ts", "src/templates/assets/javascripts/components/search/_/index.ts", "src/templates/assets/javascripts/components/search/highlight/index.ts", "src/templates/assets/javascripts/components/sidebar/index.ts", "src/templates/assets/javascripts/components/source/facts/github/index.ts", "src/templates/assets/javascripts/components/source/facts/gitlab/index.ts", "src/templates/assets/javascripts/components/source/facts/_/index.ts", "src/templates/assets/javascripts/components/source/_/index.ts", "src/templates/assets/javascripts/components/tabs/index.ts", "src/templates/assets/javascripts/components/toc/index.ts", "src/templates/assets/javascripts/components/top/index.ts", "src/templates/assets/javascripts/patches/ellipsis/index.ts", "src/templates/assets/javascripts/patches/indeterminate/index.ts", "src/templates/assets/javascripts/patches/scrollfix/index.ts", "src/templates/assets/javascripts/patches/scrolllock/index.ts", "src/templates/assets/javascripts/polyfills/index.ts"], + "sourcesContent": ["(function (global, factory) {\n typeof exports === 'object' && typeof module !== 'undefined' ? factory() :\n typeof define === 'function' && define.amd ? define(factory) :\n (factory());\n}(this, (function () { 'use strict';\n\n /**\n * Applies the :focus-visible polyfill at the given scope.\n * A scope in this case is either the top-level Document or a Shadow Root.\n *\n * @param {(Document|ShadowRoot)} scope\n * @see https://github.com/WICG/focus-visible\n */\n function applyFocusVisiblePolyfill(scope) {\n var hadKeyboardEvent = true;\n var hadFocusVisibleRecently = false;\n var hadFocusVisibleRecentlyTimeout = null;\n\n var inputTypesAllowlist = {\n text: true,\n search: true,\n url: true,\n tel: true,\n email: true,\n password: true,\n number: true,\n date: true,\n month: true,\n week: true,\n time: true,\n datetime: true,\n 'datetime-local': true\n };\n\n /**\n * Helper function for legacy browsers and iframes which sometimes focus\n * elements like document, body, and non-interactive SVG.\n * @param {Element} el\n */\n function isValidFocusTarget(el) {\n if (\n el &&\n el !== document &&\n el.nodeName !== 'HTML' &&\n el.nodeName !== 'BODY' &&\n 'classList' in el &&\n 'contains' in el.classList\n ) {\n return true;\n }\n return false;\n }\n\n /**\n * Computes whether the given element should automatically trigger the\n * `focus-visible` class being added, i.e. whether it should always match\n * `:focus-visible` when focused.\n * @param {Element} el\n * @return {boolean}\n */\n function focusTriggersKeyboardModality(el) {\n var type = el.type;\n var tagName = el.tagName;\n\n if (tagName === 'INPUT' && inputTypesAllowlist[type] && !el.readOnly) {\n return true;\n }\n\n if (tagName === 'TEXTAREA' && !el.readOnly) {\n return true;\n }\n\n if (el.isContentEditable) {\n return true;\n }\n\n return false;\n }\n\n /**\n * Add the `focus-visible` class to the given element if it was not added by\n * the author.\n * @param {Element} el\n */\n function addFocusVisibleClass(el) {\n if (el.classList.contains('focus-visible')) {\n return;\n }\n el.classList.add('focus-visible');\n el.setAttribute('data-focus-visible-added', '');\n }\n\n /**\n * Remove the `focus-visible` class from the given element if it was not\n * originally added by the author.\n * @param {Element} el\n */\n function removeFocusVisibleClass(el) {\n if (!el.hasAttribute('data-focus-visible-added')) {\n return;\n }\n el.classList.remove('focus-visible');\n el.removeAttribute('data-focus-visible-added');\n }\n\n /**\n * If the most recent user interaction was via the keyboard;\n * and the key press did not include a meta, alt/option, or control key;\n * then the modality is keyboard. Otherwise, the modality is not keyboard.\n * Apply `focus-visible` to any current active element and keep track\n * of our keyboard modality state with `hadKeyboardEvent`.\n * @param {KeyboardEvent} e\n */\n function onKeyDown(e) {\n if (e.metaKey || e.altKey || e.ctrlKey) {\n return;\n }\n\n if (isValidFocusTarget(scope.activeElement)) {\n addFocusVisibleClass(scope.activeElement);\n }\n\n hadKeyboardEvent = true;\n }\n\n /**\n * If at any point a user clicks with a pointing device, ensure that we change\n * the modality away from keyboard.\n * This avoids the situation where a user presses a key on an already focused\n * element, and then clicks on a different element, focusing it with a\n * pointing device, while we still think we're in keyboard modality.\n * @param {Event} e\n */\n function onPointerDown(e) {\n hadKeyboardEvent = false;\n }\n\n /**\n * On `focus`, add the `focus-visible` class to the target if:\n * - the target received focus as a result of keyboard navigation, or\n * - the event target is an element that will likely require interaction\n * via the keyboard (e.g. a text box)\n * @param {Event} e\n */\n function onFocus(e) {\n // Prevent IE from focusing the document or HTML element.\n if (!isValidFocusTarget(e.target)) {\n return;\n }\n\n if (hadKeyboardEvent || focusTriggersKeyboardModality(e.target)) {\n addFocusVisibleClass(e.target);\n }\n }\n\n /**\n * On `blur`, remove the `focus-visible` class from the target.\n * @param {Event} e\n */\n function onBlur(e) {\n if (!isValidFocusTarget(e.target)) {\n return;\n }\n\n if (\n e.target.classList.contains('focus-visible') ||\n e.target.hasAttribute('data-focus-visible-added')\n ) {\n // To detect a tab/window switch, we look for a blur event followed\n // rapidly by a visibility change.\n // If we don't see a visibility change within 100ms, it's probably a\n // regular focus change.\n hadFocusVisibleRecently = true;\n window.clearTimeout(hadFocusVisibleRecentlyTimeout);\n hadFocusVisibleRecentlyTimeout = window.setTimeout(function() {\n hadFocusVisibleRecently = false;\n }, 100);\n removeFocusVisibleClass(e.target);\n }\n }\n\n /**\n * If the user changes tabs, keep track of whether or not the previously\n * focused element had .focus-visible.\n * @param {Event} e\n */\n function onVisibilityChange(e) {\n if (document.visibilityState === 'hidden') {\n // If the tab becomes active again, the browser will handle calling focus\n // on the element (Safari actually calls it twice).\n // If this tab change caused a blur on an element with focus-visible,\n // re-apply the class when the user switches back to the tab.\n if (hadFocusVisibleRecently) {\n hadKeyboardEvent = true;\n }\n addInitialPointerMoveListeners();\n }\n }\n\n /**\n * Add a group of listeners to detect usage of any pointing devices.\n * These listeners will be added when the polyfill first loads, and anytime\n * the window is blurred, so that they are active when the window regains\n * focus.\n */\n function addInitialPointerMoveListeners() {\n document.addEventListener('mousemove', onInitialPointerMove);\n document.addEventListener('mousedown', onInitialPointerMove);\n document.addEventListener('mouseup', onInitialPointerMove);\n document.addEventListener('pointermove', onInitialPointerMove);\n document.addEventListener('pointerdown', onInitialPointerMove);\n document.addEventListener('pointerup', onInitialPointerMove);\n document.addEventListener('touchmove', onInitialPointerMove);\n document.addEventListener('touchstart', onInitialPointerMove);\n document.addEventListener('touchend', onInitialPointerMove);\n }\n\n function removeInitialPointerMoveListeners() {\n document.removeEventListener('mousemove', onInitialPointerMove);\n document.removeEventListener('mousedown', onInitialPointerMove);\n document.removeEventListener('mouseup', onInitialPointerMove);\n document.removeEventListener('pointermove', onInitialPointerMove);\n document.removeEventListener('pointerdown', onInitialPointerMove);\n document.removeEventListener('pointerup', onInitialPointerMove);\n document.removeEventListener('touchmove', onInitialPointerMove);\n document.removeEventListener('touchstart', onInitialPointerMove);\n document.removeEventListener('touchend', onInitialPointerMove);\n }\n\n /**\n * When the polfyill first loads, assume the user is in keyboard modality.\n * If any event is received from a pointing device (e.g. mouse, pointer,\n * touch), turn off keyboard modality.\n * This accounts for situations where focus enters the page from the URL bar.\n * @param {Event} e\n */\n function onInitialPointerMove(e) {\n // Work around a Safari quirk that fires a mousemove on whenever the\n // window blurs, even if you're tabbing out of the page. \u00AF\\_(\u30C4)_/\u00AF\n if (e.target.nodeName && e.target.nodeName.toLowerCase() === 'html') {\n return;\n }\n\n hadKeyboardEvent = false;\n removeInitialPointerMoveListeners();\n }\n\n // For some kinds of state, we are interested in changes at the global scope\n // only. For example, global pointer input, global key presses and global\n // visibility change should affect the state at every scope:\n document.addEventListener('keydown', onKeyDown, true);\n document.addEventListener('mousedown', onPointerDown, true);\n document.addEventListener('pointerdown', onPointerDown, true);\n document.addEventListener('touchstart', onPointerDown, true);\n document.addEventListener('visibilitychange', onVisibilityChange, true);\n\n addInitialPointerMoveListeners();\n\n // For focus and blur, we specifically care about state changes in the local\n // scope. This is because focus / blur events that originate from within a\n // shadow root are not re-dispatched from the host element if it was already\n // the active element in its own scope:\n scope.addEventListener('focus', onFocus, true);\n scope.addEventListener('blur', onBlur, true);\n\n // We detect that a node is a ShadowRoot by ensuring that it is a\n // DocumentFragment and also has a host property. This check covers native\n // implementation and polyfill implementation transparently. If we only cared\n // about the native implementation, we could just check if the scope was\n // an instance of a ShadowRoot.\n if (scope.nodeType === Node.DOCUMENT_FRAGMENT_NODE && scope.host) {\n // Since a ShadowRoot is a special kind of DocumentFragment, it does not\n // have a root element to add a class to. So, we add this attribute to the\n // host element instead:\n scope.host.setAttribute('data-js-focus-visible', '');\n } else if (scope.nodeType === Node.DOCUMENT_NODE) {\n document.documentElement.classList.add('js-focus-visible');\n document.documentElement.setAttribute('data-js-focus-visible', '');\n }\n }\n\n // It is important to wrap all references to global window and document in\n // these checks to support server-side rendering use cases\n // @see https://github.com/WICG/focus-visible/issues/199\n if (typeof window !== 'undefined' && typeof document !== 'undefined') {\n // Make the polyfill helper globally available. This can be used as a signal\n // to interested libraries that wish to coordinate with the polyfill for e.g.,\n // applying the polyfill to a shadow root:\n window.applyFocusVisiblePolyfill = applyFocusVisiblePolyfill;\n\n // Notify interested libraries of the polyfill's presence, in case the\n // polyfill was loaded lazily:\n var event;\n\n try {\n event = new CustomEvent('focus-visible-polyfill-ready');\n } catch (error) {\n // IE11 does not support using CustomEvent as a constructor directly:\n event = document.createEvent('CustomEvent');\n event.initCustomEvent('focus-visible-polyfill-ready', false, false, {});\n }\n\n window.dispatchEvent(event);\n }\n\n if (typeof document !== 'undefined') {\n // Apply the polyfill to the global document, so that no JavaScript\n // coordination is required to use the polyfill in the top-level document:\n applyFocusVisiblePolyfill(document);\n }\n\n})));\n", "/*!\n * clipboard.js v2.0.11\n * https://clipboardjs.com/\n *\n * Licensed MIT \u00A9 Zeno Rocha\n */\n(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory();\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine([], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"ClipboardJS\"] = factory();\n\telse\n\t\troot[\"ClipboardJS\"] = factory();\n})(this, function() {\nreturn /******/ (function() { // webpackBootstrap\n/******/ \tvar __webpack_modules__ = ({\n\n/***/ 686:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n\n// EXPORTS\n__webpack_require__.d(__webpack_exports__, {\n \"default\": function() { return /* binding */ clipboard; }\n});\n\n// EXTERNAL MODULE: ./node_modules/tiny-emitter/index.js\nvar tiny_emitter = __webpack_require__(279);\nvar tiny_emitter_default = /*#__PURE__*/__webpack_require__.n(tiny_emitter);\n// EXTERNAL MODULE: ./node_modules/good-listener/src/listen.js\nvar listen = __webpack_require__(370);\nvar listen_default = /*#__PURE__*/__webpack_require__.n(listen);\n// EXTERNAL MODULE: ./node_modules/select/src/select.js\nvar src_select = __webpack_require__(817);\nvar select_default = /*#__PURE__*/__webpack_require__.n(src_select);\n;// CONCATENATED MODULE: ./src/common/command.js\n/**\n * Executes a given operation type.\n * @param {String} type\n * @return {Boolean}\n */\nfunction command(type) {\n try {\n return document.execCommand(type);\n } catch (err) {\n return false;\n }\n}\n;// CONCATENATED MODULE: ./src/actions/cut.js\n\n\n/**\n * Cut action wrapper.\n * @param {String|HTMLElement} target\n * @return {String}\n */\n\nvar ClipboardActionCut = function ClipboardActionCut(target) {\n var selectedText = select_default()(target);\n command('cut');\n return selectedText;\n};\n\n/* harmony default export */ var actions_cut = (ClipboardActionCut);\n;// CONCATENATED MODULE: ./src/common/create-fake-element.js\n/**\n * Creates a fake textarea element with a value.\n * @param {String} value\n * @return {HTMLElement}\n */\nfunction createFakeElement(value) {\n var isRTL = document.documentElement.getAttribute('dir') === 'rtl';\n var fakeElement = document.createElement('textarea'); // Prevent zooming on iOS\n\n fakeElement.style.fontSize = '12pt'; // Reset box model\n\n fakeElement.style.border = '0';\n fakeElement.style.padding = '0';\n fakeElement.style.margin = '0'; // Move element out of screen horizontally\n\n fakeElement.style.position = 'absolute';\n fakeElement.style[isRTL ? 'right' : 'left'] = '-9999px'; // Move element to the same position vertically\n\n var yPosition = window.pageYOffset || document.documentElement.scrollTop;\n fakeElement.style.top = \"\".concat(yPosition, \"px\");\n fakeElement.setAttribute('readonly', '');\n fakeElement.value = value;\n return fakeElement;\n}\n;// CONCATENATED MODULE: ./src/actions/copy.js\n\n\n\n/**\n * Create fake copy action wrapper using a fake element.\n * @param {String} target\n * @param {Object} options\n * @return {String}\n */\n\nvar fakeCopyAction = function fakeCopyAction(value, options) {\n var fakeElement = createFakeElement(value);\n options.container.appendChild(fakeElement);\n var selectedText = select_default()(fakeElement);\n command('copy');\n fakeElement.remove();\n return selectedText;\n};\n/**\n * Copy action wrapper.\n * @param {String|HTMLElement} target\n * @param {Object} options\n * @return {String}\n */\n\n\nvar ClipboardActionCopy = function ClipboardActionCopy(target) {\n var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {\n container: document.body\n };\n var selectedText = '';\n\n if (typeof target === 'string') {\n selectedText = fakeCopyAction(target, options);\n } else if (target instanceof HTMLInputElement && !['text', 'search', 'url', 'tel', 'password'].includes(target === null || target === void 0 ? void 0 : target.type)) {\n // If input type doesn't support `setSelectionRange`. Simulate it. https://developer.mozilla.org/en-US/docs/Web/API/HTMLInputElement/setSelectionRange\n selectedText = fakeCopyAction(target.value, options);\n } else {\n selectedText = select_default()(target);\n command('copy');\n }\n\n return selectedText;\n};\n\n/* harmony default export */ var actions_copy = (ClipboardActionCopy);\n;// CONCATENATED MODULE: ./src/actions/default.js\nfunction _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\n\n\n/**\n * Inner function which performs selection from either `text` or `target`\n * properties and then executes copy or cut operations.\n * @param {Object} options\n */\n\nvar ClipboardActionDefault = function ClipboardActionDefault() {\n var options = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {};\n // Defines base properties passed from constructor.\n var _options$action = options.action,\n action = _options$action === void 0 ? 'copy' : _options$action,\n container = options.container,\n target = options.target,\n text = options.text; // Sets the `action` to be performed which can be either 'copy' or 'cut'.\n\n if (action !== 'copy' && action !== 'cut') {\n throw new Error('Invalid \"action\" value, use either \"copy\" or \"cut\"');\n } // Sets the `target` property using an element that will be have its content copied.\n\n\n if (target !== undefined) {\n if (target && _typeof(target) === 'object' && target.nodeType === 1) {\n if (action === 'copy' && target.hasAttribute('disabled')) {\n throw new Error('Invalid \"target\" attribute. Please use \"readonly\" instead of \"disabled\" attribute');\n }\n\n if (action === 'cut' && (target.hasAttribute('readonly') || target.hasAttribute('disabled'))) {\n throw new Error('Invalid \"target\" attribute. You can\\'t cut text from elements with \"readonly\" or \"disabled\" attributes');\n }\n } else {\n throw new Error('Invalid \"target\" value, use a valid Element');\n }\n } // Define selection strategy based on `text` property.\n\n\n if (text) {\n return actions_copy(text, {\n container: container\n });\n } // Defines which selection strategy based on `target` property.\n\n\n if (target) {\n return action === 'cut' ? actions_cut(target) : actions_copy(target, {\n container: container\n });\n }\n};\n\n/* harmony default export */ var actions_default = (ClipboardActionDefault);\n;// CONCATENATED MODULE: ./src/clipboard.js\nfunction clipboard_typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { clipboard_typeof = function _typeof(obj) { return typeof obj; }; } else { clipboard_typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return clipboard_typeof(obj); }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }\n\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function\"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); if (superClass) _setPrototypeOf(subClass, superClass); }\n\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf || function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\n\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = _getPrototypeOf(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = _getPrototypeOf(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return _possibleConstructorReturn(this, result); }; }\n\nfunction _possibleConstructorReturn(self, call) { if (call && (clipboard_typeof(call) === \"object\" || typeof call === \"function\")) { return call; } return _assertThisInitialized(self); }\n\nfunction _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return self; }\n\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Date.prototype.toString.call(Reflect.construct(Date, [], function () {})); return true; } catch (e) { return false; } }\n\nfunction _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); }\n\n\n\n\n\n\n/**\n * Helper function to retrieve attribute value.\n * @param {String} suffix\n * @param {Element} element\n */\n\nfunction getAttributeValue(suffix, element) {\n var attribute = \"data-clipboard-\".concat(suffix);\n\n if (!element.hasAttribute(attribute)) {\n return;\n }\n\n return element.getAttribute(attribute);\n}\n/**\n * Base class which takes one or more elements, adds event listeners to them,\n * and instantiates a new `ClipboardAction` on each click.\n */\n\n\nvar Clipboard = /*#__PURE__*/function (_Emitter) {\n _inherits(Clipboard, _Emitter);\n\n var _super = _createSuper(Clipboard);\n\n /**\n * @param {String|HTMLElement|HTMLCollection|NodeList} trigger\n * @param {Object} options\n */\n function Clipboard(trigger, options) {\n var _this;\n\n _classCallCheck(this, Clipboard);\n\n _this = _super.call(this);\n\n _this.resolveOptions(options);\n\n _this.listenClick(trigger);\n\n return _this;\n }\n /**\n * Defines if attributes would be resolved using internal setter functions\n * or custom functions that were passed in the constructor.\n * @param {Object} options\n */\n\n\n _createClass(Clipboard, [{\n key: \"resolveOptions\",\n value: function resolveOptions() {\n var options = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {};\n this.action = typeof options.action === 'function' ? options.action : this.defaultAction;\n this.target = typeof options.target === 'function' ? options.target : this.defaultTarget;\n this.text = typeof options.text === 'function' ? options.text : this.defaultText;\n this.container = clipboard_typeof(options.container) === 'object' ? options.container : document.body;\n }\n /**\n * Adds a click event listener to the passed trigger.\n * @param {String|HTMLElement|HTMLCollection|NodeList} trigger\n */\n\n }, {\n key: \"listenClick\",\n value: function listenClick(trigger) {\n var _this2 = this;\n\n this.listener = listen_default()(trigger, 'click', function (e) {\n return _this2.onClick(e);\n });\n }\n /**\n * Defines a new `ClipboardAction` on each click event.\n * @param {Event} e\n */\n\n }, {\n key: \"onClick\",\n value: function onClick(e) {\n var trigger = e.delegateTarget || e.currentTarget;\n var action = this.action(trigger) || 'copy';\n var text = actions_default({\n action: action,\n container: this.container,\n target: this.target(trigger),\n text: this.text(trigger)\n }); // Fires an event based on the copy operation result.\n\n this.emit(text ? 'success' : 'error', {\n action: action,\n text: text,\n trigger: trigger,\n clearSelection: function clearSelection() {\n if (trigger) {\n trigger.focus();\n }\n\n window.getSelection().removeAllRanges();\n }\n });\n }\n /**\n * Default `action` lookup function.\n * @param {Element} trigger\n */\n\n }, {\n key: \"defaultAction\",\n value: function defaultAction(trigger) {\n return getAttributeValue('action', trigger);\n }\n /**\n * Default `target` lookup function.\n * @param {Element} trigger\n */\n\n }, {\n key: \"defaultTarget\",\n value: function defaultTarget(trigger) {\n var selector = getAttributeValue('target', trigger);\n\n if (selector) {\n return document.querySelector(selector);\n }\n }\n /**\n * Allow fire programmatically a copy action\n * @param {String|HTMLElement} target\n * @param {Object} options\n * @returns Text copied.\n */\n\n }, {\n key: \"defaultText\",\n\n /**\n * Default `text` lookup function.\n * @param {Element} trigger\n */\n value: function defaultText(trigger) {\n return getAttributeValue('text', trigger);\n }\n /**\n * Destroy lifecycle.\n */\n\n }, {\n key: \"destroy\",\n value: function destroy() {\n this.listener.destroy();\n }\n }], [{\n key: \"copy\",\n value: function copy(target) {\n var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {\n container: document.body\n };\n return actions_copy(target, options);\n }\n /**\n * Allow fire programmatically a cut action\n * @param {String|HTMLElement} target\n * @returns Text cutted.\n */\n\n }, {\n key: \"cut\",\n value: function cut(target) {\n return actions_cut(target);\n }\n /**\n * Returns the support of the given action, or all actions if no action is\n * given.\n * @param {String} [action]\n */\n\n }, {\n key: \"isSupported\",\n value: function isSupported() {\n var action = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : ['copy', 'cut'];\n var actions = typeof action === 'string' ? [action] : action;\n var support = !!document.queryCommandSupported;\n actions.forEach(function (action) {\n support = support && !!document.queryCommandSupported(action);\n });\n return support;\n }\n }]);\n\n return Clipboard;\n}((tiny_emitter_default()));\n\n/* harmony default export */ var clipboard = (Clipboard);\n\n/***/ }),\n\n/***/ 828:\n/***/ (function(module) {\n\nvar DOCUMENT_NODE_TYPE = 9;\n\n/**\n * A polyfill for Element.matches()\n */\nif (typeof Element !== 'undefined' && !Element.prototype.matches) {\n var proto = Element.prototype;\n\n proto.matches = proto.matchesSelector ||\n proto.mozMatchesSelector ||\n proto.msMatchesSelector ||\n proto.oMatchesSelector ||\n proto.webkitMatchesSelector;\n}\n\n/**\n * Finds the closest parent that matches a selector.\n *\n * @param {Element} element\n * @param {String} selector\n * @return {Function}\n */\nfunction closest (element, selector) {\n while (element && element.nodeType !== DOCUMENT_NODE_TYPE) {\n if (typeof element.matches === 'function' &&\n element.matches(selector)) {\n return element;\n }\n element = element.parentNode;\n }\n}\n\nmodule.exports = closest;\n\n\n/***/ }),\n\n/***/ 438:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\nvar closest = __webpack_require__(828);\n\n/**\n * Delegates event to a selector.\n *\n * @param {Element} element\n * @param {String} selector\n * @param {String} type\n * @param {Function} callback\n * @param {Boolean} useCapture\n * @return {Object}\n */\nfunction _delegate(element, selector, type, callback, useCapture) {\n var listenerFn = listener.apply(this, arguments);\n\n element.addEventListener(type, listenerFn, useCapture);\n\n return {\n destroy: function() {\n element.removeEventListener(type, listenerFn, useCapture);\n }\n }\n}\n\n/**\n * Delegates event to a selector.\n *\n * @param {Element|String|Array} [elements]\n * @param {String} selector\n * @param {String} type\n * @param {Function} callback\n * @param {Boolean} useCapture\n * @return {Object}\n */\nfunction delegate(elements, selector, type, callback, useCapture) {\n // Handle the regular Element usage\n if (typeof elements.addEventListener === 'function') {\n return _delegate.apply(null, arguments);\n }\n\n // Handle Element-less usage, it defaults to global delegation\n if (typeof type === 'function') {\n // Use `document` as the first parameter, then apply arguments\n // This is a short way to .unshift `arguments` without running into deoptimizations\n return _delegate.bind(null, document).apply(null, arguments);\n }\n\n // Handle Selector-based usage\n if (typeof elements === 'string') {\n elements = document.querySelectorAll(elements);\n }\n\n // Handle Array-like based usage\n return Array.prototype.map.call(elements, function (element) {\n return _delegate(element, selector, type, callback, useCapture);\n });\n}\n\n/**\n * Finds closest match and invokes callback.\n *\n * @param {Element} element\n * @param {String} selector\n * @param {String} type\n * @param {Function} callback\n * @return {Function}\n */\nfunction listener(element, selector, type, callback) {\n return function(e) {\n e.delegateTarget = closest(e.target, selector);\n\n if (e.delegateTarget) {\n callback.call(element, e);\n }\n }\n}\n\nmodule.exports = delegate;\n\n\n/***/ }),\n\n/***/ 879:\n/***/ (function(__unused_webpack_module, exports) {\n\n/**\n * Check if argument is a HTML element.\n *\n * @param {Object} value\n * @return {Boolean}\n */\nexports.node = function(value) {\n return value !== undefined\n && value instanceof HTMLElement\n && value.nodeType === 1;\n};\n\n/**\n * Check if argument is a list of HTML elements.\n *\n * @param {Object} value\n * @return {Boolean}\n */\nexports.nodeList = function(value) {\n var type = Object.prototype.toString.call(value);\n\n return value !== undefined\n && (type === '[object NodeList]' || type === '[object HTMLCollection]')\n && ('length' in value)\n && (value.length === 0 || exports.node(value[0]));\n};\n\n/**\n * Check if argument is a string.\n *\n * @param {Object} value\n * @return {Boolean}\n */\nexports.string = function(value) {\n return typeof value === 'string'\n || value instanceof String;\n};\n\n/**\n * Check if argument is a function.\n *\n * @param {Object} value\n * @return {Boolean}\n */\nexports.fn = function(value) {\n var type = Object.prototype.toString.call(value);\n\n return type === '[object Function]';\n};\n\n\n/***/ }),\n\n/***/ 370:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\nvar is = __webpack_require__(879);\nvar delegate = __webpack_require__(438);\n\n/**\n * Validates all params and calls the right\n * listener function based on its target type.\n *\n * @param {String|HTMLElement|HTMLCollection|NodeList} target\n * @param {String} type\n * @param {Function} callback\n * @return {Object}\n */\nfunction listen(target, type, callback) {\n if (!target && !type && !callback) {\n throw new Error('Missing required arguments');\n }\n\n if (!is.string(type)) {\n throw new TypeError('Second argument must be a String');\n }\n\n if (!is.fn(callback)) {\n throw new TypeError('Third argument must be a Function');\n }\n\n if (is.node(target)) {\n return listenNode(target, type, callback);\n }\n else if (is.nodeList(target)) {\n return listenNodeList(target, type, callback);\n }\n else if (is.string(target)) {\n return listenSelector(target, type, callback);\n }\n else {\n throw new TypeError('First argument must be a String, HTMLElement, HTMLCollection, or NodeList');\n }\n}\n\n/**\n * Adds an event listener to a HTML element\n * and returns a remove listener function.\n *\n * @param {HTMLElement} node\n * @param {String} type\n * @param {Function} callback\n * @return {Object}\n */\nfunction listenNode(node, type, callback) {\n node.addEventListener(type, callback);\n\n return {\n destroy: function() {\n node.removeEventListener(type, callback);\n }\n }\n}\n\n/**\n * Add an event listener to a list of HTML elements\n * and returns a remove listener function.\n *\n * @param {NodeList|HTMLCollection} nodeList\n * @param {String} type\n * @param {Function} callback\n * @return {Object}\n */\nfunction listenNodeList(nodeList, type, callback) {\n Array.prototype.forEach.call(nodeList, function(node) {\n node.addEventListener(type, callback);\n });\n\n return {\n destroy: function() {\n Array.prototype.forEach.call(nodeList, function(node) {\n node.removeEventListener(type, callback);\n });\n }\n }\n}\n\n/**\n * Add an event listener to a selector\n * and returns a remove listener function.\n *\n * @param {String} selector\n * @param {String} type\n * @param {Function} callback\n * @return {Object}\n */\nfunction listenSelector(selector, type, callback) {\n return delegate(document.body, selector, type, callback);\n}\n\nmodule.exports = listen;\n\n\n/***/ }),\n\n/***/ 817:\n/***/ (function(module) {\n\nfunction select(element) {\n var selectedText;\n\n if (element.nodeName === 'SELECT') {\n element.focus();\n\n selectedText = element.value;\n }\n else if (element.nodeName === 'INPUT' || element.nodeName === 'TEXTAREA') {\n var isReadOnly = element.hasAttribute('readonly');\n\n if (!isReadOnly) {\n element.setAttribute('readonly', '');\n }\n\n element.select();\n element.setSelectionRange(0, element.value.length);\n\n if (!isReadOnly) {\n element.removeAttribute('readonly');\n }\n\n selectedText = element.value;\n }\n else {\n if (element.hasAttribute('contenteditable')) {\n element.focus();\n }\n\n var selection = window.getSelection();\n var range = document.createRange();\n\n range.selectNodeContents(element);\n selection.removeAllRanges();\n selection.addRange(range);\n\n selectedText = selection.toString();\n }\n\n return selectedText;\n}\n\nmodule.exports = select;\n\n\n/***/ }),\n\n/***/ 279:\n/***/ (function(module) {\n\nfunction E () {\n // Keep this empty so it's easier to inherit from\n // (via https://github.com/lipsmack from https://github.com/scottcorgan/tiny-emitter/issues/3)\n}\n\nE.prototype = {\n on: function (name, callback, ctx) {\n var e = this.e || (this.e = {});\n\n (e[name] || (e[name] = [])).push({\n fn: callback,\n ctx: ctx\n });\n\n return this;\n },\n\n once: function (name, callback, ctx) {\n var self = this;\n function listener () {\n self.off(name, listener);\n callback.apply(ctx, arguments);\n };\n\n listener._ = callback\n return this.on(name, listener, ctx);\n },\n\n emit: function (name) {\n var data = [].slice.call(arguments, 1);\n var evtArr = ((this.e || (this.e = {}))[name] || []).slice();\n var i = 0;\n var len = evtArr.length;\n\n for (i; i < len; i++) {\n evtArr[i].fn.apply(evtArr[i].ctx, data);\n }\n\n return this;\n },\n\n off: function (name, callback) {\n var e = this.e || (this.e = {});\n var evts = e[name];\n var liveEvents = [];\n\n if (evts && callback) {\n for (var i = 0, len = evts.length; i < len; i++) {\n if (evts[i].fn !== callback && evts[i].fn._ !== callback)\n liveEvents.push(evts[i]);\n }\n }\n\n // Remove event from queue to prevent memory leak\n // Suggested by https://github.com/lazd\n // Ref: https://github.com/scottcorgan/tiny-emitter/commit/c6ebfaa9bc973b33d110a84a307742b7cf94c953#commitcomment-5024910\n\n (liveEvents.length)\n ? e[name] = liveEvents\n : delete e[name];\n\n return this;\n }\n};\n\nmodule.exports = E;\nmodule.exports.TinyEmitter = E;\n\n\n/***/ })\n\n/******/ \t});\n/************************************************************************/\n/******/ \t// The module cache\n/******/ \tvar __webpack_module_cache__ = {};\n/******/ \t\n/******/ \t// The require function\n/******/ \tfunction __webpack_require__(moduleId) {\n/******/ \t\t// Check if module is in cache\n/******/ \t\tif(__webpack_module_cache__[moduleId]) {\n/******/ \t\t\treturn __webpack_module_cache__[moduleId].exports;\n/******/ \t\t}\n/******/ \t\t// Create a new module (and put it into the cache)\n/******/ \t\tvar module = __webpack_module_cache__[moduleId] = {\n/******/ \t\t\t// no module.id needed\n/******/ \t\t\t// no module.loaded needed\n/******/ \t\t\texports: {}\n/******/ \t\t};\n/******/ \t\n/******/ \t\t// Execute the module function\n/******/ \t\t__webpack_modules__[moduleId](module, module.exports, __webpack_require__);\n/******/ \t\n/******/ \t\t// Return the exports of the module\n/******/ \t\treturn module.exports;\n/******/ \t}\n/******/ \t\n/************************************************************************/\n/******/ \t/* webpack/runtime/compat get default export */\n/******/ \t!function() {\n/******/ \t\t// getDefaultExport function for compatibility with non-harmony modules\n/******/ \t\t__webpack_require__.n = function(module) {\n/******/ \t\t\tvar getter = module && module.__esModule ?\n/******/ \t\t\t\tfunction() { return module['default']; } :\n/******/ \t\t\t\tfunction() { return module; };\n/******/ \t\t\t__webpack_require__.d(getter, { a: getter });\n/******/ \t\t\treturn getter;\n/******/ \t\t};\n/******/ \t}();\n/******/ \t\n/******/ \t/* webpack/runtime/define property getters */\n/******/ \t!function() {\n/******/ \t\t// define getter functions for harmony exports\n/******/ \t\t__webpack_require__.d = function(exports, definition) {\n/******/ \t\t\tfor(var key in definition) {\n/******/ \t\t\t\tif(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n/******/ \t\t\t\t\tObject.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n/******/ \t\t\t\t}\n/******/ \t\t\t}\n/******/ \t\t};\n/******/ \t}();\n/******/ \t\n/******/ \t/* webpack/runtime/hasOwnProperty shorthand */\n/******/ \t!function() {\n/******/ \t\t__webpack_require__.o = function(obj, prop) { return Object.prototype.hasOwnProperty.call(obj, prop); }\n/******/ \t}();\n/******/ \t\n/************************************************************************/\n/******/ \t// module exports must be returned from runtime so entry inlining is disabled\n/******/ \t// startup\n/******/ \t// Load entry module and return exports\n/******/ \treturn __webpack_require__(686);\n/******/ })()\n.default;\n});", "/*!\n * escape-html\n * Copyright(c) 2012-2013 TJ Holowaychuk\n * Copyright(c) 2015 Andreas Lubbe\n * Copyright(c) 2015 Tiancheng \"Timothy\" Gu\n * MIT Licensed\n */\n\n'use strict';\n\n/**\n * Module variables.\n * @private\n */\n\nvar matchHtmlRegExp = /[\"'&<>]/;\n\n/**\n * Module exports.\n * @public\n */\n\nmodule.exports = escapeHtml;\n\n/**\n * Escape special characters in the given string of html.\n *\n * @param {string} string The string to escape for inserting into HTML\n * @return {string}\n * @public\n */\n\nfunction escapeHtml(string) {\n var str = '' + string;\n var match = matchHtmlRegExp.exec(str);\n\n if (!match) {\n return str;\n }\n\n var escape;\n var html = '';\n var index = 0;\n var lastIndex = 0;\n\n for (index = match.index; index < str.length; index++) {\n switch (str.charCodeAt(index)) {\n case 34: // \"\n escape = '"';\n break;\n case 38: // &\n escape = '&';\n break;\n case 39: // '\n escape = ''';\n break;\n case 60: // <\n escape = '<';\n break;\n case 62: // >\n escape = '>';\n break;\n default:\n continue;\n }\n\n if (lastIndex !== index) {\n html += str.substring(lastIndex, index);\n }\n\n lastIndex = index + 1;\n html += escape;\n }\n\n return lastIndex !== index\n ? html + str.substring(lastIndex, index)\n : html;\n}\n", "/*\n * Copyright (c) 2016-2024 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport \"focus-visible\"\n\nimport {\n EMPTY,\n NEVER,\n Observable,\n Subject,\n defer,\n delay,\n filter,\n map,\n merge,\n mergeWith,\n shareReplay,\n switchMap\n} from \"rxjs\"\n\nimport { configuration, feature } from \"./_\"\nimport {\n at,\n getActiveElement,\n getOptionalElement,\n requestJSON,\n setLocation,\n setToggle,\n watchDocument,\n watchKeyboard,\n watchLocation,\n watchLocationTarget,\n watchMedia,\n watchPrint,\n watchScript,\n watchViewport\n} from \"./browser\"\nimport {\n getComponentElement,\n getComponentElements,\n mountAnnounce,\n mountBackToTop,\n mountConsent,\n mountContent,\n mountDialog,\n mountHeader,\n mountHeaderTitle,\n mountPalette,\n mountProgress,\n mountSearch,\n mountSearchHiglight,\n mountSidebar,\n mountSource,\n mountTableOfContents,\n mountTabs,\n watchHeader,\n watchMain\n} from \"./components\"\nimport {\n SearchIndex,\n setupClipboardJS,\n setupInstantNavigation,\n setupVersionSelector\n} from \"./integrations\"\nimport {\n patchEllipsis,\n patchIndeterminate,\n patchScrollfix,\n patchScrolllock\n} from \"./patches\"\nimport \"./polyfills\"\n\n/* ----------------------------------------------------------------------------\n * Functions - @todo refactor\n * ------------------------------------------------------------------------- */\n\n/**\n * Fetch search index\n *\n * @returns Search index observable\n */\nfunction fetchSearchIndex(): Observable {\n if (location.protocol === \"file:\") {\n return watchScript(\n `${new URL(\"search/search_index.js\", config.base)}`\n )\n .pipe(\n // @ts-ignore - @todo fix typings\n map(() => __index),\n shareReplay(1)\n )\n } else {\n return requestJSON(\n new URL(\"search/search_index.json\", config.base)\n )\n }\n}\n\n/* ----------------------------------------------------------------------------\n * Application\n * ------------------------------------------------------------------------- */\n\n/* Yay, JavaScript is available */\ndocument.documentElement.classList.remove(\"no-js\")\ndocument.documentElement.classList.add(\"js\")\n\n/* Set up navigation observables and subjects */\nconst document$ = watchDocument()\nconst location$ = watchLocation()\nconst target$ = watchLocationTarget(location$)\nconst keyboard$ = watchKeyboard()\n\n/* Set up media observables */\nconst viewport$ = watchViewport()\nconst tablet$ = watchMedia(\"(min-width: 960px)\")\nconst screen$ = watchMedia(\"(min-width: 1220px)\")\nconst print$ = watchPrint()\n\n/* Retrieve search index, if search is enabled */\nconst config = configuration()\nconst index$ = document.forms.namedItem(\"search\")\n ? fetchSearchIndex()\n : NEVER\n\n/* Set up Clipboard.js integration */\nconst alert$ = new Subject()\nsetupClipboardJS({ alert$ })\n\n/* Set up progress indicator */\nconst progress$ = new Subject()\n\n/* Set up instant navigation, if enabled */\nif (feature(\"navigation.instant\"))\n setupInstantNavigation({ location$, viewport$, progress$ })\n .subscribe(document$)\n\n/* Set up version selector */\nif (config.version?.provider === \"mike\")\n setupVersionSelector({ document$ })\n\n/* Always close drawer and search on navigation */\nmerge(location$, target$)\n .pipe(\n delay(125)\n )\n .subscribe(() => {\n setToggle(\"drawer\", false)\n setToggle(\"search\", false)\n })\n\n/* Set up global keyboard handlers */\nkeyboard$\n .pipe(\n filter(({ mode }) => mode === \"global\")\n )\n .subscribe(key => {\n switch (key.type) {\n\n /* Go to previous page */\n case \"p\":\n case \",\":\n const prev = getOptionalElement(\"link[rel=prev]\")\n if (typeof prev !== \"undefined\")\n setLocation(prev)\n break\n\n /* Go to next page */\n case \"n\":\n case \".\":\n const next = getOptionalElement(\"link[rel=next]\")\n if (typeof next !== \"undefined\")\n setLocation(next)\n break\n\n /* Expand navigation, see https://bit.ly/3ZjG5io */\n case \"Enter\":\n const active = getActiveElement()\n if (active instanceof HTMLLabelElement)\n active.click()\n }\n })\n\n/* Set up patches */\npatchEllipsis({ document$ })\npatchIndeterminate({ document$, tablet$ })\npatchScrollfix({ document$ })\npatchScrolllock({ viewport$, tablet$ })\n\n/* Set up header and main area observable */\nconst header$ = watchHeader(getComponentElement(\"header\"), { viewport$ })\nconst main$ = document$\n .pipe(\n map(() => getComponentElement(\"main\")),\n switchMap(el => watchMain(el, { viewport$, header$ })),\n shareReplay(1)\n )\n\n/* Set up control component observables */\nconst control$ = merge(\n\n /* Consent */\n ...getComponentElements(\"consent\")\n .map(el => mountConsent(el, { target$ })),\n\n /* Dialog */\n ...getComponentElements(\"dialog\")\n .map(el => mountDialog(el, { alert$ })),\n\n /* Header */\n ...getComponentElements(\"header\")\n .map(el => mountHeader(el, { viewport$, header$, main$ })),\n\n /* Color palette */\n ...getComponentElements(\"palette\")\n .map(el => mountPalette(el)),\n\n /* Progress bar */\n ...getComponentElements(\"progress\")\n .map(el => mountProgress(el, { progress$ })),\n\n /* Search */\n ...getComponentElements(\"search\")\n .map(el => mountSearch(el, { index$, keyboard$ })),\n\n /* Repository information */\n ...getComponentElements(\"source\")\n .map(el => mountSource(el))\n)\n\n/* Set up content component observables */\nconst content$ = defer(() => merge(\n\n /* Announcement bar */\n ...getComponentElements(\"announce\")\n .map(el => mountAnnounce(el)),\n\n /* Content */\n ...getComponentElements(\"content\")\n .map(el => mountContent(el, { viewport$, target$, print$ })),\n\n /* Search highlighting */\n ...getComponentElements(\"content\")\n .map(el => feature(\"search.highlight\")\n ? mountSearchHiglight(el, { index$, location$ })\n : EMPTY\n ),\n\n /* Header title */\n ...getComponentElements(\"header-title\")\n .map(el => mountHeaderTitle(el, { viewport$, header$ })),\n\n /* Sidebar */\n ...getComponentElements(\"sidebar\")\n .map(el => el.getAttribute(\"data-md-type\") === \"navigation\"\n ? at(screen$, () => mountSidebar(el, { viewport$, header$, main$ }))\n : at(tablet$, () => mountSidebar(el, { viewport$, header$, main$ }))\n ),\n\n /* Navigation tabs */\n ...getComponentElements(\"tabs\")\n .map(el => mountTabs(el, { viewport$, header$ })),\n\n /* Table of contents */\n ...getComponentElements(\"toc\")\n .map(el => mountTableOfContents(el, {\n viewport$, header$, main$, target$\n })),\n\n /* Back-to-top button */\n ...getComponentElements(\"top\")\n .map(el => mountBackToTop(el, { viewport$, header$, main$, target$ }))\n))\n\n/* Set up component observables */\nconst component$ = document$\n .pipe(\n switchMap(() => content$),\n mergeWith(control$),\n shareReplay(1)\n )\n\n/* Subscribe to all components */\ncomponent$.subscribe()\n\n/* ----------------------------------------------------------------------------\n * Exports\n * ------------------------------------------------------------------------- */\n\nwindow.document$ = document$ /* Document observable */\nwindow.location$ = location$ /* Location subject */\nwindow.target$ = target$ /* Location target observable */\nwindow.keyboard$ = keyboard$ /* Keyboard observable */\nwindow.viewport$ = viewport$ /* Viewport observable */\nwindow.tablet$ = tablet$ /* Media tablet observable */\nwindow.screen$ = screen$ /* Media screen observable */\nwindow.print$ = print$ /* Media print observable */\nwindow.alert$ = alert$ /* Alert subject */\nwindow.progress$ = progress$ /* Progress indicator subject */\nwindow.component$ = component$ /* Component observable */\n", "/*! *****************************************************************************\r\nCopyright (c) Microsoft Corporation.\r\n\r\nPermission to use, copy, modify, and/or distribute this software for any\r\npurpose with or without fee is hereby granted.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\r\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\r\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\r\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\r\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\r\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\r\nPERFORMANCE OF THIS SOFTWARE.\r\n***************************************************************************** */\r\n/* global Reflect, Promise */\r\n\r\nvar extendStatics = function(d, b) {\r\n extendStatics = Object.setPrototypeOf ||\r\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\r\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\r\n return extendStatics(d, b);\r\n};\r\n\r\nexport function __extends(d, b) {\r\n if (typeof b !== \"function\" && b !== null)\r\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\r\n extendStatics(d, b);\r\n function __() { this.constructor = d; }\r\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\r\n}\r\n\r\nexport var __assign = function() {\r\n __assign = Object.assign || function __assign(t) {\r\n for (var s, i = 1, n = arguments.length; i < n; i++) {\r\n s = arguments[i];\r\n for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\r\n }\r\n return t;\r\n }\r\n return __assign.apply(this, arguments);\r\n}\r\n\r\nexport function __rest(s, e) {\r\n var t = {};\r\n for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\r\n t[p] = s[p];\r\n if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\r\n for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\r\n if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\r\n t[p[i]] = s[p[i]];\r\n }\r\n return t;\r\n}\r\n\r\nexport function __decorate(decorators, target, key, desc) {\r\n var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\r\n if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\r\n else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\r\n return c > 3 && r && Object.defineProperty(target, key, r), r;\r\n}\r\n\r\nexport function __param(paramIndex, decorator) {\r\n return function (target, key) { decorator(target, key, paramIndex); }\r\n}\r\n\r\nexport function __metadata(metadataKey, metadataValue) {\r\n if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\r\n}\r\n\r\nexport function __awaiter(thisArg, _arguments, P, generator) {\r\n function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\r\n return new (P || (P = Promise))(function (resolve, reject) {\r\n function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\r\n function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\r\n function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\r\n step((generator = generator.apply(thisArg, _arguments || [])).next());\r\n });\r\n}\r\n\r\nexport function __generator(thisArg, body) {\r\n var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\r\n return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\r\n function verb(n) { return function (v) { return step([n, v]); }; }\r\n function step(op) {\r\n if (f) throw new TypeError(\"Generator is already executing.\");\r\n while (_) try {\r\n if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\r\n if (y = 0, t) op = [op[0] & 2, t.value];\r\n switch (op[0]) {\r\n case 0: case 1: t = op; break;\r\n case 4: _.label++; return { value: op[1], done: false };\r\n case 5: _.label++; y = op[1]; op = [0]; continue;\r\n case 7: op = _.ops.pop(); _.trys.pop(); continue;\r\n default:\r\n if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\r\n if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\r\n if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\r\n if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\r\n if (t[2]) _.ops.pop();\r\n _.trys.pop(); continue;\r\n }\r\n op = body.call(thisArg, _);\r\n } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\r\n if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\r\n }\r\n}\r\n\r\nexport var __createBinding = Object.create ? (function(o, m, k, k2) {\r\n if (k2 === undefined) k2 = k;\r\n Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });\r\n}) : (function(o, m, k, k2) {\r\n if (k2 === undefined) k2 = k;\r\n o[k2] = m[k];\r\n});\r\n\r\nexport function __exportStar(m, o) {\r\n for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(o, p)) __createBinding(o, m, p);\r\n}\r\n\r\nexport function __values(o) {\r\n var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\r\n if (m) return m.call(o);\r\n if (o && typeof o.length === \"number\") return {\r\n next: function () {\r\n if (o && i >= o.length) o = void 0;\r\n return { value: o && o[i++], done: !o };\r\n }\r\n };\r\n throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\r\n}\r\n\r\nexport function __read(o, n) {\r\n var m = typeof Symbol === \"function\" && o[Symbol.iterator];\r\n if (!m) return o;\r\n var i = m.call(o), r, ar = [], e;\r\n try {\r\n while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\r\n }\r\n catch (error) { e = { error: error }; }\r\n finally {\r\n try {\r\n if (r && !r.done && (m = i[\"return\"])) m.call(i);\r\n }\r\n finally { if (e) throw e.error; }\r\n }\r\n return ar;\r\n}\r\n\r\n/** @deprecated */\r\nexport function __spread() {\r\n for (var ar = [], i = 0; i < arguments.length; i++)\r\n ar = ar.concat(__read(arguments[i]));\r\n return ar;\r\n}\r\n\r\n/** @deprecated */\r\nexport function __spreadArrays() {\r\n for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;\r\n for (var r = Array(s), k = 0, i = 0; i < il; i++)\r\n for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)\r\n r[k] = a[j];\r\n return r;\r\n}\r\n\r\nexport function __spreadArray(to, from, pack) {\r\n if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {\r\n if (ar || !(i in from)) {\r\n if (!ar) ar = Array.prototype.slice.call(from, 0, i);\r\n ar[i] = from[i];\r\n }\r\n }\r\n return to.concat(ar || Array.prototype.slice.call(from));\r\n}\r\n\r\nexport function __await(v) {\r\n return this instanceof __await ? (this.v = v, this) : new __await(v);\r\n}\r\n\r\nexport function __asyncGenerator(thisArg, _arguments, generator) {\r\n if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n var g = generator.apply(thisArg, _arguments || []), i, q = [];\r\n return i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i;\r\n function verb(n) { if (g[n]) i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; }\r\n function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\r\n function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\r\n function fulfill(value) { resume(\"next\", value); }\r\n function reject(value) { resume(\"throw\", value); }\r\n function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\r\n}\r\n\r\nexport function __asyncDelegator(o) {\r\n var i, p;\r\n return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\r\n function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: n === \"return\" } : f ? f(v) : v; } : f; }\r\n}\r\n\r\nexport function __asyncValues(o) {\r\n if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n var m = o[Symbol.asyncIterator], i;\r\n return m ? m.call(o) : (o = typeof __values === \"function\" ? __values(o) : o[Symbol.iterator](), i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i);\r\n function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }\r\n function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\r\n}\r\n\r\nexport function __makeTemplateObject(cooked, raw) {\r\n if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\r\n return cooked;\r\n};\r\n\r\nvar __setModuleDefault = Object.create ? (function(o, v) {\r\n Object.defineProperty(o, \"default\", { enumerable: true, value: v });\r\n}) : function(o, v) {\r\n o[\"default\"] = v;\r\n};\r\n\r\nexport function __importStar(mod) {\r\n if (mod && mod.__esModule) return mod;\r\n var result = {};\r\n if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\r\n __setModuleDefault(result, mod);\r\n return result;\r\n}\r\n\r\nexport function __importDefault(mod) {\r\n return (mod && mod.__esModule) ? mod : { default: mod };\r\n}\r\n\r\nexport function __classPrivateFieldGet(receiver, state, kind, f) {\r\n if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\r\n if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\r\n return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\r\n}\r\n\r\nexport function __classPrivateFieldSet(receiver, state, value, kind, f) {\r\n if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\r\n if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\r\n if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\r\n return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\r\n}\r\n", "/**\n * Returns true if the object is a function.\n * @param value The value to check\n */\nexport function isFunction(value: any): value is (...args: any[]) => any {\n return typeof value === 'function';\n}\n", "/**\n * Used to create Error subclasses until the community moves away from ES5.\n *\n * This is because compiling from TypeScript down to ES5 has issues with subclassing Errors\n * as well as other built-in types: https://github.com/Microsoft/TypeScript/issues/12123\n *\n * @param createImpl A factory function to create the actual constructor implementation. The returned\n * function should be a named function that calls `_super` internally.\n */\nexport function createErrorClass(createImpl: (_super: any) => any): T {\n const _super = (instance: any) => {\n Error.call(instance);\n instance.stack = new Error().stack;\n };\n\n const ctorFunc = createImpl(_super);\n ctorFunc.prototype = Object.create(Error.prototype);\n ctorFunc.prototype.constructor = ctorFunc;\n return ctorFunc;\n}\n", "import { createErrorClass } from './createErrorClass';\n\nexport interface UnsubscriptionError extends Error {\n readonly errors: any[];\n}\n\nexport interface UnsubscriptionErrorCtor {\n /**\n * @deprecated Internal implementation detail. Do not construct error instances.\n * Cannot be tagged as internal: https://github.com/ReactiveX/rxjs/issues/6269\n */\n new (errors: any[]): UnsubscriptionError;\n}\n\n/**\n * An error thrown when one or more errors have occurred during the\n * `unsubscribe` of a {@link Subscription}.\n */\nexport const UnsubscriptionError: UnsubscriptionErrorCtor = createErrorClass(\n (_super) =>\n function UnsubscriptionErrorImpl(this: any, errors: (Error | string)[]) {\n _super(this);\n this.message = errors\n ? `${errors.length} errors occurred during unsubscription:\n${errors.map((err, i) => `${i + 1}) ${err.toString()}`).join('\\n ')}`\n : '';\n this.name = 'UnsubscriptionError';\n this.errors = errors;\n }\n);\n", "/**\n * Removes an item from an array, mutating it.\n * @param arr The array to remove the item from\n * @param item The item to remove\n */\nexport function arrRemove(arr: T[] | undefined | null, item: T) {\n if (arr) {\n const index = arr.indexOf(item);\n 0 <= index && arr.splice(index, 1);\n }\n}\n", "import { isFunction } from './util/isFunction';\nimport { UnsubscriptionError } from './util/UnsubscriptionError';\nimport { SubscriptionLike, TeardownLogic, Unsubscribable } from './types';\nimport { arrRemove } from './util/arrRemove';\n\n/**\n * Represents a disposable resource, such as the execution of an Observable. A\n * Subscription has one important method, `unsubscribe`, that takes no argument\n * and just disposes the resource held by the subscription.\n *\n * Additionally, subscriptions may be grouped together through the `add()`\n * method, which will attach a child Subscription to the current Subscription.\n * When a Subscription is unsubscribed, all its children (and its grandchildren)\n * will be unsubscribed as well.\n *\n * @class Subscription\n */\nexport class Subscription implements SubscriptionLike {\n /** @nocollapse */\n public static EMPTY = (() => {\n const empty = new Subscription();\n empty.closed = true;\n return empty;\n })();\n\n /**\n * A flag to indicate whether this Subscription has already been unsubscribed.\n */\n public closed = false;\n\n private _parentage: Subscription[] | Subscription | null = null;\n\n /**\n * The list of registered finalizers to execute upon unsubscription. Adding and removing from this\n * list occurs in the {@link #add} and {@link #remove} methods.\n */\n private _finalizers: Exclude[] | null = null;\n\n /**\n * @param initialTeardown A function executed first as part of the finalization\n * process that is kicked off when {@link #unsubscribe} is called.\n */\n constructor(private initialTeardown?: () => void) {}\n\n /**\n * Disposes the resources held by the subscription. May, for instance, cancel\n * an ongoing Observable execution or cancel any other type of work that\n * started when the Subscription was created.\n * @return {void}\n */\n unsubscribe(): void {\n let errors: any[] | undefined;\n\n if (!this.closed) {\n this.closed = true;\n\n // Remove this from it's parents.\n const { _parentage } = this;\n if (_parentage) {\n this._parentage = null;\n if (Array.isArray(_parentage)) {\n for (const parent of _parentage) {\n parent.remove(this);\n }\n } else {\n _parentage.remove(this);\n }\n }\n\n const { initialTeardown: initialFinalizer } = this;\n if (isFunction(initialFinalizer)) {\n try {\n initialFinalizer();\n } catch (e) {\n errors = e instanceof UnsubscriptionError ? e.errors : [e];\n }\n }\n\n const { _finalizers } = this;\n if (_finalizers) {\n this._finalizers = null;\n for (const finalizer of _finalizers) {\n try {\n execFinalizer(finalizer);\n } catch (err) {\n errors = errors ?? [];\n if (err instanceof UnsubscriptionError) {\n errors = [...errors, ...err.errors];\n } else {\n errors.push(err);\n }\n }\n }\n }\n\n if (errors) {\n throw new UnsubscriptionError(errors);\n }\n }\n }\n\n /**\n * Adds a finalizer to this subscription, so that finalization will be unsubscribed/called\n * when this subscription is unsubscribed. If this subscription is already {@link #closed},\n * because it has already been unsubscribed, then whatever finalizer is passed to it\n * will automatically be executed (unless the finalizer itself is also a closed subscription).\n *\n * Closed Subscriptions cannot be added as finalizers to any subscription. Adding a closed\n * subscription to a any subscription will result in no operation. (A noop).\n *\n * Adding a subscription to itself, or adding `null` or `undefined` will not perform any\n * operation at all. (A noop).\n *\n * `Subscription` instances that are added to this instance will automatically remove themselves\n * if they are unsubscribed. Functions and {@link Unsubscribable} objects that you wish to remove\n * will need to be removed manually with {@link #remove}\n *\n * @param teardown The finalization logic to add to this subscription.\n */\n add(teardown: TeardownLogic): void {\n // Only add the finalizer if it's not undefined\n // and don't add a subscription to itself.\n if (teardown && teardown !== this) {\n if (this.closed) {\n // If this subscription is already closed,\n // execute whatever finalizer is handed to it automatically.\n execFinalizer(teardown);\n } else {\n if (teardown instanceof Subscription) {\n // We don't add closed subscriptions, and we don't add the same subscription\n // twice. Subscription unsubscribe is idempotent.\n if (teardown.closed || teardown._hasParent(this)) {\n return;\n }\n teardown._addParent(this);\n }\n (this._finalizers = this._finalizers ?? []).push(teardown);\n }\n }\n }\n\n /**\n * Checks to see if a this subscription already has a particular parent.\n * This will signal that this subscription has already been added to the parent in question.\n * @param parent the parent to check for\n */\n private _hasParent(parent: Subscription) {\n const { _parentage } = this;\n return _parentage === parent || (Array.isArray(_parentage) && _parentage.includes(parent));\n }\n\n /**\n * Adds a parent to this subscription so it can be removed from the parent if it\n * unsubscribes on it's own.\n *\n * NOTE: THIS ASSUMES THAT {@link _hasParent} HAS ALREADY BEEN CHECKED.\n * @param parent The parent subscription to add\n */\n private _addParent(parent: Subscription) {\n const { _parentage } = this;\n this._parentage = Array.isArray(_parentage) ? (_parentage.push(parent), _parentage) : _parentage ? [_parentage, parent] : parent;\n }\n\n /**\n * Called on a child when it is removed via {@link #remove}.\n * @param parent The parent to remove\n */\n private _removeParent(parent: Subscription) {\n const { _parentage } = this;\n if (_parentage === parent) {\n this._parentage = null;\n } else if (Array.isArray(_parentage)) {\n arrRemove(_parentage, parent);\n }\n }\n\n /**\n * Removes a finalizer from this subscription that was previously added with the {@link #add} method.\n *\n * Note that `Subscription` instances, when unsubscribed, will automatically remove themselves\n * from every other `Subscription` they have been added to. This means that using the `remove` method\n * is not a common thing and should be used thoughtfully.\n *\n * If you add the same finalizer instance of a function or an unsubscribable object to a `Subscription` instance\n * more than once, you will need to call `remove` the same number of times to remove all instances.\n *\n * All finalizer instances are removed to free up memory upon unsubscription.\n *\n * @param teardown The finalizer to remove from this subscription\n */\n remove(teardown: Exclude): void {\n const { _finalizers } = this;\n _finalizers && arrRemove(_finalizers, teardown);\n\n if (teardown instanceof Subscription) {\n teardown._removeParent(this);\n }\n }\n}\n\nexport const EMPTY_SUBSCRIPTION = Subscription.EMPTY;\n\nexport function isSubscription(value: any): value is Subscription {\n return (\n value instanceof Subscription ||\n (value && 'closed' in value && isFunction(value.remove) && isFunction(value.add) && isFunction(value.unsubscribe))\n );\n}\n\nfunction execFinalizer(finalizer: Unsubscribable | (() => void)) {\n if (isFunction(finalizer)) {\n finalizer();\n } else {\n finalizer.unsubscribe();\n }\n}\n", "import { Subscriber } from './Subscriber';\nimport { ObservableNotification } from './types';\n\n/**\n * The {@link GlobalConfig} object for RxJS. It is used to configure things\n * like how to react on unhandled errors.\n */\nexport const config: GlobalConfig = {\n onUnhandledError: null,\n onStoppedNotification: null,\n Promise: undefined,\n useDeprecatedSynchronousErrorHandling: false,\n useDeprecatedNextContext: false,\n};\n\n/**\n * The global configuration object for RxJS, used to configure things\n * like how to react on unhandled errors. Accessible via {@link config}\n * object.\n */\nexport interface GlobalConfig {\n /**\n * A registration point for unhandled errors from RxJS. These are errors that\n * cannot were not handled by consuming code in the usual subscription path. For\n * example, if you have this configured, and you subscribe to an observable without\n * providing an error handler, errors from that subscription will end up here. This\n * will _always_ be called asynchronously on another job in the runtime. This is because\n * we do not want errors thrown in this user-configured handler to interfere with the\n * behavior of the library.\n */\n onUnhandledError: ((err: any) => void) | null;\n\n /**\n * A registration point for notifications that cannot be sent to subscribers because they\n * have completed, errored or have been explicitly unsubscribed. By default, next, complete\n * and error notifications sent to stopped subscribers are noops. However, sometimes callers\n * might want a different behavior. For example, with sources that attempt to report errors\n * to stopped subscribers, a caller can configure RxJS to throw an unhandled error instead.\n * This will _always_ be called asynchronously on another job in the runtime. This is because\n * we do not want errors thrown in this user-configured handler to interfere with the\n * behavior of the library.\n */\n onStoppedNotification: ((notification: ObservableNotification, subscriber: Subscriber) => void) | null;\n\n /**\n * The promise constructor used by default for {@link Observable#toPromise toPromise} and {@link Observable#forEach forEach}\n * methods.\n *\n * @deprecated As of version 8, RxJS will no longer support this sort of injection of a\n * Promise constructor. If you need a Promise implementation other than native promises,\n * please polyfill/patch Promise as you see appropriate. Will be removed in v8.\n */\n Promise?: PromiseConstructorLike;\n\n /**\n * If true, turns on synchronous error rethrowing, which is a deprecated behavior\n * in v6 and higher. This behavior enables bad patterns like wrapping a subscribe\n * call in a try/catch block. It also enables producer interference, a nasty bug\n * where a multicast can be broken for all observers by a downstream consumer with\n * an unhandled error. DO NOT USE THIS FLAG UNLESS IT'S NEEDED TO BUY TIME\n * FOR MIGRATION REASONS.\n *\n * @deprecated As of version 8, RxJS will no longer support synchronous throwing\n * of unhandled errors. All errors will be thrown on a separate call stack to prevent bad\n * behaviors described above. Will be removed in v8.\n */\n useDeprecatedSynchronousErrorHandling: boolean;\n\n /**\n * If true, enables an as-of-yet undocumented feature from v5: The ability to access\n * `unsubscribe()` via `this` context in `next` functions created in observers passed\n * to `subscribe`.\n *\n * This is being removed because the performance was severely problematic, and it could also cause\n * issues when types other than POJOs are passed to subscribe as subscribers, as they will likely have\n * their `this` context overwritten.\n *\n * @deprecated As of version 8, RxJS will no longer support altering the\n * context of next functions provided as part of an observer to Subscribe. Instead,\n * you will have access to a subscription or a signal or token that will allow you to do things like\n * unsubscribe and test closed status. Will be removed in v8.\n */\n useDeprecatedNextContext: boolean;\n}\n", "import type { TimerHandle } from './timerHandle';\ntype SetTimeoutFunction = (handler: () => void, timeout?: number, ...args: any[]) => TimerHandle;\ntype ClearTimeoutFunction = (handle: TimerHandle) => void;\n\ninterface TimeoutProvider {\n setTimeout: SetTimeoutFunction;\n clearTimeout: ClearTimeoutFunction;\n delegate:\n | {\n setTimeout: SetTimeoutFunction;\n clearTimeout: ClearTimeoutFunction;\n }\n | undefined;\n}\n\nexport const timeoutProvider: TimeoutProvider = {\n // When accessing the delegate, use the variable rather than `this` so that\n // the functions can be called without being bound to the provider.\n setTimeout(handler: () => void, timeout?: number, ...args) {\n const { delegate } = timeoutProvider;\n if (delegate?.setTimeout) {\n return delegate.setTimeout(handler, timeout, ...args);\n }\n return setTimeout(handler, timeout, ...args);\n },\n clearTimeout(handle) {\n const { delegate } = timeoutProvider;\n return (delegate?.clearTimeout || clearTimeout)(handle as any);\n },\n delegate: undefined,\n};\n", "import { config } from '../config';\nimport { timeoutProvider } from '../scheduler/timeoutProvider';\n\n/**\n * Handles an error on another job either with the user-configured {@link onUnhandledError},\n * or by throwing it on that new job so it can be picked up by `window.onerror`, `process.on('error')`, etc.\n *\n * This should be called whenever there is an error that is out-of-band with the subscription\n * or when an error hits a terminal boundary of the subscription and no error handler was provided.\n *\n * @param err the error to report\n */\nexport function reportUnhandledError(err: any) {\n timeoutProvider.setTimeout(() => {\n const { onUnhandledError } = config;\n if (onUnhandledError) {\n // Execute the user-configured error handler.\n onUnhandledError(err);\n } else {\n // Throw so it is picked up by the runtime's uncaught error mechanism.\n throw err;\n }\n });\n}\n", "/* tslint:disable:no-empty */\nexport function noop() { }\n", "import { CompleteNotification, NextNotification, ErrorNotification } from './types';\n\n/**\n * A completion object optimized for memory use and created to be the\n * same \"shape\" as other notifications in v8.\n * @internal\n */\nexport const COMPLETE_NOTIFICATION = (() => createNotification('C', undefined, undefined) as CompleteNotification)();\n\n/**\n * Internal use only. Creates an optimized error notification that is the same \"shape\"\n * as other notifications.\n * @internal\n */\nexport function errorNotification(error: any): ErrorNotification {\n return createNotification('E', undefined, error) as any;\n}\n\n/**\n * Internal use only. Creates an optimized next notification that is the same \"shape\"\n * as other notifications.\n * @internal\n */\nexport function nextNotification(value: T) {\n return createNotification('N', value, undefined) as NextNotification;\n}\n\n/**\n * Ensures that all notifications created internally have the same \"shape\" in v8.\n *\n * TODO: This is only exported to support a crazy legacy test in `groupBy`.\n * @internal\n */\nexport function createNotification(kind: 'N' | 'E' | 'C', value: any, error: any) {\n return {\n kind,\n value,\n error,\n };\n}\n", "import { config } from '../config';\n\nlet context: { errorThrown: boolean; error: any } | null = null;\n\n/**\n * Handles dealing with errors for super-gross mode. Creates a context, in which\n * any synchronously thrown errors will be passed to {@link captureError}. Which\n * will record the error such that it will be rethrown after the call back is complete.\n * TODO: Remove in v8\n * @param cb An immediately executed function.\n */\nexport function errorContext(cb: () => void) {\n if (config.useDeprecatedSynchronousErrorHandling) {\n const isRoot = !context;\n if (isRoot) {\n context = { errorThrown: false, error: null };\n }\n cb();\n if (isRoot) {\n const { errorThrown, error } = context!;\n context = null;\n if (errorThrown) {\n throw error;\n }\n }\n } else {\n // This is the general non-deprecated path for everyone that\n // isn't crazy enough to use super-gross mode (useDeprecatedSynchronousErrorHandling)\n cb();\n }\n}\n\n/**\n * Captures errors only in super-gross mode.\n * @param err the error to capture\n */\nexport function captureError(err: any) {\n if (config.useDeprecatedSynchronousErrorHandling && context) {\n context.errorThrown = true;\n context.error = err;\n }\n}\n", "import { isFunction } from './util/isFunction';\nimport { Observer, ObservableNotification } from './types';\nimport { isSubscription, Subscription } from './Subscription';\nimport { config } from './config';\nimport { reportUnhandledError } from './util/reportUnhandledError';\nimport { noop } from './util/noop';\nimport { nextNotification, errorNotification, COMPLETE_NOTIFICATION } from './NotificationFactories';\nimport { timeoutProvider } from './scheduler/timeoutProvider';\nimport { captureError } from './util/errorContext';\n\n/**\n * Implements the {@link Observer} interface and extends the\n * {@link Subscription} class. While the {@link Observer} is the public API for\n * consuming the values of an {@link Observable}, all Observers get converted to\n * a Subscriber, in order to provide Subscription-like capabilities such as\n * `unsubscribe`. Subscriber is a common type in RxJS, and crucial for\n * implementing operators, but it is rarely used as a public API.\n *\n * @class Subscriber\n */\nexport class Subscriber extends Subscription implements Observer {\n /**\n * A static factory for a Subscriber, given a (potentially partial) definition\n * of an Observer.\n * @param next The `next` callback of an Observer.\n * @param error The `error` callback of an\n * Observer.\n * @param complete The `complete` callback of an\n * Observer.\n * @return A Subscriber wrapping the (partially defined)\n * Observer represented by the given arguments.\n * @nocollapse\n * @deprecated Do not use. Will be removed in v8. There is no replacement for this\n * method, and there is no reason to be creating instances of `Subscriber` directly.\n * If you have a specific use case, please file an issue.\n */\n static create(next?: (x?: T) => void, error?: (e?: any) => void, complete?: () => void): Subscriber {\n return new SafeSubscriber(next, error, complete);\n }\n\n /** @deprecated Internal implementation detail, do not use directly. Will be made internal in v8. */\n protected isStopped: boolean = false;\n /** @deprecated Internal implementation detail, do not use directly. Will be made internal in v8. */\n protected destination: Subscriber | Observer; // this `any` is the escape hatch to erase extra type param (e.g. R)\n\n /**\n * @deprecated Internal implementation detail, do not use directly. Will be made internal in v8.\n * There is no reason to directly create an instance of Subscriber. This type is exported for typings reasons.\n */\n constructor(destination?: Subscriber | Observer) {\n super();\n if (destination) {\n this.destination = destination;\n // Automatically chain subscriptions together here.\n // if destination is a Subscription, then it is a Subscriber.\n if (isSubscription(destination)) {\n destination.add(this);\n }\n } else {\n this.destination = EMPTY_OBSERVER;\n }\n }\n\n /**\n * The {@link Observer} callback to receive notifications of type `next` from\n * the Observable, with a value. The Observable may call this method 0 or more\n * times.\n * @param {T} [value] The `next` value.\n * @return {void}\n */\n next(value?: T): void {\n if (this.isStopped) {\n handleStoppedNotification(nextNotification(value), this);\n } else {\n this._next(value!);\n }\n }\n\n /**\n * The {@link Observer} callback to receive notifications of type `error` from\n * the Observable, with an attached `Error`. Notifies the Observer that\n * the Observable has experienced an error condition.\n * @param {any} [err] The `error` exception.\n * @return {void}\n */\n error(err?: any): void {\n if (this.isStopped) {\n handleStoppedNotification(errorNotification(err), this);\n } else {\n this.isStopped = true;\n this._error(err);\n }\n }\n\n /**\n * The {@link Observer} callback to receive a valueless notification of type\n * `complete` from the Observable. Notifies the Observer that the Observable\n * has finished sending push-based notifications.\n * @return {void}\n */\n complete(): void {\n if (this.isStopped) {\n handleStoppedNotification(COMPLETE_NOTIFICATION, this);\n } else {\n this.isStopped = true;\n this._complete();\n }\n }\n\n unsubscribe(): void {\n if (!this.closed) {\n this.isStopped = true;\n super.unsubscribe();\n this.destination = null!;\n }\n }\n\n protected _next(value: T): void {\n this.destination.next(value);\n }\n\n protected _error(err: any): void {\n try {\n this.destination.error(err);\n } finally {\n this.unsubscribe();\n }\n }\n\n protected _complete(): void {\n try {\n this.destination.complete();\n } finally {\n this.unsubscribe();\n }\n }\n}\n\n/**\n * This bind is captured here because we want to be able to have\n * compatibility with monoid libraries that tend to use a method named\n * `bind`. In particular, a library called Monio requires this.\n */\nconst _bind = Function.prototype.bind;\n\nfunction bind any>(fn: Fn, thisArg: any): Fn {\n return _bind.call(fn, thisArg);\n}\n\n/**\n * Internal optimization only, DO NOT EXPOSE.\n * @internal\n */\nclass ConsumerObserver implements Observer {\n constructor(private partialObserver: Partial>) {}\n\n next(value: T): void {\n const { partialObserver } = this;\n if (partialObserver.next) {\n try {\n partialObserver.next(value);\n } catch (error) {\n handleUnhandledError(error);\n }\n }\n }\n\n error(err: any): void {\n const { partialObserver } = this;\n if (partialObserver.error) {\n try {\n partialObserver.error(err);\n } catch (error) {\n handleUnhandledError(error);\n }\n } else {\n handleUnhandledError(err);\n }\n }\n\n complete(): void {\n const { partialObserver } = this;\n if (partialObserver.complete) {\n try {\n partialObserver.complete();\n } catch (error) {\n handleUnhandledError(error);\n }\n }\n }\n}\n\nexport class SafeSubscriber extends Subscriber {\n constructor(\n observerOrNext?: Partial> | ((value: T) => void) | null,\n error?: ((e?: any) => void) | null,\n complete?: (() => void) | null\n ) {\n super();\n\n let partialObserver: Partial>;\n if (isFunction(observerOrNext) || !observerOrNext) {\n // The first argument is a function, not an observer. The next\n // two arguments *could* be observers, or they could be empty.\n partialObserver = {\n next: (observerOrNext ?? undefined) as (((value: T) => void) | undefined),\n error: error ?? undefined,\n complete: complete ?? undefined,\n };\n } else {\n // The first argument is a partial observer.\n let context: any;\n if (this && config.useDeprecatedNextContext) {\n // This is a deprecated path that made `this.unsubscribe()` available in\n // next handler functions passed to subscribe. This only exists behind a flag\n // now, as it is *very* slow.\n context = Object.create(observerOrNext);\n context.unsubscribe = () => this.unsubscribe();\n partialObserver = {\n next: observerOrNext.next && bind(observerOrNext.next, context),\n error: observerOrNext.error && bind(observerOrNext.error, context),\n complete: observerOrNext.complete && bind(observerOrNext.complete, context),\n };\n } else {\n // The \"normal\" path. Just use the partial observer directly.\n partialObserver = observerOrNext;\n }\n }\n\n // Wrap the partial observer to ensure it's a full observer, and\n // make sure proper error handling is accounted for.\n this.destination = new ConsumerObserver(partialObserver);\n }\n}\n\nfunction handleUnhandledError(error: any) {\n if (config.useDeprecatedSynchronousErrorHandling) {\n captureError(error);\n } else {\n // Ideal path, we report this as an unhandled error,\n // which is thrown on a new call stack.\n reportUnhandledError(error);\n }\n}\n\n/**\n * An error handler used when no error handler was supplied\n * to the SafeSubscriber -- meaning no error handler was supplied\n * do the `subscribe` call on our observable.\n * @param err The error to handle\n */\nfunction defaultErrorHandler(err: any) {\n throw err;\n}\n\n/**\n * A handler for notifications that cannot be sent to a stopped subscriber.\n * @param notification The notification being sent\n * @param subscriber The stopped subscriber\n */\nfunction handleStoppedNotification(notification: ObservableNotification, subscriber: Subscriber) {\n const { onStoppedNotification } = config;\n onStoppedNotification && timeoutProvider.setTimeout(() => onStoppedNotification(notification, subscriber));\n}\n\n/**\n * The observer used as a stub for subscriptions where the user did not\n * pass any arguments to `subscribe`. Comes with the default error handling\n * behavior.\n */\nexport const EMPTY_OBSERVER: Readonly> & { closed: true } = {\n closed: true,\n next: noop,\n error: defaultErrorHandler,\n complete: noop,\n};\n", "/**\n * Symbol.observable or a string \"@@observable\". Used for interop\n *\n * @deprecated We will no longer be exporting this symbol in upcoming versions of RxJS.\n * Instead polyfill and use Symbol.observable directly *or* use https://www.npmjs.com/package/symbol-observable\n */\nexport const observable: string | symbol = (() => (typeof Symbol === 'function' && Symbol.observable) || '@@observable')();\n", "/**\n * This function takes one parameter and just returns it. Simply put,\n * this is like `(x: T): T => x`.\n *\n * ## Examples\n *\n * This is useful in some cases when using things like `mergeMap`\n *\n * ```ts\n * import { interval, take, map, range, mergeMap, identity } from 'rxjs';\n *\n * const source$ = interval(1000).pipe(take(5));\n *\n * const result$ = source$.pipe(\n * map(i => range(i)),\n * mergeMap(identity) // same as mergeMap(x => x)\n * );\n *\n * result$.subscribe({\n * next: console.log\n * });\n * ```\n *\n * Or when you want to selectively apply an operator\n *\n * ```ts\n * import { interval, take, identity } from 'rxjs';\n *\n * const shouldLimit = () => Math.random() < 0.5;\n *\n * const source$ = interval(1000);\n *\n * const result$ = source$.pipe(shouldLimit() ? take(5) : identity);\n *\n * result$.subscribe({\n * next: console.log\n * });\n * ```\n *\n * @param x Any value that is returned by this function\n * @returns The value passed as the first parameter to this function\n */\nexport function identity(x: T): T {\n return x;\n}\n", "import { identity } from './identity';\nimport { UnaryFunction } from '../types';\n\nexport function pipe(): typeof identity;\nexport function pipe(fn1: UnaryFunction): UnaryFunction;\nexport function pipe(fn1: UnaryFunction, fn2: UnaryFunction): UnaryFunction;\nexport function pipe(fn1: UnaryFunction, fn2: UnaryFunction, fn3: UnaryFunction): UnaryFunction;\nexport function pipe(\n fn1: UnaryFunction,\n fn2: UnaryFunction,\n fn3: UnaryFunction,\n fn4: UnaryFunction\n): UnaryFunction;\nexport function pipe(\n fn1: UnaryFunction,\n fn2: UnaryFunction,\n fn3: UnaryFunction,\n fn4: UnaryFunction,\n fn5: UnaryFunction\n): UnaryFunction;\nexport function pipe(\n fn1: UnaryFunction,\n fn2: UnaryFunction,\n fn3: UnaryFunction,\n fn4: UnaryFunction,\n fn5: UnaryFunction,\n fn6: UnaryFunction\n): UnaryFunction;\nexport function pipe(\n fn1: UnaryFunction,\n fn2: UnaryFunction,\n fn3: UnaryFunction,\n fn4: UnaryFunction,\n fn5: UnaryFunction,\n fn6: UnaryFunction,\n fn7: UnaryFunction\n): UnaryFunction;\nexport function pipe(\n fn1: UnaryFunction,\n fn2: UnaryFunction,\n fn3: UnaryFunction,\n fn4: UnaryFunction,\n fn5: UnaryFunction,\n fn6: UnaryFunction,\n fn7: UnaryFunction,\n fn8: UnaryFunction\n): UnaryFunction;\nexport function pipe(\n fn1: UnaryFunction,\n fn2: UnaryFunction,\n fn3: UnaryFunction,\n fn4: UnaryFunction,\n fn5: UnaryFunction,\n fn6: UnaryFunction,\n fn7: UnaryFunction,\n fn8: UnaryFunction,\n fn9: UnaryFunction\n): UnaryFunction;\nexport function pipe(\n fn1: UnaryFunction,\n fn2: UnaryFunction,\n fn3: UnaryFunction,\n fn4: UnaryFunction,\n fn5: UnaryFunction,\n fn6: UnaryFunction,\n fn7: UnaryFunction,\n fn8: UnaryFunction,\n fn9: UnaryFunction,\n ...fns: UnaryFunction[]\n): UnaryFunction;\n\n/**\n * pipe() can be called on one or more functions, each of which can take one argument (\"UnaryFunction\")\n * and uses it to return a value.\n * It returns a function that takes one argument, passes it to the first UnaryFunction, and then\n * passes the result to the next one, passes that result to the next one, and so on. \n */\nexport function pipe(...fns: Array>): UnaryFunction {\n return pipeFromArray(fns);\n}\n\n/** @internal */\nexport function pipeFromArray(fns: Array>): UnaryFunction {\n if (fns.length === 0) {\n return identity as UnaryFunction;\n }\n\n if (fns.length === 1) {\n return fns[0];\n }\n\n return function piped(input: T): R {\n return fns.reduce((prev: any, fn: UnaryFunction) => fn(prev), input as any);\n };\n}\n", "import { Operator } from './Operator';\nimport { SafeSubscriber, Subscriber } from './Subscriber';\nimport { isSubscription, Subscription } from './Subscription';\nimport { TeardownLogic, OperatorFunction, Subscribable, Observer } from './types';\nimport { observable as Symbol_observable } from './symbol/observable';\nimport { pipeFromArray } from './util/pipe';\nimport { config } from './config';\nimport { isFunction } from './util/isFunction';\nimport { errorContext } from './util/errorContext';\n\n/**\n * A representation of any set of values over any amount of time. This is the most basic building block\n * of RxJS.\n *\n * @class Observable\n */\nexport class Observable implements Subscribable {\n /**\n * @deprecated Internal implementation detail, do not use directly. Will be made internal in v8.\n */\n source: Observable | undefined;\n\n /**\n * @deprecated Internal implementation detail, do not use directly. Will be made internal in v8.\n */\n operator: Operator | undefined;\n\n /**\n * @constructor\n * @param {Function} subscribe the function that is called when the Observable is\n * initially subscribed to. This function is given a Subscriber, to which new values\n * can be `next`ed, or an `error` method can be called to raise an error, or\n * `complete` can be called to notify of a successful completion.\n */\n constructor(subscribe?: (this: Observable, subscriber: Subscriber) => TeardownLogic) {\n if (subscribe) {\n this._subscribe = subscribe;\n }\n }\n\n // HACK: Since TypeScript inherits static properties too, we have to\n // fight against TypeScript here so Subject can have a different static create signature\n /**\n * Creates a new Observable by calling the Observable constructor\n * @owner Observable\n * @method create\n * @param {Function} subscribe? the subscriber function to be passed to the Observable constructor\n * @return {Observable} a new observable\n * @nocollapse\n * @deprecated Use `new Observable()` instead. Will be removed in v8.\n */\n static create: (...args: any[]) => any = (subscribe?: (subscriber: Subscriber) => TeardownLogic) => {\n return new Observable(subscribe);\n };\n\n /**\n * Creates a new Observable, with this Observable instance as the source, and the passed\n * operator defined as the new observable's operator.\n * @method lift\n * @param operator the operator defining the operation to take on the observable\n * @return a new observable with the Operator applied\n * @deprecated Internal implementation detail, do not use directly. Will be made internal in v8.\n * If you have implemented an operator using `lift`, it is recommended that you create an\n * operator by simply returning `new Observable()` directly. See \"Creating new operators from\n * scratch\" section here: https://rxjs.dev/guide/operators\n */\n lift(operator?: Operator): Observable {\n const observable = new Observable();\n observable.source = this;\n observable.operator = operator;\n return observable;\n }\n\n subscribe(observerOrNext?: Partial> | ((value: T) => void)): Subscription;\n /** @deprecated Instead of passing separate callback arguments, use an observer argument. Signatures taking separate callback arguments will be removed in v8. Details: https://rxjs.dev/deprecations/subscribe-arguments */\n subscribe(next?: ((value: T) => void) | null, error?: ((error: any) => void) | null, complete?: (() => void) | null): Subscription;\n /**\n * Invokes an execution of an Observable and registers Observer handlers for notifications it will emit.\n *\n * Use it when you have all these Observables, but still nothing is happening.\n *\n * `subscribe` is not a regular operator, but a method that calls Observable's internal `subscribe` function. It\n * might be for example a function that you passed to Observable's constructor, but most of the time it is\n * a library implementation, which defines what will be emitted by an Observable, and when it be will emitted. This means\n * that calling `subscribe` is actually the moment when Observable starts its work, not when it is created, as it is often\n * the thought.\n *\n * Apart from starting the execution of an Observable, this method allows you to listen for values\n * that an Observable emits, as well as for when it completes or errors. You can achieve this in two\n * of the following ways.\n *\n * The first way is creating an object that implements {@link Observer} interface. It should have methods\n * defined by that interface, but note that it should be just a regular JavaScript object, which you can create\n * yourself in any way you want (ES6 class, classic function constructor, object literal etc.). In particular, do\n * not attempt to use any RxJS implementation details to create Observers - you don't need them. Remember also\n * that your object does not have to implement all methods. If you find yourself creating a method that doesn't\n * do anything, you can simply omit it. Note however, if the `error` method is not provided and an error happens,\n * it will be thrown asynchronously. Errors thrown asynchronously cannot be caught using `try`/`catch`. Instead,\n * use the {@link onUnhandledError} configuration option or use a runtime handler (like `window.onerror` or\n * `process.on('error)`) to be notified of unhandled errors. Because of this, it's recommended that you provide\n * an `error` method to avoid missing thrown errors.\n *\n * The second way is to give up on Observer object altogether and simply provide callback functions in place of its methods.\n * This means you can provide three functions as arguments to `subscribe`, where the first function is equivalent\n * of a `next` method, the second of an `error` method and the third of a `complete` method. Just as in case of an Observer,\n * if you do not need to listen for something, you can omit a function by passing `undefined` or `null`,\n * since `subscribe` recognizes these functions by where they were placed in function call. When it comes\n * to the `error` function, as with an Observer, if not provided, errors emitted by an Observable will be thrown asynchronously.\n *\n * You can, however, subscribe with no parameters at all. This may be the case where you're not interested in terminal events\n * and you also handled emissions internally by using operators (e.g. using `tap`).\n *\n * Whichever style of calling `subscribe` you use, in both cases it returns a Subscription object.\n * This object allows you to call `unsubscribe` on it, which in turn will stop the work that an Observable does and will clean\n * up all resources that an Observable used. Note that cancelling a subscription will not call `complete` callback\n * provided to `subscribe` function, which is reserved for a regular completion signal that comes from an Observable.\n *\n * Remember that callbacks provided to `subscribe` are not guaranteed to be called asynchronously.\n * It is an Observable itself that decides when these functions will be called. For example {@link of}\n * by default emits all its values synchronously. Always check documentation for how given Observable\n * will behave when subscribed and if its default behavior can be modified with a `scheduler`.\n *\n * #### Examples\n *\n * Subscribe with an {@link guide/observer Observer}\n *\n * ```ts\n * import { of } from 'rxjs';\n *\n * const sumObserver = {\n * sum: 0,\n * next(value) {\n * console.log('Adding: ' + value);\n * this.sum = this.sum + value;\n * },\n * error() {\n * // We actually could just remove this method,\n * // since we do not really care about errors right now.\n * },\n * complete() {\n * console.log('Sum equals: ' + this.sum);\n * }\n * };\n *\n * of(1, 2, 3) // Synchronously emits 1, 2, 3 and then completes.\n * .subscribe(sumObserver);\n *\n * // Logs:\n * // 'Adding: 1'\n * // 'Adding: 2'\n * // 'Adding: 3'\n * // 'Sum equals: 6'\n * ```\n *\n * Subscribe with functions ({@link deprecations/subscribe-arguments deprecated})\n *\n * ```ts\n * import { of } from 'rxjs'\n *\n * let sum = 0;\n *\n * of(1, 2, 3).subscribe(\n * value => {\n * console.log('Adding: ' + value);\n * sum = sum + value;\n * },\n * undefined,\n * () => console.log('Sum equals: ' + sum)\n * );\n *\n * // Logs:\n * // 'Adding: 1'\n * // 'Adding: 2'\n * // 'Adding: 3'\n * // 'Sum equals: 6'\n * ```\n *\n * Cancel a subscription\n *\n * ```ts\n * import { interval } from 'rxjs';\n *\n * const subscription = interval(1000).subscribe({\n * next(num) {\n * console.log(num)\n * },\n * complete() {\n * // Will not be called, even when cancelling subscription.\n * console.log('completed!');\n * }\n * });\n *\n * setTimeout(() => {\n * subscription.unsubscribe();\n * console.log('unsubscribed!');\n * }, 2500);\n *\n * // Logs:\n * // 0 after 1s\n * // 1 after 2s\n * // 'unsubscribed!' after 2.5s\n * ```\n *\n * @param {Observer|Function} observerOrNext (optional) Either an observer with methods to be called,\n * or the first of three possible handlers, which is the handler for each value emitted from the subscribed\n * Observable.\n * @param {Function} error (optional) A handler for a terminal event resulting from an error. If no error handler is provided,\n * the error will be thrown asynchronously as unhandled.\n * @param {Function} complete (optional) A handler for a terminal event resulting from successful completion.\n * @return {Subscription} a subscription reference to the registered handlers\n * @method subscribe\n */\n subscribe(\n observerOrNext?: Partial> | ((value: T) => void) | null,\n error?: ((error: any) => void) | null,\n complete?: (() => void) | null\n ): Subscription {\n const subscriber = isSubscriber(observerOrNext) ? observerOrNext : new SafeSubscriber(observerOrNext, error, complete);\n\n errorContext(() => {\n const { operator, source } = this;\n subscriber.add(\n operator\n ? // We're dealing with a subscription in the\n // operator chain to one of our lifted operators.\n operator.call(subscriber, source)\n : source\n ? // If `source` has a value, but `operator` does not, something that\n // had intimate knowledge of our API, like our `Subject`, must have\n // set it. We're going to just call `_subscribe` directly.\n this._subscribe(subscriber)\n : // In all other cases, we're likely wrapping a user-provided initializer\n // function, so we need to catch errors and handle them appropriately.\n this._trySubscribe(subscriber)\n );\n });\n\n return subscriber;\n }\n\n /** @internal */\n protected _trySubscribe(sink: Subscriber): TeardownLogic {\n try {\n return this._subscribe(sink);\n } catch (err) {\n // We don't need to return anything in this case,\n // because it's just going to try to `add()` to a subscription\n // above.\n sink.error(err);\n }\n }\n\n /**\n * Used as a NON-CANCELLABLE means of subscribing to an observable, for use with\n * APIs that expect promises, like `async/await`. You cannot unsubscribe from this.\n *\n * **WARNING**: Only use this with observables you *know* will complete. If the source\n * observable does not complete, you will end up with a promise that is hung up, and\n * potentially all of the state of an async function hanging out in memory. To avoid\n * this situation, look into adding something like {@link timeout}, {@link take},\n * {@link takeWhile}, or {@link takeUntil} amongst others.\n *\n * #### Example\n *\n * ```ts\n * import { interval, take } from 'rxjs';\n *\n * const source$ = interval(1000).pipe(take(4));\n *\n * async function getTotal() {\n * let total = 0;\n *\n * await source$.forEach(value => {\n * total += value;\n * console.log('observable -> ' + value);\n * });\n *\n * return total;\n * }\n *\n * getTotal().then(\n * total => console.log('Total: ' + total)\n * );\n *\n * // Expected:\n * // 'observable -> 0'\n * // 'observable -> 1'\n * // 'observable -> 2'\n * // 'observable -> 3'\n * // 'Total: 6'\n * ```\n *\n * @param next a handler for each value emitted by the observable\n * @return a promise that either resolves on observable completion or\n * rejects with the handled error\n */\n forEach(next: (value: T) => void): Promise;\n\n /**\n * @param next a handler for each value emitted by the observable\n * @param promiseCtor a constructor function used to instantiate the Promise\n * @return a promise that either resolves on observable completion or\n * rejects with the handled error\n * @deprecated Passing a Promise constructor will no longer be available\n * in upcoming versions of RxJS. This is because it adds weight to the library, for very\n * little benefit. If you need this functionality, it is recommended that you either\n * polyfill Promise, or you create an adapter to convert the returned native promise\n * to whatever promise implementation you wanted. Will be removed in v8.\n */\n forEach(next: (value: T) => void, promiseCtor: PromiseConstructorLike): Promise;\n\n forEach(next: (value: T) => void, promiseCtor?: PromiseConstructorLike): Promise {\n promiseCtor = getPromiseCtor(promiseCtor);\n\n return new promiseCtor((resolve, reject) => {\n const subscriber = new SafeSubscriber({\n next: (value) => {\n try {\n next(value);\n } catch (err) {\n reject(err);\n subscriber.unsubscribe();\n }\n },\n error: reject,\n complete: resolve,\n });\n this.subscribe(subscriber);\n }) as Promise;\n }\n\n /** @internal */\n protected _subscribe(subscriber: Subscriber): TeardownLogic {\n return this.source?.subscribe(subscriber);\n }\n\n /**\n * An interop point defined by the es7-observable spec https://github.com/zenparsing/es-observable\n * @method Symbol.observable\n * @return {Observable} this instance of the observable\n */\n [Symbol_observable]() {\n return this;\n }\n\n /* tslint:disable:max-line-length */\n pipe(): Observable;\n pipe(op1: OperatorFunction): Observable;\n pipe(op1: OperatorFunction, op2: OperatorFunction): Observable;\n pipe(op1: OperatorFunction, op2: OperatorFunction, op3: OperatorFunction): Observable;\n pipe(\n op1: OperatorFunction,\n op2: OperatorFunction,\n op3: OperatorFunction,\n op4: OperatorFunction\n ): Observable;\n pipe(\n op1: OperatorFunction,\n op2: OperatorFunction,\n op3: OperatorFunction,\n op4: OperatorFunction,\n op5: OperatorFunction\n ): Observable;\n pipe(\n op1: OperatorFunction,\n op2: OperatorFunction,\n op3: OperatorFunction,\n op4: OperatorFunction,\n op5: OperatorFunction,\n op6: OperatorFunction\n ): Observable;\n pipe(\n op1: OperatorFunction,\n op2: OperatorFunction,\n op3: OperatorFunction,\n op4: OperatorFunction,\n op5: OperatorFunction,\n op6: OperatorFunction,\n op7: OperatorFunction\n ): Observable;\n pipe(\n op1: OperatorFunction,\n op2: OperatorFunction,\n op3: OperatorFunction,\n op4: OperatorFunction,\n op5: OperatorFunction,\n op6: OperatorFunction,\n op7: OperatorFunction,\n op8: OperatorFunction\n ): Observable;\n pipe(\n op1: OperatorFunction,\n op2: OperatorFunction,\n op3: OperatorFunction,\n op4: OperatorFunction,\n op5: OperatorFunction,\n op6: OperatorFunction,\n op7: OperatorFunction,\n op8: OperatorFunction,\n op9: OperatorFunction\n ): Observable;\n pipe(\n op1: OperatorFunction,\n op2: OperatorFunction,\n op3: OperatorFunction,\n op4: OperatorFunction,\n op5: OperatorFunction,\n op6: OperatorFunction,\n op7: OperatorFunction,\n op8: OperatorFunction,\n op9: OperatorFunction,\n ...operations: OperatorFunction[]\n ): Observable;\n /* tslint:enable:max-line-length */\n\n /**\n * Used to stitch together functional operators into a chain.\n * @method pipe\n * @return {Observable} the Observable result of all of the operators having\n * been called in the order they were passed in.\n *\n * ## Example\n *\n * ```ts\n * import { interval, filter, map, scan } from 'rxjs';\n *\n * interval(1000)\n * .pipe(\n * filter(x => x % 2 === 0),\n * map(x => x + x),\n * scan((acc, x) => acc + x)\n * )\n * .subscribe(x => console.log(x));\n * ```\n */\n pipe(...operations: OperatorFunction[]): Observable {\n return pipeFromArray(operations)(this);\n }\n\n /* tslint:disable:max-line-length */\n /** @deprecated Replaced with {@link firstValueFrom} and {@link lastValueFrom}. Will be removed in v8. Details: https://rxjs.dev/deprecations/to-promise */\n toPromise(): Promise;\n /** @deprecated Replaced with {@link firstValueFrom} and {@link lastValueFrom}. Will be removed in v8. Details: https://rxjs.dev/deprecations/to-promise */\n toPromise(PromiseCtor: typeof Promise): Promise;\n /** @deprecated Replaced with {@link firstValueFrom} and {@link lastValueFrom}. Will be removed in v8. Details: https://rxjs.dev/deprecations/to-promise */\n toPromise(PromiseCtor: PromiseConstructorLike): Promise;\n /* tslint:enable:max-line-length */\n\n /**\n * Subscribe to this Observable and get a Promise resolving on\n * `complete` with the last emission (if any).\n *\n * **WARNING**: Only use this with observables you *know* will complete. If the source\n * observable does not complete, you will end up with a promise that is hung up, and\n * potentially all of the state of an async function hanging out in memory. To avoid\n * this situation, look into adding something like {@link timeout}, {@link take},\n * {@link takeWhile}, or {@link takeUntil} amongst others.\n *\n * @method toPromise\n * @param [promiseCtor] a constructor function used to instantiate\n * the Promise\n * @return A Promise that resolves with the last value emit, or\n * rejects on an error. If there were no emissions, Promise\n * resolves with undefined.\n * @deprecated Replaced with {@link firstValueFrom} and {@link lastValueFrom}. Will be removed in v8. Details: https://rxjs.dev/deprecations/to-promise\n */\n toPromise(promiseCtor?: PromiseConstructorLike): Promise {\n promiseCtor = getPromiseCtor(promiseCtor);\n\n return new promiseCtor((resolve, reject) => {\n let value: T | undefined;\n this.subscribe(\n (x: T) => (value = x),\n (err: any) => reject(err),\n () => resolve(value)\n );\n }) as Promise;\n }\n}\n\n/**\n * Decides between a passed promise constructor from consuming code,\n * A default configured promise constructor, and the native promise\n * constructor and returns it. If nothing can be found, it will throw\n * an error.\n * @param promiseCtor The optional promise constructor to passed by consuming code\n */\nfunction getPromiseCtor(promiseCtor: PromiseConstructorLike | undefined) {\n return promiseCtor ?? config.Promise ?? Promise;\n}\n\nfunction isObserver(value: any): value is Observer {\n return value && isFunction(value.next) && isFunction(value.error) && isFunction(value.complete);\n}\n\nfunction isSubscriber(value: any): value is Subscriber {\n return (value && value instanceof Subscriber) || (isObserver(value) && isSubscription(value));\n}\n", "import { Observable } from '../Observable';\nimport { Subscriber } from '../Subscriber';\nimport { OperatorFunction } from '../types';\nimport { isFunction } from './isFunction';\n\n/**\n * Used to determine if an object is an Observable with a lift function.\n */\nexport function hasLift(source: any): source is { lift: InstanceType['lift'] } {\n return isFunction(source?.lift);\n}\n\n/**\n * Creates an `OperatorFunction`. Used to define operators throughout the library in a concise way.\n * @param init The logic to connect the liftedSource to the subscriber at the moment of subscription.\n */\nexport function operate(\n init: (liftedSource: Observable, subscriber: Subscriber) => (() => void) | void\n): OperatorFunction {\n return (source: Observable) => {\n if (hasLift(source)) {\n return source.lift(function (this: Subscriber, liftedSource: Observable) {\n try {\n return init(liftedSource, this);\n } catch (err) {\n this.error(err);\n }\n });\n }\n throw new TypeError('Unable to lift unknown Observable type');\n };\n}\n", "import { Subscriber } from '../Subscriber';\n\n/**\n * Creates an instance of an `OperatorSubscriber`.\n * @param destination The downstream subscriber.\n * @param onNext Handles next values, only called if this subscriber is not stopped or closed. Any\n * error that occurs in this function is caught and sent to the `error` method of this subscriber.\n * @param onError Handles errors from the subscription, any errors that occur in this handler are caught\n * and send to the `destination` error handler.\n * @param onComplete Handles completion notification from the subscription. Any errors that occur in\n * this handler are sent to the `destination` error handler.\n * @param onFinalize Additional teardown logic here. This will only be called on teardown if the\n * subscriber itself is not already closed. This is called after all other teardown logic is executed.\n */\nexport function createOperatorSubscriber(\n destination: Subscriber,\n onNext?: (value: T) => void,\n onComplete?: () => void,\n onError?: (err: any) => void,\n onFinalize?: () => void\n): Subscriber {\n return new OperatorSubscriber(destination, onNext, onComplete, onError, onFinalize);\n}\n\n/**\n * A generic helper for allowing operators to be created with a Subscriber and\n * use closures to capture necessary state from the operator function itself.\n */\nexport class OperatorSubscriber extends Subscriber {\n /**\n * Creates an instance of an `OperatorSubscriber`.\n * @param destination The downstream subscriber.\n * @param onNext Handles next values, only called if this subscriber is not stopped or closed. Any\n * error that occurs in this function is caught and sent to the `error` method of this subscriber.\n * @param onError Handles errors from the subscription, any errors that occur in this handler are caught\n * and send to the `destination` error handler.\n * @param onComplete Handles completion notification from the subscription. Any errors that occur in\n * this handler are sent to the `destination` error handler.\n * @param onFinalize Additional finalization logic here. This will only be called on finalization if the\n * subscriber itself is not already closed. This is called after all other finalization logic is executed.\n * @param shouldUnsubscribe An optional check to see if an unsubscribe call should truly unsubscribe.\n * NOTE: This currently **ONLY** exists to support the strange behavior of {@link groupBy}, where unsubscription\n * to the resulting observable does not actually disconnect from the source if there are active subscriptions\n * to any grouped observable. (DO NOT EXPOSE OR USE EXTERNALLY!!!)\n */\n constructor(\n destination: Subscriber,\n onNext?: (value: T) => void,\n onComplete?: () => void,\n onError?: (err: any) => void,\n private onFinalize?: () => void,\n private shouldUnsubscribe?: () => boolean\n ) {\n // It's important - for performance reasons - that all of this class's\n // members are initialized and that they are always initialized in the same\n // order. This will ensure that all OperatorSubscriber instances have the\n // same hidden class in V8. This, in turn, will help keep the number of\n // hidden classes involved in property accesses within the base class as\n // low as possible. If the number of hidden classes involved exceeds four,\n // the property accesses will become megamorphic and performance penalties\n // will be incurred - i.e. inline caches won't be used.\n //\n // The reasons for ensuring all instances have the same hidden class are\n // further discussed in this blog post from Benedikt Meurer:\n // https://benediktmeurer.de/2018/03/23/impact-of-polymorphism-on-component-based-frameworks-like-react/\n super(destination);\n this._next = onNext\n ? function (this: OperatorSubscriber, value: T) {\n try {\n onNext(value);\n } catch (err) {\n destination.error(err);\n }\n }\n : super._next;\n this._error = onError\n ? function (this: OperatorSubscriber, err: any) {\n try {\n onError(err);\n } catch (err) {\n // Send any errors that occur down stream.\n destination.error(err);\n } finally {\n // Ensure finalization.\n this.unsubscribe();\n }\n }\n : super._error;\n this._complete = onComplete\n ? function (this: OperatorSubscriber) {\n try {\n onComplete();\n } catch (err) {\n // Send any errors that occur down stream.\n destination.error(err);\n } finally {\n // Ensure finalization.\n this.unsubscribe();\n }\n }\n : super._complete;\n }\n\n unsubscribe() {\n if (!this.shouldUnsubscribe || this.shouldUnsubscribe()) {\n const { closed } = this;\n super.unsubscribe();\n // Execute additional teardown if we have any and we didn't already do so.\n !closed && this.onFinalize?.();\n }\n }\n}\n", "import { Subscription } from '../Subscription';\n\ninterface AnimationFrameProvider {\n schedule(callback: FrameRequestCallback): Subscription;\n requestAnimationFrame: typeof requestAnimationFrame;\n cancelAnimationFrame: typeof cancelAnimationFrame;\n delegate:\n | {\n requestAnimationFrame: typeof requestAnimationFrame;\n cancelAnimationFrame: typeof cancelAnimationFrame;\n }\n | undefined;\n}\n\nexport const animationFrameProvider: AnimationFrameProvider = {\n // When accessing the delegate, use the variable rather than `this` so that\n // the functions can be called without being bound to the provider.\n schedule(callback) {\n let request = requestAnimationFrame;\n let cancel: typeof cancelAnimationFrame | undefined = cancelAnimationFrame;\n const { delegate } = animationFrameProvider;\n if (delegate) {\n request = delegate.requestAnimationFrame;\n cancel = delegate.cancelAnimationFrame;\n }\n const handle = request((timestamp) => {\n // Clear the cancel function. The request has been fulfilled, so\n // attempting to cancel the request upon unsubscription would be\n // pointless.\n cancel = undefined;\n callback(timestamp);\n });\n return new Subscription(() => cancel?.(handle));\n },\n requestAnimationFrame(...args) {\n const { delegate } = animationFrameProvider;\n return (delegate?.requestAnimationFrame || requestAnimationFrame)(...args);\n },\n cancelAnimationFrame(...args) {\n const { delegate } = animationFrameProvider;\n return (delegate?.cancelAnimationFrame || cancelAnimationFrame)(...args);\n },\n delegate: undefined,\n};\n", "import { createErrorClass } from './createErrorClass';\n\nexport interface ObjectUnsubscribedError extends Error {}\n\nexport interface ObjectUnsubscribedErrorCtor {\n /**\n * @deprecated Internal implementation detail. Do not construct error instances.\n * Cannot be tagged as internal: https://github.com/ReactiveX/rxjs/issues/6269\n */\n new (): ObjectUnsubscribedError;\n}\n\n/**\n * An error thrown when an action is invalid because the object has been\n * unsubscribed.\n *\n * @see {@link Subject}\n * @see {@link BehaviorSubject}\n *\n * @class ObjectUnsubscribedError\n */\nexport const ObjectUnsubscribedError: ObjectUnsubscribedErrorCtor = createErrorClass(\n (_super) =>\n function ObjectUnsubscribedErrorImpl(this: any) {\n _super(this);\n this.name = 'ObjectUnsubscribedError';\n this.message = 'object unsubscribed';\n }\n);\n", "import { Operator } from './Operator';\nimport { Observable } from './Observable';\nimport { Subscriber } from './Subscriber';\nimport { Subscription, EMPTY_SUBSCRIPTION } from './Subscription';\nimport { Observer, SubscriptionLike, TeardownLogic } from './types';\nimport { ObjectUnsubscribedError } from './util/ObjectUnsubscribedError';\nimport { arrRemove } from './util/arrRemove';\nimport { errorContext } from './util/errorContext';\n\n/**\n * A Subject is a special type of Observable that allows values to be\n * multicasted to many Observers. Subjects are like EventEmitters.\n *\n * Every Subject is an Observable and an Observer. You can subscribe to a\n * Subject, and you can call next to feed values as well as error and complete.\n */\nexport class Subject extends Observable implements SubscriptionLike {\n closed = false;\n\n private currentObservers: Observer[] | null = null;\n\n /** @deprecated Internal implementation detail, do not use directly. Will be made internal in v8. */\n observers: Observer[] = [];\n /** @deprecated Internal implementation detail, do not use directly. Will be made internal in v8. */\n isStopped = false;\n /** @deprecated Internal implementation detail, do not use directly. Will be made internal in v8. */\n hasError = false;\n /** @deprecated Internal implementation detail, do not use directly. Will be made internal in v8. */\n thrownError: any = null;\n\n /**\n * Creates a \"subject\" by basically gluing an observer to an observable.\n *\n * @nocollapse\n * @deprecated Recommended you do not use. Will be removed at some point in the future. Plans for replacement still under discussion.\n */\n static create: (...args: any[]) => any = (destination: Observer, source: Observable): AnonymousSubject => {\n return new AnonymousSubject(destination, source);\n };\n\n constructor() {\n // NOTE: This must be here to obscure Observable's constructor.\n super();\n }\n\n /** @deprecated Internal implementation detail, do not use directly. Will be made internal in v8. */\n lift(operator: Operator): Observable {\n const subject = new AnonymousSubject(this, this);\n subject.operator = operator as any;\n return subject as any;\n }\n\n /** @internal */\n protected _throwIfClosed() {\n if (this.closed) {\n throw new ObjectUnsubscribedError();\n }\n }\n\n next(value: T) {\n errorContext(() => {\n this._throwIfClosed();\n if (!this.isStopped) {\n if (!this.currentObservers) {\n this.currentObservers = Array.from(this.observers);\n }\n for (const observer of this.currentObservers) {\n observer.next(value);\n }\n }\n });\n }\n\n error(err: any) {\n errorContext(() => {\n this._throwIfClosed();\n if (!this.isStopped) {\n this.hasError = this.isStopped = true;\n this.thrownError = err;\n const { observers } = this;\n while (observers.length) {\n observers.shift()!.error(err);\n }\n }\n });\n }\n\n complete() {\n errorContext(() => {\n this._throwIfClosed();\n if (!this.isStopped) {\n this.isStopped = true;\n const { observers } = this;\n while (observers.length) {\n observers.shift()!.complete();\n }\n }\n });\n }\n\n unsubscribe() {\n this.isStopped = this.closed = true;\n this.observers = this.currentObservers = null!;\n }\n\n get observed() {\n return this.observers?.length > 0;\n }\n\n /** @internal */\n protected _trySubscribe(subscriber: Subscriber): TeardownLogic {\n this._throwIfClosed();\n return super._trySubscribe(subscriber);\n }\n\n /** @internal */\n protected _subscribe(subscriber: Subscriber): Subscription {\n this._throwIfClosed();\n this._checkFinalizedStatuses(subscriber);\n return this._innerSubscribe(subscriber);\n }\n\n /** @internal */\n protected _innerSubscribe(subscriber: Subscriber) {\n const { hasError, isStopped, observers } = this;\n if (hasError || isStopped) {\n return EMPTY_SUBSCRIPTION;\n }\n this.currentObservers = null;\n observers.push(subscriber);\n return new Subscription(() => {\n this.currentObservers = null;\n arrRemove(observers, subscriber);\n });\n }\n\n /** @internal */\n protected _checkFinalizedStatuses(subscriber: Subscriber) {\n const { hasError, thrownError, isStopped } = this;\n if (hasError) {\n subscriber.error(thrownError);\n } else if (isStopped) {\n subscriber.complete();\n }\n }\n\n /**\n * Creates a new Observable with this Subject as the source. You can do this\n * to create custom Observer-side logic of the Subject and conceal it from\n * code that uses the Observable.\n * @return {Observable} Observable that the Subject casts to\n */\n asObservable(): Observable {\n const observable: any = new Observable();\n observable.source = this;\n return observable;\n }\n}\n\n/**\n * @class AnonymousSubject\n */\nexport class AnonymousSubject extends Subject {\n constructor(\n /** @deprecated Internal implementation detail, do not use directly. Will be made internal in v8. */\n public destination?: Observer,\n source?: Observable\n ) {\n super();\n this.source = source;\n }\n\n next(value: T) {\n this.destination?.next?.(value);\n }\n\n error(err: any) {\n this.destination?.error?.(err);\n }\n\n complete() {\n this.destination?.complete?.();\n }\n\n /** @internal */\n protected _subscribe(subscriber: Subscriber): Subscription {\n return this.source?.subscribe(subscriber) ?? EMPTY_SUBSCRIPTION;\n }\n}\n", "import { TimestampProvider } from '../types';\n\ninterface DateTimestampProvider extends TimestampProvider {\n delegate: TimestampProvider | undefined;\n}\n\nexport const dateTimestampProvider: DateTimestampProvider = {\n now() {\n // Use the variable rather than `this` so that the function can be called\n // without being bound to the provider.\n return (dateTimestampProvider.delegate || Date).now();\n },\n delegate: undefined,\n};\n", "import { Subject } from './Subject';\nimport { TimestampProvider } from './types';\nimport { Subscriber } from './Subscriber';\nimport { Subscription } from './Subscription';\nimport { dateTimestampProvider } from './scheduler/dateTimestampProvider';\n\n/**\n * A variant of {@link Subject} that \"replays\" old values to new subscribers by emitting them when they first subscribe.\n *\n * `ReplaySubject` has an internal buffer that will store a specified number of values that it has observed. Like `Subject`,\n * `ReplaySubject` \"observes\" values by having them passed to its `next` method. When it observes a value, it will store that\n * value for a time determined by the configuration of the `ReplaySubject`, as passed to its constructor.\n *\n * When a new subscriber subscribes to the `ReplaySubject` instance, it will synchronously emit all values in its buffer in\n * a First-In-First-Out (FIFO) manner. The `ReplaySubject` will also complete, if it has observed completion; and it will\n * error if it has observed an error.\n *\n * There are two main configuration items to be concerned with:\n *\n * 1. `bufferSize` - This will determine how many items are stored in the buffer, defaults to infinite.\n * 2. `windowTime` - The amount of time to hold a value in the buffer before removing it from the buffer.\n *\n * Both configurations may exist simultaneously. So if you would like to buffer a maximum of 3 values, as long as the values\n * are less than 2 seconds old, you could do so with a `new ReplaySubject(3, 2000)`.\n *\n * ### Differences with BehaviorSubject\n *\n * `BehaviorSubject` is similar to `new ReplaySubject(1)`, with a couple of exceptions:\n *\n * 1. `BehaviorSubject` comes \"primed\" with a single value upon construction.\n * 2. `ReplaySubject` will replay values, even after observing an error, where `BehaviorSubject` will not.\n *\n * @see {@link Subject}\n * @see {@link BehaviorSubject}\n * @see {@link shareReplay}\n */\nexport class ReplaySubject extends Subject {\n private _buffer: (T | number)[] = [];\n private _infiniteTimeWindow = true;\n\n /**\n * @param bufferSize The size of the buffer to replay on subscription\n * @param windowTime The amount of time the buffered items will stay buffered\n * @param timestampProvider An object with a `now()` method that provides the current timestamp. This is used to\n * calculate the amount of time something has been buffered.\n */\n constructor(\n private _bufferSize = Infinity,\n private _windowTime = Infinity,\n private _timestampProvider: TimestampProvider = dateTimestampProvider\n ) {\n super();\n this._infiniteTimeWindow = _windowTime === Infinity;\n this._bufferSize = Math.max(1, _bufferSize);\n this._windowTime = Math.max(1, _windowTime);\n }\n\n next(value: T): void {\n const { isStopped, _buffer, _infiniteTimeWindow, _timestampProvider, _windowTime } = this;\n if (!isStopped) {\n _buffer.push(value);\n !_infiniteTimeWindow && _buffer.push(_timestampProvider.now() + _windowTime);\n }\n this._trimBuffer();\n super.next(value);\n }\n\n /** @internal */\n protected _subscribe(subscriber: Subscriber): Subscription {\n this._throwIfClosed();\n this._trimBuffer();\n\n const subscription = this._innerSubscribe(subscriber);\n\n const { _infiniteTimeWindow, _buffer } = this;\n // We use a copy here, so reentrant code does not mutate our array while we're\n // emitting it to a new subscriber.\n const copy = _buffer.slice();\n for (let i = 0; i < copy.length && !subscriber.closed; i += _infiniteTimeWindow ? 1 : 2) {\n subscriber.next(copy[i] as T);\n }\n\n this._checkFinalizedStatuses(subscriber);\n\n return subscription;\n }\n\n private _trimBuffer() {\n const { _bufferSize, _timestampProvider, _buffer, _infiniteTimeWindow } = this;\n // If we don't have an infinite buffer size, and we're over the length,\n // use splice to truncate the old buffer values off. Note that we have to\n // double the size for instances where we're not using an infinite time window\n // because we're storing the values and the timestamps in the same array.\n const adjustedBufferSize = (_infiniteTimeWindow ? 1 : 2) * _bufferSize;\n _bufferSize < Infinity && adjustedBufferSize < _buffer.length && _buffer.splice(0, _buffer.length - adjustedBufferSize);\n\n // Now, if we're not in an infinite time window, remove all values where the time is\n // older than what is allowed.\n if (!_infiniteTimeWindow) {\n const now = _timestampProvider.now();\n let last = 0;\n // Search the array for the first timestamp that isn't expired and\n // truncate the buffer up to that point.\n for (let i = 1; i < _buffer.length && (_buffer[i] as number) <= now; i += 2) {\n last = i;\n }\n last && _buffer.splice(0, last + 1);\n }\n }\n}\n", "import { Scheduler } from '../Scheduler';\nimport { Subscription } from '../Subscription';\nimport { SchedulerAction } from '../types';\n\n/**\n * A unit of work to be executed in a `scheduler`. An action is typically\n * created from within a {@link SchedulerLike} and an RxJS user does not need to concern\n * themselves about creating and manipulating an Action.\n *\n * ```ts\n * class Action extends Subscription {\n * new (scheduler: Scheduler, work: (state?: T) => void);\n * schedule(state?: T, delay: number = 0): Subscription;\n * }\n * ```\n *\n * @class Action\n */\nexport class Action extends Subscription {\n constructor(scheduler: Scheduler, work: (this: SchedulerAction, state?: T) => void) {\n super();\n }\n /**\n * Schedules this action on its parent {@link SchedulerLike} for execution. May be passed\n * some context object, `state`. May happen at some point in the future,\n * according to the `delay` parameter, if specified.\n * @param {T} [state] Some contextual data that the `work` function uses when\n * called by the Scheduler.\n * @param {number} [delay] Time to wait before executing the work, where the\n * time unit is implicit and defined by the Scheduler.\n * @return {void}\n */\n public schedule(state?: T, delay: number = 0): Subscription {\n return this;\n }\n}\n", "import type { TimerHandle } from './timerHandle';\ntype SetIntervalFunction = (handler: () => void, timeout?: number, ...args: any[]) => TimerHandle;\ntype ClearIntervalFunction = (handle: TimerHandle) => void;\n\ninterface IntervalProvider {\n setInterval: SetIntervalFunction;\n clearInterval: ClearIntervalFunction;\n delegate:\n | {\n setInterval: SetIntervalFunction;\n clearInterval: ClearIntervalFunction;\n }\n | undefined;\n}\n\nexport const intervalProvider: IntervalProvider = {\n // When accessing the delegate, use the variable rather than `this` so that\n // the functions can be called without being bound to the provider.\n setInterval(handler: () => void, timeout?: number, ...args) {\n const { delegate } = intervalProvider;\n if (delegate?.setInterval) {\n return delegate.setInterval(handler, timeout, ...args);\n }\n return setInterval(handler, timeout, ...args);\n },\n clearInterval(handle) {\n const { delegate } = intervalProvider;\n return (delegate?.clearInterval || clearInterval)(handle as any);\n },\n delegate: undefined,\n};\n", "import { Action } from './Action';\nimport { SchedulerAction } from '../types';\nimport { Subscription } from '../Subscription';\nimport { AsyncScheduler } from './AsyncScheduler';\nimport { intervalProvider } from './intervalProvider';\nimport { arrRemove } from '../util/arrRemove';\nimport { TimerHandle } from './timerHandle';\n\nexport class AsyncAction extends Action {\n public id: TimerHandle | undefined;\n public state?: T;\n // @ts-ignore: Property has no initializer and is not definitely assigned\n public delay: number;\n protected pending: boolean = false;\n\n constructor(protected scheduler: AsyncScheduler, protected work: (this: SchedulerAction, state?: T) => void) {\n super(scheduler, work);\n }\n\n public schedule(state?: T, delay: number = 0): Subscription {\n if (this.closed) {\n return this;\n }\n\n // Always replace the current state with the new state.\n this.state = state;\n\n const id = this.id;\n const scheduler = this.scheduler;\n\n //\n // Important implementation note:\n //\n // Actions only execute once by default, unless rescheduled from within the\n // scheduled callback. This allows us to implement single and repeat\n // actions via the same code path, without adding API surface area, as well\n // as mimic traditional recursion but across asynchronous boundaries.\n //\n // However, JS runtimes and timers distinguish between intervals achieved by\n // serial `setTimeout` calls vs. a single `setInterval` call. An interval of\n // serial `setTimeout` calls can be individually delayed, which delays\n // scheduling the next `setTimeout`, and so on. `setInterval` attempts to\n // guarantee the interval callback will be invoked more precisely to the\n // interval period, regardless of load.\n //\n // Therefore, we use `setInterval` to schedule single and repeat actions.\n // If the action reschedules itself with the same delay, the interval is not\n // canceled. If the action doesn't reschedule, or reschedules with a\n // different delay, the interval will be canceled after scheduled callback\n // execution.\n //\n if (id != null) {\n this.id = this.recycleAsyncId(scheduler, id, delay);\n }\n\n // Set the pending flag indicating that this action has been scheduled, or\n // has recursively rescheduled itself.\n this.pending = true;\n\n this.delay = delay;\n // If this action has already an async Id, don't request a new one.\n this.id = this.id ?? this.requestAsyncId(scheduler, this.id, delay);\n\n return this;\n }\n\n protected requestAsyncId(scheduler: AsyncScheduler, _id?: TimerHandle, delay: number = 0): TimerHandle {\n return intervalProvider.setInterval(scheduler.flush.bind(scheduler, this), delay);\n }\n\n protected recycleAsyncId(_scheduler: AsyncScheduler, id?: TimerHandle, delay: number | null = 0): TimerHandle | undefined {\n // If this action is rescheduled with the same delay time, don't clear the interval id.\n if (delay != null && this.delay === delay && this.pending === false) {\n return id;\n }\n // Otherwise, if the action's delay time is different from the current delay,\n // or the action has been rescheduled before it's executed, clear the interval id\n if (id != null) {\n intervalProvider.clearInterval(id);\n }\n\n return undefined;\n }\n\n /**\n * Immediately executes this action and the `work` it contains.\n * @return {any}\n */\n public execute(state: T, delay: number): any {\n if (this.closed) {\n return new Error('executing a cancelled action');\n }\n\n this.pending = false;\n const error = this._execute(state, delay);\n if (error) {\n return error;\n } else if (this.pending === false && this.id != null) {\n // Dequeue if the action didn't reschedule itself. Don't call\n // unsubscribe(), because the action could reschedule later.\n // For example:\n // ```\n // scheduler.schedule(function doWork(counter) {\n // /* ... I'm a busy worker bee ... */\n // var originalAction = this;\n // /* wait 100ms before rescheduling the action */\n // setTimeout(function () {\n // originalAction.schedule(counter + 1);\n // }, 100);\n // }, 1000);\n // ```\n this.id = this.recycleAsyncId(this.scheduler, this.id, null);\n }\n }\n\n protected _execute(state: T, _delay: number): any {\n let errored: boolean = false;\n let errorValue: any;\n try {\n this.work(state);\n } catch (e) {\n errored = true;\n // HACK: Since code elsewhere is relying on the \"truthiness\" of the\n // return here, we can't have it return \"\" or 0 or false.\n // TODO: Clean this up when we refactor schedulers mid-version-8 or so.\n errorValue = e ? e : new Error('Scheduled action threw falsy error');\n }\n if (errored) {\n this.unsubscribe();\n return errorValue;\n }\n }\n\n unsubscribe() {\n if (!this.closed) {\n const { id, scheduler } = this;\n const { actions } = scheduler;\n\n this.work = this.state = this.scheduler = null!;\n this.pending = false;\n\n arrRemove(actions, this);\n if (id != null) {\n this.id = this.recycleAsyncId(scheduler, id, null);\n }\n\n this.delay = null!;\n super.unsubscribe();\n }\n }\n}\n", "import { Action } from './scheduler/Action';\nimport { Subscription } from './Subscription';\nimport { SchedulerLike, SchedulerAction } from './types';\nimport { dateTimestampProvider } from './scheduler/dateTimestampProvider';\n\n/**\n * An execution context and a data structure to order tasks and schedule their\n * execution. Provides a notion of (potentially virtual) time, through the\n * `now()` getter method.\n *\n * Each unit of work in a Scheduler is called an `Action`.\n *\n * ```ts\n * class Scheduler {\n * now(): number;\n * schedule(work, delay?, state?): Subscription;\n * }\n * ```\n *\n * @class Scheduler\n * @deprecated Scheduler is an internal implementation detail of RxJS, and\n * should not be used directly. Rather, create your own class and implement\n * {@link SchedulerLike}. Will be made internal in v8.\n */\nexport class Scheduler implements SchedulerLike {\n public static now: () => number = dateTimestampProvider.now;\n\n constructor(private schedulerActionCtor: typeof Action, now: () => number = Scheduler.now) {\n this.now = now;\n }\n\n /**\n * A getter method that returns a number representing the current time\n * (at the time this function was called) according to the scheduler's own\n * internal clock.\n * @return {number} A number that represents the current time. May or may not\n * have a relation to wall-clock time. May or may not refer to a time unit\n * (e.g. milliseconds).\n */\n public now: () => number;\n\n /**\n * Schedules a function, `work`, for execution. May happen at some point in\n * the future, according to the `delay` parameter, if specified. May be passed\n * some context object, `state`, which will be passed to the `work` function.\n *\n * The given arguments will be processed an stored as an Action object in a\n * queue of actions.\n *\n * @param {function(state: ?T): ?Subscription} work A function representing a\n * task, or some unit of work to be executed by the Scheduler.\n * @param {number} [delay] Time to wait before executing the work, where the\n * time unit is implicit and defined by the Scheduler itself.\n * @param {T} [state] Some contextual data that the `work` function uses when\n * called by the Scheduler.\n * @return {Subscription} A subscription in order to be able to unsubscribe\n * the scheduled work.\n */\n public schedule(work: (this: SchedulerAction, state?: T) => void, delay: number = 0, state?: T): Subscription {\n return new this.schedulerActionCtor(this, work).schedule(state, delay);\n }\n}\n", "import { Scheduler } from '../Scheduler';\nimport { Action } from './Action';\nimport { AsyncAction } from './AsyncAction';\nimport { TimerHandle } from './timerHandle';\n\nexport class AsyncScheduler extends Scheduler {\n public actions: Array> = [];\n /**\n * A flag to indicate whether the Scheduler is currently executing a batch of\n * queued actions.\n * @type {boolean}\n * @internal\n */\n public _active: boolean = false;\n /**\n * An internal ID used to track the latest asynchronous task such as those\n * coming from `setTimeout`, `setInterval`, `requestAnimationFrame`, and\n * others.\n * @type {any}\n * @internal\n */\n public _scheduled: TimerHandle | undefined;\n\n constructor(SchedulerAction: typeof Action, now: () => number = Scheduler.now) {\n super(SchedulerAction, now);\n }\n\n public flush(action: AsyncAction): void {\n const { actions } = this;\n\n if (this._active) {\n actions.push(action);\n return;\n }\n\n let error: any;\n this._active = true;\n\n do {\n if ((error = action.execute(action.state, action.delay))) {\n break;\n }\n } while ((action = actions.shift()!)); // exhaust the scheduler queue\n\n this._active = false;\n\n if (error) {\n while ((action = actions.shift()!)) {\n action.unsubscribe();\n }\n throw error;\n }\n }\n}\n", "import { AsyncAction } from './AsyncAction';\nimport { AsyncScheduler } from './AsyncScheduler';\n\n/**\n *\n * Async Scheduler\n *\n * Schedule task as if you used setTimeout(task, duration)\n *\n * `async` scheduler schedules tasks asynchronously, by putting them on the JavaScript\n * event loop queue. It is best used to delay tasks in time or to schedule tasks repeating\n * in intervals.\n *\n * If you just want to \"defer\" task, that is to perform it right after currently\n * executing synchronous code ends (commonly achieved by `setTimeout(deferredTask, 0)`),\n * better choice will be the {@link asapScheduler} scheduler.\n *\n * ## Examples\n * Use async scheduler to delay task\n * ```ts\n * import { asyncScheduler } from 'rxjs';\n *\n * const task = () => console.log('it works!');\n *\n * asyncScheduler.schedule(task, 2000);\n *\n * // After 2 seconds logs:\n * // \"it works!\"\n * ```\n *\n * Use async scheduler to repeat task in intervals\n * ```ts\n * import { asyncScheduler } from 'rxjs';\n *\n * function task(state) {\n * console.log(state);\n * this.schedule(state + 1, 1000); // `this` references currently executing Action,\n * // which we reschedule with new state and delay\n * }\n *\n * asyncScheduler.schedule(task, 3000, 0);\n *\n * // Logs:\n * // 0 after 3s\n * // 1 after 4s\n * // 2 after 5s\n * // 3 after 6s\n * ```\n */\n\nexport const asyncScheduler = new AsyncScheduler(AsyncAction);\n\n/**\n * @deprecated Renamed to {@link asyncScheduler}. Will be removed in v8.\n */\nexport const async = asyncScheduler;\n", "import { AsyncAction } from './AsyncAction';\nimport { AnimationFrameScheduler } from './AnimationFrameScheduler';\nimport { SchedulerAction } from '../types';\nimport { animationFrameProvider } from './animationFrameProvider';\nimport { TimerHandle } from './timerHandle';\n\nexport class AnimationFrameAction extends AsyncAction {\n constructor(protected scheduler: AnimationFrameScheduler, protected work: (this: SchedulerAction, state?: T) => void) {\n super(scheduler, work);\n }\n\n protected requestAsyncId(scheduler: AnimationFrameScheduler, id?: TimerHandle, delay: number = 0): TimerHandle {\n // If delay is greater than 0, request as an async action.\n if (delay !== null && delay > 0) {\n return super.requestAsyncId(scheduler, id, delay);\n }\n // Push the action to the end of the scheduler queue.\n scheduler.actions.push(this);\n // If an animation frame has already been requested, don't request another\n // one. If an animation frame hasn't been requested yet, request one. Return\n // the current animation frame request id.\n return scheduler._scheduled || (scheduler._scheduled = animationFrameProvider.requestAnimationFrame(() => scheduler.flush(undefined)));\n }\n\n protected recycleAsyncId(scheduler: AnimationFrameScheduler, id?: TimerHandle, delay: number = 0): TimerHandle | undefined {\n // If delay exists and is greater than 0, or if the delay is null (the\n // action wasn't rescheduled) but was originally scheduled as an async\n // action, then recycle as an async action.\n if (delay != null ? delay > 0 : this.delay > 0) {\n return super.recycleAsyncId(scheduler, id, delay);\n }\n // If the scheduler queue has no remaining actions with the same async id,\n // cancel the requested animation frame and set the scheduled flag to\n // undefined so the next AnimationFrameAction will request its own.\n const { actions } = scheduler;\n if (id != null && actions[actions.length - 1]?.id !== id) {\n animationFrameProvider.cancelAnimationFrame(id as number);\n scheduler._scheduled = undefined;\n }\n // Return undefined so the action knows to request a new async id if it's rescheduled.\n return undefined;\n }\n}\n", "import { AsyncAction } from './AsyncAction';\nimport { AsyncScheduler } from './AsyncScheduler';\n\nexport class AnimationFrameScheduler extends AsyncScheduler {\n public flush(action?: AsyncAction): void {\n this._active = true;\n // The async id that effects a call to flush is stored in _scheduled.\n // Before executing an action, it's necessary to check the action's async\n // id to determine whether it's supposed to be executed in the current\n // flush.\n // Previous implementations of this method used a count to determine this,\n // but that was unsound, as actions that are unsubscribed - i.e. cancelled -\n // are removed from the actions array and that can shift actions that are\n // scheduled to be executed in a subsequent flush into positions at which\n // they are executed within the current flush.\n const flushId = this._scheduled;\n this._scheduled = undefined;\n\n const { actions } = this;\n let error: any;\n action = action || actions.shift()!;\n\n do {\n if ((error = action.execute(action.state, action.delay))) {\n break;\n }\n } while ((action = actions[0]) && action.id === flushId && actions.shift());\n\n this._active = false;\n\n if (error) {\n while ((action = actions[0]) && action.id === flushId && actions.shift()) {\n action.unsubscribe();\n }\n throw error;\n }\n }\n}\n", "import { AnimationFrameAction } from './AnimationFrameAction';\nimport { AnimationFrameScheduler } from './AnimationFrameScheduler';\n\n/**\n *\n * Animation Frame Scheduler\n *\n * Perform task when `window.requestAnimationFrame` would fire\n *\n * When `animationFrame` scheduler is used with delay, it will fall back to {@link asyncScheduler} scheduler\n * behaviour.\n *\n * Without delay, `animationFrame` scheduler can be used to create smooth browser animations.\n * It makes sure scheduled task will happen just before next browser content repaint,\n * thus performing animations as efficiently as possible.\n *\n * ## Example\n * Schedule div height animation\n * ```ts\n * // html:
\n * import { animationFrameScheduler } from 'rxjs';\n *\n * const div = document.querySelector('div');\n *\n * animationFrameScheduler.schedule(function(height) {\n * div.style.height = height + \"px\";\n *\n * this.schedule(height + 1); // `this` references currently executing Action,\n * // which we reschedule with new state\n * }, 0, 0);\n *\n * // You will see a div element growing in height\n * ```\n */\n\nexport const animationFrameScheduler = new AnimationFrameScheduler(AnimationFrameAction);\n\n/**\n * @deprecated Renamed to {@link animationFrameScheduler}. Will be removed in v8.\n */\nexport const animationFrame = animationFrameScheduler;\n", "import { Observable } from '../Observable';\nimport { SchedulerLike } from '../types';\n\n/**\n * A simple Observable that emits no items to the Observer and immediately\n * emits a complete notification.\n *\n * Just emits 'complete', and nothing else.\n *\n * ![](empty.png)\n *\n * A simple Observable that only emits the complete notification. It can be used\n * for composing with other Observables, such as in a {@link mergeMap}.\n *\n * ## Examples\n *\n * Log complete notification\n *\n * ```ts\n * import { EMPTY } from 'rxjs';\n *\n * EMPTY.subscribe({\n * next: () => console.log('Next'),\n * complete: () => console.log('Complete!')\n * });\n *\n * // Outputs\n * // Complete!\n * ```\n *\n * Emit the number 7, then complete\n *\n * ```ts\n * import { EMPTY, startWith } from 'rxjs';\n *\n * const result = EMPTY.pipe(startWith(7));\n * result.subscribe(x => console.log(x));\n *\n * // Outputs\n * // 7\n * ```\n *\n * Map and flatten only odd numbers to the sequence `'a'`, `'b'`, `'c'`\n *\n * ```ts\n * import { interval, mergeMap, of, EMPTY } from 'rxjs';\n *\n * const interval$ = interval(1000);\n * const result = interval$.pipe(\n * mergeMap(x => x % 2 === 1 ? of('a', 'b', 'c') : EMPTY),\n * );\n * result.subscribe(x => console.log(x));\n *\n * // Results in the following to the console:\n * // x is equal to the count on the interval, e.g. (0, 1, 2, 3, ...)\n * // x will occur every 1000ms\n * // if x % 2 is equal to 1, print a, b, c (each on its own)\n * // if x % 2 is not equal to 1, nothing will be output\n * ```\n *\n * @see {@link Observable}\n * @see {@link NEVER}\n * @see {@link of}\n * @see {@link throwError}\n */\nexport const EMPTY = new Observable((subscriber) => subscriber.complete());\n\n/**\n * @param scheduler A {@link SchedulerLike} to use for scheduling\n * the emission of the complete notification.\n * @deprecated Replaced with the {@link EMPTY} constant or {@link scheduled} (e.g. `scheduled([], scheduler)`). Will be removed in v8.\n */\nexport function empty(scheduler?: SchedulerLike) {\n return scheduler ? emptyScheduled(scheduler) : EMPTY;\n}\n\nfunction emptyScheduled(scheduler: SchedulerLike) {\n return new Observable((subscriber) => scheduler.schedule(() => subscriber.complete()));\n}\n", "import { SchedulerLike } from '../types';\nimport { isFunction } from './isFunction';\n\nexport function isScheduler(value: any): value is SchedulerLike {\n return value && isFunction(value.schedule);\n}\n", "import { SchedulerLike } from '../types';\nimport { isFunction } from './isFunction';\nimport { isScheduler } from './isScheduler';\n\nfunction last(arr: T[]): T | undefined {\n return arr[arr.length - 1];\n}\n\nexport function popResultSelector(args: any[]): ((...args: unknown[]) => unknown) | undefined {\n return isFunction(last(args)) ? args.pop() : undefined;\n}\n\nexport function popScheduler(args: any[]): SchedulerLike | undefined {\n return isScheduler(last(args)) ? args.pop() : undefined;\n}\n\nexport function popNumber(args: any[], defaultValue: number): number {\n return typeof last(args) === 'number' ? args.pop()! : defaultValue;\n}\n", "export const isArrayLike = ((x: any): x is ArrayLike => x && typeof x.length === 'number' && typeof x !== 'function');", "import { isFunction } from \"./isFunction\";\n\n/**\n * Tests to see if the object is \"thennable\".\n * @param value the object to test\n */\nexport function isPromise(value: any): value is PromiseLike {\n return isFunction(value?.then);\n}\n", "import { InteropObservable } from '../types';\nimport { observable as Symbol_observable } from '../symbol/observable';\nimport { isFunction } from './isFunction';\n\n/** Identifies an input as being Observable (but not necessary an Rx Observable) */\nexport function isInteropObservable(input: any): input is InteropObservable {\n return isFunction(input[Symbol_observable]);\n}\n", "import { isFunction } from './isFunction';\n\nexport function isAsyncIterable(obj: any): obj is AsyncIterable {\n return Symbol.asyncIterator && isFunction(obj?.[Symbol.asyncIterator]);\n}\n", "/**\n * Creates the TypeError to throw if an invalid object is passed to `from` or `scheduled`.\n * @param input The object that was passed.\n */\nexport function createInvalidObservableTypeError(input: any) {\n // TODO: We should create error codes that can be looked up, so this can be less verbose.\n return new TypeError(\n `You provided ${\n input !== null && typeof input === 'object' ? 'an invalid object' : `'${input}'`\n } where a stream was expected. You can provide an Observable, Promise, ReadableStream, Array, AsyncIterable, or Iterable.`\n );\n}\n", "export function getSymbolIterator(): symbol {\n if (typeof Symbol !== 'function' || !Symbol.iterator) {\n return '@@iterator' as any;\n }\n\n return Symbol.iterator;\n}\n\nexport const iterator = getSymbolIterator();\n", "import { iterator as Symbol_iterator } from '../symbol/iterator';\nimport { isFunction } from './isFunction';\n\n/** Identifies an input as being an Iterable */\nexport function isIterable(input: any): input is Iterable {\n return isFunction(input?.[Symbol_iterator]);\n}\n", "import { ReadableStreamLike } from '../types';\nimport { isFunction } from './isFunction';\n\nexport async function* readableStreamLikeToAsyncGenerator(readableStream: ReadableStreamLike): AsyncGenerator {\n const reader = readableStream.getReader();\n try {\n while (true) {\n const { value, done } = await reader.read();\n if (done) {\n return;\n }\n yield value!;\n }\n } finally {\n reader.releaseLock();\n }\n}\n\nexport function isReadableStreamLike(obj: any): obj is ReadableStreamLike {\n // We don't want to use instanceof checks because they would return\n // false for instances from another Realm, like an