e2m/dispatch
4
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Add support for owner, admin and halfop user modes

Browse Source
This commit is contained in:
Ken-Håvard Lieng 2017-05-10 03:47:34 +02:00
parent 750ffef4c2
commit 2b5a468079
2 changed files with 47 additions and 42 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

38
assets/bindata.go
View File

File diff suppressed because one or more lines are too long

51
client/src/js/reducers/channels.js
View File

@ -8,16 +8,22 @@ const User = Record({
mode: ''
});
function updateRenderName(user) {
let name = user.nick;
const modePrefixes = [
{ mode: 'q', prefix: '~' }, // Owner
{ mode: 'a', prefix: '&' }, // Admin
{ mode: 'o', prefix: '@' }, // Op
{ mode: 'h', prefix: '%' }, // Halfop
{ mode: 'v', prefix: '+' } // Voice
];
if (user.mode.indexOf('o') !== -1) {
name = `@${name}`;
} else if (user.mode.indexOf('v') !== -1) {
name = `+${name}`;
function updateRenderName(user) {
for (let i = 0; i < modePrefixes.length; i++) {
if (user.mode.indexOf(modePrefixes[i].mode) !== -1) {
return user.set('renderName', `${modePrefixes[i].prefix}${user.nick}`);
}
}
return user.set('renderName', name);
return user.set('renderName', user.nick);
}
function createUser(nick, mode) {
@ -31,35 +37,34 @@ function createUser(nick, mode) {
function loadUser(nick) {
let mode;
if (nick[0] === '@') {
mode = 'o';
} else if (nick[0] === '+') {
mode = 'v';
for (let i = 0; i < modePrefixes.length; i++) {
if (nick[0] === modePrefixes[i].prefix) {
mode = modePrefixes[i].mode;
}
}
if (mode) {
return createUser(nick.slice(1), mode);
}
return createUser(nick, mode);
return createUser(nick);
}
function compareUsers(a, b) {
a = a.renderName.toLowerCase();
b = b.renderName.toLowerCase();
if (a[0] === '@' && b[0] !== '@') {
return -1;
}
if (b[0] === '@' && a[0] !== '@') {
return 1;
}
if (a[0] === '+' && b[0] !== '+') {
return -1;
}
if (b[0] === '+' && a[0] !== '+') {
return 1;
for (let i = 0; i < modePrefixes.length; i++) {
const prefix = modePrefixes[i].prefix;
if (a[0] === prefix && b[0] !== prefix) {
return -1;
}
if (b[0] === prefix && a[0] !== prefix) {
return 1;
}
}
if (a < b) {
return -1;
}