/prog/ - /prog/ Challenge #42069

Name: Anonymous 2017-01-23 13:30

Implement a POASTchecker. The POASTchecker will analyse a post number and use heuristic processing to determine whether the number is a /proggles/number, i.e. it will either acknowledge ``dubs'', ``trips'', or ``jackson five GET''. Any reasonable input and output format is allowed.

Good luck!

Name: Anonymous 2017-01-23 13:48

char* POASTchecker(char* postnumber){
  short repeating_digits = 0;
  char previous = '\0';
  while(*postnumber != '\0'){
    if(*postnumber != previous) repeating_digits = 0;
    else repeating_digits++;
    previous = *postnumber;
    postnumber++;
  }
  if(repeating_digits > 3) return "higher order /proggles/"
  if(repeating_digits == 3) return "trips";
  if(repeating_digits == 2) return "dubs";
  if(previous == 5) return "jackson give GET";
  return "HAX MY ANUS";
}

Name: /prog/ challenge 2017-01-23 13:48

Bring RedCream back ;_;

Good luck!

Name: Anonymous 2017-01-23 14:48

(defun POASTchecker (x)
  (cond
    ((= (mod (mod x 1000) 111) 0) 'trips)
    ((= (mod (mod x  100)  11) 0) 'dubs)
    ((=           x            5) 'jackson-five-get)))

Name: Anonymous 2017-01-23 14:58

>>4

taking part in programming challenges
trying to compete with Erlang

Name: Anonymous 2017-01-23 15:07

>>5
Who are you quoting?

Name: Anonymous 2017-01-23 17:05

>>6
its meme arrows you cuck

Name: Anonymous 2017-01-23 17:46

>>7
What arrows?

Name: Anonymous 2017-01-23 21:31

imageredditor thinks there are meme arrows on /prog/
wew lad

Name: Anonymous 2017-01-23 21:33

>>5
nobody posted any erlang here so we can't compete with it

Name: Anonymous 2017-01-24 11:26

speaking of /proggles/, check my sweet dubs

Name: Anonymous 2017-01-24 14:03

>>11
manual work that could be automated, but no, that would eliminate jobs for illegal migrants

Name: Anonymous 2017-01-24 15:00

>>12
there are already two POASTchecker implementations with dubs support in this thread, they just need to be deployed

Name: Anonymous 2017-01-24 15:50

EXPERIENCED ENTERPRISE ARCHITECT SOLUTION

public class Constants {
	public static int THE_NUMBER_ZERO = 0;
	public static int THE_NUMBER_TWO = 2;
	public static int THE_NUMBER_THREE = 3;
	public static int THE_NUMBER_FIVE = 5;
	public static int THE_NUMBER_TEN = 10;

	public static int THE_JACKSON_FIVE_CONSTANT = THE_NUMBER_FIVE;

	public static String DUBS_MESSAGE = "DUBS";
	public static String TRIPS_MESSAGE = "TRIPS";
	public static String JACKSON_FIVE_GET_MESSAGE = "JACKSON FIVE GET";
	public static String TRY_AGAIN_NEXT_TIME_MESSAGE = "TRY AGAIN NEXT TIME";
}

public abstract class CheckRule {
	public abstract boolean check(int em);
	public abstract String congratulations();
}

public abstract class CheckConstantPostNumberRule extends CheckRule {
	int theConstantToCheck;

	CheckConstantPostNumberRule(int theConstantToCheck) {
		this.theConstantToCheck = theConstantToCheck;
	}

	public boolean check(int em) {
		returm em == theConstantToCheck;
	}
}

public class JacksonFiveCheckRule extends CheckConstantPostNumberRule {
	JacksonFiveCheckRule() {
		super(Constants.THE_JACKSON_FIVE_CONSTANT);
	}

	public String congratulations() {
		return Constants.JACKSON_FIVE_GET_MESSAGE;
	}
}

public abstract class CheckDubsRule extends CheckRule {
	int base;

    checkDubsRule(int base) {
        this.base = base;
    }

   boolean check(int em) {
   		return em % this.base == (em % Math.pow(this.base, Constants.THE_NUMBER_TWO)) / this.base;
   }

   String congratulations() {
   		return Constants.DUBS_MESSAGE;
   }
}

public class CheckBase10DubsRule extends CheckDubsRule {
    CheckBase10DubsRule() {
        super(Constants.THE_NUMBER_TEN);
    }
}

public abstract class CheckTripsRule extends CheckRule {
	int base;
	CheckDubsRule dubsCheckerRule;

    CheckTripsRule(int base, CheckDubsRule dubsCheckerRule) {
        this.base = base;
        this.dubsCheckerRule = dubsCheckerRule;
    }

   boolean check(int em) {
   		return em%Constants.THE_NUMBER_TEN == (em % Math.pow(this.base, Constants.THE_NUMBER_THREE)) / Math.pow(this.base, Constants.THE_NUMBER_TWO) &&
   		 this.dubsCheckerRule.check(em) && this.dubsCheckerRule.check(em / Constants.THE_NUMBER_TEN);
   }

    String congratulations() {
   		return Constants.TRIPS_MESSAGE;
   }
}

public class CheckBase10TripsRule extends CheckTripsRule {
    CheckBase10DubsRule() {
        super(Constants.THE_NUMBER_TEN, new CheckBase10DubsRule());
    }
}

public abstract class AbstractPostChecker {
	public CheckRule[] checkingRules;

	AbstractPostChecker(CheckRule[] checkingRules) {
		this.checkingRules = checkingRules;
	}

	public String check(int em) {
		for (int i=Constants.THE_NUMBER_ZERO; i<checkingRules.length; i++)
			if (checkingRules[i].check(em))
				return checkingRules[i].congratulations();
		return Constants.TRY_AGAIN_NEXT_TIME_MESSAGE
	}
}

public class POASTChecker extends AbstractPostChecker {
	POASTChecker() {
		super(new CheckRule[]{new CheckBase10DubsRule(), new CheckBase10TripsRule(),
			new JacksonFiveCheckRule()});
	}
}

public class POASTCheckerTHE_NUMBER_FIVETest {
	public static void main(String[] args) {
		POASTChecker thePOASTChecker = new POASTChecker();
		System.out.println(thePOASTChecker.check(Constant.THE_NUMBER_FIVE));
	}
}

Name: Anonymous 2017-01-25 7:22

>>14
almost good but you're using raw constructors. factories would be eneterprisier

Name: Anonymous 2017-01-25 9:40

14

use best practises for IoC injection pls

/prog/ Challenge #42069

1 Name: Anonymous 2017-01-23 13:30

2 Name: Anonymous 2017-01-23 13:48

3 Name: /prog/ challenge 2017-01-23 13:48

4 Name: Anonymous 2017-01-23 14:48

5 Name: Anonymous 2017-01-23 14:58

6 Name: Anonymous 2017-01-23 15:07

7 Name: Anonymous 2017-01-23 17:05

8 Name: Anonymous 2017-01-23 17:46

9 Name: Anonymous 2017-01-23 21:31

10 Name: Anonymous 2017-01-23 21:33

11 Name: Anonymous 2017-01-24 11:26

12 Name: Anonymous 2017-01-24 14:03

13 Name: Anonymous 2017-01-24 15:00

14 Name: Anonymous 2017-01-24 15:50

15 Name: Anonymous 2017-01-25 7:22

16 Name: Anonymous 2017-01-25 9:40