# HG changeset patch
# User Edouard Tisserant <edouard@beremiz.fr>
# Date 1726751565 -7200
# Node ID 3977d55217ecb2d6395804bbde7954d14fb93357
# Parent  9e4a3a3ea5c020a7c4c352f91ac56b890af9d6b0
MQTT: remove accidentally committed debug printfs + cosmetic

diff -r 9e4a3a3ea5c0 -r 3977d55217ec mqtt/mqtt_client_gen.py
--- a/mqtt/mqtt_client_gen.py	Thu Sep 19 12:06:53 2024 +0200
+++ b/mqtt/mqtt_client_gen.py	Thu Sep 19 15:12:45 2024 +0200
@@ -407,7 +407,7 @@
             formatdict["publish_changes"] += """
             PUBLISH_CHANGE({encoding}, {Topic}, {QoS}, {C_type}, {c_loc_name}, {Retained})""".format(**locals())
 
-        # inputs need to be sorted for bisection search 
+        # inputs need to be sorted for bisection search
         for row in sorted(self["input"]):
             Topic, QoS, iec_type, iec_number = row
             if iec_type in MQTT_IEC_types:
diff -r 9e4a3a3ea5c0 -r 3977d55217ec mqtt/mqtt_template.c
--- a/mqtt/mqtt_template.c	Thu Sep 19 12:06:53 2024 +0200
+++ b/mqtt/mqtt_template.c	Thu Sep 19 15:12:45 2024 +0200
@@ -19,8 +19,6 @@
         char mstr[256];                                                                           \
         snprintf(mstr, 255, __VA_ARGS__);                                                         \
         LogMessage(level, mstr, strlen(mstr));                                                    \
-        printf(__VA_ARGS__);                                                                      \
-        fflush(stdout);                                                                           \
     }}
 
 #define LogInfo(...) _Log(LOG_INFO, __VA_ARGS__);
@@ -226,8 +224,6 @@
         // compare strings as far as possible
         res = strncmp(topics[mid].topic, topicName, len);
 
-        printf("%*s %s topic_len %d, delta_len %d, topicLen %d, len %d, res %d, low %d, mid %d, high %d\n", topicLen, topicName, topics[mid].topic, topics[mid].topic_len, delta_len, topicLen, len, res, low, mid, high);
-
         // if partial comparison matches, longest string is the greatest
         if (res == 0)
             // update res to continue bisection