All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.bidib.wizard.model.status.SpeedSteps Maven / Gradle / Ivy

There is a newer version: 2.0.26
Show newest version
package org.bidib.wizard.model.status;

import org.bidib.jbidibc.messages.DriveState;
import org.bidib.jbidibc.messages.enums.SpeedStepsEnum;

public enum SpeedSteps implements BidibStatus {
    // @formatter:off
    DCC14(14, "14", SpeedStepsEnum.DCC14), DCC28(28, "28", SpeedStepsEnum.DCC28), 
    DCC128(127, "128", SpeedStepsEnum.DCC128), DCC_SDF(127, "DCC_SDF", SpeedStepsEnum.DCC_SDF), MM14(14, "MM14", SpeedStepsEnum.MM14), 
    MM27a(27, "MM27a", SpeedStepsEnum.MM27a), MM27b(27, "MM27b", SpeedStepsEnum.MM27b), 
    M4(128, "M4", SpeedStepsEnum.M4);
    // @formatter:on

    private final int steps;

    private final String key;

    private final SpeedStepsEnum type;

    SpeedSteps(int steps, String key, SpeedStepsEnum type) {
        this.steps = steps;
        this.key = key;
        this.type = type;
    }

    public int getSteps() {
        return steps;
    }

    @Override
    public SpeedStepsEnum getType() {
        return type;
    }

    @Override
    public String getKey() {
        return key;
    }

    public static SpeedSteps valueOf(SpeedStepsEnum type) {
        SpeedSteps result = null;

        for (SpeedSteps e : values()) {
            if (e.type == type) {
                result = e;
                break;
            }
        }
        if (result == null) {
            throw new IllegalArgumentException("cannot map " + type + " to a speed step");
        }
        return result;
    }

    public static int valueOf(SpeedSteps speedSteps) {
        int steps = speedSteps.steps;
        // change 127 --> 128
        if (steps == 127) {
            steps = 128;
        }
        return steps;
    }

    public static SpeedSteps valueOf(int speedSteps) {
        SpeedSteps result = null;

        // change 128 --> 127
        if (speedSteps == 128) {
            speedSteps = 127;
        }

        for (SpeedSteps e : values()) {
            if (e.steps == speedSteps) {
                result = e;
                break;
            }
        }
        if (result == null) {
            throw new IllegalArgumentException("cannot map " + speedSteps + " to a speed step");
        }
        return result;
    }

    public static SpeedSteps fromBidibFormat(int format) {
        SpeedSteps result = null;
        switch (format) {
            case DriveState.DRIVE_ADDRESS_FORMAT_DCC14:
                result = SpeedSteps.DCC14;
                break;
            case DriveState.DRIVE_ADDRESS_FORMAT_DCC_SDF:
                result = SpeedSteps.DCC_SDF;
                break;
            case DriveState.DRIVE_ADDRESS_FORMAT_DCC28:
                result = SpeedSteps.DCC28;
                break;
            case DriveState.DRIVE_ADDRESS_FORMAT_DCC128:
                result = SpeedSteps.DCC128;
                break;
            case DriveState.DRIVE_ADDRESS_FORMAT_MM14:
                result = SpeedSteps.MM14;
                break;
            case DriveState.DRIVE_ADDRESS_FORMAT_MM27a:
                result = SpeedSteps.MM27a;
                break;
            case DriveState.DRIVE_ADDRESS_FORMAT_MM27b:
                result = SpeedSteps.MM27b;
                break;
            case DriveState.DRIVE_ADDRESS_FORMAT_M4:
                result = SpeedSteps.M4;
                break;
            default:
                break;
        }
        return result;
    }

    @Override
    public SpeedSteps[] getValues() {
        return new SpeedSteps[] { DCC14, DCC28, DCC128, DCC_SDF };
    }

    public static SpeedSteps fromKey(String key) {
        SpeedSteps result = null;

        for (SpeedSteps e : values()) {
            if (e.key.equals(key)) {
                result = e;
                break;
            }
        }
        if (result == null) {
            throw new IllegalArgumentException("cannot map " + key + " to a speed step");
        }
        return result;
    }

}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy