d70bbfb5d0
The simple type unification algorithm suffered from some serious performance and memory problems when used with certain code bases. This adds some crucial optimizations that improve performance drastically.
40 lines
1.4 KiB
Go
40 lines
1.4 KiB
Go
// Mgmt
|
|
// Copyright (C) 2013-2019+ James Shubin and the project contributors
|
|
// Written by James Shubin <james@shubin.ca> and the project contributors
|
|
//
|
|
// This program is free software: you can redistribute it and/or modify
|
|
// it under the terms of the GNU General Public License as published by
|
|
// the Free Software Foundation, either version 3 of the License, or
|
|
// (at your option) any later version.
|
|
//
|
|
// This program 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 General Public License for more details.
|
|
//
|
|
// You should have received a copy of the GNU General Public License
|
|
// along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
package interfaces
|
|
|
|
import (
|
|
"fmt"
|
|
|
|
"github.com/purpleidea/mgmt/lang/types"
|
|
)
|
|
|
|
// Invariant represents a constraint that is described by the Expr's and Stmt's,
|
|
// and which is passed into the unification solver to describe what is known
|
|
// by the AST.
|
|
type Invariant interface {
|
|
// TODO: should we add any other methods to this type?
|
|
fmt.Stringer
|
|
|
|
// ExprList returns the list of valid expressions in this invariant.
|
|
ExprList() []Expr
|
|
|
|
// Matches returns whether an invariant matches the existing solution.
|
|
// If it is inconsistent, then it errors.
|
|
Matches(solved map[Expr]*types.Type) (bool, error)
|
|
}
|