Skip to content
GitLab
Menu
Projects
Groups
Snippets
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
Menu
Open sidebar
ift
NIFTy
Commits
a59d90da
Commit
a59d90da
authored
Oct 25, 2016
by
Jait Dixit
Browse files
Fix issue
#61
parent
72fa347b
Changes
2
Hide whitespace changes
Inline
Side-by-side
nifty/minimization/line_searching/line_search.py
View file @
a59d90da
...
...
@@ -7,7 +7,7 @@ from nifty import LineEnergy
class
LineSearch
(
object
,
Loggable
):
"""
Class for finding a step size.
◙
Class for finding a step size.
"""
__metaclass__
=
abc
.
ABCMeta
...
...
nifty/operators/fft_operator/transformations/rg_transforms.py
View file @
a59d90da
...
...
@@ -248,17 +248,15 @@ class FFTW(Transform):
# val must be numpy array or d2o with slicing distributor
###
local_offset_Q
=
False
try
:
local_val
=
val
.
get_local_data
(
copy
=
False
)
if
axes
is
None
or
0
in
axes
:
local_offset_Q
=
val
.
distributor
.
local_shape
[
0
]
%
2
except
(
AttributeError
):
local_val
=
val
current_info
=
self
.
_get_transform_info
(
self
.
domain
,
self
.
codomain
,
local_shape
=
local_val
.
shape
,
local_offset_Q
=
local_offset_Q
,
local_offset_Q
=
False
,
is_local
=
True
,
**
kwargs
)
...
...
@@ -309,14 +307,10 @@ class FFTW(Transform):
def
_mpi_transform
(
self
,
val
,
axes
,
**
kwargs
):
if
axes
is
None
or
0
in
axes
:
local_offset_list
=
np
.
cumsum
(
np
.
concatenate
([[
0
,
],
val
.
distributor
.
all_local_slices
[:,
2
]])
)
local_offset_Q
=
bool
(
local_offset_list
[
val
.
distributor
.
comm
.
rank
]
%
2
)
else
:
local_offset_Q
=
False
local_offset_list
=
np
.
cumsum
(
np
.
concatenate
([[
0
,
],
val
.
distributor
.
all_local_slices
[:,
2
]])
)
local_offset_Q
=
bool
(
local_offset_list
[
val
.
distributor
.
comm
.
rank
]
%
2
)
return_val
=
val
.
copy_empty
(
global_shape
=
val
.
shape
,
dtype
=
self
.
codomain
.
dtype
)
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment