hyperactive.base_positioner.BasePositioner.move_climb() - Code Metrics - Inspection of "small fixes to monitor search path" - SimonBlanke/Hyperactive - Measure and Improve Code Quality continuously with Scrutinizer

Completed

Push — master ( 1d68af...e525d3 )

by Simon

created 2020-02-15 08:34 UTC

BasePositioner.move_climb() A

↳ Parent: hyperactive.base_positioner

Complexity

Conditions

Size

Total Lines	9
Code Lines	7

Duplication

Lines	0
Ratio	0 %

Importance

Changes

Metric	Value
eloc	7
dl	0
loc	9
rs	10
c	0
b	0
f	0
cc	1
nop	4

# Author: Simon Blanke
# Email: [email protected]
# License: MIT License

import numpy as np


class BasePositioner:
    def __init__(self, *args, **kwargs):
        self._pos_new = None
        self._score_new = -np.inf

        self.pos_current = None
        self.score_current = -np.inf

        self.pos_best = None
        self.score_best = -np.inf

        self.pos_new_list = []
        self.score_new_list = []

    @property
    def pos_new(self):
        return self._pos_new

    @pos_new.setter
    def pos_new(self, value):
        self.pos_new_list.append(value)
        self._pos_new = value

    @property
    def score_new(self):
        return self._score_new

    @score_new.setter
    def score_new(self, value):
        self.score_new_list.append(value)
        self._score_new = value

    def move_climb(self, _cand_, pos, epsilon_mod=1):
        sigma = 3 + _cand_._space_.dim * self.epsilon * epsilon_mod
        pos_normal = self.climb_dist(pos, sigma, pos.shape)
        pos_new_int = np.rint(pos_normal)

        n_zeros = [0] * len(_cand_._space_.dim)
        pos = np.clip(pos_new_int, n_zeros, _cand_._space_.dim)

        return pos.astype(int)

    def move_random(self, _cand_):
        return _cand_._space_.get_random_pos()


1			# Author: Simon Blanke
2			# Email: [email protected]
3			# License: MIT License
4
5			import numpy as np
6
7
8			class BasePositioner:
9			def __init__(self, args, *kwargs):
10			self._pos_new = None
11			self._score_new = -np.inf
12
13			self.pos_current = None
14			self.score_current = -np.inf
15
16			self.pos_best = None
17			self.score_best = -np.inf
18
19			self.pos_new_list = []
20			self.score_new_list = []
21
22			@property
23			def pos_new(self):
24			return self._pos_new
25
26			@pos_new.setter
27			def pos_new(self, value):
28			self.pos_new_list.append(value)
29			self._pos_new = value
30
31			@property
32			def score_new(self):
33			return self._score_new
34
35			@score_new.setter
36			def score_new(self, value):
37			self.score_new_list.append(value)
38			self._score_new = value
39
40			def move_climb(self, _cand_, pos, epsilon_mod=1):
41			sigma = 3 + _cand_._space_.dim * self.epsilon * epsilon_mod
42			pos_normal = self.climb_dist(pos, sigma, pos.shape)
43			pos_new_int = np.rint(pos_normal)
44
45			n_zeros = [0] * len(_cand_._space_.dim)
46			pos = np.clip(pos_new_int, n_zeros, _cand_._space_.dim)
47
48			return pos.astype(int)
49
50			def move_random(self, _cand_):
51			return _cand_._space_.get_random_pos()
52

SimonBlanke / Hyperactive

Push — master ( 1d68af...e525d3 )

BasePositioner.move_climb() A

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like