本文整理汇总了Golang中github.com/Unknwon/gowalker/doc.Package.ViewedTime方法的典型用法代码示例。如果您正苦于以下问题：Golang Package.ViewedTime方法的具体用法？Golang Package.ViewedTime怎么用？Golang Package.ViewedTime使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类github.com/Unknwon/gowalker/doc.Package的用法示例。
在下文中一共展示了Package.ViewedTime方法的3个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Golang代码示例。
示例1: updateCacheInfo
func updateCacheInfo(pdoc *doc.Package, urpids, urpts *http.Cookie) (string, string) {
pdoc.ViewedTime = time.Now().UTC().Unix()
updateCachePros(pdoc)
updateProInfos(pdoc)
return updateUrPros(pdoc, urpids, urpts)
}示例2: updateRecentPros
func updateRecentPros(pdoc *doc.Package) {
// Only projects with import path length is less than 40 letters will be showed.
if len(pdoc.ImportPath) < 40 {
index := -1
listLen := len(recentViewedPros)
curPro := &recentPro{
Path: pdoc.ImportPath,
Synopsis: pdoc.Synopsis,
ViewedTime: time.Now().UTC().Unix(),
IsGoRepo: pdoc.ProjectName == "Go" &&
strings.Index(pdoc.ImportPath, ".") == -1,
Views: pdoc.Views,
}
pdoc.ViewedTime = curPro.ViewedTime
// Check if in the list
for i, s := range recentViewedPros {
if s.Path == curPro.Path {
index = i
break
}
}
s := make([]*recentPro, 0, recentViewedProNum)
s = append(s, curPro)
switch {
case index == -1 && listLen < recentViewedProNum:
// Not found and list is not full
s = append(s, recentViewedPros...)
case index == -1 && listLen >= recentViewedProNum:
// Not found but list is full
s = append(s, recentViewedPros[:recentViewedProNum-1]...)
case index > -1:
// Found
s = append(s, recentViewedPros[:index]...)
s = append(s, recentViewedPros[index+1:]...)
}
recentViewedPros = s
}
}示例3: updateRecentPros
func updateRecentPros(pdoc *doc.Package) {
index := -1
listLen := len(recentViewedPros)
curPro := &recentPro{
Path: pdoc.ImportPath,
ViewedTime: time.Now().UTC().Unix(),
IsGoRepo: pdoc.ProjectName == "Go",
Views: pdoc.Views,
}
pdoc.ViewedTime = curPro.ViewedTime
// Check if in the list
for i, s := range recentViewedPros {
if s.Path == curPro.Path {
index = i
break
}
}
s := make([]*recentPro, 0, recentViewedProNum)
s = append(s, curPro)
switch {
case index == -1 && listLen < recentViewedProNum:
// Not found and list is not full
s = append(s, recentViewedPros...)
case index == -1 && listLen >= recentViewedProNum:
// Not found but list is full
s = append(s, recentViewedPros[:recentViewedProNum-1]...)
case index > -1:
// Found
s = append(s, recentViewedPros[:index]...)
s = append(s, recentViewedPros[index+1:]...)
}
recentViewedPros = s
}