BH4FWA

BH4FWA‘s yet another Blog

BH4FWA

Posted on In , , , Waline: Word count in article: 989 Reading time ≈ 4 mins.

看几乎所有的嵌入式开发教程，都在用Keil4或是Keil5学习51单片机，之前了解到了一个用另一种方式做51单片机的方法，这种方法和平台架构已经没关系了，网上有人尝试用过windows，我自己尝试过Intel Mac和M系列的Mac Mini，M系列的MacBook也一样。
开发板照片：51_micro_chip.png 普中的开发板，也不算很贵，69+。

Read more »

Posted on In Waline: Word count in article: 3.6k Reading time ≈ 13 mins.

最近又重新拾起来了硬件DIY的爱好，之前简单跟着expert学了一下PCB布线，但是总感觉啥都不懂，所以说这次重新学一下51单片机开发，再学一下STM32单片机开发。所以买了两块开发板，一个是普中的51单片机开发板，类似这样子：

Read more »

Posted on Edited on Waline: Word count in article: 2.5k Reading time ≈ 9 mins.

如果你的线上MySQL数据库是由你搭建并维护的，数据库中有比较重要的核心数据，而你突然发现你迷迷糊糊误操作了，执行了 rm -rf /data/ 导致线上MySQL的文件夹目录数据全部丢失， 你会怎么办呢？

If Your Online MySQL Database is Built and Maintained by You, and It Contains Important Core Data, You Have Misunderstood and Executed rm -rf /data/ to Delete the Entire Directory of Your Online MySQL Files, What Will You Do?

Read more »

Posted on Edited on Waline: Word count in article: 662 Reading time ≈ 2 mins.

创建这个blog已经超过了3个月，与此同时，也算达成了一些微微小的成就，超过了10000次 Page View。
下面是成就邮件。
This blog has been running over 3 months, and I have achieved 10000 Page Views.

Read more »

Posted on Edited on Waline: Word count in article: 839 Reading time ≈ 3 mins. 
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
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324

package templatesService

import (
	"errors"
	"fmt"
	"github.com/Knetic/govaluate"
	"regexp"
	"strings"
)

var globalFunctions = map[string]govaluate.ExpressionFunction{
	"arrays_overlap_count": func(arguments ...interface{}) (interface{}, error) {
		// a b
		fmt.Println("arrays_overlap_count args:", arguments)
		containsType := arguments[0].(string)
		var count float64
		switch containsType {
		case "int":
			data := arguments[1].([]int)
			target := arguments[2].([]int)
			if len(target) == 0 {
				return float64(0), nil
			}
			if len(data) == 0 {
				return float64(0), nil
			}
			for _, each := range data {
				for _, each1 := range target {
					if each == each1 {
						count++
					}
				}
			}
			return count, nil
		case "int64":
			data := arguments[1].([]int64)
			target := arguments[2].([]int64)
			if len(target) == 0 {
				return float64(0), nil
			}
			if len(data) == 0 {
				return float64(0), nil
			}
			for _, each := range data {
				for _, each1 := range target {
					if each == each1 {
						count++
					}
				}
			}
			return count, nil
		case "float64":
			data := arguments[1].([]float64)
			target := arguments[2].([]float64)
			if len(target) == 0 {
				return float64(0), nil
			}
			if len(data) == 0 {
				return float64(0), nil
			}
			for _, each := range data {
				for _, each1 := range target {
					if each == each1 {
						count++
					}
				}
			}
			return count, nil
		}
		return float64(0), nil
	},
	"arrays_bit_in": func(arguments ...interface{}) (interface{}, error) {
		fmt.Println("arrays_bit_in args:", arguments)
		containsType := arguments[0].(string)
		switch containsType {
		case "int":
			data := arguments[1].([]int)
			index := int(arguments[2].(float64))
			target := arguments[3].([]int)

			if len(target) == 0 && len(data) == 0 {
				return false, nil
			}
			if len(data) == 0 {
				return false, nil
			}
			if len(target) == 0 {
				return false, nil
			}
			if len(data) > index {
				for _, d := range target {
					if data[index] == d {
						return true, nil
					}
				}
			}
			return false, nil
		}
		return false, nil
	},
	"arrays_equals": func(arguments ...interface{}) (interface{}, error) {
		// a b
		fmt.Println("arrays_equals args:", arguments)
		containsType := arguments[0].(string)
		switch containsType {
		case "int":
			data := arguments[1].([]int)
			target := arguments[2].([]int)
			if len(target) == 0 && len(data) == 0 {
				return false, nil
			}
			if len(data) == 0 {
				return false, nil
			}
			if len(target) == 0 {
				return false, nil
			}
			if len(data) == len(target) {
				for i, each := range data {
					if target[i] == each {
						continue
					}
					return false, nil
				}
				return true, nil
			}
			return false, nil
		case "int64":
			data := arguments[1].([]int64)
			target := arguments[2].([]int64)
			if len(target) == 0 && len(data) == 0 {
				return false, nil
			}
			if len(data) == 0 {
				return false, nil
			}
			if len(target) == 0 {
				return false, nil
			}
			if len(data) == len(target) {
				for i, each := range data {
					if target[i] == each {
						continue
					}
				}
				return true, nil
			}
			return false, nil
		case "float64":
			data := arguments[1].([]float64)
			target := arguments[2].([]float64)
			if len(target) == 0 && len(data) == 0 {
				return false, nil
			}
			if len(data) == 0 {
				return false, nil
			}
			if len(target) == 0 {
				return false, nil
			}
			if len(data) == len(target) {
				for i, each := range data {
					if target[i] == each {
						continue
					}
				}
				return true, nil
			}
			return false, nil
		}
		return false, nil
	},
	"arrays_overlap": func(arguments ...interface{}) (interface{}, error) {
		// a b
		fmt.Println("arrays_overlap args:", arguments)
		containsType := arguments[0].(string)
		var count int
		switch containsType {
		case "int":
			data := arguments[1].([]int)
			target := arguments[2].([]int)
			if len(target) == 0 {
				return true, nil
			}
			if len(data) == 0 {
				return true, nil
			}
			for _, each := range data {
				for _, each1 := range target {
					if each == each1 {
						count++
					}
				}
			}
			return count > 0, nil
		case "int64":
			data := arguments[1].([]int64)
			target := arguments[2].([]int64)
			if len(target) == 0 {
				return true, nil
			}
			if len(data) == 0 {
				return true, nil
			}
			for _, each := range data {
				for _, each1 := range target {
					if each == each1 {
						count++
					}
				}
			}
			return count > 0, nil
		case "float64":
			data := arguments[1].([]float64)
			target := arguments[2].([]float64)
			if len(target) == 0 {
				return true, nil
			}
			if len(data) == 0 {
				return true, nil
			}
			for _, each := range data {
				for _, each1 := range target {
					if each == each1 {
						count++
					}
				}
			}
			return count > 0, nil
		}
		return false, nil
	},
	"str_contains": func(arguments ...interface{}) (interface{}, error) {
		fmt.Println("str_contains args:", arguments)
		containsType := arguments[0].(string)
		if containsType == "string" {
			data := arguments[1].(string)
			target := arguments[2].(string)
			return strings.Contains(data, target), nil
		}
		return false, nil
	},
	"str_len": func(args ...interface{}) (interface{}, error) {
		length := len(args[0].(string))
		return (float64)(length), nil
	},
}

