From 4d35f463da308f240b64b30dfe4f38dc0c15a486 Mon Sep 17 00:00:00 2001
From: Jules Laplace <julescarbon@gmail.com>
Date: Mon, 14 May 2018 22:57:10 +0200
Subject: okayyyyyyy

---
 gen-prime.sh | 6 +++---
 model.py     | 3 ++-
 2 files changed, 5 insertions(+), 4 deletions(-)

diff --git a/gen-prime.sh b/gen-prime.sh
index f9f7469..7004153 100755
--- a/gen-prime.sh
+++ b/gen-prime.sh
@@ -47,15 +47,15 @@ function gen_prime () {
   tag="${tag}_longsubsequence"
   echo "__________________"
   echo ">> saving $exp_name - $tag"
-  ./latest.pl -n $tag -l $exp_name
+  # ./latest.pl -n $tag -l $exp_name
 }
 
 function gen_prime_set () {
   # gen_prime $1 6 44100 'zero'
   # gen_prime $1 6 44100 'noise'
   # gen_prime $1 6 44100 'sin' 440
-  gen_prime $1 6 4400 'noise' 0 0 True
-  gen_prime $1 6 4400 'sin' 440 0 True
+  gen_prime $1 6 100 'noise' 0 0 True
+  gen_prime $1 6 100 'sin' 440 0 True
 }
 
 gen_prime_set jwcglassbeat
diff --git a/model.py b/model.py
index 92ad460..6435eb4 100644
--- a/model.py
+++ b/model.py
@@ -369,6 +369,7 @@ class PrimedGenerator(Runner):
         # but maybe we want to generate the subsequence bottom_frame_size length
         # and then draw from that, although this will really emphasize the recursion
         def get_sub_sequence(i, n):
+            print("get subsequence {} {}".format(i, n))
             sub_sequence_a = sequences[:, i-n : i]        # generated
             sub_sequence_b = out_sequences[:, i-n : i]    # recursive
             tmp_sub_sequence = tmp_sequences[:, i-n : i]  # tmp/output
@@ -384,7 +385,7 @@ class PrimedGenerator(Runner):
         print("ENTERING LOOP....")
 
         for i in range(self.model.lookback, self.model.lookback + seq_len):
-            if (i % 1000) == 0:
+            if (i % 100) == 0:
                 print("{}...".format(i))
 
             for (tier_index, rnn) in \
-- 
cgit v1.2.3-70-g09d2