SOURCE

var line = turf.lineString([[1, 1], [1, 2], [1, 3], [1, 4]]);
var point = turf.point([1, 2]);
var poly1 = turf.polygon([[[0,0],[0,5],[5,5],[5,0],[0,0]]]);
var poly2 = turf.polygon([[[0,0],[0,3],[3,3],[3,0],[0,0]]]);
var poly3 = turf.polygon([[[0,0],[0,6],[3,6],[3,0],[0,0]]]);
var poly4 = turf.polygon([[[0,0],[0,5],[2,5],[2,4],[3,4],[3,5],[5,5],[5,0],[0,0]]]);
var poly5 = turf.polygon([[[2,5],[2,4],[3,4],[3,5],[2,5]]]);
var poly6 = turf.polygon([[[0,0],[5,0],[5,5],[3,5],[2,5],[0,5],[0,0]]]);
var poly7 = turf.polygon([[[5,0],[6,0],[6,5],[5,5],[5,0]]]);
var poly8 = turf.polygon([[[5,0],[5,5],[0,5],[0,0],[5,0]]]);
var poly9 = turf.polygon([[[3,4],[5,3],[5,5],[3,5],[3,4]]]);
var point2 = turf.point([2, 5]);

//console.log(turf.booleanContains(poly1, poly6));
//console.log(turf.booleanContains(poly6, poly1));
//console.log(turf.booleanContains(poly4, poly5));
//console.log(turf.booleanOverlap(poly4, poly5));
//console.log(turf.booleanPointInPolygon(point2, poly4));
//console.log(turf.booleanDisjoint(poly1, poly3))
//console.log(turf.booleanPointInPolygon(point2, poly4))
//console.log(turf.difference(poly1, poly6));
//console.log(turf.booleanIntersects(poly4, poly5));
//console.log(turf.booleanOverlap(poly5, poly6));
//console.log(turf.intersect(poly4, poly5));
//console.log(turf.intersect(poly5, poly6));
//console.log(turf.intersect(poly4, poly6));
//console.log(turf.intersect(poly1, poly3));
//console.log(turf.intersect(poly1, poly6));
//console.log(turf.intersect(poly6, poly1));
//const intersect = turf.intersect(poly6, poly1);
//console.log(turf.area(intersect.geometry));
//console.log(turf.area(poly1));
console.log(turf.booleanEqual(poly1, poly8));
//console.log(turf.booleanCrosses(poly4, poly5));