Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon. Entire thread

High Level Languages that aren't shit

Name: Anonymous 2011-12-03 3:45

Do any exist? I've been looking for something like a high level C. The closest thing is probably Lua, but that's obviously unacceptable. Plus Lua is more C++ and less C. I liked Perl, but Perl 6 is not so good and has left a bad taste in my mouth.

Name: Anonymous 2011-12-05 4:54

rpython
please use tabs instead of spaces

Name: Anonymous 2011-12-06 3:09

>>75
Doesn't look like C at all to me

Name: Anonymous 2011-12-06 11:39

FUCK!

Seriously... I've got a message for 90% of you posting this thread.

It's very simple: GC is shit.

[i]shit[/shit]

Stop trolling now. OP asked for advice and you offer your GC toy languages? Go fuck yourselves. I hope you face horrible deaths.

consider this:
- Java == GC --> shit
- Lisp == GC --> shit
- D == GC --> shit
- Haskell == GC --> shit
- 99% of the suggestions in this thread == GC --> shit

And OP, you just stick with C. If you want higher level features, you should use C++. It doesn't force GC. It's not shit.

GC is shit. I'm not joking.

Name: Anonymous 2011-12-06 11:50

>>83
GC might be shit but Lisp isn't. Also, C++ is an abomination.

Name: Anonymous 2011-12-06 11:59

>>83
C++ might be shit but GC isn't. Also, Lisp is an abomination. Also, fuck off and die you piece of shit.

Name: Anonymous 2011-12-06 12:13

>>84-85
Yeah, you just keep trolling. That's what you know best.

Name: Anonymous 2011-12-06 12:18

>>86
Fuck you lithpfag.

Name: Anonymous 2011-12-06 12:28

>>86
Check out that Intel GET!

Name: Anonymous 2011-12-06 13:57

Let's see, for non-ASM/C/C++ non-GC languages, we have:
pre-Algol-68 (no heap)
BASICs when ignoring the string table, Integer and embedded system BASICs
COBOL (ALLOCATE / FREE)
Forth (ALLOCATE / FREE)
Fortran (ALLOCATE / DEALLOCATE),
Modula-2 (NEW / DISPOSE) but not Modula-2+, Modula-3, Oberon
Objective-C with GC disabled (alloc / new / copy / release)
PL/I (ALLOC / FREE)
Pascal (NEW / DISPOSE / setLength / .create / .destroy)
PostScript Level 1 (no heap?) but not Level 2
RPG (ALLOC / %ALLOC / DEALLOC)

GC but some optional manual memory management?
AutoHotkey (VarSetCapacity)
D had delete but deprecated
Factor ((malloc) / (free), previously malloc)
Object REXX only (RexxAllocateMemory / RexxFreeMemory)
PureBasic (AllocateMemory / FreeMemory)
R (rm)
Retro (allot)
ZX Spectrum BASIC (CLEAR)

Garbage collected:
Everything else worth a shit.

Name: Anonymous 2011-12-06 14:47

>>21
which could be accomplished easily with a script that compiles c with namespaces to c with name mangling.
Name mangling is utter bullshit for anything meant to be interfaced with.

Name: Anonymous 2011-12-06 15:27


dead? U -> U,n? || (and U.Mask TileMasks.Dead)!=0
targetable? U -> U && U.Parent,n?
selectable? U -> U,dead?,n? && U,targetable? && U.HP,pos?
center U -> U.Tile + U.Size%%2
centerDisp U -> U.Disp +16U.Size-[16 16]
distanceToPlayer XY -> abs XY - Units,ThisPlayer,center
prettyName U -> U.UIName || sym (subst "_" " " U.Type,str)
unitUiColor U -> U.Owner==ThisPlayer |> #00FF00 :: Tints.(U.Color)
hp100 U -> H:U.HP (H-U.Hits)*100%%H
actGT N O -> NP:N.Prio OP:O.Prio -> OP<NP || OP==NP && O.Forced,n?
order O U -> O,sym? |> O=:UTs.'O -> Id:(U,xs? |> U.Id :: U)
          -> actGT O Orders.'Id |> Orders.'Id=:O -> U
unitSay S U -> U,int? |> U=:Units,U -> D:n
 -> S:U.Sounds.(S,([N I] -> D=:I -> N; S->S))
 -> snd\play (D|>S,D::S,pick) Volume=1.0-U.Tile,distanceToPlayer/24
act O U -> O,sym? |> O=:UTs.'O -> !O.Dst || U.Id -> !O.Range || U.Range || 1
        -> U.Path |> U.Path=:n -> U.Act=:O
units Is -> map ?,(I:int?->Units,I; U->U) Is

