Viewing profile — matusf
matusf
HN member- Joined
- Wed, Oct 17, 2018, 9:19 PM UTC
- HN karma
- 56
- Public activity
- 18 items
- HN profile
- View on Hacker News ↗
About matusf
No profile information was provided.
Recent public activity
-
comment
Comment #34228590
[dead]
-
comment
Comment #30951922
It's more of a cure of symptoms rather than a cause, but these uBlock Origin filters work for me. They hide the signup popup. There is also a filer list called EasyList Cookie[0], …
-
comment
Comment #29244684
Thanks for the report. However, without more information I'm not able to help you. What is your setup? How did you run it? could you please share the specification file? Also, let'…
-
comment
Comment #29239693
Yes, we looked into it. There is a chapter in my thesis[0] about RESTler and comparison with OpenAPI fuzzer. The main difference between those two fuzzer is that RESTler is a state…
-
comment
Comment #29238959
Right now, it's probably not well suited for use in CI, since it runs until it's terminated. But I definitely plan to add a support for better usage in CI along with some examples.…
-
comment
Comment #29238909
No, it does not. As for the parsing of the OAS, it relies on openapiv3[0], which does not yet support it. 0: https://github.com/glademiller/openapiv3
- comment
-
comment
Comment #29231836
Hi HN, I'd like to share with you a fuzzer I've been working on. It is a black-box, smart, generation-based fuzzer, that fuzzes APIs based on OpenAPI specification. It all started …
- story
- story
-
comment
Comment #27133920
Python 3.6 added f-strings which are rather popular and they cause syntax error in previous versions of Python.
- story
-
comment
Comment #26087723
Specifying `index-url` is not a solution since `pip` will always choose a package with higher version regardless of the repository. Moreover, in case of same version, it will prior…
-
comment
Comment #25798060
How is Signal Foundation going to repay it, when it's a non-profit organization?
- story
- story
- story
-
comment
Comment #18973923
The complexity is of recursive implementation of fibonacci is O(golden ratio ^ n). If it was O(n ^ 2) it would run under 0.1s. By the way, the nimpy looks cool. Thanks for sharing.…