search.go

// Copyright (c) 2020, Ben Morgan. All rights reserved.
// Use of this source code is governed by an MIT license
// that can be found in the LICENSE file.

package main

import (
	"fmt"
	"sort"

	"github.com/cassava/repoctl/internal/term"
	"github.com/cassava/repoctl/pacman/aur"
	"github.com/goulash/pr"
	"github.com/spf13/cobra"
)

var (
	searchSortBy string
	searchRaw    bool
	searchInfo   bool
)

func init() {
	MainCmd.AddCommand(searchCmd)

	searchCmd.Flags().StringVarP(&searchSortBy, "sort-by", "b", "name", "which key to sort results by")
	searchCmd.RegisterFlagCompletionFunc("sort-by", func(cmd *cobra.Command, args []string, toComplete string) ([]string, cobra.ShellCompDirective) {
		return []string{"name", "votes", "popularity", "votes-reverse", "popularity-reverse"}, cobra.ShellCompDirectiveDefault
	})

	searchCmd.Flags().BoolVarP(&searchRaw, "raw", "r", false, "show only the name")
	searchCmd.Flags().BoolVarP(&searchInfo, "info", "i", false, "show package information")
}

var searchCmd = &cobra.Command{
	Use:   "search [PKGNAME ...]",
	Short: "Search for packages on AUR",
	Long: `Search for packages hosted on AUR.

  This command searches the specified arguments on AUR by the name property.
  The results are combined and sorted by one of the following methods:

    name
    votes
    popularity
    votes-reverse
    popularity-reverse

  The default is "name". Duplicate results are filtered from the output.

  Search results are formatted similarly to Pacman search results, and can
  also be expanded to include other metadata by using the --info flag.
`,
	Example: `  repoctl search --sort-by=votes firefox
  repoctl search flir flirc flirc-bin`,
	ValidArgsFunction: completeNoFiles,
	RunE: func(cmd *cobra.Command, args []string) error {
		exceptQuiet()

		var pkgs aur.Packages
		for _, q := range args {
			aurpkgs, err := aur.SearchByName(q)
			if err != nil {
				return err
			}
			pkgs = append(pkgs, aurpkgs...)
		}

		// Sort the list
		if searchSortBy == "name" {
			sort.Slice(pkgs, func(i, j int) bool { return pkgs[i].Name < pkgs[j].Name })
		} else if searchSortBy == "votes" {
			sort.Slice(pkgs, func(i, j int) bool { return pkgs[i].NumVotes < pkgs[j].NumVotes })
		} else if searchSortBy == "votes-reverse" {
			sort.Slice(pkgs, func(i, j int) bool { return pkgs[j].NumVotes < pkgs[i].NumVotes })
		} else if searchSortBy == "popularity" {
			sort.Slice(pkgs, func(i, j int) bool { return pkgs[i].Popularity < pkgs[j].Popularity })
		} else if searchSortBy == "popularity-reverse" {
			sort.Slice(pkgs, func(i, j int) bool { return pkgs[j].Popularity < pkgs[i].Popularity })
		} else {
			return fmt.Errorf("unknown sort-by key '%s'", searchSortBy)
		}

		// Get the terminal width and fallback to a massive value if it's not
		// available. This prevents wrapping and lets us for example grep the
		// output better.
		terminalWidth := pr.StdoutTerminalWidth()
		if terminalWidth <= 0 {
			// FIXME: This is a hack
			terminalWidth = 1024
		}

		// Print the list
		var pkgnames []string
		pkgset := make(map[string]bool)
		for _, p := range pkgs {
			// Only add unique names to the list of packages
			if pkgset[p.Name] {
				continue
			}
			pkgset[p.Name] = true

			var s string
			if searchRaw {
				s = p.Name
			} else if searchInfo {
				s = term.Sprintf("@{!m}aur/@{!w}%s @{!g}%s @{r}(%d)\n@|", p.Name, p.Version, p.NumVotes)
				s += term.Sprintf("@.%s", formatAURPackageInfo(p, terminalWidth))
			} else {
				s = term.Sprintf("@{!m}aur/@{!w}%s @{!g}%s @{r}(%d)\n@|    %s", p.Name, p.Version, p.NumVotes, p.Description)
			}
			pkgnames = append(pkgnames, s)
		}
		if searchRaw {
			printSet(pkgnames, "", Conf.Columnate)
		} else {
			for _, p := range pkgnames {
				term.Printf("%s\n", p)
			}
		}

		return nil
	},
}