Geck ignoring other esps included in my mod

[JimmyRyder]

Excellent, thank you for such dedication to help me!! Like I said, even though I have Java installed it doesn't detect any .jar files to add as binary when I try (third picture), so once I got this fixed I will follow the rest of your tutorial.

 

Thanks again for putting it in pictures!

Edited July 2, 2020 by JimmyRyder

[Purr4me]

Excellent, thank you for such dedication to help me!! Like I said, even though I have Java installed it doesn't detect any .jar files to add as binary when I try (third picture), so once I got this fixed I will follow the rest of your tutorial.

 

Thanks again for putting it in pictures!

[JimmyRyder]

Check this out, I have no option to add any Java file like you do yet FO3Plugin is in my Data folder...

 

https://i.imgur.com/W8qeFI8.png

Edited July 2, 2020 by JimmyRyder

[Purr4me]

Check this out, I have no option to add any Java file like you do yet FO3Plugin is in my Data folder...

 

https://i.imgur.com/W8qeFI8.png

nah hun you can't use that software to run the program...wait a minute.

 

Download and simply install this https://javadl.oracle.com/webapps/download/AutoDL?BundleId=242058_3d5a2bb8f8d4428bbe94aed7ec7ae784

Edited July 2, 2020 by Purr4me

[JimmyRyder]

EDIT: testing something

Edited July 2, 2020 by JimmyRyder

[Purr4me]

your system then is not set up to view executables

I can show you how too

 

No need to edit or removes your posts, I get the full Monte in my e-mail

 

EDIT: hold on, give me the link to the version of MO 2 you're using at the moment?

 

1 version has issues with binary auto select.

The author's , that's' plural as in a few working on the software in question have some learning to do.

Bellow is what is closer to a model that should have been used. It may not be in the version you currently have.

 

public class BinSearch
{
static int search( int [] A, int K ) {
int l = -1; // index lower bound shift left by 1
int u = A.length; // index upper bound shift right by 1
int m;
while ( l + 1 < u ) {
m = l + (u-l)/2; // avoid overflow
if (A[m] < K){
l = m; // keep A[l] < K
} else {
u = m; // keep A >= K
}
}
if ( (u == A.length) || (A != K) ) return -1;
return u;
}
}

 

 

But I wont know until I test what you have.

Not that it makes any sense to you. this is in-depth coding

Edited July 2, 2020 by Purr4me

[JimmyRyder]

My bad, I realized the Mod Organizer I had was an older version lol. So now that I have updated it, the plugin is finally detected!!

 

Now it works I can add the pluggin. ) I'll follow the rest of your imaged tutorial and if there's anything wrong I'll let you know!

 

Thank you for having been so patient with me. )

[Purr4me]

My bad, I realized the Mod Organizer I had was an older version lol. So now that I have updated it, the plugin is finally detected!!

 

Now it works I can add the pluggin. ) I'll follow the rest of your imaged tutorial and if there's anything wrong I'll let you know!

 

Thank you for having been so patient with me. )

My pleasure.

 

Kitty Black