about summary refs log tree commit diff stats
path: root/shell
Commit message (Collapse)AuthorAgeFilesLines
* .Kartik K. Agaram2021-10-111-0/+12
|
* .Kartik K. Agaram2021-10-031-1/+1
|
* fix bad terminology: grapheme -> code pointKartik K. Agaram2021-08-292-5/+5
| | | | | | | | | | Unix text-mode terminals transparently support utf-8 these days, and so I treat utf-8 sequences (which I call graphemes in Mu) as fundamental. I then blindly carried over this state of affairs to bare-metal Mu, where it makes no sense. If you don't have a terminal handling font-rendering for you, fonts are most often indexed by code points and not utf-8 sequences.
* .Kartik K. Agaram2021-08-281-3/+2
|
* move gap buffer code to top-levelKartik K. Agaram2021-08-152-2026/+0
| | | | Now that it's been used in a second app without needing any changes.
* new tool: creating a data diskKartik K. Agaram2021-08-101-1/+7
|
* .Kartik K. Agaram2021-08-021-0/+4
|
* better error handling on stray commasKartik K. Agaram2021-08-012-0/+47
|
* .Kartik K. Agaram2021-08-011-1/+3
|
* maintain aspect ratio when rendering imagesKartik K. Agaram2021-07-291-8/+18
|
* downsampling photos makes the dithering seem worseKartik K. Agaram2021-07-291-2/+2
| | | | We support 128px, so let's use the whole 128px.
* shell: reliable image renderingKartik K. Agaram2021-07-291-0/+1
|
* shell: rendering image definitionsKartik K. Agaram2021-07-291-1/+68
| | | | | | Not quite working yet. Only the very first rendering succeeds. After that any keypress triggers a second render which aborts. Image is getting corrupted in memory somehow.
* shell: support loading 128x128px imagesKartik K. Agaram2021-07-286-10/+10
| | | | | | I'm loading them in uncompressed ASCII format, and all streams and gap buffers all over the place need to get massively scaled up to 256KB capacity. But the tests don't yet run out of RAM, so I'll keep going.
* shell: literal imagesKartik K. Agaram2021-07-283-1/+38
|
* saving definitions containing string literalsKartik K. Agaram2021-07-281-2/+0
| | | | | | | This was the whole proximal goal in implementing balanced terminals. Printing these is still unreliable. It always surrounds in [], which may not work.
* shell: second notation for string literalsKartik K. Agaram2021-07-281-5/+126
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | I've always been dissatisfied with the notion of escaping. It introduces a special-case meta-notation within the tokenizer, and the conventional approach leads to exponential "leaning toothpick syndrome" with each level of escaping. One potential "correct" solution is to keep string terminals parameterizable: [abc] => abc [=] => = [=[abc]=] => abc [=[a]bc]=] => a]bc [==[a]=]bc]==] => a]=]bc ..and so on. Basically the terminals grow linearly as the number of escapings grow. While this is workable, I'd like to wait until I actually need it, and then gauge whether the need is a sign of the stack growing too complex, with too many layers of notation/parsing. Mu's goal is just 3 notations, and it's going to require constant vigilance to keep that from growing. Therefore, for now, there are two notations for string literals, one symmetric and one balanced: "abc" => abc [abc] => abc The balancing notation permits nested brackets as long as they balance. [abc [def]] => abc [def] If you need unbalanced square brackets, use the symmetric terminals: "abc [def" => abc [def If you need double quotes inside strings, use the balanced notation: [abc "def] => abc "def If you need _both_ square brackets (whether balanced or unbalanced) and double quotes, you're currently shit outta luck.
* shell: render image from pbm data streamKartik K. Agaram2021-07-272-0/+234
|
* .Kartik K. Agaram2021-07-261-1/+1
|
* game of life in lispKartik K. Agaram2021-07-262-29/+91
| | | | | | | | Super slow; each frame is cleared as a sort of progress indicator while it computes the next frame. In the process I realize I need to adjust every single trace in the shell sources to be more fault-tolerant to a filled-up trace stream.
* .Kartik K. Agaram2021-07-262-9/+39
| | | | | Smoked out some issues by rendering a single frame of Game of Life. Incredibly slow.
* gracefully trace large multi-dimensional arraysKartik K. Agaram2021-07-261-4/+10
|
* gracefully trace large arraysKartik K. Agaram2021-07-261-0/+8
|
* palette operations now a bit fasterKartik K. Agaram2021-07-261-7/+9
|
* .Kartik K. Agaram2021-07-261-0/+6
|
* .Kartik K. Agaram2021-07-261-3/+3
|
* shell primitive: initialize array of some sizeKartik K. Agaram2021-07-261-0/+78
|
* shell primitive: iset to mutate array at indexKartik K. Agaram2021-07-251-1/+104
|
* shell primitive: array indexKartik K. Agaram2021-07-251-1/+82
|
* shell: array typeKartik K. Agaram2021-07-254-1/+161
|
* .Kartik K. Agaram2021-07-251-9/+9
|
* .Kartik K. Agaram2021-07-251-5/+5
|
* .Kartik K. Agaram2021-07-251-4/+4
|
* shell: starting to implement arraysKartik K. Agaram2021-07-252-5/+65
|
* .Kartik K. Agaram2021-07-251-11/+10
|
* .Kartik K. Agaram2021-07-241-0/+3
|
* .Kartik K. Agaram2021-07-241-5/+4
|
* .Kartik K. Agaram2021-07-192-10/+3
|
* .Kartik K. Agaram2021-07-192-3/+71
|
* error message when trying to jump to primitiveKartik K. Agaram2021-07-191-0/+15
|
* .Kartik K. Agaram2021-07-191-9/+9
|
* .Kartik K. Agaram2021-07-191-21/+0
|
* .Kartik K. Agaram2021-07-191-1/+1
|
* render functions in MRU orderKartik K. Agaram2021-07-192-45/+70
|
* .Kartik K. Agaram2021-07-171-2/+2
|
* .Kartik K. Agaram2021-07-161-1/+1
|
* .Kartik K. Agaram2021-07-081-4/+4
|
* primitives for double-bufferingKartik K. Agaram2021-07-051-4/+152
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | I thought I needed these for this bouncing-ball demo: def (bounce screen) with (w (width screen) h (height screen) cx 16 cy 16 dx 12 dy 19) while 1 clear screen ring screen cx cy 16 3 5 cx += dx cy += dy when (or (cx > w) (cx < 0)) set dx 0-dx when (or (cy > h) (cy < 0)) set dy 0-dy for _ 0 (< _ 100) ++_ # delay No matter how I adjusted the delay I couldn't get rid of the jitter. So I built a double-buffered version: (bounce2 . [def (bounce2 screen) with (w (width screen) h (height screen) cx 16 cy 16 dx 12 dy 19 screen2 (new_screen (columns screen) (lines screen))) while 1 clear screen2 ring screen2 cx cy 16 3 5 cx += dx cy += dy when (or (cx > w) (cx < 0)) set dx 0-dx when (or (cy > h) (cy < 0)) set dy 0-dy blit screen2 screen for _ 0 (< _ 100) ++_]) # delay But it didn't make a difference! Turns out nothing will help you when successive frames are too far apart. This is the correct tweak to `bounce`: - dx 12 - dy 19) + dx 1 + dy (/ 19 12)) Still, we'll keep double-buffering around for the future.
* shell: fix clear on screensKartik K. Agaram2021-07-051-1/+1
| | | | | | | Broken since commit c95648c96 on Jul 3. Unclear what test to write for this. Should clear-stream check for NULL? Should apply-clear?
* expose Mu implementation of 'bezier'Kartik K. Agaram2021-07-051-1/+256
| | | | Still no support for acute-angled control points.
ty/commit/tests/test_contact_list.c?id=768b2aa4667a362ea1343f47c044d79b642c2497'>768b2aa4 ^
6bad38c2 ^
0b3a9f57 ^




7a9d127a ^

0b3a9f57 ^
7a9d127a ^
0b3a9f57 ^
f042d1a2 ^



05f2d293 ^
768b2aa4 ^


6bad38c2 ^
0b3a9f57 ^




7a9d127a ^

0b3a9f57 ^
7a9d127a ^
0b3a9f57 ^
f042d1a2 ^



05f2d293 ^
768b2aa4 ^


6bad38c2 ^
0b3a9f57 ^




cfc23078 ^
7a9d127a ^
0b3a9f57 ^
6576ec29 ^
0b3a9f57 ^
f042d1a2 ^
05f2d293 ^
a336148c ^
6bad38c2 ^
0b3a9f57 ^

6576ec29 ^

0b3a9f57 ^
6576ec29 ^
0b3a9f57 ^
f042d1a2 ^
05f2d293 ^
a336148c ^
6bad38c2 ^
0b3a9f57 ^

6576ec29 ^

0b3a9f57 ^
f23f768d ^
0b3a9f57 ^
f042d1a2 ^


f23f768d ^
dab37236 ^


05f2d293 ^
0b3a9f57 ^
dab37236 ^

0b3a9f57 ^
f23f768d ^

0b3a9f57 ^
f23f768d ^
0b3a9f57 ^
f042d1a2 ^


f23f768d ^
05f2d293 ^
0b3a9f57 ^
dab37236 ^
0b3a9f57 ^
f23f768d ^

0b3a9f57 ^
f23f768d ^
0b3a9f57 ^
f042d1a2 ^


f23f768d ^
05f2d293 ^
0b3a9f57 ^
dab37236 ^
0b3a9f57 ^
f23f768d ^

0b3a9f57 ^
f23f768d ^
0b3a9f57 ^
f042d1a2 ^


f23f768d ^
05f2d293 ^
0b3a9f57 ^

f23f768d ^

0b3a9f57 ^
f928fb36 ^
0b3a9f57 ^
05f2d293 ^
0b3a9f57 ^

f928fb36 ^

0b3a9f57 ^
f7584469 ^
0b3a9f57 ^
f042d1a2 ^


f7584469 ^
05f2d293 ^

0b3a9f57 ^
dab37236 ^

0b3a9f57 ^
f7584469 ^

0b3a9f57 ^
9a3a0840 ^
0b3a9f57 ^
f042d1a2 ^









05f2d293 ^





0b3a9f57 ^
dab37236 ^




0b3a9f57 ^
9a3a0840 ^

0b3a9f57 ^
f7584469 ^
0b3a9f57 ^
f042d1a2 ^


f7584469 ^
05f2d293 ^


0b3a9f57 ^
dab37236 ^

0b3a9f57 ^
78bd151c ^
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
                 





                   

                    
                        
 
                                             
 
                  
                                         

                      

 
                                       
 
                  
                                                       
                                         
                                              
                  

 
                                        
 
                  
                                                       
                                         
                                
 

                                                           

 
                                        
 
                  

                                                       
                                         
 

                                              

 
                                                    
 
                  

                                                       
                                         
 

                                                 
 


                                                            

 
                                          
 
                  


                                                       
                                         
 

                                              

 
                                               
 
                  


                                                       
                                         


                                                              
 



                                                           

 
                                                   
 
                  



                                                       
                                         


                                                              
 




                                                           

 
                                                
 
                  



                                                       
                                         


                                                              
 




                                                           

 
                                             
 
                  



                                                       
                                         


                                                              
 




                                                           
 
 
                                                 
 
                  
                                                       
                                         
                                
 

                                                              

 
                                            
 
                  
                                                       
                                         
                                
 

                                         

 
                                    
 
                  


                                                       
 


                                                     
                                               
                                       

                 
                  

 
                                     
 
                  


                                                       
 
                                              
                                        
                 
                  

 
                                    
 
                  


                                                       
 
                                             
                                         
                 
                  

 
                                    
 
                  


                                                       
 
                                               

                        

 
                                             
 
                  
                                                

                        

 
                                                           
 
                  


                                                       
 

                                                 
                                          

                  
                  

 
                                              
 
                  









                                                      





                                                 
                                         




                  
                  

 
                                                                    
 
                  


                                                       
 


                                                 
                                          

                  
                  
 
#include <glib.h>
#include <stdarg.h>
#include <string.h>
#include <stddef.h>
#include <setjmp.h>
#include <cmocka.h>
#include <stdlib.h>

#include "contact.h"
#include "roster_list.h"

void empty_list_when_none_added(void **state)
{
    roster_init();
    GSList *list = roster_get_contacts();
    assert_null(list);
    roster_free();
}

void contains_one_element(void **state)
{
    roster_init();
    roster_add("James", NULL, NULL, NULL, FALSE, TRUE);
    GSList *list = roster_get_contacts();
    assert_int_equal(1, g_slist_length(list));
    roster_free();
}

void first_element_correct(void **state)
{
    roster_init();
    roster_add("James", NULL, NULL, NULL, FALSE, TRUE);
    GSList *list = roster_get_contacts();
    PContact james = list->data;

    assert_string_equal("James", p_contact_barejid(james));
    roster_free();
}

void contains_two_elements(void **state)
{
    roster_init();
    roster_add("James", NULL, NULL, NULL, FALSE, TRUE);
    roster_add("Dave", NULL, NULL, NULL, FALSE, TRUE);
    GSList *list = roster_get_contacts();

    assert_int_equal(2, g_slist_length(list));
    roster_free();
}

void first_and_second_elements_correct(void **state)
{
    roster_init();
    roster_add("James", NULL, NULL, NULL, FALSE, TRUE);
    roster_add("Dave", NULL, NULL, NULL, FALSE, TRUE);
    GSList *list = roster_get_contacts();

    PContact first = list->data;
    PContact second = (g_slist_next(list))->data;

    assert_string_equal("Dave", p_contact_barejid(first));
    assert_string_equal("James", p_contact_barejid(second));
    roster_free();
}

void contains_three_elements(void **state)
{
    roster_init();
    roster_add("James", NULL, NULL, NULL, FALSE, TRUE);
    roster_add("Bob", NULL, NULL, NULL, FALSE, TRUE);
    roster_add("Dave", NULL, NULL, NULL, FALSE, TRUE);
    GSList *list = roster_get_contacts();

    assert_int_equal(3, g_slist_length(list));
    roster_free();
}

void first_three_elements_correct(void **state)
{
    roster_init();
    roster_add("Bob", NULL, NULL, NULL, FALSE, TRUE);
    roster_add("Dave", NULL, NULL, NULL, FALSE, TRUE);
    roster_add("James", NULL, NULL, NULL, FALSE, TRUE);
    GSList *list = roster_get_contacts();
    PContact bob = list->data;
    PContact dave = (g_slist_next(list))->data;
    PContact james = (g_slist_next(g_slist_next(list)))->data;

    assert_string_equal("James", p_contact_barejid(james));
    assert_string_equal("Dave", p_contact_barejid(dave));
    assert_string_equal("Bob", p_contact_barejid(bob));
    roster_free();
}

void add_twice_at_beginning_adds_once(void **state)
{
    roster_init();
    roster_add("James", NULL, NULL, NULL, FALSE, TRUE);
    roster_add("James", NULL, NULL, NULL, FALSE, TRUE);
    roster_add("Dave", NULL, NULL, NULL, FALSE, TRUE);
    roster_add("Bob", NULL, NULL, NULL, FALSE, TRUE);
    GSList *list = roster_get_contacts();
    PContact first = list->data;
    PContact second = (g_slist_next(list))->data;
    PContact third = (g_slist_next(g_slist_next(list)))->data;

    assert_int_equal(3, g_slist_length(list));
    assert_string_equal("Bob", p_contact_barejid(first));
    assert_string_equal("Dave", p_contact_barejid(second));
    assert_string_equal("James", p_contact_barejid(third));
    roster_free();
}

void add_twice_in_middle_adds_once(void **state)
{
    roster_init();
    roster_add("James", NULL, NULL, NULL, FALSE, TRUE);
    roster_add("Dave", NULL, NULL, NULL, FALSE, TRUE);
    roster_add("James", NULL, NULL, NULL, FALSE, TRUE);
    roster_add("Bob", NULL, NULL, NULL, FALSE, TRUE);
    GSList *list = roster_get_contacts();
    PContact first = list->data;
    PContact second = (g_slist_next(list))->data;
    PContact third = (g_slist_next(g_slist_next(list)))->data;

    assert_int_equal(3, g_slist_length(list));
    assert_string_equal("Bob", p_contact_barejid(first));
    assert_string_equal("Dave", p_contact_barejid(second));
    assert_string_equal("James", p_contact_barejid(third));
    roster_free();
}

void add_twice_at_end_adds_once(void **state)
{
    roster_init();
    roster_add("James", NULL, NULL, NULL, FALSE, TRUE);
    roster_add("Dave", NULL, NULL, NULL, FALSE, TRUE);
    roster_add("Bob", NULL, NULL, NULL, FALSE, TRUE);
    roster_add("James", NULL, NULL, NULL, FALSE, TRUE);
    GSList *list = roster_get_contacts();
    PContact first = list->data;
    PContact second = (g_slist_next(list))->data;
    PContact third = (g_slist_next(g_slist_next(list)))->data;

    assert_int_equal(3, g_slist_length(list));
    assert_string_equal("Bob", p_contact_barejid(first));
    assert_string_equal("Dave", p_contact_barejid(second));
    assert_string_equal("James", p_contact_barejid(third));
    roster_free();
}

void test_show_online_when_no_value(void **state)
{
    roster_init();
    roster_add("James", NULL, NULL, NULL, FALSE, TRUE);
    GSList *list = roster_get_contacts();
    PContact james = list->data;

    assert_string_equal("offline", p_contact_presence(james));
    roster_free();
}

void test_status_when_no_value(void **state)
{
    roster_init();
    roster_add("James", NULL, NULL, NULL, FALSE, TRUE);
    GSList *list = roster_get_contacts();
    PContact james = list->data;

    assert_null(p_contact_status(james));
    roster_free();
}

void find_first_exists(void **state)
{
    roster_init();
    roster_add("James", NULL, NULL, NULL, FALSE, TRUE);
    roster_add("Dave", NULL, NULL, NULL, FALSE, TRUE);
    roster_add("Bob", NULL, NULL, NULL, FALSE, TRUE);

    char *search = (char *) malloc(2 * sizeof(char));
    strcpy(search, "B");

    char *result = roster_find_contact(search);
    assert_string_equal("Bob", result);
    free(result);
    free(search);
    roster_free();
}

void find_second_exists(void **state)
{
    roster_init();
    roster_add("James", NULL, NULL, NULL, FALSE, TRUE);
    roster_add("Dave", NULL, NULL, NULL, FALSE, TRUE);
    roster_add("Bob", NULL, NULL, NULL, FALSE, TRUE);

    char *result = roster_find_contact("Dav");
    assert_string_equal("Dave", result);
    free(result);
    roster_free();
}

void find_third_exists(void **state)
{
    roster_init();
    roster_add("James", NULL, NULL, NULL, FALSE, TRUE);
    roster_add("Dave", NULL, NULL, NULL, FALSE, TRUE);
    roster_add("Bob", NULL, NULL, NULL, FALSE, TRUE);

    char *result = roster_find_contact("Ja");
    assert_string_equal("James", result);
    free(result);
    roster_free();
}

void find_returns_null(void **state)
{
    roster_init();
    roster_add("James", NULL, NULL, NULL, FALSE, TRUE);
    roster_add("Dave", NULL, NULL, NULL, FALSE, TRUE);
    roster_add("Bob", NULL, NULL, NULL, FALSE, TRUE);

    char *result = roster_find_contact("Mike");
    assert_null(result);
    roster_free();
}

void find_on_empty_returns_null(void **state)
{
    roster_init();
    char *result = roster_find_contact("James");
    assert_null(result);
    roster_free();
}

void find_twice_returns_second_when_two_match(void **state)
{
    roster_init();
    roster_add("James", NULL, NULL, NULL, FALSE, TRUE);
    roster_add("Jamie", NULL, NULL, NULL, FALSE, TRUE);
    roster_add("Bob", NULL, NULL, NULL, FALSE, TRUE);

    char *result1 = roster_find_contact("Jam");
    char *result2 = roster_find_contact(result1);
    assert_string_equal("Jamie", result2);
    free(result1);
    free(result2);
    roster_free();
}

void find_five_times_finds_fifth(void **state)
{
    roster_init();
    roster_add("Jama", NULL, NULL, NULL, FALSE, TRUE);
    roster_add("Jamb", NULL, NULL, NULL, FALSE, TRUE);
    roster_add("Mike", NULL, NULL, NULL, FALSE, TRUE);
    roster_add("Dave", NULL, NULL, NULL, FALSE, TRUE);
    roster_add("Jamm", NULL, NULL, NULL, FALSE, TRUE);
    roster_add("Jamn", NULL, NULL, NULL, FALSE, TRUE);
    roster_add("Matt", NULL, NULL, NULL, FALSE, TRUE);
    roster_add("Jamo", NULL, NULL, NULL, FALSE, TRUE);
    roster_add("Jamy", NULL, NULL, NULL, FALSE, TRUE);
    roster_add("Jamz", NULL, NULL, NULL, FALSE, TRUE);

    char *result1 = roster_find_contact("Jam");
    char *result2 = roster_find_contact(result1);
    char *result3 = roster_find_contact(result2);
    char *result4 = roster_find_contact(result3);
    char *result5 = roster_find_contact(result4);
    assert_string_equal("Jamo", result5);
    free(result1);
    free(result2);
    free(result3);
    free(result4);
    free(result5);
    roster_free();
}

void find_twice_returns_first_when_two_match_and_reset(void **state)
{
    roster_init();
    roster_add("James", NULL, NULL, NULL, FALSE, TRUE);
    roster_add("Jamie", NULL, NULL, NULL, FALSE, TRUE);
    roster_add("Bob", NULL, NULL, NULL, FALSE, TRUE);

    char *result1 = roster_find_contact("Jam");
    roster_reset_search_attempts();
    char *result2 = roster_find_contact(result1);
    assert_string_equal("James", result2);
    free(result1);
    free(result2);
    roster_free();
}