L_RegexCostOptions

Summary

Describes how to approximate the regular expression pattern.

Syntax

typedef struct L_RegexCostOptions 
{ 
   L_UINT StructSize; 
   L_UINT InsertedCost; 
   L_UINT DeletedCost; 
   L_UINT SubstitutedCost; 
   L_UINT MaximumCost; 
   L_UINT MaximumInserts; 
   L_UINT MaximumDeletes; 
   L_UINT MaximumSubstitutes; 
   L_UINT MaximumErrors; 
} L_RegexCostOptions; 

Members

StructSize

Size of this structure in bytes, for versioning. Use the sizeof() operator to calculate this value.

InsertedCost

This is the weight/penalty associated with insertions.

DeletedCost

This is the weight/penalty associated with deletions.

SubstitutedCost

This is the weight/penalty associated with replacements.

MaximumCost

When approximating a pattern against an input, the input can be altered to get a successful match, each operation that alters input has its cost, this field controls the maximum cost allowed .

MaximumInserts

When approximating a pattern against an input, some characters maybe inserted to get a successful match, this field sets the maximum number of insertions.

MaximumDeletes

When approximating a pattern against an input, some characters may get delete to get a successful match, this field sets the maximum number of deletions.

MaximumSubstitutes

When approximating a pattern against an input, some characters may get replaced to get a successful match, this field sets the maximum number of replacements.

MaximumErrors

Maximum allowed number of errors total.

Usage

Help Version 22.0.2022.9.9
Products | Support | Contact Us | Intellectual Property Notices
© 1991-2022 LEAD Technologies, Inc. All Rights Reserved.

LEADTOOLS Raster Imaging C API Help

Products | Support | Contact Us | Intellectual Property Notices
© 1991-2022 LEAD Technologies, Inc. All Rights Reserved.