OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2007, 2008, 2009 Google Inc. All rights reserved. | 2 * Copyright (C) 2007, 2008, 2009 Google Inc. All rights reserved. |
3 * | 3 * |
4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
6 * met: | 6 * met: |
7 * | 7 * |
8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
10 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
(...skipping 11 matching lines...) Expand all Loading... |
22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
29 */ | 29 */ |
30 | 30 |
31 #include "config.h" | 31 #include "config.h" |
32 #include "V8DOMPoint.h" | 32 #include "V8WebKitPoint.h" |
33 | 33 |
34 #include "bindings/v8/V8Binding.h" | 34 #include "bindings/v8/V8Binding.h" |
35 #include "bindings/v8/V8DOMWrapper.h" | 35 #include "bindings/v8/V8DOMWrapper.h" |
36 #include "bindings/v8/WrapperTypeInfo.h" | 36 #include "bindings/v8/WrapperTypeInfo.h" |
37 | 37 |
38 #include "wtf/MathExtras.h" | 38 #include "wtf/MathExtras.h" |
39 | 39 |
40 namespace WebCore { | 40 namespace WebCore { |
41 | 41 |
42 void V8DOMPoint::constructorCustom(const v8::FunctionCallbackInfo<v8::Value>& ar
gs) | 42 void V8WebKitPoint::constructorCustom(const v8::FunctionCallbackInfo<v8::Value>&
args) |
43 { | 43 { |
44 float x = 0; | 44 float x = 0; |
45 float y = 0; | 45 float y = 0; |
46 if (args.Length() > 1) { | 46 if (args.Length() > 1) { |
47 if (!args[0]->IsUndefined()) { | 47 if (!args[0]->IsUndefined()) { |
48 x = toFloat(args[0]); | 48 x = toFloat(args[0]); |
49 if (std::isnan(x)) | 49 if (std::isnan(x)) |
50 x = 0; | 50 x = 0; |
51 } | 51 } |
52 if (!args[1]->IsUndefined()) { | 52 if (!args[1]->IsUndefined()) { |
53 y = toFloat(args[1]); | 53 y = toFloat(args[1]); |
54 if (std::isnan(y)) | 54 if (std::isnan(y)) |
55 y = 0; | 55 y = 0; |
56 } | 56 } |
57 } | 57 } |
58 RefPtr<DOMPoint> point = DOMPoint::create(x, y); | 58 RefPtr<DOMPoint> point = DOMPoint::create(x, y); |
59 v8::Handle<v8::Object> wrapper = args.Holder(); | 59 v8::Handle<v8::Object> wrapper = args.Holder(); |
60 V8DOMWrapper::associateObjectWithWrapper(point.release(), &info, wrapper, ar
gs.GetIsolate(), WrapperConfiguration::Dependent); | 60 V8DOMWrapper::associateObjectWithWrapper(point.release(), &info, wrapper, ar
gs.GetIsolate(), WrapperConfiguration::Dependent); |
61 args.GetReturnValue().Set(wrapper); | 61 args.GetReturnValue().Set(wrapper); |
62 } | 62 } |
63 | 63 |
64 } // namespace WebCore | 64 } // namespace WebCore |
OLD | NEW |