Commit 789f299424e8a1f8251defc9b38d5856ffd0675c

Authored by Alain Prouté
1 parent be8190e6

made some cleanup in predef.anubis (unused resurgent symbols renamed '_')

anubis_dev/compiler/src/interp.c
... ... @@ -2624,7 +2624,7 @@ Expr lambda_interpretations (Expr lc,
2624 2624 if (clean && fname != nil && !member(fname,symbols_in_interp(car(aux))))
2625 2625 {
2626 2626 warn_line_col(lc,
2627   - "W025",
  2627 + "W012",
2628 2628 str_format(msgtext_warn_rec_lambda_f_not_used[0],string_content(fname))
2629 2629 );
2630 2630 }
... ...
anubis_dev/compiler/src/predef.anubis
... ... @@ -356,7 +356,7 @@ public define Word8
356 356 (
357 357 Int n
358 358 ) =
359   - if truncate_to_Word32(n) is word32(low1,high1) then if low1 is word16(low2,_) then low2.
  359 + if truncate_to_Word32(n) is word32(low1,_) then if low1 is word16(low2,_) then low2.
360 360  
361 361  
362 362 *** (3.1) Determination of the host system.
... ... @@ -1462,7 +1462,7 @@ public define Result(CreateSocketError, PacketSocket)
1462 1462 the_addr))) is
1463 1463 {
1464 1464 error(e) then error(bind_error(e)),
1465   - ok(__) then ok(packetSocket(type, proto, sock))
  1465 + ok(_) then ok(packetSocket(type, proto, sock))
1466 1466 }
1467 1467 }
1468 1468 }
... ... @@ -1483,7 +1483,7 @@ public define Result(RecvError, (ByteArray, PacketSocketAddress))
1483 1483 if sa is
1484 1484 {
1485 1485 none then error(other_error),
1486   - sockaddr_in(isa) then error(other_error),
  1486 + sockaddr_in(_) then error(other_error),
1487 1487 sockaddr_ll(ppsa) then
1488 1488 with psa = packet_sockaddr(+++value_to_socket_proto(protocol(ppsa)),
1489 1489 ifindex(ppsa),
... ... @@ -1989,7 +1989,7 @@ public define SaveResult
1989 1989 if write_to_file(file_name,serialize(datum)) is
1990 1990 {
1991 1991 cannot_open_file then cannot_open_file,
1992   - write_error(n) then write_error,
  1992 + write_error(_) then write_error,
1993 1993 ok then ok
1994 1994 }.
1995 1995  
... ... @@ -2001,7 +2001,7 @@ public define RetrieveResult($T)
2001 2001 if read_from_file(file_name) is
2002 2002 {
2003 2003 cannot_find_file then cannot_find_file,
2004   - read_error(ba) then read_error,
  2004 + read_error(_) then read_error,
2005 2005 ok(ba) then
2006 2006 if (Maybe($T))unserialize(ba) is
2007 2007 {
... ... @@ -2084,7 +2084,7 @@ define Word8
2084 2084 with rem = s&7,
2085 2085 if rem = 0 // (s (mod 8)) = 0
2086 2086 then (Word8)8
2087   - else if rem is word32(l,h) then if l is word16(l1,h1) then l1.
  2087 + else if rem is word32(l,_) then if l is word16(l1,_) then l1.
2088 2088 // truncate_to_word8(s (mod 8)).
2089 2089  
2090 2090 define ByteArray
... ... @@ -3086,14 +3086,14 @@ define Bool // 'true' means 'quit'
3086 3086 result,
3087 3087 pointer_entering then +++default_host_window_handling(e1,es,window,pm,eh),
3088 3088 pointer_leaving then +++default_host_window_handling(e1,es,window,pm,eh),
3089   - key_down(ks,kk) then +++default_host_window_handling(e1,es,window,pm,eh),
3090   - mouse_move(ks,x,y) then +++default_host_window_handling(e1,es,window,pm,eh),
3091   - mouse_click(ks,mc,x,y) then +++default_host_window_handling(e1,es,window,pm,eh),
3092   - mouse_wheel(ks,d,x,y) then +++default_host_window_handling(e1,es,window,pm,eh),
  3089 + key_down(_,_) then +++default_host_window_handling(e1,es,window,pm,eh),
  3090 + mouse_move(_,_,_) then +++default_host_window_handling(e1,es,window,pm,eh),
  3091 + mouse_click(_,_,_,_) then +++default_host_window_handling(e1,es,window,pm,eh),
  3092 + mouse_wheel(_,_,_,_) then +++default_host_window_handling(e1,es,window,pm,eh),
3093 3093 tick then +++default_host_window_handling(e1,es,window,pm,eh),
3094 3094 repaint(l) then (pm(window,l);
3095 3095 +++handle_host_window_events(es,window,pm,eh)),
3096   - specific(spe) then +++default_host_window_handling(e1,es,window,pm,eh)
  3096 + specific(_) then +++default_host_window_handling(e1,es,window,pm,eh)
3097 3097 }
3098 3098 }.
3099 3099  
... ... @@ -3887,7 +3887,7 @@ define Int
3887 3887 if l is
3888 3888 {
3889 3889 [ ] then 0,
3890   - [h . t] then 1 + +++length(t)
  3890 + [_ . t] then 1 + +++length(t)
3891 3891 }.
3892 3892  
3893 3893 Checking a whole lexer. We check that transitions in all states are to existing states.
... ...