const ExpressionStr = "exp"

func expressionParse(str string, dataMap map[string]interface{}) (bool, int, error) {
	if len(str) == 0 {
		return true, 0, nil
	}

	re := regexp.MustCompile(ExpressionStr + `\{(.*?)\}`)
	matches := re.FindAllStringSubmatch(str, -1)

	for _, match := range matches {
		fmt.Println("matchSimpleExp:", match)
		parameter := match[1]
		var result bool
		fmt.Println("params:", parameter)
		ok, err := matchFuncExp(parameter, dataMap, globalFunctions)
		if err != nil {
			fmt.Println(err)
			result = true
		}
		result = ok

		str = strings.ReplaceAll(str, fmt.Sprintf(ExpressionStr+"{%s}", parameter), fmt.Sprintf("%t", result))
		fmt.Println("express:", str)
	}

	matchCount := strings.Count(str, "true")
	str = strings.ReplaceAll(str, "and", "&&")
	str = strings.ReplaceAll(str, "or", "||")
	totalRes, err := matchSimpleExp(str, dataMap)
	fmt.Println("totalResult:", totalRes, err)

	return totalRes, matchCount, err
}

func matchSimpleExp(exp string, data map[string]interface{}) (bool, error) {
	if len(exp) == 0 {
		return true, nil
	}

	expression, err := govaluate.NewEvaluableExpression(exp)
	if err != nil {
		return false, err
	}

	result, err := expression.Evaluate(data)
	if err != nil {
		return false, err
	}
	resultBool, ok := result.(bool)
	if ok {
		fmt.Println("matchSimpleExp expression :", exp, data, resultBool)
		return resultBool, nil
	}
	return false, errors.New("go Expression matchSimpleExp error")
}

func matchFuncExp(expStr string, data map[string]interface{}, funcs map[string]govaluate.ExpressionFunction) (bool, error) {
	if len(expStr) == 0 {
		return true, nil
	}
	fmt.Println("expStr:", expStr)
	expression, _ := govaluate.NewEvaluableExpressionWithFunctions(expStr, funcs)
	result, err := expression.Evaluate(data)
	if err != nil {
		return false, err
	}
	resultBool, ok := result.(bool)
	if ok {
		fmt.Println("matchSimpleExp expression:", expStr, data, resultBool)
		return resultBool, nil
	}
	return false, errors.New("go matchFuncExp matchSimpleExp error")
}

Posted on Edited on Waline: Word count in article: 746 Reading time ≈ 3 mins.

再放一下之前做的智能开关的设备，使用ESP-8266，连接舵机，主要功能是管理常见的86插座，使用热熔胶将舵机粘到86开关盒边上，使得该舵机的方向拨杆可以完成关灯操作，即可。主要是为了冬天懒得下床再关灯而设计的，然而后来我买了米家的智能灯泡，可以直接米家APP接入，就不需要了。
有智能升级，之前应该是接入了 blinker的，可以实现blinker app的控制，然后依稀记得 之前还实现了升级功能，不知道是真的假的，备份一下。

Read more »