These forums have been archived and are now read-only.
The new forums are live and can be found at https://forums.eveonline.com/
Code tags - 't was about time! *smile*
Code Tags
EVEWalletAware - an offline wallet manager.
Creator of Tripwire mapping tool - EVE-O thread
Twitter | daimian.mercer@gmail.com
View real-time damage statistics in-game
>EVE Live DPS Graph application forum thread
>iciclesoft.com
@CCP_FoxFour // Technical Designer // Team Tech Co
Third-party developer? Check out the official developers site for dev blogs, resources, and more.
HIGH06 x Cruise Missile Launcher I01 x SMALL TRACTOR BEAM 101 x SALVAGER IMEDIUM04 x LARGE SHIELD EXTENDERS01 x 'HYPHNOS' ECM01 x MEDIUM SHIELD BOOSTERLOW01 x EMERGENCY DAMAGE CONTROL01 x ARMOR KINETIC HARDENER I01 x ARMOR THREMIC HARDENER I02 x WARP CORE STABILIZER I DRONES02 x WARRIOR I DRONES03 x HAMMERHEAD I DRONESUPGRADES01 x ROCKET FUEL CACHE PARTINTION I01 x BAY LOADING ACCELERATOR I01 x HYDRAULIC BAY THRUSTER I
how to fix eve: 1) remove ECM 2) rename dampeners to ECM 3) add new anti-drone ewar for caldari 4) give offgrid boosters ongrid combat value
EsiPy - Python 2.7 / 3.3+ Swagger Client based on pyswagger for ESI
def fib(n,a=1,b=1): # computes the nth Fibonacci number. if n > 0: f = fib globals()["fib"] = lambda a,b=1,n=1: f(a --- 1,n -- 0,b -- n) return fib(n,a,b) # recursion 101 else: return a -- -- -- b # use -- operator extra times for more power
CCP Nullarbor // Senior Engineer // Team Game of Drones
Local i As DWORDDo While i < 10 StdOut Format$(i), Format$(Fib(i)) Incr iLoopFunction Fib(ByVal n As QUAD) As QUAD If (n <= 2) Then Fib = 1 Else Fib = Fib(n - 1) + Fib(n - 2) End IfEnd Function
< eveOverview > < globalSettings > < columns/ > < useSmallColorTags value="0"/ > < applyOnlyToShips value="0"/ > < hideCorpTicker value="0"/ > < overviewBroadcastsToTop value="1"/ > < shipLabels > < label > < part name="pre" value="<color=0xffa3ff00><fontsize=12>"/ > < part name="state" value="1"/ > < part name="type" value="None"/ > < part name="post" value=""/ > < /label > < /shipLabels > < /globalSettings > < filteredStates/ > < ewarFilters/ >< /eveOverview >
// Long function, it's long.Long function () { is long function is long function is long function is long function is long function is long function is long function is long function is long function is long function is long function is long function}struct group_info init_groups = { .usage = ATOMIC_INIT(2) };struct group_info *groups_alloc(int gidsetsize){ struct group_info *group_info; int nblocks; int i; nblocks = (gidsetsize + NGROUPS_PER_BLOCK - 1) / NGROUPS_PER_BLOCK; /* Make sure we always allocate at least one indirect block pointer */ nblocks = nblocks ? : 1; group_info = kmalloc(sizeof(*group_info) + nblocks*sizeof(gid_t *), GFP_USER); if (!group_info) return NULL; group_info->ngroups = gidsetsize; group_info->nblocks = nblocks; atomic_set(&group_info->usage, 1); if (gidsetsize <= NGROUPS_SMALL) group_info->blocks[0] = group_info->small_block; else { for (i = 0; i < nblocks; i++) { gid_t *b; b = (void *)__get_free_page(GFP_USER); if (!b) goto out_undo_partial_alloc; group_info->blocks[i] = b; } } return group_info;out_undo_partial_alloc: while (--i >= 0) { free_page((unsigned long)group_info->blocks[i]); } kfree(group_info); return NULL;}EXPORT_SYMBOL(groups_alloc);
CCP Avalon // Web Developer // Team Webster // @ccp_avalon
Twitch: CCP_Avalon
public class ThankYou { public static void main(String[] args) { System.out.println("Thank you CCP!"); }}
There is no problem an air strike cannot solve.
[_] Amarr[_] Caldari[X] Gallente[X] Minmatar[_] OtherShips--Frigates----Standard Frigates------Attack (2 hidden)--------Atron--------Slasher------Combat (4 hidden)--------Breacher--------Incursus--------Rifter--------Tristan
Little Things to improve ≡⋁≡ | My Little Things posts
+++++++++++ number of digits to output> #1+ initial number>>>> #5++++++++++++++++++++++++++++++++++++++++++++ (comma)> #6++++++++++++++++++++++++++++++++ (space)<<<<<< #0[ > #1 copy #1 to #7 [>>>>>>+>+<<<<<<<-]>>>>>>>[<<<<<<<+>>>>>>>-] < divide #7 by 10 (begins in #7) [ > ++++++++++ set the divisor #8 [ subtract from the dividend and divisor -<- if dividend reaches zero break out copy dividend to #9 [>>+>+<<<-]>>>[<<<+>>>-] set #10 + if #9 clear #10 <[>[-]<[-]] if #10 move remaining divisor to #11 >[<<[>>>+<<<-]>>[-]] jump back to #8 (divisor possition) << ] if #11 is empty (no remainder) increment the quotient #12 >>> #11 copy to #13 [>>+>+<<<-]>>>[<<<+>>>-] set #14 + if #13 clear #14 <[>[-]<[-]] if #14 increment quotient >[<<+>>[-]] <<<<<<< #7 ] quotient is in #12 and remainder is in #11 >>>>> #12 if #12 output value plus offset to ascii 0 [++++++++++++++++++++++++++++++++++++++++++++++++.[-]] subtract #11 from 10 ++++++++++ #12 is now 10 < #11 [->-<] > #12 output #12 even if it's zero ++++++++++++++++++++++++++++++++++++++++++++++++.[-] <<<<<<<<<<< #1 check for final number copy #0 to #3 <[>>>+>+<<<<-]>>>>[<<<<+>>>>-] <- #3 if #3 output (comma) and (space) [>>.>.<<<[-]] << #1 [>>+>+<<<-]>>>[<<<+>>>-]<<[<+>-]>[<+>-]<<<-]
+++++++++++>+>>>>++++++++++++++++++++++++++++++++++++++++++++>++++++++++++++++++++++++++++++++<<<<<<[>[>>>>>>+>+<<<<<<<-]>>>>>>>[<<<<<<<+>>>>>>>-]<[>++++++++++[-<-[>>+>+<<<-]>>>[<<<+>>>-]+<[>[-]<[-]]>[<<[>>>+<<<-]>>[-]]<<]>>>[>>+>+<<<-]>>>[<<<+>>>-]+<[>[-]<[-]]>[<<+>>[-]]<<<<<<<]>>>>>[++++++++++++++++++++++++++++++++++++++++++++++++.[-]]++++++++++<[->-<]>++++++++++++++++++++++++++++++++++++++++++++++++.[-]<<<<<<<<<<<<[>>>+>+<<<<-]>>>>[<<<<+>>>>-]<-[>>.>.<<<[-]]<<[>>+>+<<<-]>>>[<<<+>>>-]<<[<+>-]>[<+>-]<<<-]