/tech/ - Technology★

>>793034 (OP)

unixtime(this_post) % 145, how fucked would I be?

not doing anything on this list because I've got enough shit to do as is

>>793035

>sierpinski triangle

well that's fucking boring.

/tech/ doesn't program

>>793034 (OP)

Trying out embedding/extending. I'm both regretting the fact that I wrote custom file formats for config files instead of using Lua but also excited by getting a REPL inside my program.

Trying to identify islands in an image but I'm retarded. I want to hilight regions as if by using a fuzzy select and then get data such as dimensions, color vs global values and surrounding islands to feed into another program.

I decided to make a terminal-based browser of sorts. Instead of using HTML and CSS, it uses it's own format. Each page is a YAML file with a list of instructions, such as drawing a border or line, or adding text. It supports foreground and background colours too. It assumes the terminal is 80x24 for now, but I'm planning on expanding that.

It's mostly an excuse to mess with dispatch tables. The main loop for processing each instruction is a simple:

for (@{$yaml->[0]->{draw}}) {
    $draw{$_->{command}}->($_);
}

>>793034 (OP)

>opengl

>>>/v/

>>793181

>implying opengl is useful only for games

>>793146

>current_perl + 0.18

>not writing it as for ($yaml->[0]{draw}->@*) {

What are some employable things to learn?

Django

ReactJS & Angular (how common?)

Firebase (for android dev.. don't really know what's common 'stack' there or just plain android SDK)

Java EE (that shit gives me cancer.. everything has a dependency of dependency with their separate XML config files)

I'm too dumb to work with C, sure I can use it for hobby projects but I suck at math and logical thinking.

>>793034 (OP)

Let's see what I get.

>>793260

well i guess math only. i can do threading and stuff like that but often C programs have things that really need math like reggressions or quaternions.

>>793253

Is there list of syntax changes like that somewhere? @* just brings up irrelevant stuff.

>>793279

What are you using to learn gtk?

>>793286

The tutorials on the Gnome Developer site. It probably isn't the best way to learn it, but it seems to cover most of the important concepts like frames and events and such that you would expect out of a GUI library.

>>793279

>Gtk+

>yfw Gtk+ is a recursive acronym that contains a recursive acronym that contains a recursive acronym

>yfw Gtk+ means GNU's Not Unix Image Manipulation Program Toolkit

>yfw you have no face, but if you did, it would be some fucked-up repeating fractal

>>793279

Qt

>>793336

>xlib

>not xcb

I tried programming, but i had trouble implementing a linked list as an object, so maybe I'm just retarded. Goodbye, off to kill self. Gonna stay a mechanic and just enjoy computers as a hobby.

Hey Angular guys, help me out on something. I'm a newb to the framework and I can't figure out this basic thing: Say I have a parent component, inside it is a child component with the directive *ngFor. Now say my parent component has a button. When I click that button, how can I make all of my child components run a particular method?

>>793606

> Hey Angular guys,

>>>/r/programming

>>793604

Don't worry too much about it, just knowing what linked lists are puts you above a fuckton of programmers.

What language are you trying it in?

>"open public API"

>requires sign up with name, company, intended use-case, card number, DNA sample, and the soul of your firstborn son

What did they mean by this?

>>793604

The OOP meme claims another victim.

>>793604

>implementing a linked list

Found your problem.

Our team is proposing an OS architected entirely around circles and the mathematical beauty of Pi. We eliminate all rectangular elements, which represent the lesser reptilian brain, by the grace of God. It shall be called CYCLESOS. It will have an API to interface with all non-rectangular elements of TempleOS via 9-pin round connectors. We begin by eliminating all support of any draw calls to 90 degree angles.

>>793732

As part of our mandate, all data structures will be cyclic graphs.

Today I implemented general problem solver in Erlang.

What are you working on, /tech/nologists?

Software clone of a hybrid wavetable synthesizer of the 80s. VST/LV2 and C++

I am collecting information on the analog filter and I try to find a fitting model.

>>793587

Hardmode: sha-256

Hey, tech! Is there any good way to authenticate RSS users? I want expose my app's feed as RSS but each user has some private data in his feed, so I do not want everyone to have access to that data.

Rolling.

Trying to improve my Go.

I've never programmed python before (Only know C, x86 (32 and 64 bit) ASM, z80 ASM, C++, a little amount of C#, and some haskell. I decided to take a jab at writing some python code. I want you all to tear me apart here. Give me everything I did wrong, why I suck,

and what I need to read.

Ignore the while 1, thats just cause I was lazy. And the two random gens are one for letters, one with letters and digits. I guess I should make the user choose which one rather than editing the code.

import sys
reload(sys)
sys.setdefaultencoding('utf8')
import urllib
import random, string
from BeautifulSoup import BeautifulSoup
import os
from termcolor import colored
header =  "       ==== URL SHORTENER FUZZER ===      "
def randomword(length):
   letters = string.ascii_letters
   letters = letters.replace(" ", "")
   return ''.join(random.choice(letters) for i in range(length))

def randomall(length):
	letters = string.ascii_letters + string.digits
	return ''.join(random.choice(letters) for _ in range(length))

def GrabWebsite(site):
	link = site + randomword(6)
	reply = urllib.urlopen(link)
	code = reply.getcode()
	if code == 404 or code == 403:
		back = "1 " +  link

	else:
		soup = BeautifulSoup(urllib.urlopen(link))
		if soup.title is None:
			back = "No Title"
		else:
			soup = soup.title.string
			if soup is None:
				back = "No Title"
			else:
				back = link + " : " + soup.decode('utf-8')
	return back
def stats(siteOUT, ranAlready, FourOFour, TwoHundos):
	print colored(header , "green") + "\n\n"
	print colored("404's : ", "red") + colored((str((FourOFour / (ranAlready * 1.000)) * 100) + "%"), "red")
	print colored("200's : ", "cyan") + colored((str((TwoHundos / (ranAlready * 1.000)) * 100) + "%"), "cyan")

	return 0;


os.system("clear")
print colored(header, "green") + "\n\n"
site = raw_input("Website to fuzz: ")
os.system("clear")
x = 0
FourZeroFour = 0
TwoHundos = 0
f = open("FuzzOut.log", "w")
f.close
file_object = open("FuzzOut.log","r+")
file_object.write("T\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n")
while 1:
	file_object.seek(0)
	x += 1
	siteOUT = GrabWebsite(site)
	if siteOUT[0] == "1":
		FourZeroFour += 1
	else:
		TwoHundos += 1
		file_object.seek(x)
		file_object.write(siteOUT.encode('utf-8'))
		file_object.seek(0)
	os.system("clear")
	stats(siteOUT, x, FourZeroFour, TwoHundos)
	readfile = file_object.readlines()
	print "URLBeingRan: " + siteOUT[2::]
	print "\n\n ---- LAST 10 FOUND SITES ----"
	for line in readfile[-10::]:
		print line

roll

fuck reroll

roll

>>797706

reroll????

roll

>>797735

>rust and microshit visual c++ build tools first

>microshit visual c++ build tools first

>microshit

Visual C++ thing is required only if you are using Rust on windows.

Why are you calling them microshit if you support them by using their product?

>>797736

im currently visiting my parents and didn't take my laptop with me, so i enriched my mothers laptop with rust

roll

>>797741

IP...

Tracking...

Visualization... ?

I know what all of those words mean...

>>797738

I hope you obtained her consent before culturally appropriating her precious megabytes

>>797657

Use Python 3 instead of 2, and get off Windows. This is just generically bad code, it doesn't even reach the stage of being bad Python.

Your random* functions duplicate functionality and the only difference is the data they use. Make it a single function and pass "letters" as an argument (this will also make it more convenient for you to change depending on user input). Also, consider generating "letters" variables at the top-level instead of every single time you call these functions.

The code in your top level below the stats function should be moved into its own scope. You could wrap it in a main function and call it after checking that Python is calling the script directly.

if __name__ == "__main__":
    main()

With those os.system("clear") calls, overly complicated prints, and that log file, I think you miss the point of how stdout/stderr is meant to be used. You should be using them to log (you can redirect stdout to a file).

By the same token, you should prefer using command line arguments over raw_input() to get input. Interactivity like this just makes your script inconvenient to use.

You said to ignore that infinite loop, but you really should at least surround it with a try-except, so you can catch any KeyboardInterrupt and terminate your program gracefully (e.g. by closing files).

There's probably more but these are a few initial criticisms. Don't worry, many beginners write code like this.

>>793034 (OP)

Honestly feel bad about coming here because I'm working on homework and it just seems I'll never be good because I feel like I can't into clever, non-pajeet solutions.

>>793610

C++. I actually got it done, but it was hell, and I have a bug where I can't delete the last node in the list.

>>797975

post your assignment. i will give you a clever solution in rust

>>797980

I'd rather not, because prof considers it cheating to ask for outside help, and I'm sure he browses these boards. Also

>rust

Why is this popular?

>>797987

>he browses these boards

wtf????

>Why is this popular?

<Rust is a systems programming language that runs blazingly fast, prevents segfaults, and guarantees thread safety.

<zero-cost abstractions

<move semantics

<guaranteed memory safety

<threads without data races

<trait-based generics

<pattern matching

<type inference

<minimal runtime

<efficient C bindings

here is my public key: https://ghostbin.com/paste/r6m4p

send me the assignment encrypted. your prof wont be able to proof anything.

>>797991

I mean, I suspect he does. I'll post it, but don't post any code. I'm actually right about done with it, but I suspect everyone has it easier than me in this class.

    • Create an empty set and add items to it. Uniqueness of items within the set must be maintained
    • Deletion of an item from the set. This deletion must not lose any data other than the given element to be deleted. 
    • Print out the elements currently contained within the set. They will be printed out as {element1, element2, …}
    • Union between sets, as defined in class
    • Intersection of sets, as defined in class
    • Difference of sets, as defined in class
    • In this archive there are 4 small data files int1, int2, int3, int4. Each one represents a set. Your program will load the data from each list into individual sets and be able to evaluate the following three set equations (Note S1 refers to the set found in int1, S2 to int2, …). We may test your program using different (but similarly sized) data sets, so your program should be able to handle files specified by the user as opposed to hard coding the file names in. Your program must print out each equation, and then display the result. Display of the work during intermediary steps is not necessary for the final submission, but it may be helpful for debugging purposes during coding. You will NOT be counted off if the work is left in the final submission. Example output: EQ1: S1 ∪ (S2 - S3) = {1,2,3,4,5,6,7,8,9,10}
        ◦ ((S1 ∪ S4) – S3) ∩ S2
        ◦ (S1 ∩ S2) ∪ ((S3 – S2) – (S4 – S1))
        ◦ S4 – S3 – S2 – S1 
        ◦ (S3 ∪ ((S1 – S3) ∩ (S2 ∪ S4) 

A basic hash table implementation will be provided, bonus points will be given if you create your own implementation. Each implementation and the resulting analysis is worth 1/3 of the assignment grade. Due to the small size for most of the datasets, we will do this analysis by counting the loop iterations our various set operations go through as opposed to a time metric. As an example, the loop in the pseudocode below will execute the inner loop between 1 to m times, where n is the size of the array, and the outer loop 1 to n times, giving it a big-O of O(m*n). 
for(int i = 0; i < set.size(); i++)
for(int j = 0; j < array.size(); j++)
	if(set[i] == array[j])
		break 

>>797993

https://play.rust-lang.org/?gist=ae2c928c71ba0c4ca196c24f9971788b&version=stable

>>797647

HTTP Basic Auth

>>797993

Python already has sets, but I implemented a new one with those requirements.

class Set(object):
  "A set implementation."
  def __init__(self, *args):
    self.items = []
    for arg in args:
      self.add(arg)

  def __str__(self):
    "String representation of this object."
    return "{"+", ".join(self.items)+"}"

  def __repr__(self):
    "The representation of this object."
    return "<Set "+str(self)+">"

  def __add__(self, other):
    "Add an item based on its type."
    if isinstance(other, Set):
      return Set(*(self.items+other.items))
    elif isinstance(other, list):
      return Set(*(self.items+other))
    else:
      raise TypeError("Can only concatenate list or Set (not \"{}\")"
          .format(type(other)))

  def __or__(self, other):
    "Does an union with another set."
    assert isinstance(other, Set), \
      "other object is not a Set"
    return self.union(other)

  def __and__(self, other):
    "Does an intersection with another set."
    assert isinstance(other, Set), \
      "other object is not a Set"
    return self.intersect(other)

  def __xor__(self, other):
    "Returns the difference of two sets."
    assert isinstance(other, Set), \
      "other object is not a Set"
    return self.difference(other)

  def __getitem__(self, key):
    "Returns an item on index key."
    return self.items[key]

  def add(self, item):
    if not item in self.items:
      self.items.append(item)

  def remove(self, item):
    assert item in self.items, \
      "Item not in set"
    self.items.remove(item)

  def union(self, other):
    return self + other

  def intersect(self, other):
    concat = self.items + other.items
    intersect = [i for i in concat
      if i in self.items and i in other.items]
    return Set(*intersect)

  def difference(self, other):
    concat = self.items + other.items
    difference = [i for i in concat
      if not (i in self.items and i in other items)]
    return Set(*difference)

if __name__ == "__main__":
  a = Set(1, 2, 3)
  print(a) # {1, 2, 3}
  print(repr(a)) # <Set {1, 2, 3}>
  print(a + 7) # {1, 2, 3, 7}
  print(a + Set(4, 5, 6)) # {1, 2, 3, 4, 5, 6}
  print(a | Set(2, 3, 4, 5)) # {1, 2, 3, 4, 5}
  print(a & Set(2, 3, 4, 5) # {2, 3}
  print(a ^ Set(2, 3, 4, 5)) # {1, 4, 5}

>>798059

There are a few bugs in this, here's the fixed version:

class Set(object):
  "A set implementation."
  def __init__(self, *args):
    self.items = []
    for arg in args:
      self.add(arg)

  def __str__(self):
    "String representation of this object."
    return "{"+", ".join(map(str, self.items))+"}"

  def __repr__(self):
    "The representation of this object."
    return "<Set "+str(self)+">"

  def __add__(self, other):
    "Add an item based on its type."
    if isinstance(other, Set):
      return Set(*(self.items+other.items))
    elif isinstance(other, list):
      return Set(*(self.items+other))
    else:
      raise TypeError("Can only concatenate list or Set (not \"{}\")"
          .format(type(other)))

  def __or__(self, other):
    "Does an union with another set."
    assert isinstance(other, Set), \
        "other object is not a Set"
    return self.union(other)

  def __and__(self, other):
    "Does an intersection with another set."
    assert isinstance(other, Set), \
        "other object is not a Set"
    return self.intersect(other)

  def __xor__(self, other):
    "Returns the difference of two sets."
    assert isinstance(other, Set), \
        "other object is not a Set"
    return self.difference(other)

  def __getitem__(self, key):
    "Returns an item on index key."
    return self.items[key]

  def add(self, item):
    if not item in self.items:
      self.items.append(item)

  def remove(self, item):
    assert item in self.items, \
        "Item not in set"
    self.items.remove(item)

  def union(self, other):
    return self + other

  def intersect(self, other):
    concat = self.items + other.items
    intersect = [i for i in concat
      if i in self.items and i in other.items]
    return Set(*intersect)

  def difference(self, other):
    concat = self.items + other.items
    difference = [i for i in concat
      if not (i in self.items and i in other.items)]
    return Set(*difference)

if __name__ == "__main__":
  a = Set(1, 2, 3)
  print(a) # {1, 2, 3}
  print(repr(a)) # <Set {1, 2, 3}>
  print(a + [7]) # {1, 2, 3, 7}
  print(a + Set(4, 5, 6)) # {1, 2, 3, 4, 5, 6}
  print(a | Set(2, 3, 4, 5)) # {1, 2, 3, 4, 5}
  print(a & Set(2, 3, 4, 5)) # {2, 3}
  print(a ^ Set(2, 3, 4, 5)) # {1, 4, 5}
  print(a[0], a[1], a[2]) # 1 2 3

>>798049

without macros: https://play.rust-lang.org/?gist=b877be72ceb638edb5ec2dea98c67d7f&version=nightly

>>797929

>Use Python 3 instead of 2

No, use python 2. There's nothing good in python 3 that hasn't been backported. The only thing 3 gives you is reduced library compatibility. Skip 3, wait for 4.

I did rust for a while, but the syntax really stikes me as very explicit. I'm looking to write either a blockchain or a kademlia DHT with it. I'm waiting for these recent RFCs that go accepted to be implemented (GATs are gonna be dope)

I'm reading haskell from first priciples, lambda calculus is fun, I'm going t use it for blockchain related adventures.

>>798261

>listening to Zed Shaw

>>798274

>using a non turing complete language becuase it has the bigger version number

>>798278

In computer science a fundamental law is that if I have one Turing Machine I can build any other Turing Machine. If I have COBOL then I can bootstrap a compiler for FORTRAN (as disgusting as that might be). If I have FORTH, then I can build an interpreter for Ruby. This also applies to bytecodes for CPUs. If I have a Turing Complete bytecode then I can create a compiler for any language. The rule then can be extended even further to say that if I cannot create another Turing Machine in your language, then your language cannot be Turing Complete. If I can't use your language to write a compiler or interpreter for any other language then your language is not Turing Complete.

Currently you cannot run Python 2 inside the Python 3 virtual machine. Since I cannot, that means Python 3 is not Turing Complete and should not be used by anyone.

>>798280

>copypasting Zed Shaw's retardation instead of actually understanding the concept of Turing Completeness

>>798280

I thought you were retarded at first, but now I see you're just pretending.

>>798274

Give me a reason to use python 3 that isn't because the number is bigger.

>>798290

* Increased syntactic consistency

* Unified type for real numbers

* Better standard library

>>798296

rust has all of those and much more

>>798298

Does it have sane people using it?

>>798298

Also included in rust:

* horrible syntax

* not adopted widely

* fewer learning resources available (compared to C/C++)

* Vec<Rc<RefCell<Box<Trait>>>>

* CoC

* Steve Klabnik

>>798300

https://www.rust-lang.org/en-US/friends.html

>>798302

>muh syntax

>Vec<Rc<RefCell<Box<Trait>>>>

>CoC

>Steve Klabnik

kys

>muh adoption

for a language that is ~2.5 years old it's adoption is quite good

>fewer learning resources available

it doesn't need as many because it isn't such a clusterfuck as c++

>>798304

The adoption is just the beta tester generation. Once Rust actually releases anything stable they'll move on to the next corporate abortion.

>>798304

>kys

T.N. kys means "you're right"

>>798296

>Increased syntactic consistency

Oh yeah, that's way better than having compatible libraries. Good job.

>Unified type for real numbers

Who the fuck uses real numbers in raw python? Everyone that needs those uses numpy.

>Better standard library

Everything was backported or replaced with a less braindead library (see: asyncio).

Once again, the python 3 crowd showing they really just use it because the number is bigger and don't know any better.

>>798361

>Oh yeah, that's way better than having compatible libraries. Good job.

>changing syntax between MAJOR versions is bad

>Who the fuck uses real numbers in raw python? Everyone that needs those uses numpy.

Not an argument. This is obviously an improvement.

>Everything was backported or replaced with a less braindead library (see: asyncio).

Backported, causing months of duplicated effort.

Once again, the python 2 crowd showing they really just use it because it's hip and cool to dislike things other people do.

>>798367

>obviously an improvement

>to a feature zero people will ever see as everyone uses numpy on top of the raw types as python is otherwise useless for math

I'm still laughing that you even brought this up as a reason to use python 3. You must have never used them.

>Backported, causing months of duplicated effort.

How the fuck would this matter for my decision to use python 2 or 3? The reality today is that python 2 and 3 are nearly identical other than python 3 having WAY less library compatibility. Even flup doesn't have an official python 3 version and Debian doesn't maintain it[1]. How much duplicated effort would it be for me to port and maintain all the libraries I need? Fucking LARPing moron.

[1] https://bugs.debian.org/cgi-bin/bugreport.cgi?bug=873492

In C++, why isn't it legal to pass an array of ifstream type pointers to a function? Seems I can open the files into that array, but cannot traverse the array once passed.

>>798443

Post code, you sound like you don't know what you're doing.

>>798447

>you sound like you don't know what you're doing.

If only you knew how right you were.

    std::ifstream fileno[4];
    for(int i = 0; i < 4; i++){
        fileno[i].open(argv[i+2]);
        if(!fileno[i].is_open()){
            errorMessage(1);
            exit(1);
        }
    }
    f(&fileno);

So that's how it starts. Seems to go just fine, and the passing to a function just breaks.

What I'm trying to do once it gets to that other function is this

for(int i; i < 4; i++){
        while(*file[i] >> x){
            h[i].push(x);
        }
}

>>798466

Different anon - pass it as f(fileno) to a function defined as void f(std::ifstream *fileno). While you could do void f(std::ifstream (&fileno)[4]), that's disgusting, don't do it. It's awkward if you learned C++ before C because this is where C++ shits the bed but C programmers don't notice as they'd not have tried doing it.

>>798477

Tried that.

>>798478

You'll also need to access it like (*file)[i].

>>798482

Ah, that probably makes the difference.

>>797929

I'm not using windows, have been using linux for the last 6 years. And Void linux for 3.

Oh yeah I removed the extra random function and made a toggle at the beginning to allow you to choose specifics by editting the Ascii strings to include different characters.

Taken note on the stdout going to work on that now. Also with the command line args.

Thank you a lot man, I appreciate the help

>>798526

Learning programmers on Windows are notorious for using os.system(), hence my false assumption. Also, I realise I didn't explain enough about stdout/stderr.

A good general rule is to use stdout for nothing other than logical program output (in your case, that might be something like the URL followed by title for every site you find). This allows you to pipe the output of your script to another script to perform tasks without having to worry about filtering out unrelated messages. stderr is then used for debug/error/info/diagnostic information that you wouldn't typically want sent to another program.

If you do want to make a nice interactive UI for your program, you can look into using something like tkinter/gtk/qt for a GUI or curses for a terminal-based interface. Programming for a UI requires a bit more legwork than throwing together a script.

Glad you got something out of it.

Having fun with dates. DST is like a spot of sunshine in an otherwise sane world.

I mean why would day+1 == day+1.

>>801645

use https://flutter.io/

it is the future of mobile dev

>>801647

no

>>801664

not an argument

>>797332

But can it solve my alimony payments

>>801647

as of now flutter is a meme. still in alpha.

I have to write a cross platform iPhone/Android app with AES encryption, bluetooth, networking, and use of a lot of fragments. at least fragments are what they're called in Android. I was looking at cordova, but even in that the bluetooth support isn't looking the best. need to use plugins. anyone have a suggestion of what I should use?

>>801817

>AES

kek. use keccak for crypto

https://keccak.team/keyak.html

So apparently my compsi prof uses Allman-style brackets. I use Stroustrup because unlcle Bjarne's book was the first one I read on the subject and also because I came off reading K&R while I was debating doing programming. His is a slight variation on this.

So, I guess my question is, what does /tech/ prefer? And why? I find Stroustrup-syle more readable, because the bracket can be traced back to what is actually encompassing it instead of another bracket, and makes code more compact.

>>802032

I use strousoup even though I didn't know it was called that. The reason I use it is because of readabilty and also I must admit I am partial to some nice soup. Chicken soup or even mushroom soup. Soup soup soup. Soup style is the best. Yay soup!

>>802045

>soup

Moot, is that you? If so, fuck you.

>>798478

Tried that and what happened?

>>798482

What? That would dereference the first stream and call operator[] on it, wouldn't it?

Using [] on a pointer already dereferences it, so the syntax is the same as it would be on an array.

>>802107

>Tried that and what happened?

I did it wrong. You were actually correct. I turned in the assignment and it all worked.

>>801918

AES is perfectly fine. Secure and simple. On desktop I just have aes.c and aes.h for encryption with no other dependencies. Java has AES support built in. Probably what I'm going to end up doing for the app though is Phonegap and writing some of my own native code if I can't find plugins.

Also will use a JsAES for encryption there http://point-at-infinity.org/jsaes/

>>802357

>JsAES

Ah fuck nvm it's got pozzed licensing. Here's one with MIT https://github.com/ricmoo/aes-js

>>802359

>using crypto implemented by js retards

are you fucking kidding me?????????

>>793034 (OP)

Rolling, but this had better be quick.

XBF - eXtensible BrainFuck

>>802359

>GPL

>pozzed

>have my MIT cuck license instead

Yeah, we're onto you.

im reading a book called c++ for dummies gave it a break because shit's heavy in math and calculations.

>>802638

You might not be cut out for programming.

>>793034 (OP)

>What are you working on, /tech/?

Nothing right now, I learn enough to be a little bit better than beginner tier at C++, contribute small amounts to vidya projects on jewhub and then stop for a year and forget everything I learned. I have a terrible memory and shit concentration I need to fix that so rollan for a project.

>>793034 (OP)

>What are you working on, /tech/?

Started working my way through 'Build your own Lisp' yesterday. It's been pretty smooth sailing so far. I'm about halfway through.

>>802701

I learned C from The C for dummies books, but I was in middle school then.This was also back before amazon, and the local pleb bookstores didn't carry K&R. The Hastings had both volumes of C for Dummies, so that's what I got.

Once I learned C, one of the first things I did was port a TiBasic game from my graphing calculator.

>>802638

Keep at it, you'll have fun once you've learned everything.

>>797991

You can get all of that (or all the important parts anyway, type inference is overrated) in other languages. Take your shittily typed overly hyped shitty syntax snake oil and get out.

>>803045

>you can get memory safety without gc and thread safety in other languages

such as??????????

>muh syntax

>>802638

If you need help with the "heavy calculations", post a question.

>>793034 (OP)

last thing i did was add a small feature to a decoder ring command line program that i developed for the sole purpose of deciphering encrypted messages in RuneScape clue scrolls.

roll

>>803224

i'm not a real programmer. reroll

>>793034 (OP)

>What are you working on, /tech/?

Today I created my first elisp function, it is simple function that takes text as input and outputs comment with that text.

Extending emacs was easier than I expected.

>>803253

Nice. I think you only understand Emacs (or any editor) once you learn to write extensions for it.

>>797977

if you're still lurking, post the code anon

So I was drawing simple charts from data.

Started out with Ruby because I don't really know it but it seems cool. The first few hours everything was going great, defaults all worked and looked nice. Then I realised the library I was using lacked all but the simplest of options and after hacking a few more things in I gave up.

Switched to python. Defaults are terrible. Labels run off the edge of the screen. Everything needs to be hand tweaked to look passable. In the end I was thinking I should have just written my own.

>>804773

Just use perl+graphviz

>>804775

I used GD::Graph before but it looks dated.

Now that I think about it I probably should've looked at javascript.

>>804701

I will post full code when the semester ends, or when I see that I won't be needing it.

>>804806

Fuck you Jeff i need your code now before we have to turn in the assignment, post it you faggot!

>>804808

You don't want to copy my code. It's shit.

>>804818

Is your print_all O(n^2)?

>>804826

Sure thing but if you want to fix that just do something like:

if (!head)
        {
            return;
        }

        Node* node = head;
        while (node->get_next())
        {
            std::cout << node->get() << " ";
            node = node->get_next();
        }
        std::cout << node->get() << " ";

>>804865

>Allman style

>>804869

Thank you for your constructive criticism.

>>804865

store a pointer to the tail in the list that way you dont have to traverse the whole list to append.

also why isnt there a method to add something to the front?

>>804865

store a pointer to the tail in the list that way you dont have to traverse the whole list to append.

also why isnt there a method to add something to the front?

>>804873

>>804876

fucking kill yourself codemonkey

>>804865

>/tech/ actually programming

What is happening???

>>804885

well it is quite bad. but it is at least something

>>804887

i wish that other anon would post his implementation too

>>804885

/prog/ is dead

>>804936

Ignore the spergs and upload it to github

>>804939

What's a good alternative to github? Github locked me out after a student trail I had expired, and it's become a total SJW shithole.

For now I'll upload a zip to mixtape.moe. It does depend on ImageMagick because the CImg library uses that for resizing images and stuff.

https://my.mixtape.moe/usrukd.zip

>>804945

Fuck, you caught me. I was testing cross operating system compatibility.

>>804942

>those comments

C'mon on

>>804951

I actually wrote most of it a few years back, but finally just fixed one last bug. The code and comments are admittedly not great. Constructive, or destructive, criticism is welcome.

>>793034 (OP)

roll

The extent of my programming has been in VBScript in Libreoffice lately, just to do very basic surveying-related stuff. It's pretty crude doing it like that though, might be worth looking into SciPy or something like that.

>>804923

>mersenne twsiter 19937

https://en.wikipedia.org/wiki/Mersenne_Twister

>It was designed specifically to rectify most of the flaws found in older PRNGs

it is actually one of the worst prng's. a complete ant total meme only popular because of c++.

literally even lcg's are better.

>>805058

what should you do instead? public fields?

>>805057

What should be used instead when you're in C++ land?

>>805061

Ding Ding Ding!

>>805062

http://www.pcg-random.org/

>>805066

forgot to add: made by a woman

if you add that to your project, you will instantly get many diversity points

>>805068

>reading a website is too hard for me

>please spoonfeed me

@techreport{oneill:pcg2014,
    title = "PCG: A Family of Simple Fast Space-Efficient Statistically Good Algorithms for Random Number Generation",
    author = "Melissa E. O'Neill",
    institution = "Harvey Mudd College",
    address = "Claremont, CA",
    number = "HMC-CS-2014-0905",
    year = "2014",
    month = Sep,
    xurl = "https://www.cs.hmc.edu/tr/hmc-cs-2014-0905.pdf",
}

>>805070

Okay so it's a tranny, got it.

>>805071

ebin

https://www.cs.hmc.edu/~oneill/index.html

https://www.youtube.com/watch?v=45Oet5qjlms

>>805073

:-_DDD

>>805057

Can't you just use this?

http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine

>>805079

sure but it will give you terrible results if not properly used.

>>805081

How do you use it properly oh great number wizard?

>>805083

by choosing good constants and using a good output function

http://www.pcg-random.org/download.html

a pcg is just an lcg with a permutation applied to the output

>>804982

#!/usr/bin/ruby
##(c) Peter Nornig

def n(nigger) Integer(nigger) rescue false end
def f(nigger) Float(nigger) rescue false end
def atom(nigger)
  if ((n = n(nigger)) != false)
    return n
  elsif((n = f(nigger)) != false)
    return n
  end
  return nigger
end
def read_from_niggers(niggers)
  if (niggers.length == 0) then raise "unexpected EOF" end
  nigger = niggers.shift
  if ('(' == nigger)
    l = []
    while(niggers[0] != ')')
      l.push(read_from_niggers(niggers))
    end
    niggers.shift
    return l
  elsif(')' == nigger)
    raise "unexpected"
  else
    return atom(nigger)
  end
end
def niggerize(ln) ln.gsub('(', ' ( ').gsub(')', ' ) ').split end
def gibs(prog) read_from_niggers(niggerize(prog)) end
def dyad(sym) lambda{|x,y| x.send(sym.to_sym, y)} end
def standard_ghetto
  ghetto = {}
  ['+','-','*','/','<','>','<=','>='].each{ |s| ghetto[s] = dyad(s) }
  ghetto['='] = dyad('==')
  ghetto['tits'] = lambda {|x| x[0] }
  ghetto['ass'] = lambda {|x| x[1..-1] }
  ghetto['gibs'] = lambda {|x,y| [x] + y }
  ghetto['aintnothin?'] = lambda {|x| x == []}
  ghetto['hey-yo'] = lambda {|*x| x[-1]}
  ghetto['yaboys'] = lambda {|*x| Array(x) } 
  ghetto['bigz'] = lambda {|x| x.length }
  return ghetto
end
class Proced
  def initialize(gibsmedat, booty, ghetto)
    @gibsmedat = gibsmedat
    @booty = booty
    @ghetto = ghetto
  end
  def call(*args)
    @gibsmedat.zip(args).each{|p,a| @ghetto[p] = a} ##set args as param vals
    return we_wuz(@booty, @ghetto)
  end
end

$global_ghetto = standard_ghetto()
def we_wuz(x, ghetto = $global_ghetto)
  if x.instance_of?(String) #symbol
    return ghetto[x]
  elsif(x.instance_of?(Integer) or x.instance_of?(Float)) #constant literal
    return x
  elsif(x[0] == 'if')
    (_, test, conseq, alt) = x
    exp = (if we_wuz(test, ghetto) then conseq else alt end)
    return we_wuz(exp, ghetto)
  elsif(x[0] == 'we-wuz')
    (_, var, exp) = x
    ghetto[var] = we_wuz(exp, ghetto)
  elsif(x[0] == 'niglet')
    (_, gibsmedat, booty) = x
    return Proced.new(gibsmedat, booty, ghetto) #ghetto scope
  elsif(x[0] == 'quote')
    (_, exp) = x
    return exp
  else
    pro = we_wuz(x[0], ghetto)
    args = x[1..-1].map{ |arg| we_wuz(arg, ghetto)}
    res = pro.call(*args)
    return res
  end
  return nil
end

def niglipstr(exp)
  if exp.instance_of?(Array)
    return '(' + exp.map{|e| niglipstr(e)}.join(' ') + ')'
  else
    return exp
  end
end

def repl(prompt='weeny say> ')
  while true
    print prompt
    val = we_wuz(gibs(gets))
    if (val != nil)
      puts niglipstr(val)
    end
  end
end

>>805066

Thanks for the tip, maybe I'll implement tranny random numbers, or even make it user specifiable which engine to use. How much do you think poor random number generation might affect a project like this? Basically I shuffle an array of pixel indices for insertion using the PRNG and then insert data at those locations. Obviously it's not meant to be a security oriented program, but it is nice to be more secure/difficult to extract without the seed.

>>804891

Fine, you autist.

List::List(){
    head = NULL;
    current = NULL;
    size = 0;
}

void List::push(int x){
    if(head == NULL){
        head = new Node;
        head->val = x;
        size++;
        current = head;
        return;
    }
    
    current = head;
    while(current->next != NULL)
        current = current->next;
    current->next = new Node;
    current->next->val = x;
    size++;
    return;
}

bool List::pop(int x){
    if(head->val == x && head->next != NULL){
        head = head->next;
        size--;
        return 1;
    }
    if(head == NULL)
    return 0;

    current = head;

    while(current->next != NULL){
        if(current->next->val == x){
            current->next = current->next->next;
            size--;
            return 1;
        }
        else if(current->val == x){
            delete current;
        }
        current = current->next;
    }
}

//print method, do not use
void List::print(){
    current = head;
    while(current->next != NULL){
        std::cout << current->val << ", ";
        current = current->next;
    }
    std::cout << current->val;
    current = head;
    return;
}

int List::getSize(){
    return size;
}

bool List::exists(int x){
	current = head;

	if(x == head->val)
		return 1;
    while(current->next != NULL){
        if(x == current->val){
            return 1;
		}
		current = current->next;
    }
    return 0;
}