rafaelreia / tese Goto Github PK

View Code? Open in Web Editor NEW

1.0 1.0 0.0 44.65 MB

TeX 57.18% Shell 0.10% Python 0.39% Racket 42.34%

tese's Introduction

Hi there 👋

tese's People

Contributors

Stargazers

Watchers

tese's Issues

Export functions to a file or new file. then add import

Check Syntax

Have a way to continue evaluating the program even with errors in order to display more errors and to have a possibility to do refactoring with "incomplete" programs

Improve Organize Imports

Do not compare the whole string, but substrings. because of the variants of requires and imports

add module extensability

RollBack Refactoring

Useful when doing refactorings that can only be checked in the pos-conditions.

Feedback information

Give information to the user about the Why that refactoring is impossible to do at the moment

eta-abstraction is incorrect

It is using arguments but it only should use the function to do the abstraction!

[Bug] Fix preconditions in the refactorings

Add prefix preconds are incorrect.
Organize imports.
Check the others.

Missing eta-reduction commutative

Possibility of different order in args if operation is commutative.

Add "name" to the refactoring menu

For example "Rename not-used" instead of only "Rename"

This makes the refactorings more similar to the rename already provided by DrRacket

Lacking Feature: Check if it is possible to do the Eta reduction before

Do the checks before of the eta reduction.

Transform in Plugin

Plugins are easier to add to Drracket.

Bug extract-function wrongly added args

when extracting a function with had (begin-edit-sequence) it added to the arguments of the function.

it was this piece of code:

(define (eta-two var-pos-lst)
                ;;this is done for only two args, for several do somehow a loop that for the nth element does cdr n-1 times and then car
                (define anCall? #f)
                (let* ([arg1 (car var-pos-lst)]
                       [arg2 (cadr var-pos-lst)]
                       [arg-pos-begin1 (var-arrow-start-pos-left arg1)]
                       [arg-pos-begin2 (var-arrow-start-pos-left arg2)]
                       [arg-pos-end1 (var-arrow-end-pos-right arg1)]
                       [arg-pos-end2 (var-arrow-end-pos-right arg2)])

                  (for ([var-arrow (in-list binding-aux)]) ;check if the arrow counts, 
                    (begin ;Check if it's a call, to be a cal it need to be after all args once and before all args
                      ;because the arrows received (aka the args) are increasing order by the first part of the arrow 
                      ;it is possible to do the (> arg1 arg2) like this
                      (when (and (> (var-arrow-end-pos-left var-arrow)  arg-pos-begin2 arg-pos-begin1) ;order changed because how > works.
                                 (< (var-arrow-end-pos-right var-arrow) arg-pos-end1 arg-pos-end2)) ; check if add func. 
                        (begin
                          ;(displayln "An call was found")
                          ;(displayln (var-arrow-start-pos-left var-arrow))
                          (set! anCall? #t)
                          (set! calls (cons var-arrow calls))
                          )
                        )
                      ))
                  (set! calls (remove-duplicates calls = #:key(lambda (x) (var-arrow-end-pos-left x))))
                  ;(displayln (length calls))
                  ;; write the reduction 
                  ;;get call
                  (if anCall?
                      (let ([call (send text get-text  (var-arrow-end-pos-left (car calls)) (var-arrow-end-pos-right (car calls)))]
                            [edit-sequence-txts (list this)])
                        (displayln call)
                        ;;start editiing
                        (begin-edit-sequence)
                        ;(displayln "begin")
                        (send text begin-edit-sequence)
                        (set! edit-sequence-txts (cons text edit-sequence-txts))
                        ;;Delete the text
                        (send text delete start-selection end-selection)
                        ;;write call
                        (send text insert call start-selection)
                        ;; end Editing
                        (for ([txt (in-list edit-sequence-txts)])
                          (send txt end-edit-sequence))
                        )
                      (void))



                  )


                )

the let inside the if anCall?

Ifs Cascade to Cond and vice-versa

Rename in Require

Check what the rename does.
When renamming a Required name, rename in the require and not in the original file.

Refactoring Code-walker

Must do a refactoring to Code-walker, it is becoming too difficult to understand

If to When or Unless

When one branch of the if is (void) give a warning and suggest the When or unless depending on which branch is void

Defines to/from lets

[Add] Organize Imports

Remover imports nao usados
Ordenar os restantes imports.

Refactoring Menu Design/User interaction

If all refactoring should be listed, currently there is a HUGE mess and it is not simple at all.

I need a way to fix this. A good way.