BridgeHeadFindingRule.java

Go to the documentation of this file.

package denoptim.fragmenter;
 
public class BridgeHeadFindingRule
{
    private String ruleName;
 
    private String smarts;
    
    private int[] bridgeHeadPositions;
    
    private int[] allowedBridgeLength;
    
    private int lengthInAtoms;
 
 
//------------------------------------------------------------------------------
 
    public BridgeHeadFindingRule(String name, String smarts, 
            int[] bridgeHeadPositions, int[] allowedBridgeLength,
            int lengthInAtoms)
    {
        this.ruleName = name;
        this.smarts = smarts;
        this.bridgeHeadPositions = bridgeHeadPositions;
        this.allowedBridgeLength = allowedBridgeLength;
        this.lengthInAtoms = lengthInAtoms;
    }
 
//------------------------------------------------------------------------------
 
    public String getName()
    {
        return ruleName;
    }    
 
//------------------------------------------------------------------------------
    
   public String getSMARTS()
   {
       return smarts;
   }
  
//------------------------------------------------------------------------------
     
    public int[] getBridgeHeadPositions()
    {
        return bridgeHeadPositions;
    }
    
//------------------------------------------------------------------------------
    
   public int[] getAllowedBridgeLength()
   {
       return allowedBridgeLength;
   }
   
 //------------------------------------------------------------------------------
   
  public int[] getAllowedBridgeLength(int maxRingSize)
  {
      if (allowedBridgeLength!=null)
          return allowedBridgeLength;
 
      // Any bridge length is allowed
      int[] anyLength = new int[maxRingSize - lengthInAtoms];
      for (int i=1; i<anyLength.length; i++) {
          anyLength[i-1] = i;
      }
      return anyLength;
  }
   
//------------------------------------------------------------------------------
   
   public int getExistingBridgeLength()
   {
       return lengthInAtoms;
   }
 
//------------------------------------------------------------------------------
 
}