Skip to content
Projects
Groups
Snippets
Help
This project
Loading...
Sign in / Register
Toggle navigation
L
libcifpp
Overview
Overview
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
open
libcifpp
Commits
c767e89a
Unverified
Commit
c767e89a
authored
Oct 06, 2021
by
Maarten L. Hekkelman
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Fixed symmetry operator table generator
parent
b78a603d
Hide whitespace changes
Inline
Side-by-side
Showing
4 changed files
with
49 additions
and
4 deletions
+49
-4
CMakeLists.txt
+1
-1
changelog
+3
-0
src/SymOpTable_data.hpp
+0
-0
tools/symop-map-generator.cpp
+45
-3
No files found.
CMakeLists.txt
View file @
c767e89a
...
@@ -25,7 +25,7 @@
...
@@ -25,7 +25,7 @@
cmake_minimum_required
(
VERSION 3.16
)
cmake_minimum_required
(
VERSION 3.16
)
# set the project name
# set the project name
project
(
cifpp VERSION 2.0.
0
LANGUAGES CXX
)
project
(
cifpp VERSION 2.0.
1
LANGUAGES CXX
)
list
(
PREPEND CMAKE_MODULE_PATH
"
${
CMAKE_CURRENT_SOURCE_DIR
}
/cmake"
)
list
(
PREPEND CMAKE_MODULE_PATH
"
${
CMAKE_CURRENT_SOURCE_DIR
}
/cmake"
)
...
...
changelog
View file @
c767e89a
Version 2.0.1
- Fixed the generator for the symmetry operator table
Version 2.0.0
Version 2.0.0
- New API interface for accessing query results
- New API interface for accessing query results
- Removed bzip2 support
- Removed bzip2 support
...
...
src/SymOpTable_data.hpp
View file @
c767e89a
This source diff could not be displayed because it is too large. You can
view the blob
instead.
tools/symop-map-generator.cpp
View file @
c767e89a
...
@@ -181,6 +181,50 @@ class SymopParser
...
@@ -181,6 +181,50 @@ class SymopParser
int
m_trn
[
3
][
2
]
=
{};
int
m_trn
[
3
][
2
]
=
{};
};
};
std
::
array
<
int
,
15
>
move_symop
(
std
::
array
<
int
,
15
>
symop
,
const
std
::
array
<
int
,
15
>&
cenop
)
{
for
(
int
i
=
9
;
i
<
15
;
i
+=
2
)
{
if
(
cenop
[
i
]
==
0
)
continue
;
assert
(
cenop
[
i
+
1
]
!=
0
);
if
(
symop
[
i
]
==
0
)
{
assert
(
symop
[
i
+
1
]
==
0
);
symop
[
i
]
=
cenop
[
i
];
symop
[
i
+
1
]
=
cenop
[
i
+
1
];
continue
;
}
if
(
symop
[
i
+
1
]
==
cenop
[
i
+
1
])
symop
[
i
]
+=
cenop
[
i
];
else
{
int
d
=
symop
[
i
+
1
]
*
cenop
[
i
+
1
];
int
n
=
symop
[
i
]
*
cenop
[
i
+
1
]
+
symop
[
i
+
1
]
*
cenop
[
i
];
symop
[
i
]
=
n
;
symop
[
i
+
1
]
=
d
;
}
for
(
int
j
=
5
;
j
>
1
;
--
j
)
if
(
symop
[
i
]
%
j
==
0
and
symop
[
i
+
1
]
%
j
==
0
)
{
symop
[
i
]
/=
j
;
symop
[
i
+
1
]
/=
j
;
}
symop
[
i
]
=
(
symop
[
i
]
+
symop
[
i
+
1
])
%
symop
[
i
+
1
];
if
(
symop
[
i
]
==
0
)
symop
[
i
+
1
]
=
0
;
}
return
symop
;
}
int
main
(
int
argc
,
char
*
const
argv
[])
int
main
(
int
argc
,
char
*
const
argv
[])
{
{
using
namespace
std
::
literals
;
using
namespace
std
::
literals
;
...
@@ -225,7 +269,6 @@ int main(int argc, char* const argv[])
...
@@ -225,7 +269,6 @@ int main(int argc, char* const argv[])
if
(
not
out
.
is_open
())
if
(
not
out
.
is_open
())
throw
std
::
runtime_error
(
"Failed to open output file"
);
throw
std
::
runtime_error
(
"Failed to open output file"
);
// --------------------------------------------------------------------
// --------------------------------------------------------------------
// store symop data here
// store symop data here
...
@@ -311,8 +354,7 @@ int main(int argc, char* const argv[])
...
@@ -311,8 +354,7 @@ int main(int argc, char* const argv[])
{
{
for
(
auto
symop
:
symops
)
for
(
auto
symop
:
symops
)
{
{
for
(
size_t
i
=
9
;
i
<
15
;
++
i
)
symop
=
move_symop
(
symop
,
cenop
);
symop
[
i
]
+=
cenop
[
i
];
data
.
emplace_back
(
cur
.
nr
,
symopnr
,
symop
);
data
.
emplace_back
(
cur
.
nr
,
symopnr
,
symop
);
++
symopnr
;
++
symopnr
;
...
...
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