if(typeof(sortOrder) != "boolean"){
return items;
}
filtered.sort(function (a, b) {
if(sortOrder == true){
return (CustomOrder(a.status) > CustomOrder(b.status) ? 1 : -1);
}
else if(sortOrder == false){
return (CustomOrder(a.status) < CustomOrder(b.status) ? 1 : -1);
}
});The status property is a string ("Started", "Running", "Failed", "Finished", etc.), and CustomOrder is a function with a switch that just returns a predefined integer for each string. I switched CustomOrder to just be a simple lookup table object, and the sort call was changed to filtered.sort((a, b) => CustomOrder[a.status] - CustomOrder[b.status]);
if let _ = detailInformation {
loadDetailInformation()
}when optionals are killing yourself
socket.on('newMessage', (messageObj) => {
if (roomNumber === messageObj.roomNumber) {
console.log("message received:" + messageObj.message);
$('#messages').append($('<li>').text(messageObj.userName + ' : ' + messageObj.message));
}
});socket.in wasn't behaving as advertised (broadcasting to all rooms). I decided to take matters into my own hands.
var list = new List<string>() { // Assume some items in the list };
for (var i = 0; i < list.Count; i++)
{
var item = list[i];
list.Remove(item);
i--;
}Simple alternative to List.Clear()
for(var j=0;j<10;j++){
cell=document.createElement('td');
switch(j)
{
case 0:
var date1 = events[i]['start'];
var date2 = events[i]['end'];
cell.appendChild(document.createTextNode(date1.getFullYear()+'/'+date1.getMonth()+'/'+date1.getDate()+' '+date1.getHours()+':'+date1.getMinutes()+' To '+date2.getFullYear()+'/'+date2.getMonth()+'/'+date2.getDate()+' '+date2.getHours()+':'+date2.getMinutes()));
break;
case 1: cell.appendChild(document.createTextNode(events[i]['title'])); break;
case 2: cell.appendChild(document.createTextNode(events[i]['description'])); break;
}
row.appendChild(cell);
}The for loop that counts to 10, but the last seven
int number = -1;
//todo: refactor this horse shit.
for (String res: results) {
if(number == -1){
if(res.toLowerCase().contains("ten") || res.contains("10") || res.contains("１０") || res.contains("十") || res.contains("십")){
number = 10;
}
else if(res.toLowerCase().contains("nine") || res.contains("9") || res.contains("９") || res.contains("九") || res.contains("구")){
number = 9;
}
else if(res.toLowerCase().contains("eight") || res.contains("8") || res.contains("８") || res.contains("八") || res.contains("팔")){
number = 8;
}
else if(res.toLowerCase().contains("seven") || res.contains("7") || res.contains("７") || res.contains("七") || res.contains("칠")){
number = 7;
}
else if(res.toLowerCase().contains("six") || res.contains("6") || res.contains("６") || res.contains("六") || res.contains("육")){
number = 6;
}
else if(res.toLowerCase().contains("five") || res.contains("5") || res.contains("５") || res.contains("五") || res.contains("오")){
number = 5;
}
else if(res.toLowerCase().contains("four") || res.contains("4") || res.contains("４") || res.contains("四") || res.contains("사")){
number = 4;
}
else if(res.toLowerCase().contains("three") || res.contains("3") || res.contains("３") || res.contains("三") || res.contains("삼")){
number = 3;
}
else if(res.toLowerCase().contains("two") || res.contains("2") || res.contains("２") || res.contains("二") || res.contains("이")){
number = 2;
}
else if(res.toLowerCase().contains("one") || res.contains("1") || res.contains("１") || res.contains("一") || res.contains("일")){
number = 1;
}
}
}refactor this horse shit.
// Is this valid?
function validateStockInItems() {
if (stockInItemsToUpdate.length === 0)
return true;
return true;
}Found in a legacy code base for a stock management system. I will be rewriting said system soon.
outerloop:
try {
if (selectedFile == null) {
break outerloop;
} else {
if (selectedFile != null) {
readTo = new PrintStream(selectedFile);
readTo.println(userCodeInput.getText());
readTo = readTheOptionsIntegers(readTo);
}
} catch(IOException e) {
System.out.println(e);
}boolean darkModeSelected = (!darkModeSelected ? true : false);
+[[>+]>[+>]+] function hour_switvh($hour)
{
$hour=$hour/2;
if($hour==0.0){$hour="00:00";}
if($hour==0.5){$hour="00:30";}
if($hour==1.0){$hour="01:00";}
if($hour==1.5){$hour="01:30";}
if($hour==2.0){$hour="02:00";}
if($hour==2.5){$hour="02:30";}
if($hour==3.0){$hour="03:00";}
if($hour==3.5){$hour="03:30";}
if($hour==4.0){$hour="04:00";}
if($hour==4.5){$hour="04:30";}
if($hour==5.0){$hour="05:00";}
if($hour==5.5){$hour="05:30";}
if($hour==6.0){$hour="06:00";}
if($hour==6.5){$hour="06:30";}
if($hour==7.0){$hour="07:00";}
if($hour==7.5){$hour="07:30";}
if($hour==8.0){$hour="08:00";}
if($hour==8.5){$hour="08:30";}
if($hour==9.0){$hour="09:00";}
if($hour==9.5){$hour="09:30";}
if($hour==10.0){$hour="10:00";}
if($hour==10.5){$hour="10:30";}
if($hour==11.0){$hour="11:00";}
if($hour==11.5){$hour="11:30";}
if($hour==12.0){$hour="12:00";}
if($hour==12.5){$hour="12:30";}
if($hour==13.0){$hour="13:00";}
if($hour==13.5){$hour="13:30";}
if($hour==14.0){$hour="14:00";}
if($hour==14.5){$hour="14:30";}
if($hour==15.0){$hour="15:00";}
if($hour==15.5){$hour="15:30";}
if($hour==16.0){$hour="16:00";}
if($hour==16.5){$hour="16:30";}
if($hour==17.0){$hour="17:00";}
if($hour==17.5){$hour="17:30";}
if($hour==18.0){$hour="18:00";}
if($hour==18.5){$hour="18:30";}
if($hour==19.0){$hour="19:00";}
if($hour==19.5){$hour="19:30";}
if($hour==20.0){$hour="20:00";}
if($hour==20.5){$hour="20:30";}
if($hour==21.0){$hour="21:00";}
if($hour==21.5){$hour="21:30";}
if($hour==22.0){$hour="22:00";}
if($hour==22.5){$hour="22:30";}
if($hour==23.0){$hour="23:00";}
if($hour==23.5){$hour="23:30";}
if($hour==24.0){$hour="24:00";}
return $hour;
}
added by dfj
function isEmpty(value) {
if (value === '') {
return false;
} else if (value === 0) {
return false;
} else if (value === null) {
return false;
} else if (value === undefined) {
return false;
} else {
return true;
}
return true;
}javascript empty value check
from itertools import combinations as comb
from functools import reduce
def all_arrangements(k):
m=k*(k+1)/2
m_bits_on=set([tuple(reduce(lambda x,y:x[:y]+[1]+x[y+1:],c,[0]*(2*m+1))) for c in comb(range(2*m+1),m)])
return set([tuple(sorted(filter(lambda i:i>0,reduce(lambda x,y: x+[y] if y==0 else x[:-1]+[x[-1]+1,],p,[0])))) for p in m_bits_on])Returns all arrangements in the Bulgarian solitaire game with k piles https://en.wikipedia.org/wiki/Bulgarian_solitaire
/// <summary>
/// Returns true if any component of of Vector3 v is negative
/// </summary>
public static bool Ext_IsNegative(this Vector3 v)
{
return v.x < 0f && v.y < 0f && v.z < 0f;
}Either the description is wrong or the method in itself
def _take_items_from_list_and_put_them_into_string(self, list):
string = ''
for element in list:
string += element + ','
if len(string) > 0 and string[-1] == ',':
string = string[0:-1]
return string