1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428
|
#!/usr/bin/env python3
#***********************************************************************
# This file is part of OpenMolcas. *
# *
# OpenMolcas is free software; you can redistribute it and/or modify *
# it under the terms of the GNU Lesser General Public License, v. 2.1. *
# OpenMolcas is distributed in the hope that it will be useful, but it *
# is provided "as is" and without any express or implied warranties. *
# For more details see the full text of the license in the file *
# LICENSE or in <http://www.gnu.org/licenses/>. *
# *
# Copyright (C) 2021, Ignacio Fdez. Galván *
#***********************************************************************
# Help script for reformatting a basis set file in Molcas format.
# It writes the numbers in a consistent format and fails if precision
# is lost.
# Use with compact=True and remove_comments=True to facilitate comparison
# between different versions.
import sys
import re
import numpy as np
from decimal import Decimal
# Output formats: (total_places, decimal_places)
# if compact, just use minimal space
compact = False
# format for basis set exponents
exp_form = [20, 8]
# format for basis set coefficients, orbital energies and Fock operator
coe_form = [15, 12]
# format for pseudopotential parameters
pp_form = [14, 8]
# format for "M1" and "M2" parameters
ecpm_form = [15, 12]
# format for "PROJOP" exponents
ecpe_form = [20, 8]
# format for "PROJOP" coefficients and constants
ecpc_form = [15, 12]
# maximum line length
max_line = 180
uncontracted = False
remove_comments = False
insert_comments = False
l_lab = 'spdfghi'
if compact:
exp_form[0] = None
coe_form[0] = None
pp_form[0] = None
ecpm_form[0] = None
ecpe_form[0] = None
ecpc_form[0] = None
# Read next line, ignores (and prints unchanged) comments and empty lines
def nextline(f):
global uncontracted
line = f.readline()
while line and (line.startswith('*') or line.startswith('#') or line.startswith('!') or line.startswith('\n')):
if re.match(r'#Contraction *UNC', line, re.I):
uncontracted = True
if not remove_comments:
print(line.rstrip())
line = f.readline()
if line:
return line.rstrip()
else:
return None
def count_items(parts):
n = 0
for i in parts:
if i.startswith('*'):
break
n += 1
return n
def read_nums(f, n):
nums = []
while len(nums) < n:
line = nextline(f)
nums.extend(line.split())
if nums[-1] == '/':
l = n-len(nums)+1
nums = nums[:-1]+l*['0']
assert(len(nums) == n)
return nums
def print_line(nums, form):
parts = [f' {format_num(i, *form)}' for i in nums]
if max_line is None:
print(''.join(parts))
else:
line = ''
for i in parts:
if len(line) + len(i) > max_line:
print(line)
line = ''
line += i
print(line)
################################################################################
# Set of functions to "pretty print" a number in some reserved space,
# ensuring that no precision is lost.
# Quite hackish and inefficient, but as long as it works...
# Return the "scale" of a number, i.e, the exponent of its leading digit
def scale(num):
if num == 0:
return 0
return num.adjusted()
# Significant places of a number
def sig_places(num):
digits = list(num.as_tuple().digits)
while len(digits) > 1:
if digits[-1] != 0:
break
digits.pop()
return len(digits)
# Try to fit a number in n total places with m decimals.
# Returns a string of asterisks if it fails
def fit_num(f, n, m):
s = sig_places(f)
e = scale(f)
sg = 1 if f < 0 else 0
if (s-e-1 <= m) and (e+1 <= n-m-sg-1):
out = f'{f:{n}.{m}f}'
else:
out = '*'*n
return out
# Try to fit a number in n total places with m decimals, with an exponent (shift)
# Returns a string of asterisks if it fails
def print_shifted(f, n, m, shift=0):
fs = f.scaleb(shift)
if shift == 0:
es = 0
else:
es = np.int(np.floor(np.log10(abs(shift))))+2
if shift > 0:
es += 1
s = sig_places(fs)
if shift == 0:
out = fit_num(fs, n, m)
else:
out = fit_num(fs, n-es, m-es)
out += f'e{-shift}'
if len(out) > n or out[0] == '*':
out = '*'*n
return out
# Simplify a number that may come from an "overprecise" float,
# i.e. round to fewer decimals as long as it represents the same float number
def simplify(f):
out = f
ref = float(f)
s, n, e = f.as_tuple()
m = len(n)
for i in range(m):
a = f.quantize(f.scaleb(i+1))
if float(a) != ref:
break
out = a
if out != f:
print(f'simplify {f} to {out}', file=sys.stderr)
return out
# Regexp to fix exponents from Fortran prints, which may have D instead of E
fortfixexp = re.compile(r'([\d.])[dD]?(((?<=[dD])[+-]?|[+-])\d)')
# Format a number using the minumum necessary space
# (but still using at least one explicit zero before/after decimal point)
def format_minimal(num):
t = num.as_tuple()
d = [i for i in t.digits]
e = t.exponent
# remove trailing zeros
while (len(d) > 1) and d[-1] == 0:
d.pop()
e += 1
# "text" contains all significant digits
text = ''.join([f'{i}' for i in d])
# special case for zero
if text == '0':
return text
# large number, use exponent if large enough
if ((len(d) > 1) and (e > 3)) or (e > 4):
if len(d) == 1:
text += f'.0e{e}'
else:
s = len(d)-1
# prefer fewer digits in exponent
if (e+s > 9) and (e+1 < 10):
s = 9-e
elif (e+s > 99) and (e+1 < 100):
s = 99-e
e_ = e+s
text = text[0:-s] + '.' + text[-s:] + f'e{e_}'
# not too large, not too small, print without exponent
elif e >= 0:
text += e*'0'
elif len(d)+e > 0:
text = text[:e] + '.' + text[e:]
elif ((len(d) > 1) and (-e-len(d) < 3)) or (e > -5):
text = '0.' + (-len(d)-e)*'0' + text
# small number, use exponent
else:
if len(d) == 1:
s = -2
e_ = e
z = '0'
else:
s = len(d)-1
e_ = e+s
z = ''
text = text[0:-s] + '.' + text[-s:] + z + f'e{e_}'
out = '-' if t.sign else ''
out += text
return out
# Format a decimal number in n total places with m decimals, adjusting
# the exponent if necessary.
# If n = None, formats the number with the minimal space needed.
# Raises exception if failed.
def format_num(num, n=None, m=None):
num = fortfixexp.sub(r'\1e\2', num)
f = Decimal(num)
f = simplify(f)
if n is None:
out = format_minimal(f)
else:
out = print_shifted(f, n, m)
# if it doesn't fit without exponent, try shifting until it fits
if out[0] == '*':
e = scale(f)
if e > 0:
for i in range(-e, 0):
out = print_shifted(f, n, m, shift=i)
if out[0] != '*':
break
else:
for i in range(-e, -e+(n-m-1)):
out = print_shifted(f, n, m, shift=i)
if out[0] != '*':
break
if out[0] == '*':
raise Exception(f'Cannot fit number in ({n}.{m}): {num}')
# ensure that the final number represents the same float
if float(num) != float(out):
raise Exception(f'Changed value in ({n}.{m}): {num} -> {out}')
return out
################################################################################
with open(sys.argv[1]) as f:
line = nextline(f)
while line is not None:
if line.startswith('/'):
# basis label
print(line)
parts = line.split('.')
prim = parts[3]
prim = re.sub(r'[spdfghi]', ' ', prim).split()
n_p = len(prim)-1
n_prim = [int(i) for i in prim]
func = parts[4]
func = re.sub(r'[spdfghi]', ' ', func).split()
n_f = [int(i) for i in func]
if uncontracted:
assert(np.all(prim == func))
# two reference lines
line = nextline(f)
print(line)
line = nextline(f)
print(line)
options = ''
line = nextline(f)
elif re.match(r'Options', line, re.I):
# all lines until "EndOptions"
print(line)
line = nextline(f)
while line is not None and not re.match(r'End([ O]|$)', line, re.I):
print(line)
if re.match(r'FockOperator', line, re.I):
options += 'f'
if re.match(r'OrbitalEnergies', line, re.I):
options += 'e'
line = nextline(f)
print(line)
line = nextline(f)
elif re.match(r'Spectral', line, re.I):
# all lines until "End of Spectral"
print(line)
line = nextline(f)
while line is not None and not re.match(r'End([ o]|$)', line, re.I):
print(line)
if re.match(r'Exte', line, re.I):
line = nextline(f)
maxl = int(line)
print(f' {maxl:4d}')
for i in range(maxl+1):
line = nextline(f)
mp, = [int(j) for j in line.split()]
print(f' {mp:4d}')
exps = read_nums(f, mp)
for e in exps:
print(format_num(e, *exp_form))
elif line == 'SOC':
line = nextline(f)
maxl = int(line)
print(f' {maxl:4d}')
for i in range(maxl+1):
line = nextline(f)
mp, mo, md = [int(j) for j in line.split()]
if insert_comments:
print(f'* {l_lab[i]}-type functions')
print(f' {mp:4d} {mo:4d} {md:4d}')
exps = read_nums(f, mp)
for e in exps:
print(format_num(e, *exp_form))
for c in range(mp):
coefs = read_nums(f, mo)
print_line(coefs, coe_form)
line = nextline(f)
print(line)
line = nextline(f)
elif re.match(r'PP', line, re.I):
parts = [i.strip() for i in line.strip(';').split(',')]
parts[0] = 'PP'
parts[1] = parts[1][0].upper() + parts[1][1:].lower()
maxl = int(parts[3])
print(', '.join(parts)+' ;')
for nl in range(maxl+1):
line = nextline(f).split(';')[0]
n = int(line)
print(f'{n:3d} ;')
for m in range(n):
line = nextline(f).strip(';')
parts = line.split(',')
i = int(parts[0])
f1 = parts[1]
f2 = parts[2]
print(f'{i:2d}, {format_num(f1, *pp_form)}, {format_num(f2, *pp_form)} ;')
line = nextline(f)
elif re.match(r'M[12]', line, re.I):
print(line.strip().upper())
line = nextline(f)
n = int(line)
print(f'{n:3d}')
if n > 0:
for i in [1, 2]:
nums = read_nums(f, n)
print_line(nums, ecpm_form)
line = nextline(f)
elif re.match(r'COREREP', line, re.I):
print('COREREP')
line = nextline(f)
print(line)
line = nextline(f)
elif re.match(r'PROJOP', line, re.I):
print('PROJOP')
line = nextline(f)
maxl = int(line)
print(f' {maxl:4d}')
for i in range(maxl+1):
line = nextline(f)
parts = [int(j) for j in line.split()]
mp = parts[0]
mo = parts[1]
occ = parts[2:]
assert(len(occ) <= mo)
if len(occ) == mo:
if all([j == 4*i+2 for j in occ]):
occ = []
print(f' {mp:4d} {mo:4d}' + ''.join([f' {j:4d}' for j in occ]))
coefs = read_nums(f, mo)
print_line(coefs, ecpc_form)
exps = read_nums(f, mp)
for e in exps:
print(format_num(e, *ecpe_form))
for c in range(mp):
coefs = read_nums(f, mo)
print_line(coefs, ecpc_form)
line = nextline(f)
else:
# here go the exponents and coefficients for the basis set
parts = line.split()
Z = float(parts[0])
maxl = n_p
print(f' {Z:5.1f} {maxl:3d}')
line = nextline(f)
for nl in range(maxl+1):
if insert_comments:
print(f'* {l_lab[nl]}-type functions')
parts = line.split()
n_p = int(parts[0])
assert(n_prim[nl] == n_p)
assert(count_items(parts) <= 2)
if count_items(parts) > 1:
assert(n_f[nl] == int(parts[1]))
print(f' {n_p:4d} {n_f[nl]:4d}')
exps = read_nums(f, n_p)
for e in exps:
print(format_num(e, *exp_form))
if not uncontracted:
for c in range(n_p):
coefs = read_nums(f, n_f[nl])
print_line(coefs, coe_form)
line = nextline(f)
if 'f' in options:
n = int(line)
print(f' {n:4d}')
for c in range(n):
coefs = read_nums(f, n)
print_line(coefs, coe_form)
line = nextline(f)
if 'e' in options:
n = int(line)
print(f' {n:4d}')
coefs = read_nums(f, n)
if n:
print_line(coefs, coe_form)
line = nextline(f)
|