This commit is contained in:
Kevin Froman 2019-12-04 01:02:28 -06:00
parent 1eb47a4584
commit 1eb7880de9
3 changed files with 42 additions and 1 deletions

View File

@ -62,7 +62,6 @@ function appendMessages(msg, blockHash, beforeHash, channel) {
}
var el = document.createElement('div')
el.className = 'entry'
el.innerText = msg['content']
if (beforeHash !== null) {
@ -87,6 +86,9 @@ function appendMessages(msg, blockHash, beforeHash, channel) {
var div = clone.querySelectorAll("div")
var identicon = clone.querySelectorAll("img")
div[0].classList.add('entry')
div[0].setAttribute('timestamp', msg['meta']['time'])
div[0].setAttribute('data-bl', blockHash)
div[2].textContent = msg['content']
if (typeof msg['meta']['signer'] != 'undefined' && msg['meta']['signer'].length > 0){
@ -158,6 +160,7 @@ function getBlocks(){
loadMessage(blockList[i], blockList, i, ch);
}
}
sortEntries()
}
function loadMessage(blockHash, blockList, count, channel){

View File

@ -24,6 +24,7 @@
<script defer src="detect-plaintext-storage.js"></script>
<script defer src='sethumanreadable.js'></script>
<script defer src="default-circle-picker.js"></script>
<script defer src="sort-posts.js"></script>
<script defer src='board.js'></script>
<script defer src='autorefresh.js'></script>
</head>

View File

@ -0,0 +1,37 @@
/*
Onionr - Private P2P Communication
Sort post entries
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
function sortEntries(){
var entries = document.getElementsByClassName('entry')
var timestamp = 0;
if (entries.length > 0){
timestamp = entries[0].getAttribute('timestamp')
}
for (i = 0; i < entries.length; i++){
console.log(i)
if (entries[i].getAttribute('timestamp') > timestamp){
if(entries[i].previousElementSibling){
entries[i].parentNode.insertBefore(entries[i], entries[i].previousElementSibling)
}
}
}
}