anim A U -> U.Anim =: (U.Anims.'A||U.Anims.Still)
swapAnim D S U -> UTs.(U.Type).Anims.'S |> U.Anims.'D=:It :: U


morph T U -> O:U.Owner T:(T,sym? |> UTs.'T :: T) -> T.Id=:U.Id
 -> T.Owner=:O     -> T.Color=:U.Color -> T.Act=:U.Act     -> T.Tile=:U.Tile
 -> T.Disp=:U.Disp -> T.Dir=:U.Dir     -> T.Frame=:U.Frame -> T.Anim=:U.Anim
 -> T.Hits=:U.Hits -> T.Kids=:U.Kids   -> U.Effects |> T.Effects=:It
 -> U.Fire |> T.Fire=:It -> U.Res |> T.Res=:It -> U.Mana |> T.Mana=:It
 -> skip1 U.Id !Owned,O.(U.Type) => @!Owned,O.(T.Type) T.Id -> T


awayFrom 'f R SR -> RT:~[R R] RS:[2R 2R] take MaxUnits Units
  | all (n?->y; U->rectsIsect [@(U.Tile+RT) @(U.Size+RS)] SR && f U | n?)

efx U Es -> merge !U.Effects Es

flipUnitLayer U -> updArea U (C->xor !C.Mask U.Layer)

mark U -> Id:U.Id S:U.Sight
 -> updArea U (C => @!C.Content Id -> xor !C.Mask U.Layer)
 -> updArea [Tile=U.Tile-[S S] Size=U.Size+[2S 2S]] (C => @!C.Sensors Id)

unmark U -> Id:U.Id S:U.Sight
 -> updArea U (C -> skip1 Id !C.Content -> xor !C.Mask U.Layer)
 -> updArea [Tile=U.Tile-[S S] Size=U.Size+[2S 2S]] (C -> skip1 Id !C.Sensors)

deployUnit XY U => @!U Tile=XY Disp=32XY -> aset U.Id U Units -> mark U

newUnit O T Delay=n -> T,sym? |> T=:UTs.'T -> R:(Delay||rand 6)+1+Cycle
 -> U:[@T Id=FreeIds,pop Owner=O Color=(T.Color||Units,O.Color||{Yellow})]
 -> U.MP |> [@!MUs updMana U.Id]
 -> U.Upgrades |> map (upgrade ? !U) (keep Owned,O.? It)
 => @!Scheds.'R U.Id => @!Owned,O.(T.Type) U.Id -> U

delUnit Id -> U:Units,Id O:U.Owner -> U.Disp |> unmark U -> ~@!Orders.'Id
 -> skip1 Id !Owned,O.(U.Type) => @!FreeIds Id -> aset Id n Units

freeUnit U => @!DelUnits (U,int? |> U :: U.Id) -> U

killUnit U
 -> (and U.Mask TileMasks.Dead)==0 |>
    (-> U.Disp |>
        (-> U.Layer == TileMasks.`2` |>
            (-> U,unmark -> U.Layer=:TileMasks.`0` -> U,mark)
         -> U.Explodes |> spawnFx U.Tile It D=U,centerDisp-[16 16]
         -> U.Building |>
            (-> U.Fire=:n
             -> E:UTs.(U.Extends) R:E.Resource E && (R,n?||U.'R,pos?) |>
                (-> N:(newUnit 0 E.Type) -> deployUnit U.Tile N.'R=:U.'R)))
     -> U.Parent |> [@!Trans 'unkid [It U.Id]]
     -> U.Incomplete,n? && U.Supply |> [[U.Id {Food} ~It]@!NQs.(U.Owner).`+`]
     -> U.Cost.Food |> [[U.Id {Food}  It]@!NQs.(U.Owner).`+`]
     -> or !U.Mask TileMasks.Dead)
 -> U

spawnUnit O T XY A=n TTL=n -> U:[@(newUnit O T) Tile=XY] -> A |> (anim A !U)
 -> U.Building||U.Dir=:Dirs,pick => @!Trans 'show U.Id => U@!NewUnits -> u

DeathAnim ~> (0 0)
StillAnim ~> (0 6)
BuildingAnim => Still={(0 6)} `50`={(1 6)} `25`={(2 6)} `0`={(3 6)}
                Attack={attack (0 60)} Death={(4 200) (5 200)}

chkCost Rs C -> D:(~@C.Time | map ([R A] => R Rs.'R-A))
             -> keep ([_ neg?]->y) D |> D

chkCosts U T
 -> (T.UCost |> chkCost U It) || (T.OCost |> chkCost Units,(U.Owner) It)

canAct U A T
 -> A.Rule |> fc It U A T :: y |>
    (chkCosts U A |> do (notify "Not enough $(It,0,0) for $(A.Type)") n :: y)

enemyOf U X -> fnd X.Owner Units,(U.Owner).Enemies
canAttack U A T -> T && (A.Confirm||enemyOf U T) && (and A.Mask T.Mask)==T.Mask

CoastMask -> TileMasks.Coast
ruleCoast P -> points [@P 3 3] | any (P->(and P,cell.Mask CoastMask)!=0)
ruleGoldMine P -> awayFrom ?.Depot=={Gold} 3 [@P 3 3]
ruleGoldDepot P -> awayFrom ?.Resource=={Gold} 3 [@P 4 4]
ruleOilDepot P -> P,ruleCoast && awayFrom ?.Resource=={Oil} 3 [@P 3 3]

canHarvest U A -> R:U.Resource
 -> R && U.Foundation,n? && (fnd R A.Harvests |> U.'It,pos? && It)
ruleHarvest U A T -> canHarvest T A |> U.'It<100

doHarvest U -> A:U.Act Dst:A.Dst D:Units,Dst R:A.Res
 -> R || (-> R=:(canHarvest D A) -> U.Act.Res=:R)
 -> cnd {U.Parent || D.TileId ->
        ;y => @!Trans 'hide [Dst U.Id] -> U.Act.Sounds=:n -> anim {Still} !U}
 -> U

fixHarvest U -> A:U.Act Id:A.Dst D:Units,Id R:A.Res
 -> cnd {U.'R>=100 -> swapAnim {Move} R !U | swapAnim {Still} "$(R)Still"
                   -> U.Parent |> (=> @!Trans 'show U.Id -> anim {Still} !U)
                   -> act [@UTs.Store Back=Id Res=R Depot=A.Depot] !U
        ;D.TileId && findResource U D.Tile A -> U.Act.Dst=:It
        ;y -> U.Act=:n}
 -> U

resources U -> keep U.?,pos? ResNames

doStore U -> A:U.Act R:(A.Res || U,resources,([R@_] -> U.Act.Res=:R -> R))
    Depot:A.Depot T:(Depot |> Units,Depot) | dead?
    |>(Depot || findDepot R U
       |> U.Act.Depot=:It :: (-> notify "Nowhere to store $R" -> U.Act=:n))
    ::A.State,({Near} -> swapAnim {Move} {Move} !U | swapAnim {Still} {Still}
                      => @!Trans 'hide [Depot U.Id] -> U.Act.State=:{Inside}
              ;{Inside} -> pos? U.'R
                   |> (=> @!NQs.(U.Owner).`+` [U.Id R 5] -> !U.'R-5)
                   :: (=> @!Trans 'show U.Id
                       -> O:(map UTs.? U.Acts | fnd (X -> fnd R X.Harvests))
                       -> order [@O Dst=A.Back Depot=A.Depot] U)
              ; _ -> U.Act.State=:{Near} -> U.Act.Dst=:Depot)
 -> U


ruleMove U A T -> canMoveTo T.Tile U
ruleBoard U A T -> T.Transport && T.Owner==U.Owner
doBoard U => @!Trans 'hide [U.Act.Dst U.Id] -> U.Act=:n
doUnloadSelf U => @!Trans 'show U.Id -> U.Act=:n

produce C U HP=n
 -> O:[@UTs.Producing O=Cycle T=(max 1 24C.Time%%32) Last=Cycle Cost=C]
 -> HP |> (-> U.Hits=:U.HP-1 -> O.AddHP=:U.HP/O.T) -> U.Incomplete=:y -> act O U

ruleBuild U A T -> buildRect T.Tile U UTs.(A.What) | all 'y?

doBuild U -> A:U.Act
 -> B:(newUnit U.Owner A.What) -> B.Tile=:Units,(A.Dst).Tile
 -> E:(map Units,? B.Tile,cell.Content | fnd ?.Type==B.Extends)
    |> (-> R:E.Resource B.'R=:E.'R -> freeUnit E)
 -> swapAnim {Still} "0" !B -> produce A.OCost !B HP=y
 -> B.Anims.Still | ([[F _]@_] -> B.Frame=:F) -> unitSay {Construction} B
 => @!Trans 'hide [B.Id U.Id] 'show B.Id => @!NewUnits B -> U.Act=:n

doTrain U -> A:U.Act P:A.Producing
  |> (-> fnd P U.Kids |> U :: U.Act=:n)
  :: (-> NU:[@(newUnit U.Owner A.What) Tile=U,center Parent=U.Id]
      -> produce A.OCost !NU -> A.Research |> NU.Research=:y
      -> NU.Dir=:Dirs,pick => @!NewUnits NU
      => @!U.Kids NU.Id => @!U.Act Producing=NU.Id OCost=n)

doMorph U -> A:U.Act T:UTs.(A.Into) -> U.MorphTo=:T.Type -> U.Gfxes=:T.Gfxes
          -> produce T.Cost !U -> U.Anims=:T.Anims -> anim "50" !U -> U

doProducing U
 -> A:U.Act fin:(-> swapAnim {Still} {Still} !U | anim {Still}
                 -> max !U.Hits 0 | int -> ~@U.Incomplete -> U.Act=:n)
    cnd {(C:Cycle-A.O) < (T:A.T)
         -> anim cnd,{C/T<1/4->"0"; C/T<1/2->"25"; y->"50"} !U
         -> !U.Hits - (Cycle-A.Last)*A.AddHP => @!U.Act Last=Cycle
        ;U.Research -> T:U.Type O:U.Owner
          -> U.MorphAll |> morphUnits O It T
          -> U.Upgrade |> map (upgradeUnits O ? T) Upgrades.'T
          -> rekid U.Owner U.Id -> fin
        ;U.Parent -> unitSay {Ready} U => @!Trans 'show U.Id -> fin
        ;N:UTs.(U.MorphTo) -> morph N !U -> fin
        ;y -> U.Supply |> [[U.Id {Food} It]@!NQs.(U.Owner).`+`]
           -> U.Kids,([Id@_] -> unitSay {Work_Done} Id -> showKids U) -> fin}

doCancel U
 -> (A:U.Act.What).Type == {Producing}
    |> (-> for [R A]=~@A.Cost.Food [[U.Id R A]@!NQs.(U.Owner).`+`]
        -> U.MorphTo |> (-> U.Gfxes=:UTs.(U.Type).Gfxes -> U.Act=:n)
                     :: (-> showKids U | order {Die}))
    :: U.Act=:n
 -> U

animSpeed [[_ W _]@Xs] -> W+Xs,animSpeed
DummyFrame => 8++DummyGfx
AttackLayers -> map TileMasks.? 0..9 | fold 'or
MCs => Coast={Water Coast} Water={Water} Land={Plain Mud}
       Air={Rock Forest Plain Mud Coast Water Wall}
       Plain={Plain} Wall={Wall} Invuln={Invuln}

Name: Anonymous 2011-12-06 15:42

>>90
Not if mangling is sane.
Just put Average_insertValue instead of insertValue__7AverageFv and I won't care about. Don't people write glRotatef instead of gl::rotate(float) anyways?

Name: Anonymous 2011-12-06 17:30

GC is great, Lisp/C++ is for faggots.

Name: Anonymous 2011-12-06 18:37

>>83
You call all those languages shit, then have the gal to tell the OP to use C++?

What's your problem?

Name: Anonymous 2011-12-06 19:25

>>94
yhbt

Name: >>99 2011-12-06 20:44

>>98
Thanks!

Name: Anonymous 2011-12-06 21:41

check 'em

Name: Anonymous 2011-12-06 23:43

>>97
check what?

Name: Anonymous 2011-12-07 0:07

>>99
dubs!

Name: Anonymous 2011-12-07 5:15

dubs again

holy shit we are on fire

Name: Anonymous 2011-12-07 7:09

Binary JACKSON 5 GET.

Name: Anonymous 2011-12-07 8:56

>>101
not bad

Name: Anonymous 2011-12-07 12:39

base 14 dubz
<---- check em'

Name: Anonymous 2011-12-07 14:12

wanting high level language...

not using vb or delphi

What is this board? L33t kids who just wrote "hello world" in school and think of themselves as cool programmers?

Name: Anonymous 2011-12-07 14:12

4wy4wy

Name: Anonymous 2011-12-07 14:12

4wy4wy4wtt4

Name: Anonymous 2011-12-07 14:33

>>104

Why would anyone want to use vb?

Name: Anonymous 2011-12-07 15:04

>>107
YHBT

Name: Anonymous 2011-12-07 15:17

>>108
The first thing I coded was a silly chess game inside a Word 97 document with VBA macros and forms. It's sad that I needed to read books to learn C and C++ though.

Name: Anonymous 2011-12-07 23:07

wanting to use /g/ speak on /prog/

not going back to /g/

What is this board? L33t kids who accidentally clicked a link to /prog/ someone posted on /g/ in school and think of themselves as cool programmers?

Name: Anonymous 2011-12-07 23:54

>>91

What language is this? Haskell? It makes me want to prolog.

Name: Anonymous 2011-12-08 3:27

>>111
sweet trips bro

Name: Anonymous 2011-12-08 3:42

>>112
thanks bro

Name: Anonymous 2011-12-08 3:57

SQL

Name: Anonymous 2011-12-08 5:36

>>111
I'm going to guess Erlang
Newer Posts
Don't change these.
Name: Email:
Entire Thread Thread List
All trademarks and copyrights on this site are owned by their respective parties. All comments and posts are the responsibility of their own posters.
- Tinychan + 2ch Mode -