Skip to content

Commit

Permalink
Merge pull request #61 from tangly1024/feature_quickPage
Browse files Browse the repository at this point in the history
Feature quick page
  • Loading branch information
tangly1024 authored Feb 26, 2022
2 parents 26d1c91 + bebde04 commit 3bd94f1
Show file tree
Hide file tree
Showing 2 changed files with 11 additions and 25 deletions.
6 changes: 3 additions & 3 deletions package.json
Original file line number Diff line number Diff line change
Expand Up @@ -33,15 +33,15 @@
"lodash.throttle": "^4.1.1",
"memory-cache": "^0.2.0",
"next": "^12.0.5",
"notion-client": "4.14.1",
"notion-utils": "4.14.1",
"notion-client": "4.16.0",
"notion-utils": "4.16.0",
"preact": "^10.5.15",
"qrcode.react": "^1.0.1",
"react": "17.0.2",
"react-cookies": "^0.1.1",
"react-cusdis": "^2.1.3",
"react-dom": "17.0.2",
"react-notion-x": "4.14.2",
"react-notion-x": "4.16.0",
"smoothscroll-polyfill": "^0.4.4",
"typed.js": "^2.0.12",
"use-ackee": "^3.0.0"
Expand Down
30 changes: 8 additions & 22 deletions pages/article/[slug].js
Original file line number Diff line number Diff line change
Expand Up @@ -68,22 +68,25 @@ export async function getStaticProps ({ params: { slug } }) {
}

/**
*
* 获取文章的关联推荐文章列表,目前根据标签关联性筛选
* @param post
* @param {*} allPosts
* @param {*} count
* @returns
*/
function getRecommendPost (post, allPosts, count = 5) {
let filteredPosts = Object.create(allPosts)
// 筛选同标签
let filteredPosts = []
for (const i in allPosts) {
const p = allPosts[i]
filteredPosts.push(Object.assign(p))
}

if (post.tags && post.tags.length) {
const currentTag = post.tags[0]
filteredPosts = filteredPosts.filter(
p => p && p.tags && p.tags.includes(currentTag) && p.slug !== post.slug && p.type === 'post'
p => p && p.slug !== post.slug && p.tags && p.tags?.includes(currentTag) && p.type === ['Post']
)
}
shuffleSort(filteredPosts)

// 筛选前5个
if (filteredPosts.length > count) {
Expand All @@ -92,21 +95,4 @@ function getRecommendPost (post, allPosts, count = 5) {
return filteredPosts
}

/**
* 洗牌乱序:从数组的最后位置开始,从前面随机一个位置,对两个数进行交换,直到循环完毕
* @param arr
* @returns {*}
*/
function shuffleSort (arr) {
let i = arr.length - 1
while (i > 0) {
const rIndex = Math.floor(Math.random() * i)
const temp = arr[rIndex]
arr[rIndex] = arr[i]
arr[i] = temp
i--
}
return arr
}

export default Slug

1 comment on commit 3bd94f1

@vercel
Copy link

@vercel vercel bot commented on 3bd94f1 Feb 26, 2022

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Please sign in to comment.