! Copyright (C) 2009 Daniel Ehrenberg ! See http://factorcode.org/license.txt for BSD license. USING: accessors arrays combinators combinators.short-circuit fry kernel kernel.private lists locals math sequences typed ; IN: wrap ! black is the text length, white is the whitespace length TUPLE: element contents black white ; C: element > ] [ white>> ] bi + ; inline TUPLE: paragraph line-max line-ideal lines head-width tail-cost ; C: paragraph : if-one-line ( paragraph true false -- ) [ dup lines>> 1list? ] 2dip if ; inline TYPED: top-fits? ( paragraph: paragraph -- ? ) [ head-width>> ] [ [ line-ideal>> ] [ line-max>> ] if-one-line ] bi <= ; inline TYPED: fits? ( paragraph: paragraph -- ? ) ! Make this not count spaces at end { [ lines>> car 1list? ] [ top-fits? ] } 1|| ; inline TYPED: paragraph-cost ( paragraph: paragraph -- cost ) [ drop 0 ] [ [ head-width>> ] [ line-ideal>> - sq ] [ tail-cost>> ] tri + ] if-one-line ; inline : min-cost ( paragraphs -- paragraph ) [ paragraph-cost ] infimum-by ; inline TYPED: new-line ( paragraph: paragraph element: element -- paragraph ) { [ drop [ line-max>> ] [ line-ideal>> ] bi ] [ [ lines>> ] [ 1list ] bi* swons ] [ nip black>> ] [ drop paragraph-cost ] } 2cleave ; inline TYPED: add-element ( paragraph: paragraph element: element -- ) [ '[ _ element-length + ] change-head-width ] [ '[ unswons _ swons swons ] change-lines ] bi drop ; inline TYPED: wrap-step ( paragraphs: array element: element -- paragraphs ) [ [ min-cost ] dip new-line ] [ dupd '[ _ add-element ] each ] 2bi swap prefix { array } declare [ fits? ] filter ; inline : 1paragraph ( line-max line-ideal element -- paragraph ) [ 1list 1list ] [ black>> ] bi 0 ; : post-process ( paragraph -- array ) lines>> [ [ contents>> ] lmap>array ] lmap>array ; : initial-step ( line-max line-ideal elements -- elements paragraph ) reverse unclip [ -rot ] dip 1paragraph 1array ; PRIVATE> : wrap ( elements line-max line-ideal -- array ) rot [ 2drop { } ] [ initial-step [ wrap-step ] reduce min-cost post-process ] if-empty ;