Run gofmt on compliance
Test: builds Change-Id: I404b138faac0db9a92201be6163b19d9e6bff810
This commit is contained in:
@@ -51,7 +51,6 @@ var (
|
||||
failNoLicenses = fmt.Errorf("No licenses")
|
||||
)
|
||||
|
||||
|
||||
// byError orders conflicts by error string
|
||||
type byError []compliance.SourceSharePrivacyConflict
|
||||
|
||||
|
@@ -143,7 +143,6 @@ func LicenseConditionSetFromNames(tn *TargetNode, names ...string) LicenseCondit
|
||||
return cs
|
||||
}
|
||||
|
||||
|
||||
// Resolution happens in three phases:
|
||||
//
|
||||
// 1. A bottom-up traversal propagates (restricted) license conditions up to
|
||||
@@ -182,7 +181,6 @@ func LicenseConditionSetFromNames(tn *TargetNode, names ...string) LicenseCondit
|
||||
// Not all restricted licenses are create equal. Some have special rules or
|
||||
// exceptions. e.g. LGPL or "with classpath excption".
|
||||
|
||||
|
||||
// depConditionsPropagatingToTarget returns the conditions which propagate up an
|
||||
// edge from dependency to target.
|
||||
//
|
||||
@@ -270,7 +268,6 @@ func conditionsAttachingAcrossEdge(lg *LicenseGraph, e *TargetEdge, universe Lic
|
||||
return result
|
||||
}
|
||||
|
||||
|
||||
// edgeIsDynamicLink returns true for edges representing shared libraries
|
||||
// linked dynamically at runtime.
|
||||
func edgeIsDynamicLink(e *TargetEdge) bool {
|
||||
|
@@ -65,7 +65,6 @@ func (rs ResolutionSet) AttachesTo() TargetNodeList {
|
||||
return result
|
||||
}
|
||||
|
||||
|
||||
// AttachesToTarget returns true if the set contains conditions that
|
||||
// are `attachedTo`.
|
||||
func (rs ResolutionSet) AttachesToTarget(target *TargetNode) bool {
|
||||
@@ -73,7 +72,6 @@ func (rs ResolutionSet) AttachesToTarget(target *TargetNode) bool {
|
||||
return isPresent
|
||||
}
|
||||
|
||||
|
||||
// Resolutions returns the list of resolutions that `attachedTo`
|
||||
// target must resolve. Returns empty list if no conditions apply.
|
||||
func (rs ResolutionSet) Resolutions(attachesTo *TargetNode) ResolutionList {
|
||||
|
@@ -219,7 +219,6 @@ func (l byEdge) Less(i, j int) bool {
|
||||
return l[i].target < l[j].target
|
||||
}
|
||||
|
||||
|
||||
// annotated describes annotated test data edges to define test graphs.
|
||||
type annotated struct {
|
||||
target, dep string
|
||||
|
Reference in New Issue
Block a user