mirror of
https://github.com/unidoc/unioffice.git
synced 2025-04-25 13:48:53 +08:00

* update license and terms * Fixes * Create ACKNOWLEDGEMENTS.md * Update ACKNOWLEDGEMENTS.md * Revert go.mod changes and remove go1.11 tests
153 lines
4.3 KiB
Go
153 lines
4.3 KiB
Go
// Copyright 2017 FoxyUtils ehf. All rights reserved.
|
|
//
|
|
// Use of this software package and source code is governed by the terms of the
|
|
// UniDoc End User License Agreement (EULA) that is available at:
|
|
// https://unidoc.io/eula/
|
|
// A trial license code for evaluation can be obtained at https://unidoc.io.
|
|
|
|
package common
|
|
|
|
import (
|
|
"fmt"
|
|
"strings"
|
|
|
|
"github.com/unidoc/unioffice"
|
|
"github.com/unidoc/unioffice/schema/soo/pkg/relationships"
|
|
)
|
|
|
|
// Relationships represents a .rels file.
|
|
type Relationships struct {
|
|
x *relationships.Relationships
|
|
}
|
|
|
|
// NewRelationships creates a new relationship wrapper.
|
|
func NewRelationships() Relationships {
|
|
return Relationships{x: relationships.NewRelationships()}
|
|
}
|
|
|
|
// NewRelationshipsCopy creates a new relationships wrapper as a copy of passed in instance.
|
|
func NewRelationshipsCopy(rels Relationships) Relationships {
|
|
copiedBody := *rels.x
|
|
return Relationships{x: &copiedBody}
|
|
}
|
|
|
|
// X returns the underlying raw XML data.
|
|
func (r Relationships) X() *relationships.Relationships {
|
|
return r.x
|
|
}
|
|
|
|
// IsEmpty returns true if there are no relationships.
|
|
func (r Relationships) IsEmpty() bool {
|
|
return r.x == nil || len(r.x.Relationship) == 0
|
|
}
|
|
|
|
// Clear removes any existing relationships.
|
|
func (r Relationships) Clear() {
|
|
r.x.Relationship = nil
|
|
}
|
|
|
|
// FindRIDForN returns the relationship ID for the i'th relationship of type t.
|
|
func (r Relationships) FindRIDForN(i int, t string) string {
|
|
for _, rel := range r.x.CT_Relationships.Relationship {
|
|
if rel.TypeAttr == t {
|
|
if i == 0 {
|
|
return rel.IdAttr
|
|
}
|
|
i--
|
|
}
|
|
}
|
|
return ""
|
|
}
|
|
|
|
// AddAutoRelationship adds a relationship with an automatically generated
|
|
// filename based off of the type. It should be preferred over AddRelationship
|
|
// to ensure consistent filenames are maintained.
|
|
func (r Relationships) AddAutoRelationship(dt unioffice.DocType, src string, idx int, ctype string) Relationship {
|
|
return r.AddRelationship(unioffice.RelativeFilename(dt, src, ctype, idx), ctype)
|
|
}
|
|
|
|
// AddRelationship adds a relationship.
|
|
func (r Relationships) AddRelationship(target, ctype string) Relationship {
|
|
if !strings.HasPrefix(ctype, "http://") {
|
|
unioffice.Log("relationship type %s should start with 'http://'", ctype)
|
|
}
|
|
rel := relationships.NewRelationship()
|
|
nextID := len(r.x.Relationship) + 1
|
|
used := map[string]struct{}{}
|
|
|
|
// identify IDs in use
|
|
for _, exRel := range r.x.Relationship {
|
|
used[exRel.IdAttr] = struct{}{}
|
|
}
|
|
// find the next ID that is unused
|
|
for _, ok := used[fmt.Sprintf("rId%d", nextID)]; ok; _, ok = used[fmt.Sprintf("rId%d", nextID)] {
|
|
nextID++
|
|
|
|
}
|
|
rel.IdAttr = fmt.Sprintf("rId%d", nextID)
|
|
rel.TargetAttr = target
|
|
rel.TypeAttr = ctype
|
|
r.x.Relationship = append(r.x.Relationship, rel)
|
|
return Relationship{rel}
|
|
}
|
|
|
|
// Remove removes an existing relationship.
|
|
func (r Relationships) Remove(rel Relationship) bool {
|
|
for i, ir := range r.x.Relationship {
|
|
if ir == rel.x {
|
|
copy(r.x.Relationship[i:], r.x.Relationship[i+1:])
|
|
r.x.Relationship = r.x.Relationship[0 : len(r.x.Relationship)-1]
|
|
return true
|
|
}
|
|
}
|
|
return false
|
|
}
|
|
|
|
// CopyRelationship copies the relationship.
|
|
func (r Relationships) CopyRelationship(idAttr string) (Relationship, bool) {
|
|
for i := range r.x.Relationship {
|
|
if r.x.Relationship[i].IdAttr == idAttr {
|
|
copied := *r.x.Relationship[i]
|
|
|
|
nextID := len(r.x.Relationship) + 1
|
|
used := map[string]struct{}{}
|
|
|
|
// identify IDs in use
|
|
for _, exRel := range r.x.Relationship {
|
|
used[exRel.IdAttr] = struct{}{}
|
|
}
|
|
// find the next ID that is unused
|
|
for _, ok := used[fmt.Sprintf("rId%d", nextID)]; ok; _, ok = used[fmt.Sprintf("rId%d", nextID)] {
|
|
nextID++
|
|
}
|
|
|
|
copied.IdAttr = fmt.Sprintf("rId%d", nextID)
|
|
|
|
r.x.Relationship = append(r.x.Relationship, &copied)
|
|
|
|
return Relationship{&copied}, true
|
|
}
|
|
}
|
|
|
|
return Relationship{}, false
|
|
}
|
|
|
|
// Hyperlink is just an appropriately configured relationship.
|
|
type Hyperlink Relationship
|
|
|
|
// AddHyperlink adds an external hyperlink relationship.
|
|
func (r Relationships) AddHyperlink(target string) Hyperlink {
|
|
rel := r.AddRelationship(target, unioffice.HyperLinkType)
|
|
rel.x.TargetModeAttr = relationships.ST_TargetModeExternal
|
|
return Hyperlink(rel)
|
|
}
|
|
|
|
// Relationships returns a slice of all of the relationships.
|
|
func (r Relationships) Relationships() []Relationship {
|
|
ret := []Relationship{}
|
|
for _, x := range r.x.Relationship {
|
|
ret = append(ret, Relationship{x})
|
|
}
|
|
return ret
|
|
}
|