Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
pystencils
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Model registry
Operate
Environments
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Terms and privacy
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Markus Holzer
pystencils
Commits
8e92a559
Commit
8e92a559
authored
1 year ago
by
Christoph Alt
Browse files
Options
Downloads
Plain Diff
Merge branch 'stencil_util' into 'master'
Add adjacent direcitons to stencil module See merge request
!337
parents
2956e326
a3cc3a8d
Branches
Branches containing commit
Tags
release/0.2.14
Tags containing commit
No related merge requests found
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
pystencils/stencil.py
+34
-0
34 additions, 0 deletions
pystencils/stencil.py
pystencils/utils.py
+15
-0
15 additions, 0 deletions
pystencils/utils.py
with
49 additions
and
0 deletions
pystencils/stencil.py
+
34
−
0
View file @
8e92a559
...
...
@@ -5,6 +5,8 @@ from typing import Sequence
import
numpy
as
np
import
sympy
as
sp
from
pystencils.utils
import
binary_numbers
def
inverse_direction
(
direction
):
"""
Returns inverse i.e. negative of given direction tuple
...
...
@@ -293,6 +295,38 @@ def direction_string_to_offset(direction: str, dim: int = 3):
return
offset
[:
dim
]
def
adjacent_directions
(
direction
):
"""
Returns all adjacent directions for a direction as tuple of tuples. This is useful for exmple to find all directions
relevant for neighbour communication.
Args:
direction: tuple representing a direction. For example (0, 1, 0) for the northern side
Examples:
>>>
adjacent_directions
((
0
,
0
,
0
))
((
0
,
0
,
0
),)
>>>
adjacent_directions
((
0
,
1
,
0
))
((
0
,
1
,
0
),)
>>>
adjacent_directions
((
0
,
1
,
1
))
((
0
,
0
,
1
),
(
0
,
1
,
0
),
(
0
,
1
,
1
))
>>>
adjacent_directions
((
-
1
,
-
1
))
((
-
1
,
-
1
),
(
-
1
,
0
),
(
0
,
-
1
))
"""
result
=
set
()
if
all
(
e
==
0
for
e
in
direction
):
result
.
add
(
direction
)
return
tuple
(
result
)
binary_numbers_list
=
binary_numbers
(
len
(
direction
))
for
adjacent_direction
in
binary_numbers_list
:
for
i
,
entry
in
enumerate
(
direction
):
if
entry
==
0
:
adjacent_direction
[
i
]
=
0
if
entry
==
-
1
and
adjacent_direction
[
i
]
==
1
:
adjacent_direction
[
i
]
=
-
1
if
not
all
(
e
==
0
for
e
in
adjacent_direction
):
result
.
add
(
tuple
(
adjacent_direction
))
return
tuple
(
sorted
(
result
))
# -------------------------------------- Visualization -----------------------------------------------------------------
...
...
This diff is collapsed.
Click to expand it.
pystencils/utils.py
+
15
−
0
View file @
8e92a559
...
...
@@ -96,6 +96,21 @@ def boolean_array_bounding_box(boolean_array):
return
bounds
def
binary_numbers
(
n
):
"""
Returns all binary numbers up to 2^n - 1
Example:
>>>
binary_numbers
(
2
)
[[
0
,
0
],
[
0
,
1
],
[
1
,
0
],
[
1
,
1
]]
"""
result
=
list
()
for
i
in
range
(
1
<<
n
):
binary_number
=
bin
(
i
)[
2
:]
binary_number
=
'
0
'
*
(
n
-
len
(
binary_number
))
+
binary_number
result
.
append
((
list
(
map
(
int
,
binary_number
))))
return
result
class
LinearEquationSystem
:
"""
Symbolic linear system of equations - consisting of matrix and right hand side.
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment