Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit c8116b5

Browse files
Use __typeof for compile compatibility
Signed-off-by: begeekmyfriend <begeekmyfriend@gmail.com>
1 parent d547944 commit c8116b5

File tree

13 files changed

+31
-31
lines changed

13 files changed

+31
-31
lines changed

‎0030_substring_with_concatenation_of_all_words/concatenation.c‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -11,9 +11,9 @@
1111
container_of(ptr, type, member)
1212

1313
#define list_for_each_entry(pos, head, member) \
14-
for (pos = list_entry((head)->next, typeof(*pos), member); \
14+
for (pos = list_entry((head)->next, __typeof(*pos), member); \
1515
&(pos)->member != (head); \
16-
pos = list_entry((pos)->member.next, typeof(*pos), member))
16+
pos = list_entry((pos)->member.next, __typeof(*pos), member))
1717

1818
struct list_head {
1919
struct list_head *next, *prev;

‎0105_construct_binary_tree_from_preorder_and_inorder_traversal/binary_tree_build.c‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -9,9 +9,9 @@
99
container_of(ptr, type, member)
1010

1111
#define list_for_each_entry(pos, head, member) \
12-
for (pos = list_entry((head)->next, typeof(*pos), member); \
12+
for (pos = list_entry((head)->next, __typeof(*pos), member); \
1313
&(pos)->member != (head); \
14-
pos = list_entry((pos)->member.next, typeof(*pos), member))
14+
pos = list_entry((pos)->member.next, __typeof(*pos), member))
1515

1616
struct list_head {
1717
struct list_head *next, *prev;

‎0106_construct_binary_tree_from_inorder_and_postorder_traversal/binary_tree_build.c‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -9,9 +9,9 @@
99
container_of(ptr, type, member)
1010

1111
#define list_for_each_entry(pos, head, member) \
12-
for (pos = list_entry((head)->next, typeof(*pos), member); \
12+
for (pos = list_entry((head)->next, __typeof(*pos), member); \
1313
&(pos)->member != (head); \
14-
pos = list_entry((pos)->member.next, typeof(*pos), member))
14+
pos = list_entry((pos)->member.next, __typeof(*pos), member))
1515

1616
struct list_head {
1717
struct list_head *next, *prev;

‎0123_best_time_to_buy_and_sell_stock_iii/stock.c‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -53,7 +53,7 @@ static int maxProfit(int* prices, int pricesSize)
5353
int total = left_profit[pricesSize - 1];
5454
for (i = pricesSize - 2; i >= 0; i--) {
5555
if (prices[i] > max) {
56-
max = prices[i];
56+
max = prices[i];
5757
} else {
5858
tmp = max - prices[i];
5959
right_profit = tmp > right_profit ? tmp : right_profit;

‎0126_word_ladder_ii/word_ladder.c‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -13,9 +13,9 @@
1313
#define list_first_entry(ptr, type, field) list_entry((ptr)->next, type, field)
1414

1515
#define list_for_each_entry(pos, head, member) \
16-
for (pos = list_entry((head)->next, typeof(*pos), member); \
16+
for (pos = list_entry((head)->next, __typeof(*pos), member); \
1717
&(pos)->member != (head); \
18-
pos = list_entry((pos)->member.next, typeof(*pos), member))
18+
pos = list_entry((pos)->member.next, __typeof(*pos), member))
1919

2020
struct list_head {
2121
struct list_head *next, *prev;

‎0127_word_ladder/word_ladder.c‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -12,9 +12,9 @@
1212
#define list_first_entry(ptr, type, field) list_entry((ptr)->next, type, field)
1313

1414
#define list_for_each_entry(pos, head, member) \
15-
for (pos = list_entry((head)->next, typeof(*pos), member); \
15+
for (pos = list_entry((head)->next, __typeof(*pos), member); \
1616
&(pos)->member != (head); \
17-
pos = list_entry((pos)->member.next, typeof(*pos), member))
17+
pos = list_entry((pos)->member.next, __typeof(*pos), member))
1818

1919
struct list_head {
2020
struct list_head *next, *prev;

‎0128_longest_consecutive_sequence/consec_seq.c‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -9,9 +9,9 @@
99
container_of(ptr, type, member)
1010

1111
#define list_for_each_entry(pos, head, member) \
12-
for (pos = list_entry((head)->next, typeof(*pos), member); \
12+
for (pos = list_entry((head)->next, __typeof(*pos), member); \
1313
&(pos)->member != (head); \
14-
pos = list_entry((pos)->member.next, typeof(*pos), member))
14+
pos = list_entry((pos)->member.next, __typeof(*pos), member))
1515

1616
struct list_head {
1717
struct list_head *next, *prev;

‎0133_clone_graph/clone_graph.c‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -9,9 +9,9 @@
99
container_of(ptr, type, member)
1010

1111
#define list_for_each_entry(pos, head, member) \
12-
for (pos = list_entry((head)->next, typeof(*pos), member); \
12+
for (pos = list_entry((head)->next, __typeof(*pos), member); \
1313
&(pos)->member != (head); \
14-
pos = list_entry((pos)->member.next, typeof(*pos), member))
14+
pos = list_entry((pos)->member.next, __typeof(*pos), member))
1515

1616
struct list_head {
1717
struct list_head *next, *prev;

‎0140_word_break_ii/word_break.c‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -10,9 +10,9 @@
1010
container_of(ptr, type, member)
1111

1212
#define list_for_each_entry(pos, head, member) \
13-
for (pos = list_entry((head)->next, typeof(*pos), member); \
13+
for (pos = list_entry((head)->next, __typeof(*pos), member); \
1414
&(pos)->member != (head); \
15-
pos = list_entry((pos)->member.next, typeof(*pos), member))
15+
pos = list_entry((pos)->member.next, __typeof(*pos), member))
1616

1717
struct list_head {
1818
struct list_head *next, *prev;

‎0146_lru_cache/lru_cache.c‎

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -11,15 +11,15 @@
1111
#define list_last_entry(ptr, type, field) list_entry((ptr)->prev, type, field)
1212

1313
#define list_for_each_entry(pos, head, member) \
14-
for (pos = list_entry((head)->next, typeof(*pos), member); \
14+
for (pos = list_entry((head)->next, __typeof(*pos), member); \
1515
&(pos)->member != (head); \
16-
pos = list_entry((pos)->member.next, typeof(*pos), member))
16+
pos = list_entry((pos)->member.next, __typeof(*pos), member))
1717

1818
#define list_for_each_entry_safe(pos, n, head, member) \
19-
for (pos = list_entry((head)->next, typeof(*pos), member), \
20-
n = list_entry(pos->member.next, typeof(*pos), member); \
19+
for (pos = list_entry((head)->next, __typeof(*pos), member), \
20+
n = list_entry(pos->member.next, __typeof(*pos), member); \
2121
&pos->member != (head); \
22-
pos = n, n = list_entry(n->member.next, typeof(*n), member))
22+
pos = n, n = list_entry(n->member.next, __typeof(*n), member))
2323

2424
struct list_head {
2525
struct list_head *next, *prev;

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /