⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 util.h

📁 大型并行量子化学软件;支持密度泛函(DFT)。可以进行各种量子化学计算。支持CHARMM并行计算。非常具有应用价值。
💻 H
字号:
//// util.h//// Copyright (C) 1997 Limit Point Systems, Inc.//// Author: Curtis Janssen <cljanss@limitpt.com>// Maintainer: LPS//// This file is part of the SC Toolkit.//// The SC Toolkit is free software; you can redistribute it and/or modify// it under the terms of the GNU Library General Public License as published by// the Free Software Foundation; either version 2, or (at your option)// any later version.//// The SC Toolkit is distributed in the hope that it will be useful,// but WITHOUT ANY WARRANTY; without even the implied warranty of// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the// GNU Library General Public License for more details.//// You should have received a copy of the GNU Library General Public License// along with the SC Toolkit; see the file COPYING.LIB.  If not, write to// the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.//// The U.S. Government is granted a limited license as per AL 91-7.//#ifndef _chemistry_qc_mbpt_util_h#define _chemistry_qc_mbpt_util_h#ifdef __GNUC__#pragma interface#endif#include <util/group/message.h>namespace sc {class BiggestContribs {  private:    int nindex_;    int **indices_;    double *vals_;    int ncontrib_;    int maxcontrib_;  public:    BiggestContribs(int nindex, int maxcontrib);    ~BiggestContribs();    double val(int i) { return vals_[i]; }    int ncontrib() { return ncontrib_; }    const int *indices(int i) { return indices_[i]; }    void insert(double val, const int *);    void insert(double val, int i0, int i1);    void insert(double val, int i0, int i1, int i2, int i3);    void insert(double val, int i0, int i1, int i2, int i3, int i4);    void combine(const Ref<MessageGrp> &grp);};}#endif// Local Variables:// mode: c++// c-file-style: "CLJ"// End:

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -