/**
* Get Field Lookup Value Direct
*
* @param windowNo Window
* @param AD_Field_ID
* @param keyValues array of id values
* @param cache
* @return list of display values
*/
public ArrayList<NamePair> getLookupValueDirect(
int AD_Field_ID, ArrayList<String> keyValues, boolean cache) {
int windowNo = 0; // No Context
ArrayList<NamePair> displayValues = new ArrayList<NamePair>();
UIField field = getField(AD_Field_ID, windowNo);
// if (cache && field.isLookup())
// field.getLookup().removeAllElements();
if (field == null) log.warning("Cannot find AD_Field_ID=" + AD_Field_ID);
//
for (int i = 0; i < keyValues.size(); i++) {
String key = keyValues.get(i);
String value = null;
if (field != null) value = field.getLookupDisplay(m_context, windowNo, key, cache);
if (value == null) {
/*
* if(key == null) value = ""; else value = "<" + key + ">";
*/
value = "";
}
NamePair pp = new ValueNamePair(key, value);
displayValues.add(pp);
}
return displayValues;
} // getLookupValueDirect
/*
-- This is a helper method run datasets such as emacs, gcc etc
*/
private static void runOtherDataSets() throws Exception {
System.out.println("Running tddd " + directory);
ReadFile.readFile(directory, fileList); // read the two files
System.out.println(fileList.get(0) + " " + fileList.get(1));
preliminaryStep(directory);
startCDC();
}
public void init() {
Scanner scan = new Scanner(System.in);
count = scan.nextInt();
x0 = scan.nextLong();
y0 = scan.nextLong();
int result = 0;
boolean special = false;
for (int i = 0; i < count; i++) {
long tempx = scan.nextLong();
long tempy = scan.nextLong();
if (tempx == x0 && tempy == y0) {
special = true;
continue;
}
boolean isDuplicate = false;
for (int j = 0; j < result; j++) {
long x1 = xList.get(j);
long y1 = yList.get(j);
if ((x1 - x0) * (tempy - y0) == (y1 - y0) * (tempx - x0)) {
isDuplicate = true;
break;
}
}
if (!isDuplicate) {
xList.add(tempx);
yList.add(tempy);
result++;
}
}
if (special && result == 0) result = 1;
System.out.println(result);
scan.close();
}
private void postProcessChangeVO(
ChangeVO change, int windowNo, Map<String, String> context, String[] dataRow, UITab tab) {
// make an updated context to get the necessary listboxvos
Map<String, String> contextAfterUpdate = new HashMap<String, String>(context);
int j = 0;
for (UIField field : tab.getFields()) {
contextAfterUpdate.put(field.getColumnName(), dataRow[j]);
j++;
}
// now change rowData to remove password, and reload the changed
// listboxes
j = 0;
for (UIField field : tab.getFields()) {
// return an empty string for passwords etc
if (field.isEncryptedField()
|| field.isEncryptedColumn()
|| "Password".equals(field.getColumnName())) change.rowData[j] = "";
if (FieldType.isClientLookup(field.getAD_Reference_ID()) && field.isDependentValue()) {
if (change.changedDropDowns == null)
change.changedDropDowns = new HashMap<String, ArrayList<NamePair>>();
ArrayList<NamePair> values;
if (field.getAD_Reference_ID() == DisplayTypeConstants.Search) {
ArrayList<String> t = new ArrayList<String>(1);
t.add(context.get(field.getColumnName()));
values = getLookupValueDirect(field.getAD_Field_ID(), t, true);
} else values = getLookupData(windowNo, field.getAD_Field_ID(), context, true);
change.changedDropDowns.put(field.getColumnName(), values);
}
j++;
}
}
/*
-- This is a helper methid to run the morph files
*/
private static void runMorphDataSet() throws Exception {
String morph_directory =
"../../thesis-datasets/morph/"; // directory where all the morph code is stored
File d = new File(morph_directory);
// get all the files from a directory
File[] fList = d.listFiles();
List<String> dir_list = new ArrayList<String>();
for (File file : fList) {
if (file.isDirectory()) {
dir_list.add(file.getName());
}
}
for (String dir : dir_list) {
directory = morph_directory + dir + "/";
System.out.println("Running TDDD " + directory);
ReadFile.readFile(directory, fileList); // read the two files
System.out.println(fileList.get(0) + " " + fileList.get(1));
preliminaryStep(directory);
startCDC();
fileList.clear();
fileArray.clear();
hashed_File_List.clear();
}
}
public static void main(String[] args) {
/* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
try {
Scanner sc = new Scanner(new File("/home/santosh/Desktop/testData"));
int testCases = sc.nextInt();
int i = 0;
ArrayList<ArrayList<Integer>> inputArraysList = new ArrayList<ArrayList<Integer>>();
ArrayList<Integer> list;
while (i++ < testCases) {
int n = sc.nextInt();
int k = 0;
list = new ArrayList<Integer>();
while (k < n) {
list.add(sc.nextInt());
k++;
}
inputArraysList.add(list);
}
// System.out.println(inputArraysList.size());
for (ArrayList<Integer> arr : inputArraysList) {
countPairs(arr.toArray(new Integer[arr.size()]));
}
} catch (Exception e) {
}
}
public ChangeVO updateRow(
int windowNo,
int AD_Tab_ID,
int queryResultID,
int relRowNo,
Map<String, String> context,
boolean force) {
if (context == null || context.size() == 0)
return new ChangeVO(true, Msg.translate(m_context, "NoContext"));
ArrayList<String[]> data = m_results.get(queryResultID);
if (data == null || data.size() == 0)
return new ChangeVO(true, Msg.translate(m_context, "CachedDataNotFound"));
UITab tab = getTab(AD_Tab_ID);
if (tab == null) {
log.config("Not found AD_Tab_ID=" + AD_Tab_ID);
return new ChangeVO(true, Msg.translate(m_context, "@NotFound@ @AD_Tab_ID@=" + AD_Tab_ID));
}
CContext ctx = new CContext(m_context.entrySet());
ctx.addWindow(windowNo, context);
ChangeVO retValue;
if (force) retValue = tab.saveRow(ctx, windowNo, false, null);
else retValue = tab.saveRow(ctx, windowNo, false, data.get(relRowNo));
if (retValue.hasError()) return retValue;
// Update Results
String[] dataRow = retValue.rowData.clone();
data.set(relRowNo, dataRow);
postProcessChangeVO(retValue, windowNo, context, dataRow, tab);
retValue.trxInfo = GridTab.getTrxInfo(tab.getTableName(), ctx, windowNo, tab.getTabNo());
if (retValue.isRefreshAll()) {}
return retValue;
}
public List<ICFAccTaxObj> readAllTax(boolean forceRead) {
final String S_ProcName = "readAllTax";
if ((allTax == null) || forceRead) {
Map<CFAccTaxPKey, ICFAccTaxObj> map = new HashMap<CFAccTaxPKey, ICFAccTaxObj>();
allTax = map;
CFAccTaxBuff[] buffList =
((ICFAccSchema) schema.getBackingStore())
.getTableTax()
.readAllDerived(schema.getAuthorization());
CFAccTaxBuff buff;
ICFAccTaxObj obj;
for (int idx = 0; idx < buffList.length; idx++) {
buff = buffList[idx];
obj = newInstance();
obj.setPKey(((ICFAccSchema) schema.getBackingStore()).getFactoryTax().newPKey());
obj.setBuff(buff);
ICFAccTaxObj realized = (ICFAccTaxObj) obj.realize();
}
}
Comparator<ICFAccTaxObj> cmp =
new Comparator<ICFAccTaxObj>() {
public int compare(ICFAccTaxObj lhs, ICFAccTaxObj rhs) {
if (lhs == null) {
if (rhs == null) {
return (0);
} else {
return (-1);
}
} else if (rhs == null) {
return (1);
} else {
CFAccTaxPKey lhsPKey = lhs.getPKey();
CFAccTaxPKey rhsPKey = rhs.getPKey();
int ret = lhsPKey.compareTo(rhsPKey);
return (ret);
}
}
};
int len = allTax.size();
ICFAccTaxObj arr[] = new ICFAccTaxObj[len];
Iterator<ICFAccTaxObj> valIter = allTax.values().iterator();
int idx = 0;
while ((idx < len) && valIter.hasNext()) {
arr[idx++] = valIter.next();
}
if (idx < len) {
throw CFLib.getDefaultExceptionFactory()
.newArgumentUnderflowException(getClass(), S_ProcName, 0, "idx", idx, len);
} else if (valIter.hasNext()) {
throw CFLib.getDefaultExceptionFactory()
.newArgumentOverflowException(getClass(), S_ProcName, 0, "idx", idx, len);
}
Arrays.sort(arr, cmp);
ArrayList<ICFAccTaxObj> arrayList = new ArrayList<ICFAccTaxObj>(len);
for (idx = 0; idx < len; idx++) {
arrayList.add(arr[idx]);
}
List<ICFAccTaxObj> sortedList = arrayList;
return (sortedList);
}
// Executes the given action
public void executeAction(Action a) {
// For each state variable, retrieve the DD for it, evaluate it
// w.r.t. the current state and build a new state.
ArrayList new_state = new ArrayList();
int c;
for (c = 0; c < (_nVars << 1); c++) {
new_state.add("-");
}
for (c = 0; c < (_nVars << 1); c++) {
Object cur_assign = _state.get(c);
if (cur_assign instanceof Boolean) {
// System.out.println(a._tmID2DD);
int nonprime_id = c + 1;
int prime_id = nonprime_id - _nVars;
Object DD = a._tmID2DD.get(new Integer(prime_id));
_state.set(prime_id - 1, TRUE);
double p_true = _mdp._context.evaluate(DD, _state);
// System.out.println("ID: " + nonprime_id + ", " + prime_id + ": " +
// _mdp._context.printNode(DD) + " -> " +
// _mdp._df.format(p_true));
new_state.set(c, (_r.nextFloat() < p_true) ? TRUE : FALSE);
}
}
_state = new_state;
}
/**
* Get Restriction Lines
*
* @param reload reload data
* @return array of lines
*/
public MGoalRestriction[] getRestrictions(boolean reload) {
if (m_restrictions != null && !reload) return m_restrictions;
ArrayList<MGoalRestriction> list = new ArrayList<MGoalRestriction>();
//
String sql =
"SELECT * FROM PA_GoalRestriction "
+ "WHERE PA_Goal_ID=? AND IsActive='Y' "
+ "ORDER BY Org_ID, C_BPartner_ID, M_Product_ID";
PreparedStatement pstmt = null;
ResultSet rs = null;
try {
pstmt = DB.prepareStatement(sql, get_Trx());
pstmt.setInt(1, getPA_Goal_ID());
rs = pstmt.executeQuery();
while (rs.next()) list.add(new MGoalRestriction(getCtx(), rs, get_Trx()));
} catch (Exception e) {
log.log(Level.SEVERE, sql, e);
} finally {
DB.closeStatement(pstmt);
DB.closeResultSet(rs);
}
//
m_restrictions = new MGoalRestriction[list.size()];
list.toArray(m_restrictions);
return m_restrictions;
} // getRestrictions
/**
* Get Accessible Goals
*
* @param ctx context
* @return array of goals
*/
public static MGoal[] getGoals(Ctx ctx) {
ArrayList<MGoal> list = new ArrayList<MGoal>();
String sql = "SELECT * FROM PA_Goal WHERE IsActive='Y' " + "ORDER BY SeqNo";
sql =
MRole.getDefault(ctx, false)
.addAccessSQL(sql, "PA_Goal", false, true); // RW to restrict Access
PreparedStatement pstmt = null;
ResultSet rs = null;
try {
pstmt = DB.prepareStatement(sql, (Trx) null);
rs = pstmt.executeQuery();
while (rs.next()) {
MGoal goal = new MGoal(ctx, rs, null);
goal.updateGoal(false);
list.add(goal);
}
} catch (Exception e) {
s_log.log(Level.SEVERE, sql, e);
} finally {
DB.closeStatement(pstmt);
DB.closeResultSet(rs);
}
MGoal[] retValue = new MGoal[list.size()];
list.toArray(retValue);
return retValue;
} // getGoals
public int totalNQueens(int n) {
StringBuilder[] board = new StringBuilder[n];
for (int i = 0; i < n; i++) {
board[i] = new StringBuilder();
for (int j = 0; j < n; j++) {
board[i].append('.');
}
}
for (int i = 0; i < n / 2; i++) {
board[0].setCharAt(i, 'Q');
dfs(n, 1, board);
board[0].setCharAt(i, '.');
}
ArrayList<String[]> aux = new ArrayList<String[]>();
for (String[] k : res) {
String[] tmp = new String[n];
for (int i = 0; i < n; i++) {
StringBuilder sb = new StringBuilder(k[i]).reverse();
tmp[i] = sb.toString();
}
aux.add(tmp);
}
res.addAll(aux);
if (n % 2 != 0) {
board[0].setCharAt(n / 2, 'Q');
dfs(n, 1, board);
board[0].setCharAt(n / 2, '.');
}
return res.size();
}
/**
* Save (Insert new) Row of Tab
*
* @param windowNo relative window
* @param AD_Tab_ID tab
* @param curRow insert after relative row number in results
* @param context current (relevant) context of new row
* @return error message or null
*/
public ChangeVO insertRow(
int windowNo, int AD_Tab_ID, int queryResultID, int curRow, Map<String, String> context) {
if (context == null || context.size() == 0) return new ChangeVO(true, "No Context");
UITab tab = getTab(AD_Tab_ID);
if (tab == null) {
log.config("Not found AD_Tab_ID=" + AD_Tab_ID);
return new ChangeVO(true, "@NotFound@ @AD_Tab_ID@=" + AD_Tab_ID);
}
log.info("Line Amt:" + context.get("LineNetAmt"));
CContext ctx = new CContext(m_context.entrySet());
ctx.addWindow(windowNo, context);
ChangeVO retValue = tab.saveRow(ctx, windowNo, true);
if (retValue.hasError()) return retValue;
// Update Results
ArrayList<String[]> data = m_results.get(queryResultID);
if (data == null) retValue.addError("Data Not Found");
else {
String[] dataRow = retValue.rowData;
if (curRow >= data.size()) data.add(dataRow);
else data.add(curRow, dataRow);
retValue.trxInfo = GridTab.getTrxInfo(tab.getTableName(), ctx, windowNo, tab.getTabNo());
}
return retValue;
} // insertRow
/*
Read in all the files and loop through all the files
We already have the hashed version of the documents
First, we cut up the first document into chunks (using the CDC algorhtim) and store it
Then we cut up the second document (usually a different version of the same document) and see how many chunks match
*/
private static void runBytes(
int window,
long divisor1,
long divisor2,
long divisor3,
long remainder,
Long minBoundary,
Long maxBoundary)
throws Exception {
storeChunks(
fileArray.get(0),
hashed_File_List.get(0),
divisor1,
divisor2,
divisor3,
remainder,
minBoundary,
maxBoundary); // here we run 2min, ck how similar the documents are to the one already in
// the system
runTddd(
fileArray.get(1),
hashed_File_List.get(1),
divisor1,
divisor2,
divisor3,
remainder,
minBoundary,
maxBoundary); // here we run 2min, ck how similar the documents are to the one already in
// the system
} // end of the function
// Derives QFunctions for the given value function and simulates the
// greedy policy for the given number of trials and steps per trial.
// Returns final value of every trial.
public ArrayList simulate(int trials, int steps, long rand_seed) {
ArrayList values = new ArrayList();
_r = new Random(rand_seed);
for (int trial = 1; trial <= trials; trial++) {
System.out.println("\n -----------\n Trial " + trial + "\n -----------");
// Initialize state
_state = new ArrayList();
_nVars = _mdp._alVars.size();
for (int c = 0; c < (_nVars << 1); c++) {
_state.add("-");
}
Iterator i = _mdp._alVars.iterator();
_vars = new TreeSet();
while (i.hasNext()) {
String s = (String) i.next();
if (!s.endsWith("\'")) {
Integer gid = (Integer) _mdp._tmVar2ID.get(s);
_vars.add(gid);
// Note: assign level (level is gid-1 b/c gids in order)
_state.set(gid.intValue() - 1, _r.nextBoolean() ? TRUE : FALSE);
}
}
// System.out.println(_mdp._context.printNode(_mdp._valueDD) + "\n" + _state);
double reward = _mdp._context.evaluate(_mdp._rewardDD, _state);
System.out.print(" " + PrintState(_state) + " " + MDP._df.format(reward));
// Run steps
for (int step = 1; step <= steps; step++) {
// Get action
Action a;
if (_bUseBasis) {
a = getBasisAction();
} else {
a = getAction();
}
// Execute action
executeAction(a);
// Update reward
reward =
(_mdp._bdDiscount.doubleValue() * reward)
+ _mdp._context.evaluate(_mdp._rewardDD, _state);
System.out.println(", a=" + a._sName);
System.out.print(
" " + PrintState(_state) + " " + MDP._df.format(reward) + ": " + "Step " + step);
}
values.add(new Double(reward));
System.out.println();
}
return values;
}
public static double Average(ArrayList l) {
double accum = 0.0d;
Iterator i = l.iterator();
while (i.hasNext()) {
Double d = (Double) i.next();
accum += d.doubleValue();
}
return (accum / (double) l.size());
}
public void solve(InputReader in, OutputWriter out) {
int n = in.nextInt();
ArrayList<String> a = new ArrayList<>();
for (int i = 0; i < n; i++) {
a.add(in.next());
}
TreeNode tree = new TreeNode(a);
int res = new A1().maxPathSum(tree);
out.println(res);
}
public void WriteUnparsed(){
//@ToDo : Make this proper java!
out.println(" <ValidichroUnparsed>");
int s = unparsed_lines.size();
for(int i=0;i<s;i++){
String line=(String)unparsed_lines.get(i);
out.println(" <ValidichroUnparsedLine>"+line+"</ValidichroUnparsedLine>");
}
out.println(" </ValidichroUnparsed>");
}
/**
* @param type
* @return
* @throws IOException
*/
public Section[] getSections(final int type) throws IOException {
final ArrayList<Section> result = new ArrayList<Section>();
final Section[] secs = getSections();
for (Section section : secs) {
if (type == section.getType()) {
result.add(section);
}
}
return result.toArray(new Section[result.size()]);
}
public static void main(String[] args) {
try {
BufferedReader r = new BufferedReader(new FileReader(args[0]));
ArrayList<BigInteger> in = new ArrayList<>();
String l;
while ((l = r.readLine()) != null) {
in.add(new BigInteger(l));
}
System.out.println(largeSum(in).toString().substring(0, 10));
} catch (Exception e) {
}
}
/** Business logic to execute. */
public VOListResponse updateWindowCustomizations(
ArrayList oldRows, ArrayList newRows, String serverLanguageId, String username)
throws Throwable {
Statement stmt = null;
Connection conn = null;
try {
if (this.conn == null) conn = getConn();
else conn = this.conn;
WindowCustomizationVO oldVO = null;
WindowCustomizationVO newVO = null;
for (int i = 0; i < oldRows.size(); i++) {
oldVO = (WindowCustomizationVO) oldRows.get(i);
newVO = (WindowCustomizationVO) newRows.get(i);
TranslationUtils.updateTranslation(
oldVO.getDescriptionSYS10(),
newVO.getDescriptionSYS10(),
newVO.getProgressiveSys10SYS12(),
serverLanguageId,
conn);
}
return new VOListResponse(newRows, false, newRows.size());
} catch (Throwable ex) {
Logger.error(
username,
this.getClass().getName(),
"executeCommand",
"Error while updating customized columns",
ex);
try {
if (this.conn == null && conn != null)
// rollback only local connection
conn.rollback();
} catch (Exception ex3) {
}
throw new Exception(ex.getMessage());
} finally {
try {
if (this.conn == null && conn != null) {
// close only local connection
conn.commit();
conn.close();
}
} catch (Exception exx) {
}
}
}
public static void main(String[] args) {
long start = System.currentTimeMillis();
Scanner input = new Scanner(System.in);
int numberOfTestCases = input.nextInt();
ArrayList<Integer> order = new ArrayList<Integer>(numberOfTestCases);
int previousKey = -1;
int previousValue = 0;
int cycleNumber = 0;
Map<Integer, Integer> testCases = new TreeMap<Integer, Integer>();
for (int i = 0; i < numberOfTestCases; i++) {
int numberOfCycles = input.nextInt();
testCases.put(numberOfCycles, 1);
order.add(numberOfCycles);
}
for (Map.Entry<Integer, Integer> entry : testCases.entrySet()) {
int numberOfCycles;
int initialHeight;
if (previousKey == -1) {
numberOfCycles = entry.getKey();
initialHeight = entry.getValue();
} else {
numberOfCycles = entry.getKey() - previousKey;
initialHeight = previousValue;
}
for (int i = 0; i < numberOfCycles; i++) {
if (cycleNumber % 2 == 0) {
initialHeight *= 2;
} else {
initialHeight += 1;
}
cycleNumber++;
}
entry.setValue(initialHeight);
previousKey = entry.getKey();
previousValue = initialHeight;
}
for (Integer element : order) {
System.out.println(testCases.get(element));
}
long elapsed = System.currentTimeMillis() - start;
System.out.println("time: " + elapsed);
}
public void cleanOutStandingTable(boolean closeAllSell) {
ArrayList<Guid> toBeRemoved = new ArrayList<Guid>();
for (Iterator<RelationOrder> iterator = this._outstandingOrders.values().iterator();
iterator.hasNext(); ) {
RelationOrder relationOrder = iterator.next();
if (relationOrder.get_OpenOrder().get_IsBuy() == closeAllSell) {
toBeRemoved.add(relationOrder.get_OpenOrder().get_Id());
this._bindingSourceForOutstanding.remove(relationOrder);
}
}
for (Guid id : toBeRemoved) {
this._outstandingOrders.remove(id);
}
}
public static String[] getZipList(String zipFile) throws ZipException, IOException {
File file = new File(zipFile);
ZipFile zip = new ZipFile(file);
Enumeration<? extends ZipEntry> zipFileEntries = zip.entries();
ArrayList<String> files = new ArrayList<String>();
// Process each entry
while (zipFileEntries.hasMoreElements()) {
// grab a zip file entry
ZipEntry entry = (ZipEntry) zipFileEntries.nextElement();
String currentEntry = entry.getName();
files.add(currentEntry);
}
return files.toArray(new String[files.size()]);
}
private static void startCDC() throws IOException, Exception {
long remainder = 7;
for (int i = startBoundary; i <= endBoundary; i += increment) {
long minBoundary = min_multiplier * i; // we will set the mod value as the minimum boundary
long maxBoundary = max_multiplier * i; // we will set this as the maximum boundary
long divisor1 = i; // this will be used to mod the results
long divisor2 = i / 2 + 1; // the backup divisor is half the original divisor
long divisor3 = i / 4 + 1;
totalSize =
fileArray.get(1)
.length; // note we only care about the size of the second file since that's the file
// we are measuring
System.out.print(divisor1 + " " + divisor2 + " " + divisor3 + " ");
runBytes(
window,
divisor1,
divisor2,
divisor3,
remainder,
minBoundary,
maxBoundary); // run the karb rabin algorithm
// this is the block size per boundary
double blockSize = (double) totalSize / (double) numOfPieces;
double ratio = (double) coverage / (double) totalSize;
System.out.println(blockSize + " " + ratio);
// clear the hashTable, and counters so we can reset the values for the next round of
// boundaries
coverage = 0;
numOfPieces = 0;
table.clear();
HashClass.duplicate_counter = 0;
HashClass.max_list_length = 0;
}
}
public void ParseSpectralEntry(String line){
//@ToDo, take all values (there are 7)
// Update - now takes all values, but calls them Unknown1,2,3,4 I need to find out what these values represent!
//Not production safe!
String table_ent=Parser.getTableRow(line,new String[]{"WaveLength","Smooth","Unsmooth","Unknown1","Unknown2","Uknown3","Unknown4"});
spectral_table.add(table_ent);
}
void constructBoard(StringBuilder[] board) {
String[] tmp = new String[board.length];
for (int i = 0; i < board.length; i++) {
tmp[i] = board[i].toString();
}
res.add(tmp);
}
// Fill in weights for specific counting aggregator approaches
//
// Basis function 1: Count of computers running
// Basis function 2: Count of computers running and connected to
// one other running computer
//
// Assuming action succeeds... compute next-state value based on action,
// choose best action.
public Action getBasisAction() {
int best_reboot = -1;
double best_reboot_val = -1d;
for (int c = 1; c <= _nVars; c++) {
ArrayList test_state = (ArrayList) _state.clone();
test_state.set(c - 1 + _nVars, TRUE);
double test_val = evalBasisState(test_state, W_BASIS_1, W_BASIS_2);
if (test_val > best_reboot_val) {
best_reboot_val = test_val;
best_reboot = c;
}
}
return (Action) _mdp._hmName2Action.get("reboot" + best_reboot);
}
public String[][] getTabSearchResults(int searchResultID, int rowCount) {
ArrayList<String[]> matches = m_results.get(searchResultID);
if (matches != null) {
if (matches.size() < rowCount) {
rowCount = matches.size();
}
String[][] result = new String[rowCount][];
int i = 0;
for (String[] row : matches) {
result[i++] = row;
if (i == rowCount) break;
}
return result;
} else {
return new String[0][];
}
}
/** @param args the command line arguments */
public static void main(String[] args) throws IOException {
File names = new File("C:\\Users\\FRANKCHUKY\\Desktop\\whotnames.txt");
Scanner sc = new Scanner(names);
v = new Vector<String>();
while (sc.hasNext()) {
String get = sc.nextLine();
v.addElement(get);
}
ArrayList<Vector> view = share(v);
player1 = view.get(0);
player2 = view.get(1);
place.addElement(v.elementAt(0));
v.removeElementAt(0);
int determine = rules(place.elementAt(place.size() - 1), player1, player2, v);
System.out.println(view);
// System.out.println(player2);
}
