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
|
/*
* $Id: Atom.i 2519 2013-05-17 03:01:18Z glandrum $
*
* Copyright (c) 2010, Novartis Institutes for BioMedical Research Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following
* disclaimer in the documentation and/or other materials provided
* with the distribution.
* * Neither the name of Novartis Institutes for BioMedical Research Inc.
* nor the names of its contributors may be used to endorse or promote
* products derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
%include "std_string.i"
%include "std_vector.i"
%include "std_map.i"
%include "std_pair.i"
%{
#include <Query/QueryObjects.h>
#include <RDGeneral/types.h>
#include <GraphMol/ROMol.h>
#include <GraphMol/PeriodicTable.h>
#include <GraphMol/SanitException.h>
#include <GraphMol/Atom.h>
#include <GraphMol/ConjugHybrid.cpp>
#include <GraphMol/MolTransforms/MolTransforms.h>
#include <Geometry/point.h>
#include <GraphMol/MolOps.h>
%}
%ignore RDKit::Atom::Match(const Atom *) const;
%template(Bond_Vect) std::vector<RDKit::Bond*>;
%include "enums.swg"
#if swifjava
%javaconst(1);
#endif
%include <GraphMol/Atom.h>
%newobject RDKit::Atom::getProp;
%newobject RDKit::Atom::getBonds;
%extend RDKit::Atom {
std::string getProp(const std::string key){
std::string res;
($self)->getProp(key, res);
return res;
}
/* Methods from ConjugHybrid.cpp */
void markConjAtomBonds() {
RDKit::markConjAtomBonds(($self));
}
int numBondsPlusLonePairs() {
RDKit::numBondsPlusLonePairs(($self));
}
bool atomHasConjugatedBond() {
return RDKit::MolOps::atomHasConjugatedBond(($self));
}
/* From MolTransforms.h */
void transformAtom(RDGeom::Transform3D &tform) {
MolTransforms::transformAtom(($self), tform);
}
/* Based on Python wrappers and unit tests */
bool IsInRing(){
if(!($self)->getOwningMol().getRingInfo()->isInitialized()){
RDKit::MolOps::findSSSR(($self)->getOwningMol());
}
return ($self)->getOwningMol().getRingInfo()->numAtomRings(($self)->getIdx())!=0;
}
bool IsInRingSize(int size){
if(!($self)->getOwningMol().getRingInfo()->isInitialized()){
RDKit::MolOps::findSSSR(($self)->getOwningMol());
}
return ($self)->getOwningMol().getRingInfo()->isAtomInRingOfSize(($self)->getIdx(),size);
}
std::vector<RDKit::Bond*> *getBonds() {
std::vector<RDKit::Bond*> *bonds = new std::vector<RDKit::Bond*>;
RDKit::ROMol *parent = &($self)->getOwningMol();
RDKit::ROMol::OEDGE_ITER begin,end;
boost::tie(begin,end) = parent->getAtomBonds(($self));
while(begin!=end){
RDKit::Bond *tmpB = (*parent)[*begin];
bonds->push_back(tmpB);
begin++;
}
return bonds;
}
}
|