From c8116b509eed986d5e0bf9931ede0b27013bba29 Mon Sep 17 00:00:00 2001 From: begeekmyfriend Date: Thu, 26 Oct 2023 20:40:23 +0800 Subject: [PATCH] Use __typeof for compile compatibility Signed-off-by: begeekmyfriend --- .../concatenation.c | 4 ++-- .../binary_tree_build.c | 4 ++-- .../binary_tree_build.c | 4 ++-- 0123_best_time_to_buy_and_sell_stock_iii/stock.c | 2 +- 0126_word_ladder_ii/word_ladder.c | 4 ++-- 0127_word_ladder/word_ladder.c | 4 ++-- 0128_longest_consecutive_sequence/consec_seq.c | 4 ++-- 0133_clone_graph/clone_graph.c | 4 ++-- 0140_word_break_ii/word_break.c | 4 ++-- 0146_lru_cache/lru_cache.c | 10 +++++----- 0149_max_points_on_a_line/points_on_line.c | 4 ++-- 0166_fraction_to_recurring_decimal/fraction.c | 4 ++-- 0460_lfu_cache/lfu_cache.c | 10 +++++----- 13 files changed, 31 insertions(+), 31 deletions(-) diff --git a/0030_substring_with_concatenation_of_all_words/concatenation.c b/0030_substring_with_concatenation_of_all_words/concatenation.c index 4018389..475cc45 100644 --- a/0030_substring_with_concatenation_of_all_words/concatenation.c +++ b/0030_substring_with_concatenation_of_all_words/concatenation.c @@ -11,9 +11,9 @@ container_of(ptr, type, member) #define list_for_each_entry(pos, head, member) \ - for (pos = list_entry((head)->next, typeof(*pos), member); \ + for (pos = list_entry((head)->next, __typeof(*pos), member); \ &(pos)->member != (head); \ - pos = list_entry((pos)->member.next, typeof(*pos), member)) + pos = list_entry((pos)->member.next, __typeof(*pos), member)) struct list_head { struct list_head *next, *prev; diff --git a/0105_construct_binary_tree_from_preorder_and_inorder_traversal/binary_tree_build.c b/0105_construct_binary_tree_from_preorder_and_inorder_traversal/binary_tree_build.c index f0be239..53d4916 100644 --- a/0105_construct_binary_tree_from_preorder_and_inorder_traversal/binary_tree_build.c +++ b/0105_construct_binary_tree_from_preorder_and_inorder_traversal/binary_tree_build.c @@ -9,9 +9,9 @@ container_of(ptr, type, member) #define list_for_each_entry(pos, head, member) \ - for (pos = list_entry((head)->next, typeof(*pos), member); \ + for (pos = list_entry((head)->next, __typeof(*pos), member); \ &(pos)->member != (head); \ - pos = list_entry((pos)->member.next, typeof(*pos), member)) + pos = list_entry((pos)->member.next, __typeof(*pos), member)) struct list_head { struct list_head *next, *prev; diff --git a/0106_construct_binary_tree_from_inorder_and_postorder_traversal/binary_tree_build.c b/0106_construct_binary_tree_from_inorder_and_postorder_traversal/binary_tree_build.c index b37dd41..5adb6ab 100644 --- a/0106_construct_binary_tree_from_inorder_and_postorder_traversal/binary_tree_build.c +++ b/0106_construct_binary_tree_from_inorder_and_postorder_traversal/binary_tree_build.c @@ -9,9 +9,9 @@ container_of(ptr, type, member) #define list_for_each_entry(pos, head, member) \ - for (pos = list_entry((head)->next, typeof(*pos), member); \ + for (pos = list_entry((head)->next, __typeof(*pos), member); \ &(pos)->member != (head); \ - pos = list_entry((pos)->member.next, typeof(*pos), member)) + pos = list_entry((pos)->member.next, __typeof(*pos), member)) struct list_head { struct list_head *next, *prev; diff --git a/0123_best_time_to_buy_and_sell_stock_iii/stock.c b/0123_best_time_to_buy_and_sell_stock_iii/stock.c index c0e38ef..55172db 100644 --- a/0123_best_time_to_buy_and_sell_stock_iii/stock.c +++ b/0123_best_time_to_buy_and_sell_stock_iii/stock.c @@ -53,7 +53,7 @@ static int maxProfit(int* prices, int pricesSize) int total = left_profit[pricesSize - 1]; for (i = pricesSize - 2; i >= 0; i--) { if (prices[i] > max) { - max = prices[i]; + max = prices[i]; } else { tmp = max - prices[i]; right_profit = tmp > right_profit ? tmp : right_profit; diff --git a/0126_word_ladder_ii/word_ladder.c b/0126_word_ladder_ii/word_ladder.c index 963b6b4..9efc70f 100644 --- a/0126_word_ladder_ii/word_ladder.c +++ b/0126_word_ladder_ii/word_ladder.c @@ -13,9 +13,9 @@ #define list_first_entry(ptr, type, field) list_entry((ptr)->next, type, field) #define list_for_each_entry(pos, head, member) \ - for (pos = list_entry((head)->next, typeof(*pos), member); \ + for (pos = list_entry((head)->next, __typeof(*pos), member); \ &(pos)->member != (head); \ - pos = list_entry((pos)->member.next, typeof(*pos), member)) + pos = list_entry((pos)->member.next, __typeof(*pos), member)) struct list_head { struct list_head *next, *prev; diff --git a/0127_word_ladder/word_ladder.c b/0127_word_ladder/word_ladder.c index dc12247..f057487 100644 --- a/0127_word_ladder/word_ladder.c +++ b/0127_word_ladder/word_ladder.c @@ -12,9 +12,9 @@ #define list_first_entry(ptr, type, field) list_entry((ptr)->next, type, field) #define list_for_each_entry(pos, head, member) \ - for (pos = list_entry((head)->next, typeof(*pos), member); \ + for (pos = list_entry((head)->next, __typeof(*pos), member); \ &(pos)->member != (head); \ - pos = list_entry((pos)->member.next, typeof(*pos), member)) + pos = list_entry((pos)->member.next, __typeof(*pos), member)) struct list_head { struct list_head *next, *prev; diff --git a/0128_longest_consecutive_sequence/consec_seq.c b/0128_longest_consecutive_sequence/consec_seq.c index 3d52eda..f3e5d3f 100644 --- a/0128_longest_consecutive_sequence/consec_seq.c +++ b/0128_longest_consecutive_sequence/consec_seq.c @@ -9,9 +9,9 @@ container_of(ptr, type, member) #define list_for_each_entry(pos, head, member) \ - for (pos = list_entry((head)->next, typeof(*pos), member); \ + for (pos = list_entry((head)->next, __typeof(*pos), member); \ &(pos)->member != (head); \ - pos = list_entry((pos)->member.next, typeof(*pos), member)) + pos = list_entry((pos)->member.next, __typeof(*pos), member)) struct list_head { struct list_head *next, *prev; diff --git a/0133_clone_graph/clone_graph.c b/0133_clone_graph/clone_graph.c index 748c342..1c18389 100644 --- a/0133_clone_graph/clone_graph.c +++ b/0133_clone_graph/clone_graph.c @@ -9,9 +9,9 @@ container_of(ptr, type, member) #define list_for_each_entry(pos, head, member) \ - for (pos = list_entry((head)->next, typeof(*pos), member); \ + for (pos = list_entry((head)->next, __typeof(*pos), member); \ &(pos)->member != (head); \ - pos = list_entry((pos)->member.next, typeof(*pos), member)) + pos = list_entry((pos)->member.next, __typeof(*pos), member)) struct list_head { struct list_head *next, *prev; diff --git a/0140_word_break_ii/word_break.c b/0140_word_break_ii/word_break.c index e987eae..588bc1e 100644 --- a/0140_word_break_ii/word_break.c +++ b/0140_word_break_ii/word_break.c @@ -10,9 +10,9 @@ container_of(ptr, type, member) #define list_for_each_entry(pos, head, member) \ - for (pos = list_entry((head)->next, typeof(*pos), member); \ + for (pos = list_entry((head)->next, __typeof(*pos), member); \ &(pos)->member != (head); \ - pos = list_entry((pos)->member.next, typeof(*pos), member)) + pos = list_entry((pos)->member.next, __typeof(*pos), member)) struct list_head { struct list_head *next, *prev; diff --git a/0146_lru_cache/lru_cache.c b/0146_lru_cache/lru_cache.c index 79c8cf5..205896c 100644 --- a/0146_lru_cache/lru_cache.c +++ b/0146_lru_cache/lru_cache.c @@ -11,15 +11,15 @@ #define list_last_entry(ptr, type, field) list_entry((ptr)->prev, type, field) #define list_for_each_entry(pos, head, member) \ - for (pos = list_entry((head)->next, typeof(*pos), member); \ + for (pos = list_entry((head)->next, __typeof(*pos), member); \ &(pos)->member != (head); \ - pos = list_entry((pos)->member.next, typeof(*pos), member)) + pos = list_entry((pos)->member.next, __typeof(*pos), member)) #define list_for_each_entry_safe(pos, n, head, member) \ - for (pos = list_entry((head)->next, typeof(*pos), member), \ - n = list_entry(pos->member.next, typeof(*pos), member); \ + for (pos = list_entry((head)->next, __typeof(*pos), member), \ + n = list_entry(pos->member.next, __typeof(*pos), member); \ &pos->member != (head); \ - pos = n, n = list_entry(n->member.next, typeof(*n), member)) + pos = n, n = list_entry(n->member.next, __typeof(*n), member)) struct list_head { struct list_head *next, *prev; diff --git a/0149_max_points_on_a_line/points_on_line.c b/0149_max_points_on_a_line/points_on_line.c index 3291c69..c0ad22f 100644 --- a/0149_max_points_on_a_line/points_on_line.c +++ b/0149_max_points_on_a_line/points_on_line.c @@ -11,9 +11,9 @@ container_of(ptr, type, member) #define list_for_each_entry(pos, head, member) \ - for (pos = list_entry((head)->next, typeof(*pos), member); \ + for (pos = list_entry((head)->next, __typeof(*pos), member); \ &(pos)->member != (head); \ - pos = list_entry((pos)->member.next, typeof(*pos), member)) + pos = list_entry((pos)->member.next, __typeof(*pos), member)) struct list_head { struct list_head *next, *prev; diff --git a/0166_fraction_to_recurring_decimal/fraction.c b/0166_fraction_to_recurring_decimal/fraction.c index b2c7a8b..f1c90ff 100644 --- a/0166_fraction_to_recurring_decimal/fraction.c +++ b/0166_fraction_to_recurring_decimal/fraction.c @@ -11,9 +11,9 @@ container_of(ptr, type, member) #define list_for_each_entry(pos, head, member) \ - for (pos = list_entry((head)->next, typeof(*pos), member); \ + for (pos = list_entry((head)->next, __typeof(*pos), member); \ &(pos)->member != (head); \ - pos = list_entry((pos)->member.next, typeof(*pos), member)) + pos = list_entry((pos)->member.next, __typeof(*pos), member)) struct list_head { struct list_head *next, *prev; diff --git a/0460_lfu_cache/lfu_cache.c b/0460_lfu_cache/lfu_cache.c index a902948..fdcfb77 100644 --- a/0460_lfu_cache/lfu_cache.c +++ b/0460_lfu_cache/lfu_cache.c @@ -13,15 +13,15 @@ #define list_last_entry(ptr, type, field) list_entry((ptr)->prev, type, field) #define list_for_each_entry(pos, head, member) \ - for (pos = list_entry((head)->next, typeof(*pos), member); \ + for (pos = list_entry((head)->next, __typeof(*pos), member); \ &(pos)->member != (head); \ - pos = list_entry((pos)->member.next, typeof(*pos), member)) + pos = list_entry((pos)->member.next, __typeof(*pos), member)) #define list_for_each_entry_safe(pos, n, head, member) \ - for (pos = list_entry((head)->next, typeof(*pos), member), \ - n = list_entry(pos->member.next, typeof(*pos), member); \ + for (pos = list_entry((head)->next, __typeof(*pos), member), \ + n = list_entry(pos->member.next, __typeof(*pos), member); \ &pos->member != (head); \ - pos = n, n = list_entry(n->member.next, typeof(*n), member)) + pos = n, n = list_entry(n->member.next, __typeof(*n), member)) struct list_head { struct list_head *next, *prev;