eduardoleon

pyon% sage
┌────────────────────────────────────────────────────────────────────┐
│ SageMath version 9.2, Release Date: 2020-10-24                     │
│ Using Python 3.9.4. Type "help()" for help.                        │
└────────────────────────────────────────────────────────────────────┘
sage: P.<x,y,z,w> = PolynomialRing(CC)
sage: d = 4
sage: I = Ideal([w*y^d - x*x^d, w*z^d - y*x^d])
sage: J = Ideal([w*y^d - x*x^d, w*z^d - y*x^d, w*w^d - z*x^d])
sage: p = I.hilbert_polynomial()

eduardoleon

#!/usr/bin/python
import os
import subprocess
import sys

def extract_media(path):
    args = ['unzip', path, '*media*']
    subprocess.run(args)

def list_media(path):

eduardoleon

pyon% poly
Poly/ML 5.8 Release
> datatype foo = Foo;
datatype foo = Foo
> val mine = Foo;
val mine = Foo: foo
> datatype foo = Foo;
datatype foo = Foo
> val yours = Foo;
val yours = Foo: foo

eduardoleon

#include <stdio.h>
#include <stdlib.h>

struct tree {
     struct tree *left;
     struct tree *right;
};

struct stack {
     int           state;

eduardoleon

#include <stdio.h>
#include <stdlib.h>

struct tree {
     int          value;
     struct tree *left;
     struct tree *right;
};

struct stack {

eduardoleon

#include <stdio.h>
#include <stdlib.h>

struct stack {
     int           state;
     void         *current;
     struct stack *next;
};

struct graph {

eduardoleon

#include <stdio.h>
#include <stdlib.h>

struct tree {
     int          value;
     struct tree *left;
     struct tree *right;
};

struct stack {

eduardoleon

#include <stdio.h>
#include <stdlib.h>

struct tree {
     int          value;
     struct tree *left;
     struct tree *right;
};

struct stack {

eduardoleon

#include <stdio.h>

struct node {
     int          value;
     struct node *next;
};

void uniquify_head(struct node *head)
{
     struct node *node = head;

eduardoleon

R_LIBS=~/programs/rpkg