github/bettercap
1
0
Fork 0
mirror of https://github.com/bettercap/bettercap synced 2025-08-19 13:09:49 -07:00
Code Issues Projects Releases Packages Wiki Activity Actions

Minor improvements to prevent unecessaries allocations

Browse source
This commit is contained in:
Stefano Gabryel 2019-04-20 16:51:14 +02:00
commit 0e857e4467
2 changed files with 4 additions and 4 deletions
Download patch file Download diff file Expand all files Collapse all files

4
core/core.go
View file

@ -8,8 +8,8 @@ import (
) )
func UniqueInts(a []int, sorted bool) []int { func UniqueInts(a []int, sorted bool) []int {
tmp := make(map[int]bool) tmp := make(map[int]bool, len(a))
uniq := make([]int, 0) uniq := make([]int, 0, len(a))
for _, n := range a { for _, n := range a {
tmp[n] = true tmp[n] = true

4
modules/net_recon/net_show.go
View file

@ -15,7 +15,7 @@ import (
"github.com/evilsocket/islazy/tui" "github.com/evilsocket/islazy/tui"
) )
var ( const (
AliveTimeInterval = time.Duration(10) * time.Second AliveTimeInterval = time.Duration(10) * time.Second
PresentTimeInterval = time.Duration(1) * time.Minute PresentTimeInterval = time.Duration(1) * time.Minute
JustJoinedTimeInterval = time.Duration(10) * time.Second JustJoinedTimeInterval = time.Duration(10) * time.Second
@ -109,7 +109,7 @@ func (mod *Discovery) getRow(e *network.Endpoint, withMeta bool) [][]string {
}) })
sort.Strings(metas) sort.Strings(metas)
rows := [][]string{} rows := make([][]string, 0, len(metas))
for i, m := range metas { for i, m := range metas {
if i == 0 { if i == 0 {
rows = append(rows, append(row, m)) rows = append(rows, append(row, m))