Curious, inspiring
29 Jul 2017 | Poetry | webdev poemContinuing from the previous poetry I pushed a little at what could be created, I made up a new set of rules for myself and had a go at what could come out:
- The poetry must be written in any programming language.
- Submitted source code must compile and run.
- Source code should output letter by letter the title of the poem.
- L33t is alowed in the poem, but not in the output.
- Should be passed one function for outputting the letter, and optional helper sorting functions.
- String literals can be used, but should be kept to a minimum
I chose to mainly pass key retrieval functions to let me play with the environment, but these may change in time.
poem = (p,t)=>{
a={ct:'i',o:'n', r:'eact',i:'on',
u:'n',c:'ov',e:'r'}, r=ep=a.r[5-3],
t(r),a.ve,r=5+1,n=g= t,h=e= p(a),t,t(e[r]),n;
a.d,dr=e[5],s= 0,r = {di:'sbu',r:'se'};
t.r,u=s,t( i=n= what= dr),a.ws, yo=u,
c=0,n,t(a.ct), t.he, u=[n,s,e.en],
j=u[s],t, u[s]= a.nd, t(h[4]),t, r.a,f=t,
o=n, t(h[1+5]), o=c=e=a,n= 0,f, g(r[e.e][n]);
}
poem((a)=>{return Object.keys(a).sort();}, console.log);
poem = (n,l) => {
th={e: 's',ea:'r',c:'h', f:'or'}, t={he: 'n',ew:
'g',ro:'ws', g:'reat',er: 'w',i:'t',h: 'ti'},m=e=
t,h=e, m.o,u=n(t),a=1,n, aw=[a,1],ts= u[5],
al=l( tha=ts), le='f',t, i=s= t.he, c=l(i),m=b=
{p:u.l,l:i,ng: 'y',o:u}, o=n(w=ard=(s=
th.e)? m:i),l(e=s), d=r=a.g, b,y=
s.eems+ i.ts? n:o[7- 4],t, th.e, t.op,
a.ll? th.a=t:s= l,e.ft= i.s, t.o, f=l(y),
s.tr,e=t[c='h'][1],n.g, a.nd= s[04],r=i.ng,
th.e, p=a.tt=e.rn, y=0,u, w=34,v=3,
t.ea,r=5, a, h.o,l(e), th.r,o=u,g=h, th[e] +s.ky,
a=ll= t.h[a],t=5, le.f,t+= 1-5, to= le,a.v,e=
th,e, l.igh=t, s.h=4,t.te=r[5]+ 70- 5,h.a,rd=s,
r-=3,f=orm=i,n=g= d=e.f[1],n.es,
inv=1,t=3,s( you= i=n),s.ide,
a.l,l( th=a),t-5, l(e=f),t;
i?s( yo=u[r]):s;
}
poem((a)=>{return Object.keys(a).sort();}, console.log);