27765193716

Committed 18 Jun 2026 02:04PM UTC coverage: 0.0% (-89.1%) from 89.085%

Build # 27765193716

Build Type

push

github

Committed by

amarrerod

Commit Message

Fixes coveralls action

Coverage Stats

0 of 2254 relevant lines covered (0.0%)

0.0 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

0.0

/digneapy/operators/selection/binary.py

#!/usr/bin/env python
# -*-coding:utf-8 -*-
"""
@File    :   binary.py
@Time    :   2026/05/21 15:17:30
@Author  :   Alejandro Marrero (amarrerd@ull.edu.es)
@Version :   1.0
@Contact :   amarrerd@ull.edu.es
@License :   (C)Copyright 2026, Alejandro Marrero
@Desc    :   None
"""

from collections.abc import Sequence
from operator import attrgetter
from typing import Optional

import numpy as np

from digneapy.typing import IndType

from ._base_selection import Selection


class BinarySelection(Selection):
    def __init__(
        self, attr: str = "fitness", seed: Optional[int | np.random.SeedSequence] = None
    ):
        super().__init__(seed)
        self._attr = attr

    def __call__(
        self,
        population: Sequence[IndType] | np.ndarray,
    ) -> IndType:
        """Binary Tournament Selection Operator

        Args:
            population (Sequence): Population of individuals to select a parent from

        Raises:
            RuntimeError: If the population is empty

        Returns:
            Instance or Solution: New parent
        """
        if not population:
            msg = "Trying to selection individuals in an empty population."
            raise ValueError(msg)
        elif len(population) == 1:
            return population[0]
        else:
            idx1, idx2 = self._rng.integers(low=0, high=len(population), size=2)
            return max(population[idx1], population[idx2], key=attrgetter(self._attr))

1	#!/usr/bin/env python
2	# --coding:utf-8 --
3	"""
4	@File : binary.py
5	@Time : 2026/05/21 15:17:30
6	@Author : Alejandro Marrero (amarrerd@ull.edu.es)
7	@Version : 1.0
8	@Contact : amarrerd@ull.edu.es
9	@License : (C)Copyright 2026, Alejandro Marrero
10	@Desc : None
11	"""
12
13	from collections.abc import Sequence	×
14	from operator import attrgetter	×
15	from typing import Optional	×
16
17	import numpy as np	×
18
19	from digneapy.typing import IndType	×
20
21	from ._base_selection import Selection	×
22
23
24	class BinarySelection(Selection):	×
25	def __init__(	×
26	self, attr: str = "fitness", seed: Optional[int \| np.random.SeedSequence] = None
27	):
28	super().__init__(seed)	×
29	self._attr = attr	×
30
31	def __call__(	×
32	self,
33	population: Sequence[IndType] \| np.ndarray,
34	) -> IndType:
35	"""Binary Tournament Selection Operator
36
37	Args:
38	population (Sequence): Population of individuals to select a parent from
39
40	Raises:
41	RuntimeError: If the population is empty
42
43	Returns:
44	Instance or Solution: New parent
45	"""
46	if not population:	×
47	msg = "Trying to selection individuals in an empty population."	×
48	raise ValueError(msg)	×
49	elif len(population) == 1:	×
50	return population[0]	×
51	else:
52	idx1, idx2 = self._rng.integers(low=0, high=len(population), size=2)	×
53	return max(population[idx1], population[idx2], key=attrgetter(self._attr))	×

DIGNEA / DIGNEApy / 27765193716

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous