summary refs log tree commit diff stats
path: root/tests/stdlib/tstrutils.nim
Commit message (Expand)AuthorAgeFilesLines
* Replacement PR for https://github.com/nim-lang/Nim/pull/23779 that (#23793)c-blake2024-07-071-1/+1
* fixes testament matrix doesn't work with other backends which left many JS te...ringabout2024-05-141-1/+1
* make parseEnum skip type aliases for enum type sym (#22727)metagn2023-09-191-4/+15
* `strutils.split/rsplit` now return src on an empty sep (#22136)Zoom2023-06-211-6/+10
* alternative to #21914; split, rsplit now forbid an empty separator (#21961)ringabout2023-05-301-0/+14
* stdlib tests now check refc too (#21664)ringabout2023-04-211-1/+1
* int64/uint64 as bigint in JS (#21613)metagn2023-04-111-7/+11
* strutils, rstgen: avoid deprecated `strutils.delete` (#20488)ee72022-10-051-0/+3
* fix #19500; remove find optimization [backport: 1.6] (#19714)ringabout2022-09-281-0/+5
* make more standard libraries work with `nimPreviewSlimSystem` (#20343)ringabout2022-09-271-0/+1
* fix #18128 rfind on empty needle returns rightmost index (#20430)n5m2022-09-261-13/+17
* Fix `find` routines' api to default to `last=-1` (#19761)Zoom2022-06-071-17/+21
* fix parseEnum cannot parse enum with const fields (#19466)flywind2022-02-041-0/+11
* Fix nimIdentNormalize, fixes #19067 (#19068)Tomasz Kramkowski2021-10-291-0/+7
* deprecate strutils.delete and add an overload with saner semantics consistent...Timothee Cour2021-07-181-1/+25
* add string-string tests for find and rfind (#18137)n5m2021-06-021-3/+98
* improve fast returns of find and rfind (#18127)n5m2021-05-311-0/+28
* std/hashes: hash(ref|ptr|pointer) + other improvements (#17731)Timothee Cour2021-04-161-5/+1
* use doAssert in tests (#16486)flywind2020-12-281-132/+132
* strip minor improvement (#16444)flywind2020-12-231-0/+13
* improve tstrutils: test c, cpp, js, vm; cleanups (#16357)Timothee Cour2020-12-151-0/+689
1036'>8a6679b ^
9d73909 ^



8a6679b ^












aa13727 ^











4c368bc ^


aa13727 ^





























































4c368bc ^


aa13727 ^














































































7e597ae ^
aa13727 ^


7e597ae ^
aa13727 ^




7e597ae ^
aa13727 ^


7e597ae ^
aa13727 ^











b5159df ^
aa13727 ^














9d73909 ^
aa13727 ^










9d73909 ^
aa13727 ^



daae3bb ^









aa13727 ^

8a6679b ^
aa13727 ^
8a6679b ^
aa13727 ^

8a6679b ^

aa13727 ^
8a6679b ^
9d73909 ^


8a6679b ^
aa13727 ^

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
295
296
297
298
299
300
301
302
303




                                                              
                  
 

            











                                              

           
 
                                      
 

                                  
                          



                                       

                    
                                              
         
                             

 



                                 












                                        











                                                 


                                       





























































                                                                            


                                       














































































                                                                            
                                       


                                      
                                       




                                                              
                                                     


                                                    
                                                     











                                                          
                                                          














                                                                    
                  










                                  
                  



                      









                                  

              
                        
 
                                                               

                       

                                           
                               
                  


                          
                 

                      
/*
 * (C)opyright MMVI Anselm R. Garbe <garbeam at gmail dot com>
 * See LICENSE file for license details.
 */
#include "dwm.h"
#include <stdio.h>

/* static */

static Client *
minclient()
{
	Client *c, *min;

	for(min = c = clients; c; c = c->next)
		if(c->weight < min->weight)
			min = c;
	return min;
}


static void
reorder()
{
	Client *c, *newclients, *tail;

	newclients = tail = NULL;
	while((c = minclient())) {
		detach(c);
		if(tail) {
			c->prev = tail;
			tail->next = c;
			tail = c;
		}
		else
			tail = newclients = c;
	}
	clients = newclients;
}

/* extern */

void (*arrange)(Arg *) = DEFMODE;

void
detach(Client *c)
{
	if(c->prev)
		c->prev->next = c->next;
	if(c->next)
		c->next->prev = c->prev;
	if(c == clients)
		clients = c->next;
	c->next = c->prev = NULL;
}

void
dofloat(Arg *arg)
{
	Client *c;

	for(c = clients; c; c = c->next) {
		c->ismax = False;
		if(isvisible(c)) {
			resize(c, True, TopLeft);
		}
		else
			ban(c);
	}
	if(!sel || !isvisible(sel))
		sel = getnext(clients);
	if(sel)
		focus(sel);
	else
		XSetInputFocus(dpy, root, RevertToPointerRoot, CurrentTime);
	restack();
}

void
dotile(Arg *arg)
{
	int h, i, n, w;
	Client *c;

	w = sw - mw;
	for(n = 0, c = clients; c; c = c->next)
		if(isvisible(c) && !c->isfloat)
			n++;

	if(n > 1)
		h = (sh - bh) / (n - 1);
	else
		h = sh - bh;

	for(i = 0, c = clients; c; c = c->next) {
		c->ismax = False;
		if(isvisible(c)) {
			if(c->isfloat) {
				resize(c, True, TopLeft);
				continue;
			}
			if(n == 1) {
				c->x = sx;
				c->y = sy + bh;
				c->w = sw - 2;
				c->h = sh - 2 - bh;
			}
			else if(i == 0) {
				c->x = sx;
				c->y = sy + bh;
				c->w = mw - 2;
				c->h = sh - 2 - bh;
			}
			else if(h > bh) {
				c->x = sx + mw;
				c->y = sy + (i - 1) * h + bh;
				c->w = w - 2;
				if(i + 1 == n)
					c->h = sh - c->y - 2;
				else
					c->h = h - 2;
			}
			else { /* fallback if h < bh */
				c->x = sx + mw;
				c->y = sy + bh;
				c->w = w - 2;
				c->h = sh - 2 - bh;
			}
			resize(c, False, TopLeft);
			i++;
		}
		else
			ban(c);
	}
	if(!sel || !isvisible(sel))
		sel = getnext(clients);
	if(sel)
		focus(sel);
	else
		XSetInputFocus(dpy, root, RevertToPointerRoot, CurrentTime);
	restack();
}

void
focusnext(Arg *arg)
{
	Client *c;
   
	if(!sel)
		return;

	if(!(c = getnext(sel->next)))
		c = getnext(clients);
	if(c) {
		focus(c);
		restack();
	}
}

void
focusprev(Arg *arg)
{
	Client *c;

	if(!sel)
		return;

	if(!(c = getprev(sel->prev))) {
		for(c = clients; c && c->next; c = c->next);
		c = getprev(c);
	}
	if(c) {
		focus(c);
		restack();
	}
}

Bool
isvisible(Client *c)
{
	unsigned int i;

	for(i = 0; i < ntags; i++)
		if(c->tags[i] && seltag[i])
			return True;
	return False;
}

void
restack()
{
	static unsigned int nwins = 0;
	static Window *wins = NULL;
	unsigned int f, fi, m, mi, n;
	Client *c;
	XEvent ev;

	for(f = 0, m = 0, c = clients; c; c = c->next)
		if(isvisible(c)) {
			if(c->isfloat || arrange == dofloat)
				f++;
			else
				m++;
		}
	if(!(n = 2 * (f + m))) {
		drawstatus();
		return;
	}
	if(nwins < n) {
		nwins = n;
		wins = erealloc(wins, nwins * sizeof(Window));
	}

	fi = 0;
	mi = 2 * f;
	if(sel->isfloat || arrange == dofloat) {
		wins[fi++] = sel->twin;
		wins[fi++] = sel->win;
	}
	else {
		wins[mi++] = sel->twin;
		wins[mi++] = sel->win;
	}
	for(c = clients; c; c = c->next)
		if(isvisible(c) && c != sel) {
			if(c->isfloat || arrange == dofloat) {
				wins[fi++] = c->twin;
				wins[fi++] = c->win;
			}
			else {
				wins[mi++] = c->twin;
				wins[mi++] = c->win;
			}
		}
	XRestackWindows(dpy, wins, n);
	drawall();
	XSync(dpy, False);
	while(XCheckMaskEvent(dpy, EnterWindowMask, &ev));
}

void
togglemode(Arg *arg)
{
	arrange = (arrange == dofloat) ? dotile : dofloat;
	if(sel)
		arrange(NULL);
	else
		drawstatus();
}

void
toggleview(Arg *arg)
{
	unsigned int i;

	seltag[arg->i] = !seltag[arg->i];
	for(i = 0; i < ntags && !seltag[i]; i++);
	if(i == ntags)
		seltag[arg->i] = True; /* cannot toggle last view */
	reorder();
	arrange(NULL);
}

void
view(Arg *arg)
{
	unsigned int i;

	for(i = 0; i < ntags; i++)
		seltag[i] = False;
	seltag[arg->i] = True;
	reorder();
	arrange(NULL);
}

void
viewall(Arg *arg)
{
	unsigned int i;

	for(i = 0; i < ntags; i++)
		seltag[i] = True;
	arrange(NULL);
}

void
zoom(Arg *arg)
{
	Client *c = sel;

	if(!c || (arrange != dotile) || c->isfloat || c->ismax)
		return;

	if(c == getnext(clients))
		if(!(c = getnext(c->next)))
			return;
	detach(c);
	c->next = clients;
	clients->prev = c;
	clients = c;
	focus(c);
	arrange(NULL);
}