@@@ tweak

[xyla] / bt-set.c

diff --git a/bt-set.c b/bt-set.c
index 8ee6ed342daea6a63bf8703f181b38320f2f3a54..8f7bb852783b482e6a8e42ae01e351c9f79de153 100644 (file)
--- a/bt-set.c
+++ b/bt-set.c
@@ -76,8 +76,6 @@ int xyla_bt_unisect(struct xyla_bt_nodecls *cls,
 
   enum { RIGHT, JOIN };
 
-  XYLA__ASSERT(keyfn);
-
   /* This is an essentially recursive procedure based on the following
    * observations.  Let A and B be sets of ordered elements.
    *
@@ -302,8 +300,6 @@ int xyla_bt_diffsect(struct xyla_bt_nodecls *cls,
 
   enum { RIGHT, JOIN };
 
-  XYLA__ASSERT(keyfn);
-
   /* This is an essentially recursive procedure, similar to `xyla_bt_unisect'
    * above, based on the following observations.  Let A and B be sets of
    * ordered elements.