blob_id
stringlengths 40
40
| directory_id
stringlengths 40
40
| path
stringlengths 3
264
| content_id
stringlengths 40
40
| detected_licenses
sequencelengths 0
85
| license_type
stringclasses 2
values | repo_name
stringlengths 5
140
| snapshot_id
stringlengths 40
40
| revision_id
stringlengths 40
40
| branch_name
stringclasses 986
values | visit_date
timestamp[us] | revision_date
timestamp[us] | committer_date
timestamp[us] | github_id
int64 3.89k
681M
⌀ | star_events_count
int64 0
209k
| fork_events_count
int64 0
110k
| gha_license_id
stringclasses 23
values | gha_event_created_at
timestamp[us] | gha_created_at
timestamp[us] | gha_language
stringclasses 145
values | src_encoding
stringclasses 34
values | language
stringclasses 1
value | is_vendor
bool 1
class | is_generated
bool 2
classes | length_bytes
int64 3
10.4M
| extension
stringclasses 122
values | content
stringlengths 3
10.4M
| authors
sequencelengths 1
1
| author_id
stringlengths 0
158
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
b065c84fa2296edb20a5c66d14cc1a98138b5243 | dc53f17cf8b5e111905f8e20896a70d2c60ed4ad | /content/browser/site_per_process_unload_browsertest.cc | 0644b38d8f391a3893319648b39cba5f168c2187 | [
"BSD-3-Clause"
] | permissive | to-be-architect/chromium | 2d9b7fae2a347d0f9a9544c35e003852036a725c | 5d84ea71caa7d307fcb1f062e559dadc752544a4 | refs/heads/master | 2023-02-22T14:52:00.473036 | 2020-05-01T16:30:43 | 2020-05-01T16:30:43 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 67,078 | cc | // Copyright (c) 2012 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "content/browser/site_per_process_browsertest.h"
#include <algorithm>
#include <list>
#include <memory>
#include <string>
#include <utility>
#include <vector>
#include "base/json/json_reader.h"
#include "base/location.h"
#include "base/memory/ptr_util.h"
#include "base/run_loop.h"
#include "base/scoped_observer.h"
#include "base/single_thread_task_runner.h"
#include "base/stl_util.h"
#include "base/test/test_timeouts.h"
#include "base/threading/thread_task_runner_handle.h"
#include "base/time/time.h"
#include "build/build_config.h"
#include "components/network_session_configurator/common/network_switches.h"
#include "content/browser/frame_host/cross_process_frame_connector.h"
#include "content/browser/frame_host/frame_tree.h"
#include "content/browser/frame_host/navigation_controller_impl.h"
#include "content/browser/frame_host/navigator.h"
#include "content/browser/frame_host/render_frame_host_impl.h"
#include "content/browser/renderer_host/render_widget_host_view_child_frame.h"
#include "content/browser/web_contents/web_contents_impl.h"
#include "content/common/content_navigation_policy.h"
#include "content/common/frame_messages.h"
#include "content/public/browser/back_forward_cache.h"
#include "content/public/browser/navigation_handle.h"
#include "content/public/common/url_constants.h"
#include "content/public/test/browser_test_utils.h"
#include "content/public/test/content_browser_test_utils.h"
#include "content/shell/browser/shell.h"
#include "content/test/content_browser_test_utils_internal.h"
#include "net/test/embedded_test_server/embedded_test_server.h"
#include "net/test/embedded_test_server/http_request.h"
#include "net/test/embedded_test_server/http_response.h"
#include "testing/gmock/include/gmock/gmock.h"
#include "testing/gtest/include/gtest/gtest.h"
using testing::ElementsAre;
using testing::WhenSorted;
namespace content {
namespace {
void UnloadPrint(const ToRenderFrameHost& target, const char* message) {
EXPECT_TRUE(
ExecJs(target, JsReplace("window.onunload = function() { "
" window.domAutomationController.send($1);"
"}",
message)));
}
} // namespace
// Tests that there are no crashes if a subframe is detached in its unload
// handler. See https://crbug.com/590054.
IN_PROC_BROWSER_TEST_F(SitePerProcessBrowserTest, DetachInUnloadHandler) {
GURL main_url(embedded_test_server()->GetURL(
"a.com", "/cross_site_iframe_factory.html?a(b(b))"));
EXPECT_TRUE(NavigateToURL(shell(), main_url));
FrameTreeNode* root = static_cast<WebContentsImpl*>(shell()->web_contents())
->GetFrameTree()
->root();
EXPECT_EQ(
" Site A ------------ proxies for B\n"
" +--Site B ------- proxies for A\n"
" +--Site B -- proxies for A\n"
"Where A = http://a.com/\n"
" B = http://b.com/",
DepictFrameTree(root));
EXPECT_EQ(1, EvalJs(root->child_at(0), "frames.length;"));
RenderFrameDeletedObserver deleted_observer(
root->child_at(0)->child_at(0)->current_frame_host());
// Add an unload handler to the grandchild that causes it to be synchronously
// detached, then navigate it.
EXPECT_TRUE(ExecuteScript(
root->child_at(0)->child_at(0),
"window.onunload=function(e){\n"
" window.parent.document.getElementById('child-0').remove();\n"
"};\n"));
auto script = JsReplace("window.document.getElementById('child-0').src = $1",
embedded_test_server()->GetURL(
"c.com", "/cross_site_iframe_factory.html?c"));
EXPECT_TRUE(ExecuteScript(root->child_at(0), script));
deleted_observer.WaitUntilDeleted();
EXPECT_EQ(0, EvalJs(root->child_at(0), "frames.length;"));
EXPECT_EQ(
" Site A ------------ proxies for B\n"
" +--Site B ------- proxies for A\n"
"Where A = http://a.com/\n"
" B = http://b.com/",
DepictFrameTree(root));
}
// Tests that trying to navigate in the unload handler doesn't crash the
// browser.
IN_PROC_BROWSER_TEST_F(SitePerProcessBrowserTest, NavigateInUnloadHandler) {
GURL main_url(embedded_test_server()->GetURL(
"a.com", "/cross_site_iframe_factory.html?a(b(b))"));
EXPECT_TRUE(NavigateToURL(shell(), main_url));
FrameTreeNode* root = static_cast<WebContentsImpl*>(shell()->web_contents())
->GetFrameTree()
->root();
EXPECT_EQ(
" Site A ------------ proxies for B\n"
" +--Site B ------- proxies for A\n"
" +--Site B -- proxies for A\n"
"Where A = http://a.com/\n"
" B = http://b.com/",
DepictFrameTree(root));
EXPECT_EQ(1,
EvalJs(root->child_at(0)->current_frame_host(), "frames.length;"));
// Add an unload handler to B's subframe.
EXPECT_TRUE(
ExecuteScript(root->child_at(0)->child_at(0)->current_frame_host(),
"window.onunload=function(e){\n"
" window.location = '#navigate';\n"
"};\n"));
// Navigate B's subframe to a cross-site C.
RenderFrameDeletedObserver deleted_observer(
root->child_at(0)->child_at(0)->current_frame_host());
auto script = JsReplace("window.document.getElementById('child-0').src = $1",
embedded_test_server()->GetURL(
"c.com", "/cross_site_iframe_factory.html"));
EXPECT_TRUE(ExecuteScript(root->child_at(0)->current_frame_host(), script));
// Wait until B's subframe RenderFrameHost is destroyed.
deleted_observer.WaitUntilDeleted();
// Check that C's subframe is alive and the navigation in the unload handler
// was ignored.
EXPECT_EQ(0, EvalJs(root->child_at(0)->child_at(0)->current_frame_host(),
"frames.length;"));
EXPECT_EQ(
" Site A ------------ proxies for B C\n"
" +--Site B ------- proxies for A C\n"
" +--Site C -- proxies for A B\n"
"Where A = http://a.com/\n"
" B = http://b.com/\n"
" C = http://c.com/",
DepictFrameTree(root));
}
// Verifies that when navigating an OOPIF to same site and then canceling
// navigation from beforeunload handler popup will not remove the
// RemoteFrameView from OOPIF's owner element in the parent process. This test
// uses OOPIF visibility to make sure RemoteFrameView exists after beforeunload
// is handled.
IN_PROC_BROWSER_TEST_F(SitePerProcessBrowserTest,
CanceledBeforeUnloadShouldNotClearRemoteFrameView) {
GURL a_url(embedded_test_server()->GetURL(
"a.com", "/cross_site_iframe_factory.html?a(b)"));
EXPECT_TRUE(NavigateToURL(shell(), a_url));
FrameTreeNode* child_node =
web_contents()->GetFrameTree()->root()->child_at(0);
GURL b_url(embedded_test_server()->GetURL(
"b.com", "/render_frame_host/beforeunload.html"));
NavigateFrameToURL(child_node, b_url);
FrameConnectorDelegate* frame_connector_delegate =
static_cast<RenderWidgetHostViewChildFrame*>(
child_node->current_frame_host()->GetView())
->FrameConnectorForTesting();
// Need user gesture for 'beforeunload' to fire.
PrepContentsForBeforeUnloadTest(web_contents());
// Simulate user choosing to stay on the page after beforeunload fired.
SetShouldProceedOnBeforeUnload(shell(), true /* proceed */,
false /* success */);
// First, hide the <iframe>. This goes through RemoteFrameView::Hide() and
// eventually updates the FrameConnectorDelegate. Also,
// RemoteFrameView::self_visible_ will be set to false which can only be
// undone by calling RemoteFrameView::Show. Therefore, potential calls to
// RemoteFrameView::SetParentVisible(true) would not update the visibility at
// the browser side.
ASSERT_TRUE(ExecuteScript(
web_contents(),
"document.querySelector('iframe').style.visibility = 'hidden';"));
while (!frame_connector_delegate->IsHidden()) {
base::RunLoop run_loop;
base::ThreadTaskRunnerHandle::Get()->PostDelayedTask(
FROM_HERE, run_loop.QuitClosure(), TestTimeouts::tiny_timeout());
run_loop.Run();
}
// Now we navigate the child to about:blank, but since we do not proceed with
// the navigation, the OOPIF should stay alive and RemoteFrameView intact.
ASSERT_TRUE(ExecuteScript(
web_contents(), "document.querySelector('iframe').src = 'about:blank';"));
WaitForAppModalDialog(shell());
// Sanity check: We should still have an OOPIF and hence a RWHVCF.
ASSERT_TRUE(static_cast<RenderWidgetHostViewBase*>(
child_node->current_frame_host()->GetView())
->IsRenderWidgetHostViewChildFrame());
// Now make the <iframe> visible again. This calls RemoteFrameView::Show()
// only if the RemoteFrameView is the EmbeddedContentView of the corresponding
// HTMLFrameOwnerElement.
ASSERT_TRUE(ExecuteScript(
web_contents(),
"document.querySelector('iframe').style.visibility = 'visible';"));
while (frame_connector_delegate->IsHidden()) {
base::RunLoop run_loop;
base::ThreadTaskRunnerHandle::Get()->PostDelayedTask(
FROM_HERE, run_loop.QuitClosure(), TestTimeouts::tiny_timeout());
run_loop.Run();
}
}
// Ensure that after a main frame with an OOPIF is navigated cross-site, the
// unload handler in the OOPIF sees correct main frame origin, namely the old
// and not the new origin. See https://crbug.com/825283.
IN_PROC_BROWSER_TEST_F(SitePerProcessBrowserTest,
ParentOriginDoesNotChangeInUnloadHandler) {
GURL main_url(embedded_test_server()->GetURL(
"a.com", "/cross_site_iframe_factory.html?a(b)"));
EXPECT_TRUE(NavigateToURL(shell(), main_url));
FrameTreeNode* root = static_cast<WebContentsImpl*>(shell()->web_contents())
->GetFrameTree()
->root();
// Open a popup on b.com. The b.com subframe on the main frame will use this
// in its unload handler.
GURL b_url(embedded_test_server()->GetURL("b.com", "/title1.html"));
EXPECT_TRUE(OpenPopup(shell()->web_contents(), b_url, "popup"));
// Add an unload handler to b.com subframe, which will look up the top
// frame's origin and send it via domAutomationController. Unfortunately,
// the subframe's browser-side state will have been torn down when it runs
// the unload handler, so to ensure that the message can be received, send it
// through the popup.
EXPECT_TRUE(
ExecuteScript(root->child_at(0),
"window.onunload = function(e) {"
" window.open('','popup').domAutomationController.send("
" 'top-origin ' + location.ancestorOrigins[0]);"
"};"));
// Navigate the main frame to c.com and wait for the message from the
// subframe's unload handler.
GURL c_url(embedded_test_server()->GetURL("c.com", "/title1.html"));
DOMMessageQueue msg_queue;
EXPECT_TRUE(NavigateToURL(shell(), c_url));
std::string message, top_origin;
while (msg_queue.WaitForMessage(&message)) {
base::TrimString(message, "\"", &message);
auto message_parts = base::SplitString(message, " ", base::TRIM_WHITESPACE,
base::SPLIT_WANT_NONEMPTY);
if (message_parts[0] == "top-origin") {
top_origin = message_parts[1];
break;
}
}
// The top frame's origin should be a.com, not c.com.
EXPECT_EQ(top_origin + "/", main_url.GetOrigin().spec());
}
// Verify that when the last active frame in a process is going away as part of
// OnUnload, the FrameHostMsg_Unload_ACK is received prior to the process
// starting to shut down, ensuring that any related unload work also happens
// before shutdown. See https://crbug.com/867274 and https://crbug.com/794625.
IN_PROC_BROWSER_TEST_F(SitePerProcessBrowserTest,
UnloadACKArrivesPriorToProcessShutdownRequest) {
GURL start_url(embedded_test_server()->GetURL("a.com", "/title1.html"));
EXPECT_TRUE(NavigateToURL(shell(), start_url));
RenderFrameHostImpl* rfh = web_contents()->GetMainFrame();
rfh->DisableUnloadTimerForTesting();
// Navigate cross-site. Since the current frame is the last active frame in
// the current process, the process will eventually shut down. Once the
// process goes away, ensure that the FrameHostMsg_Unload_ACK was received
// (i.e., that we didn't just simulate OnUnloaded() due to the process
// erroneously going away before the FrameHostMsg_Unload_ACK was received, as
// in https://crbug.com/867274).
RenderProcessHostWatcher watcher(
rfh->GetProcess(), RenderProcessHostWatcher::WATCH_FOR_PROCESS_EXIT);
auto unload_ack_filter = base::MakeRefCounted<ObserveMessageFilter>(
FrameMsgStart, FrameHostMsg_Unload_ACK::ID);
rfh->GetProcess()->AddFilter(unload_ack_filter.get());
GURL cross_site_url(embedded_test_server()->GetURL("b.com", "/title1.html"));
EXPECT_TRUE(NavigateToURLFromRenderer(shell(), cross_site_url));
watcher.Wait();
EXPECT_TRUE(unload_ack_filter->has_received_message());
EXPECT_TRUE(watcher.did_exit_normally());
}
// This is a regression test for https://crbug.com/891423 in which tabs showing
// beforeunload dialogs stalled navigation and triggered the "hung process"
// dialog.
IN_PROC_BROWSER_TEST_F(SitePerProcessBrowserTest,
NoCommitTimeoutWithBeforeUnloadDialog) {
WebContentsImpl* web_contents =
static_cast<WebContentsImpl*>(shell()->web_contents());
// Navigate first tab to a.com.
GURL a_url(embedded_test_server()->GetURL("a.com", "/title1.html"));
EXPECT_TRUE(NavigateToURL(shell(), a_url));
RenderProcessHost* a_process = web_contents->GetMainFrame()->GetProcess();
// Open b.com in a second tab. Using a renderer-initiated navigation is
// important to leave a.com and b.com SiteInstances in the same
// BrowsingInstance (so the b.com -> a.com navigation in the next test step
// will reuse the process associated with the first a.com tab).
GURL b_url(embedded_test_server()->GetURL("b.com", "/title2.html"));
Shell* new_shell = OpenPopup(web_contents, b_url, "newtab");
WebContents* new_contents = new_shell->web_contents();
EXPECT_TRUE(WaitForLoadStop(new_contents));
RenderProcessHost* b_process = new_contents->GetMainFrame()->GetProcess();
EXPECT_NE(a_process, b_process);
// Disable the beforeunload hang monitor (otherwise there will be a race
// between the beforeunload dialog and the beforeunload hang timer) and give
// the page a gesture to allow dialogs.
web_contents->GetMainFrame()->DisableBeforeUnloadHangMonitorForTesting();
web_contents->GetMainFrame()->ExecuteJavaScriptWithUserGestureForTests(
base::string16());
// Hang the first contents in a beforeunload dialog.
BeforeUnloadBlockingDelegate test_delegate(web_contents);
EXPECT_TRUE(
ExecJs(web_contents, "window.onbeforeunload=function(e){ return 'x' }"));
EXPECT_TRUE(ExecJs(web_contents,
"setTimeout(function() { window.location.reload() }, 0)"));
test_delegate.Wait();
// Attempt to navigate the second tab to a.com. This will attempt to reuse
// the hung process.
base::TimeDelta kTimeout = base::TimeDelta::FromMilliseconds(100);
NavigationRequest::SetCommitTimeoutForTesting(kTimeout);
GURL hung_url(embedded_test_server()->GetURL("a.com", "/title3.html"));
UnresponsiveRendererObserver unresponsive_renderer_observer(new_contents);
EXPECT_TRUE(
ExecJs(new_contents, JsReplace("window.location = $1", hung_url)));
// Verify that we will not be notified about the unresponsive renderer.
// Before changes in https://crrev.com/c/1089797, the test would get notified
// and therefore |hung_process| would be non-null.
RenderProcessHost* hung_process =
unresponsive_renderer_observer.Wait(kTimeout * 10);
EXPECT_FALSE(hung_process);
// Reset the timeout.
NavigationRequest::SetCommitTimeoutForTesting(base::TimeDelta());
}
// Test that unload handlers in iframes are run, even when the removed subtree
// is complicated with nested iframes in different processes.
// A1 A1
// / \ / \
// B1 D --- Navigate ---> E D
// / \
// C1 C2
// | |
// B2 A2
// |
// C3
// TODO(crbug.com/1012185): Flaky timeouts on Linux and Mac.
#if defined(OS_LINUX) || defined(OS_MACOSX)
#define MAYBE_UnloadHandlerSubframes DISABLED_UnloadHandlerSubframes
#else
#define MAYBE_UnloadHandlerSubframes UnloadHandlerSubframes
#endif
IN_PROC_BROWSER_TEST_F(SitePerProcessBrowserTest,
MAYBE_UnloadHandlerSubframes) {
GURL main_url(embedded_test_server()->GetURL(
"a.com", "/cross_site_iframe_factory.html?a(b(c(b),c(a(c))),d)"));
EXPECT_TRUE(NavigateToURL(shell(), main_url));
// Add a unload handler to every frames. It notifies the browser using the
// DomAutomationController it has been executed.
FrameTreeNode* root = web_contents()->GetFrameTree()->root();
UnloadPrint(root, "A1");
UnloadPrint(root->child_at(0), "B1");
UnloadPrint(root->child_at(0)->child_at(0), "C1");
UnloadPrint(root->child_at(0)->child_at(1), "C2");
UnloadPrint(root->child_at(0)->child_at(0)->child_at(0), "B2");
UnloadPrint(root->child_at(0)->child_at(1)->child_at(0), "A2");
UnloadPrint(root->child_at(0)->child_at(1)->child_at(0)->child_at(0), "C3");
DOMMessageQueue dom_message_queue(
WebContents::FromRenderFrameHost(web_contents()->GetMainFrame()));
// Disable the unload timer on B1.
root->child_at(0)->current_frame_host()->DisableUnloadTimerForTesting();
// Process B and C are expected to shutdown once every unload handler has
// run.
RenderProcessHostWatcher shutdown_B(
root->child_at(0)->current_frame_host()->GetProcess(),
RenderProcessHostWatcher::WATCH_FOR_PROCESS_EXIT);
RenderProcessHostWatcher shutdown_C(
root->child_at(0)->child_at(0)->current_frame_host()->GetProcess(),
RenderProcessHostWatcher::WATCH_FOR_PROCESS_EXIT);
// Navigate B to E.
GURL e_url(embedded_test_server()->GetURL("e.com", "/title1.html"));
NavigateFrameToURL(root->child_at(0), e_url);
// Collect unload handler messages.
std::string message;
std::vector<std::string> messages;
for (int i = 0; i < 6; ++i) {
EXPECT_TRUE(dom_message_queue.WaitForMessage(&message));
base::TrimString(message, "\"", &message);
messages.push_back(message);
}
EXPECT_FALSE(dom_message_queue.PopMessage(&message));
// Check every frame in the replaced subtree has executed its unload handler.
EXPECT_THAT(messages,
WhenSorted(ElementsAre("A2", "B1", "B2", "C1", "C2", "C3")));
// In every renderer process, check ancestors have executed their unload
// handler before their children. This is a slightly less restrictive
// condition than the specification which requires it to be global instead of
// per process.
// https://html.spec.whatwg.org/multipage/browsing-the-web.html#unloading-documents
//
// In process B:
auto B1 = std::find(messages.begin(), messages.end(), "B1");
auto B2 = std::find(messages.begin(), messages.end(), "B2");
EXPECT_LT(B1, B2);
// In process C:
auto C2 = std::find(messages.begin(), messages.end(), "C2");
auto C3 = std::find(messages.begin(), messages.end(), "C3");
EXPECT_LT(C2, C3);
// Make sure the processes are deleted at some point.
shutdown_B.Wait();
shutdown_C.Wait();
}
// Check that unload handlers in iframe don't prevents the main frame to be
// deleted after a timeout.
IN_PROC_BROWSER_TEST_F(SitePerProcessBrowserTest, SlowUnloadHandlerInIframe) {
GURL initial_url(embedded_test_server()->GetURL(
"a.com", "/cross_site_iframe_factory.html?a(b)"));
GURL next_url(embedded_test_server()->GetURL("c.com", "/title1.html"));
// 1) Navigate on a page with an iframe.
EXPECT_TRUE(NavigateToURL(shell(), initial_url));
// 2) Act as if there was an infinite unload handler in B.
auto filter = base::MakeRefCounted<DropMessageFilter>(
FrameMsgStart, FrameHostMsg_Detach::ID);
RenderFrameHost* rfh_b =
web_contents()->GetFrameTree()->root()->child_at(0)->current_frame_host();
rfh_b->GetProcess()->AddFilter(filter.get());
// 3) Navigate and check the old frame is deleted after some time.
FrameTreeNode* root = web_contents()->GetFrameTree()->root();
RenderFrameDeletedObserver deleted_observer(root->current_frame_host());
EXPECT_TRUE(NavigateToURL(shell(), next_url));
deleted_observer.WaitUntilDeleted();
}
// Navigate from A(B(A(B)) to C. Check the unload handler are executed, executed
// in the right order and the processes for A and B are removed.
IN_PROC_BROWSER_TEST_F(SitePerProcessBrowserTest, Unload_ABAB) {
web_contents()->GetController().GetBackForwardCache().DisableForTesting(
content::BackForwardCache::TEST_USES_UNLOAD_EVENT);
GURL initial_url(embedded_test_server()->GetURL(
"a.com", "/cross_site_iframe_factory.html?a(b(a(b)))"));
GURL next_url(embedded_test_server()->GetURL("c.com", "/title1.html"));
// 1) Navigate on a page with an iframe.
EXPECT_TRUE(NavigateToURL(shell(), initial_url));
// 2) Add unload handler on every frame.
FrameTreeNode* root = web_contents()->GetFrameTree()->root();
UnloadPrint(root, "A1");
UnloadPrint(root->child_at(0), "B1");
UnloadPrint(root->child_at(0)->child_at(0), "A2");
UnloadPrint(root->child_at(0)->child_at(0)->child_at(0), "B2");
root->current_frame_host()->DisableUnloadTimerForTesting();
DOMMessageQueue dom_message_queue(
WebContents::FromRenderFrameHost(web_contents()->GetMainFrame()));
RenderProcessHostWatcher shutdown_A(
root->current_frame_host()->GetProcess(),
RenderProcessHostWatcher::WATCH_FOR_PROCESS_EXIT);
RenderProcessHostWatcher shutdown_B(
root->child_at(0)->current_frame_host()->GetProcess(),
RenderProcessHostWatcher::WATCH_FOR_PROCESS_EXIT);
// 3) Navigate cross process.
EXPECT_TRUE(NavigateToURL(shell(), next_url));
// 4) Wait for unload handler messages and check they are sent in order.
std::vector<std::string> messages;
std::string message;
for (int i = 0; i < 4; ++i) {
EXPECT_TRUE(dom_message_queue.WaitForMessage(&message));
base::TrimString(message, "\"", &message);
messages.push_back(message);
}
EXPECT_FALSE(dom_message_queue.PopMessage(&message));
EXPECT_THAT(messages, WhenSorted(ElementsAre("A1", "A2", "B1", "B2")));
auto A1 = std::find(messages.begin(), messages.end(), "A1");
auto A2 = std::find(messages.begin(), messages.end(), "A2");
auto B1 = std::find(messages.begin(), messages.end(), "B1");
auto B2 = std::find(messages.begin(), messages.end(), "B2");
EXPECT_LT(A1, A2);
EXPECT_LT(B1, B2);
// Make sure the processes are deleted at some point.
shutdown_A.Wait();
shutdown_B.Wait();
}
// Start with A(B(C)), navigate C to D and then B to E. By emulating a slow
// unload handler in B,C and D, the end result is C is in pending deletion in B
// and B is in pending deletion in A.
// (1) (2) (3)
//| | | |
//| A | A | A |
//| | | | | \ |
//| B | B | B E |
//| | | \ | \ |
//| C | C D | C D |
IN_PROC_BROWSER_TEST_F(SitePerProcessBrowserTest, UnloadNestedPendingDeletion) {
std::string onunload_script = "window.onunload = function(){}";
GURL url_abc(embedded_test_server()->GetURL(
"a.com", "/cross_site_iframe_factory.html?a(b(c))"));
GURL url_d(embedded_test_server()->GetURL("d.com", "/title1.html"));
GURL url_e(embedded_test_server()->GetURL("e.com", "/title1.html"));
// 1) Navigate to a page with an iframe.
EXPECT_TRUE(NavigateToURL(shell(), url_abc));
RenderFrameHostImpl* rfh_a = web_contents()->GetMainFrame();
RenderFrameHostImpl* rfh_b = rfh_a->child_at(0)->current_frame_host();
RenderFrameHostImpl* rfh_c = rfh_b->child_at(0)->current_frame_host();
EXPECT_EQ(RenderFrameHostImpl::LifecycleState::kActive,
rfh_a->lifecycle_state());
EXPECT_EQ(RenderFrameHostImpl::LifecycleState::kActive,
rfh_b->lifecycle_state());
EXPECT_EQ(RenderFrameHostImpl::LifecycleState::kActive,
rfh_c->lifecycle_state());
// Act as if there was a slow unload handler on rfh_b and rfh_c.
// The navigating frames are waiting for FrameHostMsg_Unload_ACK.
auto unload_ack_filter_b = base::MakeRefCounted<DropMessageFilter>(
FrameMsgStart, FrameHostMsg_Unload_ACK::ID);
auto unload_ack_filter_c = base::MakeRefCounted<DropMessageFilter>(
FrameMsgStart, FrameHostMsg_Unload_ACK::ID);
rfh_b->GetProcess()->AddFilter(unload_ack_filter_b.get());
rfh_c->GetProcess()->AddFilter(unload_ack_filter_c.get());
EXPECT_TRUE(ExecuteScript(rfh_b->frame_tree_node(), onunload_script));
EXPECT_TRUE(ExecuteScript(rfh_c->frame_tree_node(), onunload_script));
rfh_b->DisableUnloadTimerForTesting();
rfh_c->DisableUnloadTimerForTesting();
RenderFrameDeletedObserver delete_b(rfh_b), delete_c(rfh_c);
// 2) Navigate rfh_c to D.
NavigateFrameToURL(rfh_c->frame_tree_node(), url_d);
EXPECT_EQ(RenderFrameHostImpl::LifecycleState::kActive,
rfh_a->lifecycle_state());
EXPECT_EQ(RenderFrameHostImpl::LifecycleState::kActive,
rfh_b->lifecycle_state());
EXPECT_EQ(RenderFrameHostImpl::LifecycleState::kRunningUnloadHandlers,
rfh_c->lifecycle_state());
RenderFrameHostImpl* rfh_d = rfh_b->child_at(0)->current_frame_host();
// Set an arbitrarily long timeout to ensure the subframe unload timer doesn't
// fire before we call OnDetach().
rfh_d->SetSubframeUnloadTimeoutForTesting(base::TimeDelta::FromSeconds(30));
RenderFrameDeletedObserver delete_d(rfh_d);
// Act as if there was a slow unload handler on rfh_d.
// The non navigating frames are waiting for FrameHostMsg_Detach.
auto detach_filter = base::MakeRefCounted<DropMessageFilter>(
FrameMsgStart, FrameHostMsg_Detach::ID);
rfh_d->GetProcess()->AddFilter(detach_filter.get());
EXPECT_TRUE(ExecuteScript(rfh_d->frame_tree_node(), onunload_script));
// 3) Navigate rfh_b to E.
NavigateFrameToURL(rfh_b->frame_tree_node(), url_e);
EXPECT_EQ(RenderFrameHostImpl::LifecycleState::kActive,
rfh_a->lifecycle_state());
EXPECT_EQ(RenderFrameHostImpl::LifecycleState::kRunningUnloadHandlers,
rfh_b->lifecycle_state());
EXPECT_EQ(RenderFrameHostImpl::LifecycleState::kRunningUnloadHandlers,
rfh_c->lifecycle_state());
EXPECT_EQ(RenderFrameHostImpl::LifecycleState::kRunningUnloadHandlers,
rfh_d->lifecycle_state());
// rfh_d completes its unload event. It deletes the frame, including rfh_c.
EXPECT_FALSE(delete_c.deleted());
EXPECT_FALSE(delete_d.deleted());
rfh_d->OnDetach();
EXPECT_TRUE(delete_c.deleted());
EXPECT_TRUE(delete_d.deleted());
// rfh_b completes its unload event.
EXPECT_FALSE(delete_b.deleted());
rfh_b->OnUnloadACK();
EXPECT_TRUE(delete_b.deleted());
}
// A set of nested frames A1(B1(A2)) are pending deletion because of a
// navigation. This tests what happens if only A2 has an unload handler.
// If B1 receives FrameHostMsg_OnDetach before A2, it should not destroy itself
// and its children, but rather wait for A2.
IN_PROC_BROWSER_TEST_F(SitePerProcessBrowserTest, PartialUnloadHandler) {
web_contents()->GetController().GetBackForwardCache().DisableForTesting(
content::BackForwardCache::TEST_USES_UNLOAD_EVENT);
GURL url_aba(embedded_test_server()->GetURL(
"a.com", "/cross_site_iframe_factory.html?a(b(a))"));
GURL url_c(embedded_test_server()->GetURL("c.com", "/title1.html"));
// 1) Navigate to A1(B1(A2))
EXPECT_TRUE(NavigateToURL(shell(), url_aba));
FrameTreeNode* root = web_contents()->GetFrameTree()->root();
RenderFrameHostImpl* a1 = root->current_frame_host();
RenderFrameHostImpl* b1 = a1->child_at(0)->current_frame_host();
RenderFrameHostImpl* a2 = b1->child_at(0)->current_frame_host();
RenderFrameDeletedObserver delete_a1(a1);
RenderFrameDeletedObserver delete_a2(a2);
RenderFrameDeletedObserver delete_b1(b1);
// Disable Detach and FrameHostMsg_Unload_ACK. They will be called manually.
auto unload_ack_filter = base::MakeRefCounted<DropMessageFilter>(
FrameMsgStart, FrameHostMsg_Unload_ACK::ID);
auto detach_filter_a = base::MakeRefCounted<DropMessageFilter>(
FrameMsgStart, FrameHostMsg_Detach::ID);
auto detach_filter_b = base::MakeRefCounted<DropMessageFilter>(
FrameMsgStart, FrameHostMsg_Detach::ID);
a1->GetProcess()->AddFilter(unload_ack_filter.get());
a1->GetProcess()->AddFilter(detach_filter_a.get());
b1->GetProcess()->AddFilter(detach_filter_b.get());
a1->DisableUnloadTimerForTesting();
// Set an arbitrarily long timeout to ensure the subframe unload timer doesn't
// fire before we call OnDetach().
b1->SetSubframeUnloadTimeoutForTesting(base::TimeDelta::FromSeconds(30));
// Add unload handler on A2, but not on the other frames.
UnloadPrint(a2->frame_tree_node(), "A2");
DOMMessageQueue dom_message_queue(
WebContents::FromRenderFrameHost(web_contents()->GetMainFrame()));
// 2) Navigate cross process.
EXPECT_TRUE(NavigateToURL(shell(), url_c));
// Check that unload handlers are executed.
std::string message, message_unused;
EXPECT_TRUE(dom_message_queue.WaitForMessage(&message));
EXPECT_FALSE(dom_message_queue.PopMessage(&message_unused));
EXPECT_EQ("\"A2\"", message);
// No RenderFrameHost are deleted so far.
EXPECT_FALSE(delete_a1.deleted());
EXPECT_FALSE(delete_b1.deleted());
EXPECT_FALSE(delete_a2.deleted());
EXPECT_EQ(RenderFrameHostImpl::LifecycleState::kRunningUnloadHandlers,
a1->lifecycle_state());
EXPECT_EQ(RenderFrameHostImpl::LifecycleState::kReadyToBeDeleted,
b1->lifecycle_state());
EXPECT_EQ(RenderFrameHostImpl::LifecycleState::kRunningUnloadHandlers,
a2->lifecycle_state());
// 3) B1 receives confirmation it has been deleted. This has no effect,
// because it is still waiting on A2 to be deleted.
b1->OnDetach();
EXPECT_FALSE(delete_a1.deleted());
EXPECT_FALSE(delete_b1.deleted());
EXPECT_FALSE(delete_a2.deleted());
EXPECT_EQ(RenderFrameHostImpl::LifecycleState::kRunningUnloadHandlers,
a1->lifecycle_state());
EXPECT_EQ(RenderFrameHostImpl::LifecycleState::kReadyToBeDeleted,
b1->lifecycle_state());
EXPECT_EQ(RenderFrameHostImpl::LifecycleState::kRunningUnloadHandlers,
a2->lifecycle_state());
// 4) A2 received confirmation that it has been deleted and destroy B1 and A2.
a2->OnDetach();
EXPECT_FALSE(delete_a1.deleted());
EXPECT_TRUE(delete_b1.deleted());
EXPECT_TRUE(delete_a2.deleted());
EXPECT_EQ(RenderFrameHostImpl::LifecycleState::kRunningUnloadHandlers,
a1->lifecycle_state());
// 5) A1 receives FrameHostMsg_Unload_ACK and deletes itself.
a1->OnUnloadACK();
EXPECT_TRUE(delete_a1.deleted());
}
// Test RenderFrameHostImpl::PendingDeletionCheckCompletedOnSubtree.
//
// After a navigation commit, some children with no unload handler may be
// eligible for immediate deletion. Several configurations are tested:
//
// Before navigation commit
//
// 0 | N : No unload handler
// ‑‑‑‑‑‑‑‑‑‑‑‑‑‑‑‑‑‑‑‑‑ | [N] : Unload handler
// | | | | | | | |
// [1] 2 [3] 5 7 9 12 |
// | | | / \ / \ |
// 4 [6] 8 10 11 13 [14] |
//
// After navigation commit (expected)
//
// 0 | N : No unload handler
// --------------------- | [N] : Unload handler
// | | | | |
// [1] [3] 5 12 |
// | \ |
// [6] [14] |
IN_PROC_BROWSER_TEST_F(SitePerProcessBrowserTest,
PendingDeletionCheckCompletedOnSubtree) {
web_contents()->GetController().GetBackForwardCache().DisableForTesting(
content::BackForwardCache::TEST_USES_UNLOAD_EVENT);
GURL url_1(embedded_test_server()->GetURL(
"a.com",
"/cross_site_iframe_factory.html?a(a,a,a(a),a(a),a(a),a(a,a),a(a,a))"));
GURL url_2(embedded_test_server()->GetURL("b.com", "/title1.html"));
// 1) Navigate to 0(1,2,3(4),5(6),7(8),9(10,11),12(13,14));
EXPECT_TRUE(NavigateToURL(shell(), url_1));
FrameTreeNode* root = web_contents()->GetFrameTree()->root();
RenderFrameHostImpl* rfh_0 = root->current_frame_host();
RenderFrameHostImpl* rfh_1 = rfh_0->child_at(0)->current_frame_host();
RenderFrameHostImpl* rfh_2 = rfh_0->child_at(1)->current_frame_host();
RenderFrameHostImpl* rfh_3 = rfh_0->child_at(2)->current_frame_host();
RenderFrameHostImpl* rfh_4 = rfh_3->child_at(0)->current_frame_host();
RenderFrameHostImpl* rfh_5 = rfh_0->child_at(3)->current_frame_host();
RenderFrameHostImpl* rfh_6 = rfh_5->child_at(0)->current_frame_host();
RenderFrameHostImpl* rfh_7 = rfh_0->child_at(4)->current_frame_host();
RenderFrameHostImpl* rfh_8 = rfh_7->child_at(0)->current_frame_host();
RenderFrameHostImpl* rfh_9 = rfh_0->child_at(5)->current_frame_host();
RenderFrameHostImpl* rfh_10 = rfh_9->child_at(0)->current_frame_host();
RenderFrameHostImpl* rfh_11 = rfh_9->child_at(1)->current_frame_host();
RenderFrameHostImpl* rfh_12 = rfh_0->child_at(6)->current_frame_host();
RenderFrameHostImpl* rfh_13 = rfh_12->child_at(0)->current_frame_host();
RenderFrameHostImpl* rfh_14 = rfh_12->child_at(1)->current_frame_host();
RenderFrameDeletedObserver delete_a0(rfh_0), delete_a1(rfh_1),
delete_a2(rfh_2), delete_a3(rfh_3), delete_a4(rfh_4), delete_a5(rfh_5),
delete_a6(rfh_6), delete_a7(rfh_7), delete_a8(rfh_8), delete_a9(rfh_9),
delete_a10(rfh_10), delete_a11(rfh_11), delete_a12(rfh_12),
delete_a13(rfh_13), delete_a14(rfh_14);
// Add the unload handlers.
UnloadPrint(rfh_1->frame_tree_node(), "");
UnloadPrint(rfh_3->frame_tree_node(), "");
UnloadPrint(rfh_6->frame_tree_node(), "");
UnloadPrint(rfh_14->frame_tree_node(), "");
// Disable Detach and FrameHostMsg_Unload_ACK.
auto unload_ack_filter = base::MakeRefCounted<DropMessageFilter>(
FrameMsgStart, FrameHostMsg_Unload_ACK::ID);
auto detach_filter = base::MakeRefCounted<DropMessageFilter>(
FrameMsgStart, FrameHostMsg_Detach::ID);
rfh_0->GetProcess()->AddFilter(unload_ack_filter.get());
rfh_0->GetProcess()->AddFilter(detach_filter.get());
rfh_0->DisableUnloadTimerForTesting();
// 2) Navigate cross process and check the tree. See diagram above.
EXPECT_TRUE(NavigateToURL(shell(), url_2));
EXPECT_FALSE(delete_a0.deleted());
EXPECT_FALSE(delete_a1.deleted());
EXPECT_TRUE(delete_a2.deleted());
EXPECT_FALSE(delete_a3.deleted());
EXPECT_TRUE(delete_a4.deleted());
EXPECT_FALSE(delete_a5.deleted());
EXPECT_FALSE(delete_a6.deleted());
EXPECT_TRUE(delete_a7.deleted());
EXPECT_TRUE(delete_a8.deleted());
EXPECT_TRUE(delete_a9.deleted());
EXPECT_TRUE(delete_a10.deleted());
EXPECT_TRUE(delete_a11.deleted());
EXPECT_FALSE(delete_a12.deleted());
EXPECT_TRUE(delete_a13.deleted());
EXPECT_FALSE(delete_a14.deleted());
}
// When an iframe is detached, check that unload handlers execute in all of its
// child frames. Start from A(B(C)) and delete B from A.
IN_PROC_BROWSER_TEST_F(SitePerProcessBrowserTest,
DetachedIframeUnloadHandlerABC) {
GURL initial_url(embedded_test_server()->GetURL(
"a.com", "/cross_site_iframe_factory.html?a(b(c))"));
// 1) Navigate to a(b(c))
EXPECT_TRUE(NavigateToURL(shell(), initial_url));
FrameTreeNode* root = web_contents()->GetFrameTree()->root();
RenderFrameHostImpl* rfh_a = root->current_frame_host();
RenderFrameHostImpl* rfh_b = rfh_a->child_at(0)->current_frame_host();
RenderFrameHostImpl* rfh_c = rfh_b->child_at(0)->current_frame_host();
// 2) Add unload handlers on B and C.
UnloadPrint(rfh_b->frame_tree_node(), "B");
UnloadPrint(rfh_c->frame_tree_node(), "C");
DOMMessageQueue dom_message_queue(web_contents());
RenderProcessHostWatcher shutdown_B(
rfh_b->GetProcess(), RenderProcessHostWatcher::WATCH_FOR_PROCESS_EXIT);
RenderProcessHostWatcher shutdown_C(
rfh_c->GetProcess(), RenderProcessHostWatcher::WATCH_FOR_PROCESS_EXIT);
// 3) Detach B from A.
ExecuteScriptAsync(root, "document.querySelector('iframe').remove();");
// 4) Wait for unload handler.
std::vector<std::string> messages(2);
EXPECT_TRUE(dom_message_queue.WaitForMessage(&messages[0]));
EXPECT_TRUE(dom_message_queue.WaitForMessage(&messages[1]));
std::string unused;
EXPECT_FALSE(dom_message_queue.PopMessage(&unused));
std::sort(messages.begin(), messages.end());
EXPECT_EQ("\"B\"", messages[0]);
EXPECT_EQ("\"C\"", messages[1]);
// Make sure the processes are deleted at some point.
shutdown_B.Wait();
shutdown_C.Wait();
}
// When an iframe is detached, check that unload handlers execute in all of its
// child frames. Start from A(B1(C(B2))) and delete B1 from A.
IN_PROC_BROWSER_TEST_F(SitePerProcessBrowserTest,
DetachedIframeUnloadHandlerABCB) {
GURL initial_url(embedded_test_server()->GetURL(
"a.com", "/cross_site_iframe_factory.html?a(b(c(b)))"));
// 1) Navigate to a(b(c(b)))
EXPECT_TRUE(NavigateToURL(shell(), initial_url));
FrameTreeNode* root = web_contents()->GetFrameTree()->root();
RenderFrameHostImpl* rfh_a = root->current_frame_host();
RenderFrameHostImpl* rfh_b1 = rfh_a->child_at(0)->current_frame_host();
RenderFrameHostImpl* rfh_c = rfh_b1->child_at(0)->current_frame_host();
RenderFrameHostImpl* rfh_b2 = rfh_c->child_at(0)->current_frame_host();
// 2) Add unload handlers on B1, B2 and C.
UnloadPrint(rfh_b1->frame_tree_node(), "B1");
UnloadPrint(rfh_b2->frame_tree_node(), "B2");
UnloadPrint(rfh_c->frame_tree_node(), "C");
DOMMessageQueue dom_message_queue(web_contents());
RenderProcessHostWatcher shutdown_B(
rfh_b1->GetProcess(), RenderProcessHostWatcher::WATCH_FOR_PROCESS_EXIT);
RenderProcessHostWatcher shutdown_C(
rfh_c->GetProcess(), RenderProcessHostWatcher::WATCH_FOR_PROCESS_EXIT);
// 3) Detach B from A.
ExecuteScriptAsync(root, "document.querySelector('iframe').remove();");
// 4) Wait for unload handler.
std::vector<std::string> messages(3);
EXPECT_TRUE(dom_message_queue.WaitForMessage(&messages[0]));
EXPECT_TRUE(dom_message_queue.WaitForMessage(&messages[1]));
EXPECT_TRUE(dom_message_queue.WaitForMessage(&messages[2]));
std::string unused;
EXPECT_FALSE(dom_message_queue.PopMessage(&unused));
std::sort(messages.begin(), messages.end());
EXPECT_EQ("\"B1\"", messages[0]);
EXPECT_EQ("\"B2\"", messages[1]);
EXPECT_EQ("\"C\"", messages[2]);
// Make sure the processes are deleted at some point.
shutdown_B.Wait();
shutdown_C.Wait();
}
// When an iframe is detached, check that unload handlers execute in all of its
// child frames. Start from A1(A2(B)), delete A2 from itself.
IN_PROC_BROWSER_TEST_F(SitePerProcessBrowserTest,
DetachedIframeUnloadHandlerAAB) {
GURL initial_url(embedded_test_server()->GetURL(
"a.com", "/cross_site_iframe_factory.html?a(a(b))"));
// 1) Navigate to a(a(b)).
EXPECT_TRUE(NavigateToURL(shell(), initial_url));
FrameTreeNode* root = web_contents()->GetFrameTree()->root();
RenderFrameHostImpl* rfh_a1 = root->current_frame_host();
RenderFrameHostImpl* rfh_a2 = rfh_a1->child_at(0)->current_frame_host();
RenderFrameHostImpl* rfh_b = rfh_a2->child_at(0)->current_frame_host();
// 2) Add unload handlers on A2 ad B.
UnloadPrint(rfh_a2->frame_tree_node(), "A2");
UnloadPrint(rfh_b->frame_tree_node(), "B");
DOMMessageQueue dom_message_queue(web_contents());
RenderProcessHostWatcher shutdown_B(
rfh_b->GetProcess(), RenderProcessHostWatcher::WATCH_FOR_PROCESS_EXIT);
// 3) A2 detaches itself.
ExecuteScriptAsync(rfh_a2->frame_tree_node(),
"parent.document.querySelector('iframe').remove();");
// 4) Wait for unload handler.
std::vector<std::string> messages(2);
EXPECT_TRUE(dom_message_queue.WaitForMessage(&messages[0]));
EXPECT_TRUE(dom_message_queue.WaitForMessage(&messages[1]));
std::string unused;
EXPECT_FALSE(dom_message_queue.PopMessage(&unused));
std::sort(messages.begin(), messages.end());
EXPECT_EQ("\"A2\"", messages[0]);
EXPECT_EQ("\"B\"", messages[1]);
// Make sure the process is deleted at some point.
shutdown_B.Wait();
}
// Tests that running layout from an unload handler inside teardown of the
// RenderWidget (inside WidgetMsg_Close) can succeed.
IN_PROC_BROWSER_TEST_F(SitePerProcessBrowserTest,
RendererInitiatedWindowCloseWithUnload) {
GURL main_url(embedded_test_server()->GetURL("a.com", "/empty.html"));
EXPECT_TRUE(NavigateToURL(shell(), main_url));
FrameTreeNode* root = web_contents()->GetFrameTree()->root();
// We will window.open() another URL on the same domain so they share a
// renderer. This window has an unload handler that forces layout to occur.
// Then we (in a new stack) close that window causing that layout. If all
// goes well the window closes. If it goes poorly, the renderer may crash.
//
// This path is special because the unload results from window.close() which
// avoids the user-initiated close path through ViewMsg_ClosePage. In that
// path the unload handlers are run early, before the actual teardown of
// the closing RenderWidget.
GURL open_url = embedded_test_server()->GetURL(
"a.com", "/unload_handler_force_layout.html");
// Listen for messages from the window that the test opens, and convert them
// into the document title, which we can wait on in the main test window.
EXPECT_TRUE(
ExecuteScript(root,
"window.addEventListener('message', function(event) {\n"
" document.title = event.data;\n"
"});"));
// This performs window.open() and waits for the title of the original
// document to change to signal that the unload handler has been registered.
{
base::string16 title_when_loaded = base::UTF8ToUTF16("loaded");
TitleWatcher title_watcher(shell()->web_contents(), title_when_loaded);
EXPECT_TRUE(
ExecuteScript(root, JsReplace("var w = window.open($1)", open_url)));
EXPECT_EQ(title_watcher.WaitAndGetTitle(), title_when_loaded);
}
// The closes the window and waits for the title of the original document to
// change again to signal that the unload handler has run.
{
base::string16 title_when_done = base::UTF8ToUTF16("unloaded");
TitleWatcher title_watcher(shell()->web_contents(), title_when_done);
EXPECT_TRUE(ExecuteScript(root, "w.close()"));
EXPECT_EQ(title_watcher.WaitAndGetTitle(), title_when_done);
}
}
// Regression test for https://crbug.com/960006.
//
// 1. Navigate to a1(a2(b3),c4),
// 2. b3 has a slow unload handler.
// 3. a2 navigates same process.
// 4. When the new document is loaded, a message is sent to c4 to check it
// cannot see b3 anymore, even if b3 is still unloading.
IN_PROC_BROWSER_TEST_F(
SitePerProcessBrowserTest,
IsDetachedSubframeObservableDuringUnloadHandlerSameProcess) {
GURL page_url(embedded_test_server()->GetURL(
"a.com", "/cross_site_iframe_factory.html?a(a(b),c)"));
EXPECT_TRUE(NavigateToURL(shell(), page_url));
RenderFrameHostImpl* node1 =
static_cast<WebContentsImpl*>(shell()->web_contents())
->GetFrameTree()
->root()
->current_frame_host();
RenderFrameHostImpl* node2 = node1->child_at(0)->current_frame_host();
RenderFrameHostImpl* node3 = node2->child_at(0)->current_frame_host();
RenderFrameHostImpl* node4 = node1->child_at(1)->current_frame_host();
ASSERT_TRUE(ExecJs(node1, "window.name = 'node1'"));
ASSERT_TRUE(ExecJs(node2, "window.name = 'node2'"));
ASSERT_TRUE(ExecJs(node3, "window.name = 'node3'"));
ASSERT_TRUE(ExecJs(node4, "window.name = 'node4'"));
// Test sanity check.
EXPECT_EQ(true, EvalJs(node1, "!!top.node2.node3"));
EXPECT_EQ(true, EvalJs(node2, "!!top.node2.node3"));
EXPECT_EQ(true, EvalJs(node3, "!!top.node2.node3"));
EXPECT_EQ(true, EvalJs(node4, "!!top.node2.node3"));
// Simulate a long-running unload handler in |node3|.
auto detach_filter = base::MakeRefCounted<DropMessageFilter>(
FrameMsgStart, FrameHostMsg_Detach::ID);
node3->GetProcess()->AddFilter(detach_filter.get());
node2->DisableUnloadTimerForTesting();
ASSERT_TRUE(ExecJs(node3, "window.onunload = ()=>{}"));
// Prepare |node4| to respond to postMessage with a report of whether it can
// still find |node3|.
const char* kPostMessageHandlerScript = R"(
window.postMessageGotData == false;
window.postMessageCallback = function() {};
function receiveMessage(event) {
console.log('node4 - receiveMessage...');
var can_node3_be_found = false;
try {
can_node3_be_found = !!top.node2.node3;
} catch(e) {
can_node3_be_found = false;
}
window.postMessageGotData = true;
window.postMessageData = can_node3_be_found;
window.postMessageCallback(window.postMessageData);
}
window.addEventListener("message", receiveMessage, false);
)";
ASSERT_TRUE(ExecJs(node4, kPostMessageHandlerScript));
// Make |node1| navigate |node2| same process and after the navigation
// succeeds, send a post message to |node4|. We expect that the effects of the
// commit should be visible to |node4| by the time it receives the posted
// message.
const char* kNavigationScript = R"(
var node2_frame = document.getElementsByTagName('iframe')[0];
node2_frame.onload = function() {
console.log('node2_frame.onload ...');
node4.postMessage('try to find node3', '*');
};
node2_frame.src = $1;
)";
GURL url = embedded_test_server()->GetURL("a.com", "/title1.html");
ASSERT_TRUE(ExecJs(node1, JsReplace(kNavigationScript, url)));
// Check if |node4| has seen |node3| even after |node2| navigation finished
// (no other frame should see |node3| after the navigation of its parent).
const char* kPostMessageResultsScript = R"(
new Promise(function (resolve, reject) {
if (window.postMessageGotData)
resolve(window.postMessageData);
else
window.postMessageCallback = resolve;
});
)";
EXPECT_EQ(false, EvalJs(node4, kPostMessageResultsScript));
}
// Regression test for https://crbug.com/960006.
//
// 1. Navigate to a1(a2(b3),c4),
// 2. b3 has a slow unload handler.
// 3. a2 navigates cross process.
// 4. When the new document is loaded, a message is sent to c4 to check it
// cannot see b3 anymore, even if b3 is still unloading.
//
// Note: This test is the same as the above, except it uses a cross-process
// navigation at step 3.
IN_PROC_BROWSER_TEST_F(
SitePerProcessBrowserTest,
IsDetachedSubframeObservableDuringUnloadHandlerCrossProcess) {
GURL page_url(embedded_test_server()->GetURL(
"a.com", "/cross_site_iframe_factory.html?a(a(b),c)"));
EXPECT_TRUE(NavigateToURL(shell(), page_url));
RenderFrameHostImpl* node1 =
static_cast<WebContentsImpl*>(shell()->web_contents())
->GetFrameTree()
->root()
->current_frame_host();
RenderFrameHostImpl* node2 = node1->child_at(0)->current_frame_host();
RenderFrameHostImpl* node3 = node2->child_at(0)->current_frame_host();
RenderFrameHostImpl* node4 = node1->child_at(1)->current_frame_host();
ASSERT_TRUE(ExecJs(node1, "window.name = 'node1'"));
ASSERT_TRUE(ExecJs(node2, "window.name = 'node2'"));
ASSERT_TRUE(ExecJs(node3, "window.name = 'node3'"));
ASSERT_TRUE(ExecJs(node4, "window.name = 'node4'"));
// Test sanity check.
EXPECT_EQ(true, EvalJs(node1, "!!top.node2.node3"));
EXPECT_EQ(true, EvalJs(node2, "!!top.node2.node3"));
EXPECT_EQ(true, EvalJs(node3, "!!top.node2.node3"));
EXPECT_EQ(true, EvalJs(node4, "!!top.node2.node3"));
// Add a long-running unload handler to |node3|.
auto detach_filter = base::MakeRefCounted<DropMessageFilter>(
FrameMsgStart, FrameHostMsg_Detach::ID);
node3->GetProcess()->AddFilter(detach_filter.get());
node2->DisableUnloadTimerForTesting();
ASSERT_TRUE(ExecJs(node3, "window.onunload = ()=>{}"));
// Prepare |node4| to respond to postMessage with a report of whether it can
// still find |node3|.
const char* kPostMessageHandlerScript = R"(
window.postMessageGotData == false;
window.postMessageCallback = function() {};
function receiveMessage(event) {
console.log('node4 - receiveMessage...');
var can_node3_be_found = false;
try {
can_node3_be_found = !!top.node2.node3;
} catch(e) {
can_node3_be_found = false;
}
window.postMessageGotData = true;
window.postMessageData = can_node3_be_found;
window.postMessageCallback(window.postMessageData);
}
window.addEventListener("message", receiveMessage, false);
)";
ASSERT_TRUE(ExecJs(node4, kPostMessageHandlerScript));
// Make |node1| navigate |node2| cross process and after the navigation
// succeeds, send a post message to |node4|. We expect that the effects of the
// commit should be visible to |node4| by the time it receives the posted
// message.
const char* kNavigationScript = R"(
var node2_frame = document.getElementsByTagName('iframe')[0];
node2_frame.onload = function() {
console.log('node2_frame.onload ...');
node4.postMessage('try to find node3', '*');
};
node2_frame.src = $1;
)";
GURL url = embedded_test_server()->GetURL("d.com", "/title1.html");
ASSERT_TRUE(ExecJs(node1, JsReplace(kNavigationScript, url)));
// Check if |node4| has seen |node3| even after |node2| navigation finished
// (no other frame should see |node3| after the navigation of its parent).
const char* kPostMessageResultsScript = R"(
new Promise(function (resolve, reject) {
if (window.postMessageGotData)
resolve(window.postMessageData);
else
window.postMessageCallback = resolve;
});
)";
EXPECT_EQ(false, EvalJs(node4, kPostMessageResultsScript));
}
// Regression test. https://crbug.com/963330
// 1. Start from A1(B2,C3)
// 2. B2 is the "focused frame", is deleted and starts unloading.
// 3. C3 commits a new navigation before B2 has completed its unload.
IN_PROC_BROWSER_TEST_F(SitePerProcessBrowserTest, FocusedFrameUnload) {
// 1) Start from A1(B2,C3)
EXPECT_TRUE(NavigateToURL(
shell(), embedded_test_server()->GetURL(
"a.com", "/cross_site_iframe_factory.html?a(b,c)")));
RenderFrameHostImpl* A1 = web_contents()->GetMainFrame();
RenderFrameHostImpl* B2 = A1->child_at(0)->current_frame_host();
RenderFrameHostImpl* C3 = A1->child_at(1)->current_frame_host();
FrameTree* frame_tree = A1->frame_tree_node()->frame_tree();
// 2.1) Make B2 to be the focused frame.
EXPECT_EQ(A1->frame_tree_node(), frame_tree->GetFocusedFrame());
EXPECT_TRUE(ExecJs(A1, "document.querySelector('iframe').focus()"));
EXPECT_EQ(B2->frame_tree_node(), frame_tree->GetFocusedFrame());
// 2.2 Unload B2. Drop detach message to simulate a long unloading.
auto filter = base::MakeRefCounted<DropMessageFilter>(
FrameMsgStart, FrameHostMsg_Detach::ID);
B2->GetProcess()->AddFilter(filter.get());
B2->SetSubframeUnloadTimeoutForTesting(base::TimeDelta::FromSeconds(30));
EXPECT_FALSE(B2->GetSuddenTerminationDisablerState(
blink::mojom::SuddenTerminationDisablerType::kUnloadHandler));
EXPECT_TRUE(ExecJs(B2, "window.onunload = ()=>{};"));
EXPECT_TRUE(B2->GetSuddenTerminationDisablerState(
blink::mojom::SuddenTerminationDisablerType::kUnloadHandler));
EXPECT_TRUE(B2->is_active());
EXPECT_TRUE(ExecJs(A1, "document.querySelector('iframe').remove()"));
EXPECT_EQ(nullptr, frame_tree->GetFocusedFrame());
EXPECT_EQ(2u, A1->child_count());
EXPECT_FALSE(B2->is_active());
// 3. C3 navigates.
NavigateFrameToURL(C3->frame_tree_node(),
embedded_test_server()->GetURL("d.com", "/title1.html"));
EXPECT_TRUE(WaitForLoadStop(web_contents()));
EXPECT_EQ(2u, A1->child_count());
}
// Test the unload timeout is effective.
IN_PROC_BROWSER_TEST_F(SitePerProcessBrowserTest, UnloadTimeout) {
GURL main_url(embedded_test_server()->GetURL(
"a.com", "/cross_site_iframe_factory.html?a(b)"));
EXPECT_TRUE(NavigateToURL(shell(), main_url));
RenderFrameHostImpl* A1 = web_contents()->GetMainFrame();
RenderFrameHostImpl* B2 = A1->child_at(0)->current_frame_host();
// Simulate the iframe being slow to unload by dropping the
// FrameHostMsg_Detach message sent from B2 to the browser.
EXPECT_TRUE(ExecJs(B2, "window.onunload = ()=>{};"));
auto detach_filter = base::MakeRefCounted<DropMessageFilter>(
FrameMsgStart, FrameHostMsg_Detach::ID);
B2->GetProcess()->AddFilter(detach_filter.get());
RenderFrameDeletedObserver delete_B2(B2);
EXPECT_TRUE(ExecJs(A1, "document.querySelector('iframe').remove()"));
delete_B2.WaitUntilDeleted();
}
// Test that an unloading child can PostMessage its cross-process parent.
IN_PROC_BROWSER_TEST_F(SitePerProcessBrowserTest,
UnloadPostMessageToParentCrossProcess) {
GURL main_url(embedded_test_server()->GetURL(
"a.com", "/cross_site_iframe_factory.html?a(b)"));
EXPECT_TRUE(NavigateToURL(shell(), main_url));
RenderFrameHostImpl* A1 = web_contents()->GetMainFrame();
RenderFrameHostImpl* B2 = A1->child_at(0)->current_frame_host();
RenderFrameDeletedObserver delete_B2(B2);
EXPECT_TRUE(ExecJs(B2, R"(
window.addEventListener("unload", function() {
window.parent.postMessage("B2 message", "*");
});
)"));
EXPECT_TRUE(ExecJs(A1, R"(
window.received_message = "nothing received";
var received = false;
window.addEventListener('message', function(event) {
received_message = event.data;
});
document.querySelector('iframe').remove();
)"));
delete_B2.WaitUntilDeleted();
// TODO(https://crbug.com/964950): PostMessage called from an unloading frame
// must work. A1 must received 'B2 message'. This is not the case here.
EXPECT_EQ("nothing received", EvalJs(A1, "received_message"));
}
// Test that an unloading child can PostMessage its same-process parent.
IN_PROC_BROWSER_TEST_F(SitePerProcessBrowserTest,
UnloadPostMessageToParentSameProcess) {
GURL main_url(embedded_test_server()->GetURL(
"a.com", "/cross_site_iframe_factory.html?a(a)"));
EXPECT_TRUE(NavigateToURL(shell(), main_url));
RenderFrameHostImpl* A1 = web_contents()->GetMainFrame();
RenderFrameHostImpl* A2 = A1->child_at(0)->current_frame_host();
RenderFrameDeletedObserver delete_A1(A2);
EXPECT_TRUE(ExecJs(A2, R"(
window.addEventListener("unload", function() {
window.parent.postMessage("A2 message", "*");
});
)"));
EXPECT_TRUE(ExecJs(A1, R"(
window.received_message = "nothing received";
var received = false;
window.addEventListener('message', function(event) {
received_message = event.data;
});
document.querySelector('iframe').remove();
)"));
delete_A1.WaitUntilDeleted();
EXPECT_EQ("A2 message", EvalJs(A1, "received_message"));
}
// Related to issue https://crbug.com/950625.
//
// 1. Start from A1(B1)
// 2. Navigate A1 to A3, same-process.
// 3. A1 requests the browser to detach B1, but this message is dropped.
// 4. The browser must be resilient and detach B1 when A3 commits.
IN_PROC_BROWSER_TEST_F(SitePerProcessBrowserTest,
SameProcessNavigationResilientToDetachDropped) {
GURL A1_url(embedded_test_server()->GetURL(
"a.com", "/cross_site_iframe_factory.html?a(b)"));
GURL A3_url(embedded_test_server()->GetURL("a.com", "/title1.html"));
EXPECT_TRUE(NavigateToURL(shell(), A1_url));
RenderFrameHostImpl* A1 = web_contents()->GetMainFrame();
RenderFrameHostImpl* B1 = A1->child_at(0)->current_frame_host();
auto detach_filter = base::MakeRefCounted<DropMessageFilter>(
FrameMsgStart, FrameHostMsg_Detach::ID);
A1->GetProcess()->AddFilter(detach_filter.get());
RenderFrameDeletedObserver delete_B1(B1);
shell()->LoadURL(A3_url);
delete_B1.WaitUntilDeleted();
}
// After a same-origin iframe navigation, check that gradchild iframe are
// properly deleted and their unload handler executed.
IN_PROC_BROWSER_TEST_F(SitePerProcessBrowserTest,
NestedSubframeWithUnloadHandler) {
GURL main_url = embedded_test_server()->GetURL(
"a.com", "/cross_site_iframe_factory.html?a(b(b,c))");
GURL iframe_new_url = embedded_test_server()->GetURL("b.com", "/title1.html");
EXPECT_TRUE(NavigateToURL(shell(), main_url));
// In the document tree: A1(B2(B3,C4)) navigate B2 to B5.
RenderFrameHostImpl* A1 = web_contents()->GetMainFrame();
RenderFrameHostImpl* B2 = A1->child_at(0)->current_frame_host();
RenderFrameHostImpl* B3 = B2->child_at(0)->current_frame_host();
RenderFrameHostImpl* C4 = B2->child_at(1)->current_frame_host();
RenderFrameDeletedObserver delete_B2(B2);
RenderFrameDeletedObserver delete_B3(B3);
RenderFrameDeletedObserver delete_C4(C4);
UnloadPrint(B2, "B2");
UnloadPrint(B3, "B3");
UnloadPrint(C4, "C4");
// Navigate the iframe same-process.
ExecuteScriptAsync(B2, JsReplace("location.href = $1", iframe_new_url));
DOMMessageQueue dom_message_queue(
WebContents::FromRenderFrameHost(web_contents()->GetMainFrame()));
// All the documents must be properly deleted:
if (CreateNewHostForSameSiteSubframe())
delete_B2.WaitUntilDeleted();
delete_B3.WaitUntilDeleted();
delete_C4.WaitUntilDeleted();
// The unload handlers must have run:
std::string message;
std::vector<std::string> messages;
for (int i = 0; i < 3; ++i) {
EXPECT_TRUE(dom_message_queue.WaitForMessage(&message));
base::TrimString(message, "\"", &message);
messages.push_back(message);
}
EXPECT_FALSE(dom_message_queue.PopMessage(&message));
EXPECT_THAT(messages, WhenSorted(ElementsAre("B2", "B3", "C4")));
}
// Some tests need an https server because third-party cookies are used, and
// SameSite=None cookies must be Secure. This is a separate fixture due to
// kIgnoreCertificateErrors flag.
class SitePerProcessSSLBrowserTest : public SitePerProcessBrowserTest {
protected:
SitePerProcessSSLBrowserTest()
: https_server_(net::EmbeddedTestServer::TYPE_HTTPS) {}
void SetUpCommandLine(base::CommandLine* command_line) override {
SitePerProcessBrowserTest::SetUpCommandLine(command_line);
// This is necessary to use https with arbitrary hostnames.
command_line->AppendSwitch(switches::kIgnoreCertificateErrors);
}
void SetUpOnMainThread() override {
https_server()->AddDefaultHandlers(GetTestDataFilePath());
ASSERT_TRUE(https_server()->Start());
SitePerProcessBrowserTest::SetUpOnMainThread();
}
net::EmbeddedTestServer* https_server() { return &https_server_; }
private:
net::EmbeddedTestServer https_server_;
};
// Unload handlers should be able to do things that might require for instance
// the RenderFrameHostImpl to stay alive.
// - use console.log (handled via RFHI::DidAddMessageToConsole).
// - use history.replaceState (handled via RFHI::OnUpdateState).
// - use document.cookie
// - use localStorage
//
// Test case:
// 1. Start on A1(B2). B2 has an unload handler.
// 2. Go to A3.
// 3. Go back to A4(B5).
//
// TODO(https://crbug.com/960976): history.replaceState is broken in OOPIFs.
//
// This test is similar to UnloadHandlersArePowerfulGrandChild, but with a
// different frame hierarchy.
IN_PROC_BROWSER_TEST_F(SitePerProcessSSLBrowserTest,
UnloadHandlersArePowerful) {
// Navigate to a page hosting a cross-origin frame.
GURL url =
https_server()->GetURL("a.com", "/cross_site_iframe_factory.html?a(b)");
EXPECT_TRUE(NavigateToURL(shell(), url));
RenderFrameHostImpl* A1 = web_contents()->GetMainFrame();
RenderFrameHostImpl* B2 = A1->child_at(0)->current_frame_host();
// Increase Unload timeout to prevent the previous document from
// being deleleted before it has finished running B2 unload handler.
A1->DisableUnloadTimerForTesting();
B2->SetSubframeUnloadTimeoutForTesting(base::TimeDelta::FromSeconds(30));
// Add an unload handler to the subframe and try in that handler to preserve
// state that we will try to recover later.
ASSERT_TRUE(ExecJs(B2, R"(
window.addEventListener("unload", function() {
// Waiting for 100ms, to give more time for browser-side things to go bad
// and delete RenderFrameHostImpl prematurely.
var start = (new Date()).getTime();
do {
curr = (new Date()).getTime();
} while (start + 100 > curr);
// Test that various RFHI-dependent things work fine in an unload handler.
stateObj = { "history_test_key": "history_test_value" }
history.replaceState(stateObj, 'title', window.location.href);
console.log('console.log() sent');
// As a sanity check, test that RFHI-independent things also work fine.
localStorage.localstorage_test_key = 'localstorage_test_value';
document.cookie = 'cookie_test_key=' +
'cookie_test_value; SameSite=none; Secure';
});
)"));
// Navigate A1(B2) to A3.
{
// Prepare observers.
ConsoleObserverDelegate console(web_contents(), "console.log() sent");
web_contents()->SetDelegate(&console);
RenderFrameDeletedObserver B2_deleted(B2);
// Navigate
GURL away_url(https_server()->GetURL("a.com", "/title1.html"));
ASSERT_TRUE(ExecJs(A1, JsReplace("location = $1", away_url)));
// Observers must be reached.
B2_deleted.WaitUntilDeleted();
console.Wait();
}
// Navigate back from A3 to A4(B5).
web_contents()->GetController().GoBack();
EXPECT_TRUE(WaitForLoadStop(shell()->web_contents()));
RenderFrameHostImpl* A4 = web_contents()->GetMainFrame();
RenderFrameHostImpl* B5 = A4->child_at(0)->current_frame_host();
// Verify that we can recover the data that should have been persisted by the
// unload handler.
EXPECT_EQ("localstorage_test_value",
EvalJs(B5, "localStorage.localstorage_test_key"));
EXPECT_EQ("cookie_test_key=cookie_test_value", EvalJs(B5, "document.cookie"));
// TODO(lukasza): https://crbug.com/960976: Make the verification below
// unconditional, once the bug is fixed.
if (!AreAllSitesIsolatedForTesting()) {
EXPECT_EQ("history_test_value",
EvalJs(B5, "history.state.history_test_key"));
}
}
// Unload handlers should be able to do things that might require for instance
// the RenderFrameHostImpl to stay alive.
// - use console.log (handled via RFHI::DidAddMessageToConsole).
// - use history.replaceState (handled via RFHI::OnUpdateState).
// - use document.cookie
// - use localStorage
//
// Test case:
// 1. Start on A1(B2(C3)). C3 has an unload handler.
// 2. Go to A4.
// 3. Go back to A5(B6(C7)).
//
// TODO(https://crbug.com/960976): history.replaceState is broken in OOPIFs.
//
// This test is similar to UnloadHandlersArePowerful, but with a different frame
// hierarchy.
IN_PROC_BROWSER_TEST_F(SitePerProcessSSLBrowserTest,
UnloadHandlersArePowerfulGrandChild) {
// Navigate to a page hosting a cross-origin frame.
GURL url = https_server()->GetURL("a.com",
"/cross_site_iframe_factory.html?a(b(c))");
EXPECT_TRUE(NavigateToURL(shell(), url));
RenderFrameHostImpl* A1 = web_contents()->GetMainFrame();
RenderFrameHostImpl* B2 = A1->child_at(0)->current_frame_host();
RenderFrameHostImpl* C3 = B2->child_at(0)->current_frame_host();
// Increase Unload timeout to prevent the previous document from
// being deleleted before it has finished running C3 unload handler.
A1->DisableUnloadTimerForTesting();
B2->SetSubframeUnloadTimeoutForTesting(base::TimeDelta::FromSeconds(30));
C3->SetSubframeUnloadTimeoutForTesting(base::TimeDelta::FromSeconds(30));
// Add an unload handler to the subframe and try in that handler to preserve
// state that we will try to recover later.
ASSERT_TRUE(ExecJs(C3, R"(
window.addEventListener("unload", function() {
// Waiting for 100ms, to give more time for browser-side things to go bad
// and delete RenderFrameHostImpl prematurely.
var start = (new Date()).getTime();
do {
curr = (new Date()).getTime();
} while (start + 100 > curr);
// Test that various RFHI-dependent things work fine in an unload handler.
stateObj = { "history_test_key": "history_test_value" }
history.replaceState(stateObj, 'title', window.location.href);
console.log('console.log() sent');
// As a sanity check, test that RFHI-independent things also work fine.
localStorage.localstorage_test_key = 'localstorage_test_value';
document.cookie = 'cookie_test_key=' +
'cookie_test_value; SameSite=none; Secure';
});
)"));
// Navigate A1(B2(C3) to A4.
{
// Prepare observers.
ConsoleObserverDelegate console(web_contents(), "console.log() sent");
web_contents()->SetDelegate(&console);
RenderFrameDeletedObserver B2_deleted(B2);
RenderFrameDeletedObserver C3_deleted(C3);
// Navigate
GURL away_url(https_server()->GetURL("a.com", "/title1.html"));
ASSERT_TRUE(ExecJs(A1, JsReplace("location = $1", away_url)));
// Observers must be reached.
B2_deleted.WaitUntilDeleted();
C3_deleted.WaitUntilDeleted();
console.Wait();
}
// Navigate back from A4 to A5(B6(C7))
web_contents()->GetController().GoBack();
EXPECT_TRUE(WaitForLoadStop(shell()->web_contents()));
RenderFrameHostImpl* A5 = web_contents()->GetMainFrame();
RenderFrameHostImpl* B6 = A5->child_at(0)->current_frame_host();
RenderFrameHostImpl* C7 = B6->child_at(0)->current_frame_host();
// Verify that we can recover the data that should have been persisted by the
// unload handler.
EXPECT_EQ("localstorage_test_value",
EvalJs(C7, "localStorage.localstorage_test_key"));
EXPECT_EQ("cookie_test_key=cookie_test_value", EvalJs(C7, "document.cookie"));
// TODO(lukasza): https://crbug.com/960976: Make the verification below
// unconditional, once the bug is fixed.
if (!AreAllSitesIsolatedForTesting()) {
EXPECT_EQ("history_test_value",
EvalJs(C7, "history.state.history_test_key"));
}
}
} // namespace content
| [
"[email protected]"
] | |
471cc1b9c4d3691c4676f884eb1dd5572e388d22 | 256079f44c3753c53e975efe127b4b34a137fdda | /include/hermes/VM/HadesGC.h | 6626a1d6a0af6a2405d25a089b4c3f821ddca561 | [
"MIT"
] | permissive | o-abbas/hermes | 6559000138a744fb0b5d6511404f46166de4b290 | e5c093f932488af76bcc834e169cd1e73dc67701 | refs/heads/master | 2023-03-30T10:13:14.226063 | 2021-03-30T04:17:21 | 2021-03-30T04:18:17 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 39,107 | h | /*
* Copyright (c) Facebook, Inc. and its affiliates.
*
* This source code is licensed under the MIT license found in the
* LICENSE file in the root directory of this source tree.
*/
#ifndef HERMES_VM_HADESGC_H
#define HERMES_VM_HADESGC_H
#include "hermes/ADT/BitArray.h"
#include "hermes/ADT/ExponentialMovingAverage.h"
#include "hermes/Support/Algorithms.h"
#include "hermes/Support/SlowAssert.h"
#include "hermes/VM/AlignedHeapSegment.h"
#include "hermes/VM/GCBase.h"
#include "hermes/VM/VMExperiments.h"
#include "llvh/ADT/SparseBitVector.h"
#include "llvh/Support/ErrorOr.h"
#include "llvh/Support/PointerLikeTypeTraits.h"
#include <atomic>
#include <condition_variable>
#include <cstdint>
#include <deque>
#include <future>
#include <memory>
#include <mutex>
#include <thread>
#include <utility>
#include <vector>
namespace hermes {
namespace vm {
class WeakRefBase;
template <class T>
class WeakRef;
/// A GC with a young and old generation, that does concurrent marking and
/// sweeping of the old generation.
///
/// The young gen is a single contiguous-allocation space. A
/// young-gen collection completely evacuates live objects into the
/// older generation.
///
/// The old generation is a collection of heap segments, and allocations in the
/// old gen are done with a freelist (not a bump-pointer). When the old
/// collection is nearly full, it starts a backthround thread that will mark all
/// objects in the old gen, and then sweep the dead ones onto freelists.
///
/// Compaction is done in the old gen on a per-segment basis.
///
/// NOTE: Currently HadesGC is only a stub, meant to get things to compile.
/// It will be filled out to actually work later.
class HadesGC final : public GCBase {
public:
/// Initialize the GC with the give \p gcCallbacks and \p gcConfig.
/// maximum size.
/// \param gcCallbacks A callback interface enabling the garbage collector to
/// mark roots and free symbols.
/// \param gcConfig A struct giving, e.g., minimum, initial, and maximum heap
/// sizes.
/// \param provider A provider of storage to be used by segments.
HadesGC(
MetadataTable metaTable,
GCCallbacks *gcCallbacks,
PointerBase *pointerBase,
const GCConfig &gcConfig,
std::shared_ptr<CrashManager> crashMgr,
std::shared_ptr<StorageProvider> provider,
experiments::VMExperimentFlags vmExperimentFlags);
~HadesGC();
static bool classof(const GCBase *gc) {
return gc->getKind() == HeapKind::HADES;
}
static constexpr uint32_t maxAllocationSize() {
// The largest allocation allowable in Hades is the max size a single
// segment supports.
return HeapSegment::maxSize();
}
static constexpr uint32_t minAllocationSize() {
return heapAlignSize(
max(sizeof(OldGen::FreelistCell), sizeof(CopyListCell)));
}
/// \name GCBase overrides
/// \{
void getHeapInfo(HeapInfo &info) override;
void getHeapInfoWithMallocSize(HeapInfo &info) override;
void getCrashManagerHeapInfo(CrashManager::HeapInformation &info) override;
void createSnapshot(llvh::raw_ostream &os) override;
void snapshotAddGCNativeNodes(HeapSnapshot &snap) override;
void snapshotAddGCNativeEdges(HeapSnapshot &snap) override;
void enableHeapProfiler(
std::function<void(
uint64_t,
std::chrono::microseconds,
std::vector<GCBase::AllocationLocationTracker::HeapStatsUpdate>)>
fragmentCallback) override;
void disableHeapProfiler() override;
void enableSamplingHeapProfiler(size_t samplingInterval, int64_t seed)
override;
void disableSamplingHeapProfiler(llvh::raw_ostream &os) override;
void printStats(JSONEmitter &json) override;
std::string getKindAsStr() const override;
/// \}
/// \name GC non-virtual API
/// \{
/// Allocate a new cell of the specified size \p size by calling alloc.
/// Instantiate an object of type T with constructor arguments \p args in the
/// newly allocated cell.
/// \return a pointer to the newly created object in the GC heap.
template <
typename T,
bool fixedSize = true,
HasFinalizer hasFinalizer = HasFinalizer::No,
LongLived longLived = LongLived::No,
class... Args>
inline T *makeA(uint32_t size, Args &&...args);
/// Force a garbage collection cycle.
/// (Part of general GC API defined in GCBase.h).
void collect(std::string cause, bool canEffectiveOOM = false) override;
/// Run the finalizers for all heap objects.
void finalizeAll() override;
/// Add some external memory cost to a cell.
/// (Part of general GC API defined in GCBase.h).
/// \pre canAllocExternalMemory(size) is true.
void creditExternalMemory(GCCell *alloc, uint32_t size) override;
/// Remove some external memory cost from a cell.
/// (Part of general GC API defined in GCBase.h).
void debitExternalMemory(GCCell *alloc, uint32_t size) override;
/// \name Write Barriers
/// \{
/// NOTE: For all write barriers and read barriers:
/// The call to writeBarrier/readBarrier must happen *before* the write/read
/// to memory occurs.
/// The given value is being written at the given loc (required to
/// be in the heap). If value is a pointer, execute a write barrier.
/// NOTE: The write barrier call must be placed *before* the write to the
/// pointer, so that the current value can be fetched.
void writeBarrier(const GCHermesValue *loc, HermesValue value);
/// The given pointer value is being written at the given loc (required to
/// be in the heap). The value may be null. Execute a write barrier.
/// NOTE: The write barrier call must be placed *before* the write to the
/// pointer, so that the current value can be fetched.
void writeBarrier(const GCPointerBase *loc, const GCCell *value);
/// The given symbol is being written at the given loc (required to be in the
/// heap).
void writeBarrier(SymbolID symbol);
/// Special versions of \p writeBarrier for when there was no previous value
/// initialized into the space.
void constructorWriteBarrier(const GCHermesValue *loc, HermesValue value);
void constructorWriteBarrier(const GCPointerBase *loc, const GCCell *value);
void snapshotWriteBarrier(const GCHermesValue *loc);
void snapshotWriteBarrier(const GCPointerBase *loc);
void snapshotWriteBarrierRange(const GCHermesValue *start, uint32_t numHVs);
void weakRefReadBarrier(GCCell *value);
void weakRefReadBarrier(HermesValue value);
/// \}
/// Returns whether an external allocation of the given \p size fits
/// within the maximum heap size. (Note that this does not guarantee that the
/// allocation will "succeed" -- the size plus the used() of the heap may
/// still exceed the max heap size. But if it fails, the allocation can never
/// succeed.)
bool canAllocExternalMemory(uint32_t size) override;
WeakRefSlot *allocWeakSlot(HermesValue init) override;
/// Iterate over all objects in the heap, and call \p callback on them.
/// \param callback A function to call on each found object.
void forAllObjs(const std::function<void(GCCell *)> &callback) override;
/// Inform the GC that TTI has been reached. This will transition the GC mode,
/// if the GC was currently allocating directly into OG.
void ttiReached() override;
/// \}
/// \return true if the pointer lives in the young generation.
bool inYoungGen(const void *p) const override;
/// Approximate the dirty memory footprint of the GC's heap. Note that this
/// does not return the number of dirty pages in the heap, but instead returns
/// a number that goes up if pages are dirtied, and goes down if pages are
/// cleaned.
llvh::ErrorOr<size_t> getVMFootprintForTest() const;
#ifndef NDEBUG
/// \name Debug APIs
/// \{
bool calledByBackgroundThread() const override;
/// See comment in GCBase.
bool calledByGC() const override {
// Check if this is called by the background thread or the inGC flag is
// set.
return calledByBackgroundThread() || inGC();
}
/// Return true if \p ptr is currently pointing at valid accessable memory,
/// allocated to an object.
bool validPointer(const void *ptr) const override;
/// Return true if \p ptr is within one of the virtual address ranges
/// allocated for the heap. Not intended for use in normal production GC
/// operation, debug mode only.
bool dbgContains(const void *ptr) const override;
/// Record that a cell of the given \p kind and size \p sz has been
/// found reachable in a full GC.
void trackReachable(CellKind kind, unsigned sz) override;
/// Returns true if \p cell is the most-recently allocated finalizable object.
bool isMostRecentFinalizableObj(const GCCell *cell) const override;
/// \}
#endif
class CollectionStats;
class HeapMarkingAcceptor;
template <bool CompactionEnabled>
class EvacAcceptor;
class MarkAcceptor;
class MarkWeakRootsAcceptor;
class OldGen;
class Executor;
struct CopyListCell final : public GCCell {
// Linked list of cells pointing to the next cell that was copied.
CopyListCell *next_;
// If the cell was trimmed, this field will have the original size of the
// object stored. If the cell wasn't trimmed it'll have the same size as the
// forwarded pointer.
uint32_t originalSize_;
};
/// Similar to AlignedHeapSegment except it uses a free list.
class HeapSegment final : public AlignedHeapSegment {
public:
explicit HeapSegment(AlignedStorage storage);
HeapSegment() = default;
/// Allocate space by bumping a level.
AllocResult bumpAlloc(uint32_t sz);
/// Record the head of this cell so it can be found by the card scanner.
static void setCellHead(const GCCell *start, const size_t sz);
/// Find the head of the first cell that extends into the card at index
/// \p cardIdx.
/// \return A cell such that
/// cell <= indexToAddress(cardIdx) < cell->nextCell().
GCCell *getFirstCellHead(const size_t cardIdx);
/// Call \p callback on every non-freelist cell allocated in this segment.
template <typename CallbackFunction>
void forAllObjs(CallbackFunction callback);
/// Only call the callback on cells without forwarding pointers.
template <typename CallbackFunction>
void forCompactedObjs(CallbackFunction callback);
};
class OldGen final {
public:
explicit OldGen(HadesGC *gc);
std::deque<HeapSegment>::iterator begin();
std::deque<HeapSegment>::iterator end();
std::deque<HeapSegment>::const_iterator begin() const;
std::deque<HeapSegment>::const_iterator end() const;
size_t numSegments() const;
size_t maxNumSegments() const;
HeapSegment &operator[](size_t i);
/// Take ownership of the given segment.
void addSegment(HeapSegment seg);
/// Remove the segment at \p segmentIdx.
/// WARN: This is an expensive operation and should be used sparingly. It
/// calls eraseSegmentFreelists, which has a worst case time complexity of
/// O(#Freelist buckets * #Segments).
/// \return the segment previously at segmentIdx
HeapSegment removeSegment(size_t segmentIdx);
/// Indicate that OG should target having \p targetSegments segments.
void setTargetSegments(size_t targetSegments);
/// Allocate into OG. Returns a pointer to the newly allocated space. That
/// space must be filled before releasing the gcMutex_.
/// \return A non-null pointer to memory in the old gen that should have a
/// constructor run in immediately.
/// \pre gcMutex_ must be held before calling this function.
/// \post This function either successfully allocates, or reports OOM.
GCCell *alloc(uint32_t sz);
/// Adds the given region of memory to the free list for this segment.
void addCellToFreelist(void *addr, uint32_t sz, size_t segmentIdx);
/// \return the total number of bytes that are in use by the OG section of
/// the JS heap, excluding free list entries.
uint64_t allocatedBytes() const;
/// \return the total number of bytes that are in use by the segment with
/// index \p segmentIdx in the OG section of the JS heap, excluding free
/// list entries.
uint64_t allocatedBytes(uint16_t segmentIdx) const;
/// Increase the allocated bytes tracker for the segment at index \p
/// segmentIdx;
void incrementAllocatedBytes(int32_t incr, uint16_t segmentIdx);
/// Get the peak allocated bytes for the segment at \p segmentIdx.
uint64_t peakAllocatedBytes(uint16_t segmentIdx) const;
/// Trigger an update of the peak allocated bytes. This should be done right
/// before sweeping a particular segment so we have the true peak.
void updatePeakAllocatedBytes(uint16_t segmentIdx);
/// \return the total number of bytes that are held in external memory, kept
/// alive by objects in the OG.
uint64_t externalBytes() const;
/// \return the total number of bytes that are in use by the OG section of
/// the JS heap, including free list entries.
uint64_t size() const;
/// \return the total number of bytes that we aim to use in the OG
/// section of the JS heap, including free list entries. This may be smaller
/// or greater than size().
uint64_t targetSizeBytes() const;
/// Add some external memory cost to the OG.
void creditExternalMemory(uint32_t size) {
assert(
gc_->gcMutex_ &&
"OG external bytes must be accessed under gcMutex_.");
externalBytes_ += size;
}
/// Remove some external memory cost from the OG.
void debitExternalMemory(uint32_t size) {
assert(
externalBytes_ >= size && "Debiting more memory than was credited");
assert(
gc_->gcMutex_ &&
"OG external bytes must be accessed under gcMutex_.");
externalBytes_ -= size;
}
class FreelistCell final : public VariableSizeRuntimeCell {
private:
static const VTable vt;
public:
// If null, this is the tail of the free list.
FreelistCell *next_{nullptr};
explicit FreelistCell(uint32_t sz) : VariableSizeRuntimeCell{&vt, sz} {}
/// Shrink this cell by carving out a region of size \p sz bytes. Unpoison
/// the carved out region if necessary and return it (without any
/// initialisation).
/// \param sz The size that the newly-split cell should be.
/// \pre getAllocatedSize() >= sz + minAllocationSize()
GCCell *carve(uint32_t sz);
static bool classof(const GCCell *cell) {
return cell->getKind() == CellKind::FreelistKind;
}
};
/// Adds the given cell to the free list for this segment.
/// \pre this->contains(cell) is true.
void addCellToFreelist(FreelistCell *cell, size_t segmentIdx);
/// Remove the cell pointed to by the pointer at \p prevLoc from
/// the given \p segmentIdx and \p bucket in the freelist.
/// \return a pointer to the removed cell.
FreelistCell *removeCellFromFreelist(
FreelistCell **prevLoc,
size_t bucket,
size_t segmentIdx);
/// Remove the first cell from the given \p segmentIdx and \p bucket in the
/// freelist.
/// \return a pointer to the removed cell.
FreelistCell *removeCellFromFreelist(size_t bucket, size_t segmentIdx);
/// Unset all the bits for a given segment's freelist, so that no new
/// allocations take place in it.
void clearFreelistForSegment(size_t segmentIdx);
/// Remove a segment entirely from every freelist. This will shift all bits
/// after segmentIdx down by one.
void eraseSegmentFreelists(size_t segmentIdx);
/// Sweep the next segment and advance the internal sweep iterator. If there
/// are no more segments left to sweep, update OG collection stats with
/// numbers from the sweep.
bool sweepNext();
/// Initialize the internal sweep iterator. This will reset the internal
/// sweep stats to 0, and set the sweep iterator to the last segment in the
/// OG. The sweep iterator then works backwards from there, to avoid
/// sweeping newly added segments.
void initializeSweep();
/// Number of segments left to sweep. Useful for determining how many YG
/// collections it will take to complete an incremental OG collection.
size_t sweepSegmentsRemaining() const;
/// \return The number of bytes of native memory in use by this OldGen.
size_t getMemorySize() const;
private:
/// \return the index of the bucket in freelistBuckets_ corresponding to
/// \p size.
/// \post The returned index is less than kNumFreelistBuckets.
static uint32_t getFreelistBucket(uint32_t size);
/// Adds the given region of memory to the free list for the segment that is
/// currently being swept. This does not update the Freelist bits, those
/// should all be updated in a single pass at the end of sweeping.
void addCellToFreelistFromSweep(
char *freeRangeStart,
char *freeRangeEnd,
bool setHead);
HadesGC *gc_;
/// Use a std::deque instead of a std::vector so that references into it
/// remain valid across a push_back.
std::deque<HeapSegment> segments_;
/// This is the target number of segments in the OG JS heap. It does not
/// include external memory and may be larger or smaller than the actual
/// number of segments allocated.
size_t targetSegments_{0};
/// This is the sum of all bytes currently allocated in the heap, excluding
/// bump-allocated segments. Use \c allocatedBytes() to include
/// bump-allocated segments.
uint64_t allocatedBytes_{0};
/// Each element in the vector corresponds to the segment at the same index
/// in segments_. The first element in the pair represents the currently
/// allocated bytes in this segment, the second element represents the peak
/// allocated bytes in this segment, since it was created or compacted.
std::vector<std::pair<uint32_t, uint32_t>> segmentAllocatedBytes_;
/// The amount of bytes of external memory credited to objects in the OG.
uint64_t externalBytes_{0};
/// The freelist buckets are split into two sections. In the "small"
/// section, there is one bucket for each size, in multiples of heapAlign.
/// In the "large" section, there is a bucket for each power of 2. The
/// bucket for a large block is obtained by rounding down to the nearest
/// power of 2.
/// So for instance, with a heap alignment of 8 bytes, 256 small buckets,
/// and a maximum allocation size of 2^21, we would get:
/// | Small section | Large section |
/// +----+----+----+ +--------------+ +----+
/// | 0 | 8 | 16 |...|2040|2048|4096|...|2^21|
/// +----+----+----+ +--------------+ +----+
static constexpr size_t kLogNumSmallFreelistBuckets = 8;
static constexpr size_t kNumSmallFreelistBuckets = 1
<< kLogNumSmallFreelistBuckets;
static constexpr size_t kLogMinSizeForLargeBlock =
kLogNumSmallFreelistBuckets + LogHeapAlign;
static constexpr size_t kMinSizeForLargeBlock = 1
<< kLogMinSizeForLargeBlock;
static constexpr size_t kNumLargeFreelistBuckets =
llvh::detail::ConstantLog2<HeapSegment::maxSize()>::value -
kLogMinSizeForLargeBlock + 1;
static constexpr size_t kNumFreelistBuckets =
kNumSmallFreelistBuckets + kNumLargeFreelistBuckets;
/// The below data structures should be used as follows.
/// 1. When looking for a given size, first find the smallest appropriate
/// bucket that has any elements at all, by scanning
/// freelistBucketBitArray_.
/// 2. Once a bucket is identified, find a segment that contains cells for
/// that bucket using freelistBucketSegmentBitArray_.
/// 3. Finally, with the given pair of bucket and segment index, obtain the
/// head of the freelist from freelistSegmentsBuckets_.
/// Maintain a freelist as described above for every segment. Each element
/// is the head of a freelist for the given segment + bucket pair.
std::vector<std::array<FreelistCell *, kNumFreelistBuckets>>
freelistSegmentsBuckets_;
/// Keep track of which freelist buckets have valid elements to make search
/// fast. This includes all segments.
BitArray<kNumFreelistBuckets> freelistBucketBitArray_;
/// Keep track of which segments have a valid element in a particular
/// bucket. Combined with the above bit array, this allows us to quickly
/// index into a freelist bucket.
std::array<llvh::SparseBitVector<>, kNumFreelistBuckets>
freelistBucketSegmentBitArray_;
/// Tracks the current progress of sweeping.
struct SweepIterator {
/// The current segment being swept, this should start at the end and move
/// to the front of the segment list, to avoid sweeping newly added
/// segments.
size_t segNumber{0};
/// The total number of GC-managed and external bytes swept in the current
/// sweep.
uint64_t sweptBytes{0};
uint64_t sweptExternalBytes{0};
} sweepIterator_;
/// Searches the OG for a space to allocate memory into.
/// \return A pointer to uninitialized memory that can be written into, null
/// if no such space exists.
GCCell *search(uint32_t sz);
/// Common path for when an allocation has succeeded.
/// \param cell The free memory that will soon have an object allocated into
/// it.
/// \param sz The number of bytes associated with the free memory.
/// \param segmentIdx An index into segments_ representing which segment the
/// allocation is being made in.
GCCell *finishAlloc(GCCell *cell, uint32_t sz, uint16_t segmentIdx);
};
private:
/// The maximum number of bytes that the heap can hold. Once this amount has
/// been filled up, OOM will occur.
const uint64_t maxHeapSize_;
/// This needs to be placed before youngGen_ and oldGen_, because those
/// members use numSegments_ as part of being constructed.
uint64_t numSegments_{0};
/// Stores previously allocated segment indices that have since
/// been freed. We can reuse them when another segment is allocated.
std::vector<size_t> segmentIndices_;
/// Keeps the storage provider alive until after the GC is fully destructed.
std::shared_ptr<StorageProvider> provider_;
/// youngGen is a bump-pointer space, so it can re-use AlignedHeapSegment.
/// Protected by gcMutex_.
HeapSegment youngGen_;
/// List of cells in YG that have finalizers. Iterate through this to clean
/// them out.
/// Protected by gcMutex_.
std::vector<GCCell *> youngGenFinalizables_;
/// oldGen_ is a free list space, so it needs a different segment
/// representation.
/// Protected by gcMutex_.
OldGen oldGen_;
/// Whoever holds this lock is permitted to modify data structures around the
/// GC. This includes mark bits, free lists, etc.
Mutex gcMutex_;
enum class Phase : uint8_t {
None,
Mark,
CompleteMarking,
Sweep,
};
/// Represents the current phase the concurrent GC is in. The main difference
/// between phases is their effect on read and write barriers. Should only be
/// accessed if gcMutex_ is acquired.
Phase concurrentPhase_{Phase::None};
/// Represents whether the background thread is currently marking. Should only
/// be accessed by the mutator thread or during a STW pause.
/// ogMarkingBarriers_ is true from the start of marking the OG heap until the
/// start of WeakMap marking but is kept separate from concurrentPhase_ in
/// order to reduce synchronisation requirements for write barriers.
bool ogMarkingBarriers_{false};
/// Used by the write barrier to add items to the worklist.
/// Protected by gcMutex_.
std::unique_ptr<MarkAcceptor> oldGenMarker_;
/// This provides the background thread for doing marking and sweeping
/// concurrently with the mutator.
std::unique_ptr<Executor> backgroundExecutor_;
/// This tracks the current status of execution in the background thread. The
/// future should be set every time work is enqueued onto the executor. After
/// that, whenever we need to wait for execution in the background thread to
/// end, we can call get() on this future.
std::future<void> ogThreadStatus_;
#ifndef NDEBUG
/// True from the time the background task is created, to the time it exits
/// the collection loop. False otherwise.
bool backgroundTaskActive_{false};
#endif
/// If true, whenever YG fills up immediately put it into the OG.
bool promoteYGToOG_;
/// If true, turn off promoteYGToOG_ as soon as the first OG GC occurs.
bool revertToYGAtTTI_;
/// Target OG occupancy ratio at the end of an OG collection.
const double occupancyTarget_;
/// A collection section used to track the size of YG before and after a YG
/// collection, as well as the time a YG collection takes.
std::unique_ptr<CollectionStats> ygCollectionStats_;
/// A collection section used to track the size of OG before and after an OG
/// collection, as well as the time an OG collection takes.
std::unique_ptr<CollectionStats> ogCollectionStats_;
/// Pointer to the first free weak reference slot. Free weak refs are chained
/// together in a linked list.
WeakRefSlot *firstFreeWeak_{nullptr};
/// The weighted average of the YG survival ratio over time.
ExponentialMovingAverage ygAverageSurvivalRatio_;
/// The amount of bytes of external memory credited to objects in the YG.
uint64_t ygExternalBytes_{0};
struct CompacteeState {
/// \return true if the pointer lives in the segment that is being marked or
/// evacuated for compaction.
bool contains(const void *p) const {
return start == AlignedStorage::start(p);
}
/// \return true if the pointer lives in the segment that is currently being
/// evacuated for compaction.
bool evacContains(const void *p) const {
return evacStart == AlignedStorage::start(p);
}
/// \return true if the compactee is ready to be evacuated.
bool evacActive() const {
return evacStart != reinterpret_cast<void *>(kInvalidCompacteeStart);
}
#ifndef NDEBUG
/// \return true if the compactee has not been assigned.
bool empty() const {
void *const invalid = reinterpret_cast<void *>(kInvalidCompacteeStart);
return evacStart == invalid && start == invalid && !segment;
}
#endif
/// The following variables track the state of compactions.
/// 1. To trigger a compaction, segment and start should be set at the
/// beginning of marking. This ensures that all cards containing pointers to
/// the compactee will be dirtied.
/// 2. Once marking is done, completeMarking should then set evacStart, so
/// that the next YG collection will evacuate the segment.
/// 3. On completion, the YG collection will reset all these variables.
/// In order to keep the "contains" check cheap, this can be any non-null
/// value that cannot correspond to the start of a segment.
static constexpr uintptr_t kInvalidCompacteeStart = 0x1;
/// The start address of the segment that will be compacted next. This is
/// used during marking and by write barriers to determine whether a pointer
/// is in the compactee segment.
void *start{reinterpret_cast<void *>(kInvalidCompacteeStart)};
/// The start address of the segment that is currently being compacted. When
/// this is set, the next YG will evacuate objects in this segment. This is
/// always going to be equal to "start" or nullptr.
void *evacStart{reinterpret_cast<void *>(kInvalidCompacteeStart)};
/// The segment being compacted. This should be removed from the OG right
/// after it is identified, and freed entirely once the compaction is
/// complete.
std::shared_ptr<HeapSegment> segment;
/// The number of bytes in the compactee, should be set before the compactee
/// is removed from the OG.
uint32_t allocatedBytes{0};
} compactee_;
/// If compaction completes before sweeping, there is a possibility that
/// dangling pointers into the now freed compactee may remain in the OG heap
/// until sweeping finishes. In certain cases, like when scanning dirty cards,
/// this could cause a segfault if you attempt to say, compress a pointer. To
/// handle this case, if compaction completes while sweeping is still in
/// progress, this shared_ptr will keep the compactee segment alive until the
/// end of sweeping.
std::shared_ptr<HeapSegment> compacteeHandleForSweep_;
struct NativeIDs {
HeapSnapshot::NodeID ygFinalizables{IDTracker::kInvalidNode};
HeapSnapshot::NodeID og{IDTracker::kInvalidNode};
} nativeIDs_;
/// The main entrypoint for all allocations.
/// \param sz The size of allocation requested. This might be rounded up to
/// fit heap alignment requirements.
/// \tparam fixedSize If true, the allocation is of a cell type that always
/// has the same size. The requirement enforced by Hades is that all
/// fixed-size allocations must go into YG.
/// \tparam hasFinalizer If true, the cell about to be allocated into the
/// requested space will have a finalizer that the GC will need to invoke.
template <bool fixedSize, HasFinalizer hasFinalizer>
inline void *allocWork(uint32_t sz);
/// Slow path for allocations.
void *allocSlow(uint32_t sz);
/// Like alloc, but the resulting object is expected to be long-lived.
/// Allocate directly in the old generation (doing a full collection if
/// necessary to create room).
void *allocLongLived(uint32_t sz);
/// Frees the weak slot, so it can be re-used by future WeakRef allocations.
void freeWeakSlot(WeakRefSlot *slot);
/// Perform a YG garbage collection. All live objects in YG will be evacuated
/// to the OG.
/// \param cause The cause of the GC, used for logging.
/// \param forceOldGenCollection If true, always start an old gen collection
/// if one is not already active.
/// \post The YG is completely empty, and all bytes are available for new
/// allocations.
void youngGenCollection(std::string cause, bool forceOldGenCollection);
template <typename Acceptor>
void youngGenEvacuateImpl(Acceptor &acceptor, bool doCompaction);
/// In the "no GC before TTI" mode, move the Young Gen heap segment to the
/// Old Gen without scanning for garbage.
/// \return true if a promotion occurred, false if it did not.
bool promoteYoungGenToOldGen();
/// This function checks if the live bytes after the last OG GC is greater
/// than the tripwire limit. If the conditions are met, the tripwire is
/// triggered and tripwireCallback_ is called.
/// Also resets the stats counter, so that it calls the analytics callback.
/// WARNING: Do not call this while there is an ongoing collection. It can
/// cause a race condition and a deadlock.
void checkTripwireAndResetStats();
/// Transfer any external memory charges from YG to OG. Used as part of YG
/// collection.
void transferExternalMemoryToOldGen();
/// Perform an OG garbage collection. All live objects in OG will be left
/// untouched, all unreachable objects will be placed into a free list that
/// can be used by \c oldGenAlloc.
void oldGenCollection(std::string cause);
/// If there's an OG collection going on, wait for it to complete. This
/// function is synchronous and will block the caller if the GC background
/// thread is still running.
/// \pre The gcMutex_ must be held before entering this function.
/// \post The gcMutex_ will be held when the function exits, but it might
/// have been unlocked and then re-locked.
void waitForCollectionToFinish(std::string cause);
/// Worker function that schedules the bulk of the GC work on the background
/// thread, to perform it concurrently with the mutator.
void collectOGInBackground();
/// Perform a single step of an OG collection. \p backgroundThread indicates
/// whether this call was made from the background thread.
void incrementalCollect(bool backgroundThread);
/// Finish the marking process. This requires a STW pause in order to do a
/// final marking worklist drain, and to update weak roots. It must be invoked
/// from the mutator.
void completeMarking();
/// Select a segment to compact and initialise any state needed for
/// compaction.
void prepareCompactee();
/// Search a single segment for pointers that may need to be updated as the
/// YG/compactee are evacuated.
template <bool CompactionEnabled>
void scanDirtyCardsForSegment(
SlotVisitor<EvacAcceptor<CompactionEnabled>> &visitor,
HeapSegment &segment);
/// Find all pointers from OG into the YG/compactee during a YG collection.
/// This is done quickly through use of write barriers that detect the
/// creation of such pointers.
template <bool CompactionEnabled>
void scanDirtyCards(EvacAcceptor<CompactionEnabled> &acceptor);
/// Common logic for doing the Snapshot At The Beginning (SATB) write barrier.
void snapshotWriteBarrierInternal(GCCell *oldValue);
/// Common logic for doing the Snapshot At The Beginning (SATB) write barrier.
/// Forwards to \c snapshotWriteBarrierInternal(GCCell*) if oldValue is a
/// pointer. Forwards to \c snapshotWriteBarrierInternal(SymbolID) is oldValue
/// is a symbol.
void snapshotWriteBarrierInternal(HermesValue oldValue);
/// Performs a Snapshot At The Beginning (SATB) write barrier for a symbol,
/// which assumes the old symbol was reachable at the start of the collection.
void snapshotWriteBarrierInternal(SymbolID symbol);
/// Common logic for doing the relocation write barrier for detecting
/// pointers into YG and for tracking newly created pointers into the
/// compactee.
void relocationWriteBarrier(const void *loc, const void *value);
/// Finalize all objects in YG that have finalizers.
void finalizeYoungGenObjects();
/// Run the finalizers for all heap objects, if the gcMutex_ is already
/// locked.
void finalizeAllLocked();
/// Update all of the weak references and invalidate the ones that point to
/// dead objects.
void updateWeakReferencesForYoungGen();
/// Update all of the weak references, invalidate the ones that point to
/// dead objects, and free the ones that were not marked at all.
void updateWeakReferencesForOldGen();
/// The WeakMap type in JS has special semantics for handling keys kept alive
/// by only their values. In between marking and sweeping, this function is
/// called to handle that special case.
void completeWeakMapMarking(MarkAcceptor &acceptor);
/// Sets all weak references to unmarked in preparation for a collection.
void resetWeakReferences();
/// Return the total number of bytes that are in use by the JS heap.
uint64_t allocatedBytes() const;
/// \return the total number of bytes that are in use by objects on the JS
/// heap, but is not in the heap itself.
uint64_t externalBytes() const;
/// \return the total number of bytes used by the heap, including segment
/// metadata and external memory.
uint64_t heapFootprint() const;
/// \return the remaining available space we are allowed to use. That is, the
/// difference between maxHeapSize_ and heapFootprint.
uint64_t remainingBytes() const;
/// Accessor for the YG.
HeapSegment &youngGen();
const HeapSegment &youngGen() const;
/// Create a new segment (to be used by either YG or OG).
llvh::ErrorOr<HeapSegment> createSegment();
/// Set a given segment as the YG segment.
/// \return the previous YG segment.
HeapSegment setYoungGen(HeapSegment seg);
/// Searches the old gen for this pointer. This is O(number of OG segments).
/// NOTE: In any non-debug case, \c inYoungGen should be used instead, because
/// it is O(1).
/// \return true if the pointer is in the old gen.
bool inOldGen(const void *p) const;
/// Give the background GC a chance to complete marking and finish the OG
/// collection.
void yieldToOldGen();
/// \return A number of bytes that should be drained on a per-YG basis to
/// help ensure an incremental collection will finish before the next one is
/// needed.
size_t getDrainRate();
/// Adds the start address of the segment to the CrashManager's custom data.
/// \param extraName append this to the name of the segment. Must be
/// non-empty.
void addSegmentExtentToCrashManager(
const HeapSegment &seg,
const std::string &extraName);
/// Deletes a segment from the CrashManager's custom data.
/// \param extraName that was used to initially add this segment to the crash
/// manager.
void removeSegmentExtentFromCrashManager(const std::string &extraName);
#ifdef HERMES_SLOW_DEBUG
/// Checks the heap to make sure all cells are valid.
void checkWellFormed();
/// Verify that the card table used to find pointers from OG into YG has the
/// correct cards dirtied, given the contents of the OG currently.
void verifyCardTable();
#endif
};
/// \name Inline implementations
/// \{
template <
typename T,
bool fixedSize,
HasFinalizer hasFinalizer,
LongLived longLived,
class... Args>
inline T *HadesGC::makeA(uint32_t size, Args &&...args) {
assert(
isSizeHeapAligned(size) &&
"Call to makeA must use a size aligned to HeapAlign");
if (longLived == LongLived::Yes) {
std::lock_guard<Mutex> lk{gcMutex_};
return new (allocLongLived(size)) T(std::forward<Args>(args)...);
}
return new (allocWork<fixedSize, hasFinalizer>(size))
T(std::forward<Args>(args)...);
}
template <bool fixedSize, HasFinalizer hasFinalizer>
void *HadesGC::allocWork(uint32_t sz) {
assert(
isSizeHeapAligned(sz) &&
"Should be aligned before entering this function");
assert(sz >= minAllocationSize() && "Allocating too small of an object");
if (kConcurrentGC) {
HERMES_SLOW_ASSERT(
!weakRefMutex() &&
"WeakRef mutex should not be held when alloc is called");
}
if (shouldSanitizeHandles()) {
// The best way to sanitize uses of raw pointers outside handles is to force
// the entire heap to move, and ASAN poison the old heap. That is too
// expensive to do, even with sampling, for Hades. It also doesn't test the
// more interesting aspect of Hades which is concurrent background
// collections. So instead, do a youngGenCollection which force-starts an
// oldGenCollection if one is not already running.
youngGenCollection(
kHandleSanCauseForAnalytics, /*forceOldGenCollection*/ true);
}
AllocResult res = youngGen().bumpAlloc(sz);
void *resPtr = LLVM_UNLIKELY(!res.success) ? allocSlow(sz) : res.ptr;
if (hasFinalizer == HasFinalizer::Yes)
youngGenFinalizables_.emplace_back(static_cast<GCCell *>(resPtr));
return resPtr;
}
/// \}
} // namespace vm
} // namespace hermes
#endif
| [
"[email protected]"
] | |
92c52bcd12c89a0e93ccb5d3b16c01a623f79fbc | 0dba25cd369487e055643cbee66b1f02432be148 | /TrainingFramework/src/GameObject/Sprite2D.cpp | 68c4582e540c37df829466ec5d2a6e38434c329a | [] | no_license | QuynhHust/MakingGame | d57975815e17460cd0268cf6124986f2df822886 | 20e6c05d083ff46cf311ec47fc58b64dbad10516 | refs/heads/master | 2022-03-22T06:51:41.246345 | 2019-11-13T01:05:41 | 2019-11-13T01:05:41 | 217,356,443 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,884 | cpp | #include "Sprite2D.h"
#include "Shaders.h"
#include "Models.h"
#include "Camera.h"
#include "Texture.h"
extern GLint screenWidth;
extern GLint screenHeight;
void Sprite2D::CaculateWorldMatrix()
{
Matrix m_Sc, m_T;
m_Sc.SetScale(m_Vec3Scale);
m_T.SetTranslation(m_Vec3Position);
m_WorldMat = m_Sc * m_T;
}
Sprite2D::Sprite2D() :BaseObject()
{
//
}
Sprite2D::Sprite2D(std::shared_ptr<Models> model, std::shared_ptr<Shaders> shader, std::shared_ptr<Texture> texture)
: BaseObject()
{
m_pModel = model;
m_pShader = shader;
m_pCamera = nullptr;
m_pTexture = texture;
m_Vec3Position = Vector3(0, 0, 0);
m_iHeight = 50;
m_iWidth = 100;
m_Vec3Scale = Vector3((float)m_iWidth / screenWidth, (float)m_iHeight / screenHeight, 1);
}
Sprite2D::Sprite2D(std::shared_ptr<Models> model, std::shared_ptr<Shaders> shader, Vector4 color)
: BaseObject()
{
m_pModel = model;
m_pShader = shader;
m_pCamera = nullptr;
m_pTexture = nullptr;
m_Color = color;
m_Vec3Position = Vector3(0, 0, 0);
m_iHeight = 50;
m_iWidth = 100;
m_Vec3Scale = Vector3((float)m_iWidth / screenWidth, (float)m_iHeight / screenHeight, 1);
}
Sprite2D::~Sprite2D()
{
}
void Sprite2D::Init()
{
CaculateWorldMatrix();
}
void Sprite2D::Draw()
{
glUseProgram(m_pShader->program);
glBindBuffer(GL_ARRAY_BUFFER, m_pModel->GetVertexObject());
glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, m_pModel->GetIndiceObject());
GLuint iTempShaderVaribleGLID = -1;
Matrix matrixWVP;
matrixWVP = m_WorldMat;//* m_pCamera->GetLookAtCamera();
if (m_pTexture != nullptr)
{
glActiveTexture(GL_TEXTURE0);
glEnable(GL_TEXTURE_2D);
glBindTexture(GL_TEXTURE_2D, m_pTexture->Get2DTextureAdd());
if (m_pShader->iTextureLoc[0] != -1)
glUniform1i(m_pShader->iTextureLoc[0], 0);
}
else
{
iTempShaderVaribleGLID = -1;
iTempShaderVaribleGLID = m_pShader->GetUniformLocation((char*)"u_color");
if (iTempShaderVaribleGLID != -1)
glUniform4f(iTempShaderVaribleGLID, m_Color.x, m_Color.y, m_Color.z, m_Color.w);
}
iTempShaderVaribleGLID = -1;
iTempShaderVaribleGLID = m_pShader->GetAttribLocation((char*)"a_posL");
if (iTempShaderVaribleGLID != -1)
{
glEnableVertexAttribArray(iTempShaderVaribleGLID);
glVertexAttribPointer(iTempShaderVaribleGLID, 3, GL_FLOAT, GL_FALSE, sizeof(Vertex), VETEX_POSITION);
}
iTempShaderVaribleGLID = -1;
iTempShaderVaribleGLID = m_pShader->GetAttribLocation((char*) "a_uv");
if (iTempShaderVaribleGLID != -1)
{
glEnableVertexAttribArray(iTempShaderVaribleGLID);
glVertexAttribPointer(iTempShaderVaribleGLID, 2, GL_FLOAT, GL_FALSE, sizeof(Vertex), VETEX_UV);
}
iTempShaderVaribleGLID = -1;
iTempShaderVaribleGLID = m_pShader->GetUniformLocation((char*)"u_alpha");
if (iTempShaderVaribleGLID != -1)
glUniform1f(iTempShaderVaribleGLID, 1.0);
iTempShaderVaribleGLID = -1;
iTempShaderVaribleGLID = m_pShader->GetUniformLocation((char*)"u_matMVP");
if (iTempShaderVaribleGLID != -1)
glUniformMatrix4fv(iTempShaderVaribleGLID, 1, GL_FALSE, matrixWVP.m[0]);
glDrawElements(GL_TRIANGLES, m_pModel->GetNumIndiceObject(), GL_UNSIGNED_INT, 0);
glBindBuffer(GL_ARRAY_BUFFER, 0);
glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, 0);
glBindTexture(GL_TEXTURE_2D, 0);
}
void Sprite2D::Update(GLfloat deltatime)
{
}
void Sprite2D::SetText(std::string text)
{
m_Text = text;
}
std::string Sprite2D::GetText()
{
return m_Text;
}
void Sprite2D::Set2DPosition(GLfloat width, GLfloat height)
{
m_Vec2DPos.x = width;
m_Vec2DPos.y = height;
float xx = (2.0 * m_Vec2DPos.x) / screenWidth - 1.0;
float yy = 1.0 - (2.0 * m_Vec2DPos.y) / screenHeight;
m_Vec3Position = Vector3(xx, yy, 1.0);
CaculateWorldMatrix();
}
void Sprite2D::Set2DPosition(Vector2 pos)
{
m_Vec2DPos = pos;
float xx = (2.0 * m_Vec2DPos.x) / screenWidth - 1.0;
float yy = 1.0 - (2.0 * m_Vec2DPos.y) / screenHeight;
m_Vec3Position = Vector3(xx, yy, 1.0);
CaculateWorldMatrix();
}
Vector2 Sprite2D::Get2DPosition()
{
return m_Vec2DPos;
}
void Sprite2D::SetSize(GLint width, GLint height)
{
m_iWidth = width;
m_iHeight = height;
m_Vec3Scale = Vector3((float)m_iWidth / screenWidth, (float)m_iHeight / screenHeight, 1);
CaculateWorldMatrix();
}
bool Sprite2D::CheckColision(std::shared_ptr<Sprite2D> obj2)
{
int x0 = m_Vec2DPos.x - m_iWidth / 2;
int y0 = m_Vec2DPos.y - m_iHeight / 2;
int x1 = m_Vec2DPos.x + m_iWidth / 2;
int y1 = m_Vec2DPos.y + m_iHeight / 2;
int a0 = obj2->m_Vec2DPos.x - obj2->m_iWidth / 2;
int b0 = obj2->m_Vec2DPos.y - obj2->m_iHeight / 2;
int a1 = obj2->m_Vec2DPos.x + obj2->m_iWidth / 2;
int b1 = obj2->m_Vec2DPos.y + obj2->m_iHeight / 2;
if ((a0 < x1&&x1 < a1)&&(b0<y1&&y1<b1))
{
return true;
}
else if ((a0 < x0&&x0 < a1) && (b0 < y1&&y1 < b1))
{
return true;
}
else if ((a0 < x1&&x1 < a1) && (b0 < y0&&y0 < b1))
{
return true;
}
else if ((a0 < x1&&x1 < a1) && (b0 < y1&&y1 < b1))
{
return true;
}
else return false;
}
| [
"="
] | = |
db935f08180d44652a7bdf75f6cc97144c1e7915 | 6c2c4bcd9123f1c8fcc7a61fb2d1de8aa972e3cf | /chapter_01/ray.h | 318375a83b82f8762183397c7a0b0ed6225b77ab | [] | no_license | KrisYu/RayTracing-TheNextWeek | 3af1e88d9b82c6c2be62d1c10e9663f3cc0350aa | 089112b0e32c4f529592b3e0a7763767b53aeef5 | refs/heads/master | 2020-07-10T08:48:10.348199 | 2019-08-28T00:42:55 | 2019-08-28T00:42:55 | 204,222,196 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 394 | h | #ifndef RAYH
#define RAYH
#include "vec3.h"
class ray
{
public:
ray(){}
ray(const vec3& a, const vec3 & b, float ti = 0.0){ A =a; B = b; _time = ti;}
vec3 origin() const { return A;}
vec3 direction() const { return B;}
float time() const {return _time;}
vec3 point_at_parameter(float t) const { return A+t*B;}
vec3 A;
vec3 B;
float _time;
};
#endif
| [
"[email protected]"
] | |
bb6695852cb2a5f9f1b8c0d0134a1ae1801cba7f | 3c25475e4bd5a634d7980e291ae02ae62ab6e74a | /Source/Samples/109_KinematicCharacter/KinematicCharacter.h | 786f7f2d84aa481637ed1b58bdc1d5a46952e09b | [
"MIT",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | eugeneko/rbfx | e1c8b41861093b5df03f616cd614f4a73795b16b | 379641ebfeb63a2ceba901eb06be4309d3973272 | refs/heads/master | 2023-03-19T05:06:32.714516 | 2022-09-26T12:14:05 | 2022-09-26T12:14:05 | 186,170,069 | 1 | 0 | MIT | 2019-05-11T18:45:46 | 2019-05-11T18:45:46 | null | UTF-8 | C++ | false | false | 4,169 | h | //
// Copyright (c) 2008-2020 the Urho3D project.
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
// THE SOFTWARE.
//
#pragma once
#include <Urho3D/Input/Controls.h>
#include <Urho3D/Scene/LogicComponent.h>
namespace Urho3D
{
class AnimationController;
class RigidBody;
class CollisionShape;
class KinematicCharacterController;
}
using namespace Urho3D;
const unsigned CTRL_FORWARD = 1;
const unsigned CTRL_BACK = 2;
const unsigned CTRL_LEFT = 4;
const unsigned CTRL_RIGHT = 8;
const unsigned CTRL_JUMP = 16;
const unsigned CTRL_CROUCH = 32;
const float MOVE_FORCE = 0.2f;
const float INAIR_MOVE_FORCE = 0.2f;
const float BRAKE_FORCE = 0.2f;
const float JUMP_FORCE = 7.0f;
const float YAW_SENSITIVITY = 0.1f;
const float INAIR_THRESHOLD_TIME = 0.1f;
//=============================================================================
//=============================================================================
struct MovingData
{
MovingData() : node_(0){}
MovingData& operator =(const MovingData& rhs)
{
node_ = rhs.node_;
transform_ = rhs.transform_;
return *this;
}
bool operator == (const MovingData& rhs)
{
return (node_ && node_ == rhs.node_);
}
Node *node_;
Matrix3x4 transform_;
};
//=============================================================================
//=============================================================================
/// Character component, responsible for physical movement according to controls, as well as animation.
class KinematicCharacter : public LogicComponent
{
URHO3D_OBJECT(KinematicCharacter, LogicComponent);
public:
/// Construct.
explicit KinematicCharacter(Context* context);
/// Register object factory and attributes.
static void RegisterObject(Context* context);
void DelayedStart() override;
/// Handle startup. Called by LogicComponent base class.
void Start() override;
/// Handle physics world update. Called by LogicComponent base class.
void FixedUpdate(float timeStep) override;
virtual void FixedPostUpdate(float timeStep);
void SetOnMovingPlatform(RigidBody *platformBody)
{
//onMovingPlatform_ = (platformBody != NULL);
//platformBody_ = platformBody;
}
/// Movement controls. Assigned by the main program each frame.
Controls controls_;
private:
bool IsNodeMovingPlatform(Node *node) const;
void NodeOnMovingPlatform(Node *node);
/// Handle physics collision event.
void HandleNodeCollision(StringHash eventType, VariantMap& eventData);
protected:
/// Grounded flag for movement.
bool onGround_;
/// Jump flag.
bool okToJump_;
/// In air timer. Due to possible physics inaccuracy, character can be off ground for max. 1/10 second and still be allowed to move.
float inAirTimer_;
// extra vars
Vector3 curMoveDir_;
bool isJumping_;
bool jumpStarted_;
WeakPtr<CollisionShape> collisionShape_;
WeakPtr<AnimationController> animController_;
WeakPtr<KinematicCharacterController> kinematicController_;
// moving platform data
MovingData movingData_[2];
};
| [
"[email protected]"
] | |
d531eb17eb547f76d7408e4fe9f1d490102e2b87 | f56f7dfe684e448f72c32dd4d56dc81dd494dd35 | /thrift/compiler/test/fixtures/mcpp2-compare/gen-cpp2/ReturnService.h | 0d8b97a8dc6b19e845bd63af423e96877f5e7911 | [
"Apache-2.0"
] | permissive | CHJoanna/fbthrift | 088145e079078ab09d321d101c6cc50c128838b7 | bb1dd6ba08f2fadacb801f968eee50493ab4e801 | refs/heads/master | 2023-03-23T13:20:38.916692 | 2021-03-26T18:45:03 | 2021-03-26T18:46:48 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 39,220 | h | /**
* Autogenerated by Thrift for src/module.thrift
*
* DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING
* @generated
*/
#pragma once
#include <thrift/lib/cpp2/gen/service_h.h>
#include "thrift/compiler/test/fixtures/mcpp2-compare/gen-cpp2/ReturnServiceAsyncClient.h"
#include "thrift/compiler/test/fixtures/mcpp2-compare/gen-cpp2/module_types.h"
#include "thrift/compiler/test/fixtures/mcpp2-compare/gen-cpp2/includes_types.h"
#include <folly/small_vector.h>
namespace folly {
class IOBuf;
class IOBufQueue;
}
namespace apache { namespace thrift {
class Cpp2RequestContext;
class BinaryProtocolReader;
class CompactProtocolReader;
namespace transport { class THeader; }
}}
namespace some { namespace valid { namespace ns {
class ReturnServiceSvAsyncIf {
public:
virtual ~ReturnServiceSvAsyncIf() {}
virtual void async_eb_noReturn(std::unique_ptr<apache::thrift::HandlerCallback<void>> callback) = 0;
virtual void async_tm_boolReturn(std::unique_ptr<apache::thrift::HandlerCallback<bool>> callback) = 0;
virtual folly::Future<bool> future_boolReturn() = 0;
virtual folly::SemiFuture<bool> semifuture_boolReturn() = 0;
virtual void async_tm_i16Return(std::unique_ptr<apache::thrift::HandlerCallback<::std::int16_t>> callback) = 0;
virtual folly::Future<::std::int16_t> future_i16Return() = 0;
virtual folly::SemiFuture<::std::int16_t> semifuture_i16Return() = 0;
virtual void async_tm_i32Return(std::unique_ptr<apache::thrift::HandlerCallback<::std::int32_t>> callback) = 0;
virtual folly::Future<::std::int32_t> future_i32Return() = 0;
virtual folly::SemiFuture<::std::int32_t> semifuture_i32Return() = 0;
virtual void async_tm_i64Return(std::unique_ptr<apache::thrift::HandlerCallback<::std::int64_t>> callback) = 0;
virtual folly::Future<::std::int64_t> future_i64Return() = 0;
virtual folly::SemiFuture<::std::int64_t> semifuture_i64Return() = 0;
virtual void async_tm_floatReturn(std::unique_ptr<apache::thrift::HandlerCallback<float>> callback) = 0;
virtual folly::Future<float> future_floatReturn() = 0;
virtual folly::SemiFuture<float> semifuture_floatReturn() = 0;
virtual void async_tm_doubleReturn(std::unique_ptr<apache::thrift::HandlerCallback<double>> callback) = 0;
virtual folly::Future<double> future_doubleReturn() = 0;
virtual folly::SemiFuture<double> semifuture_doubleReturn() = 0;
virtual void async_eb_stringReturn(std::unique_ptr<apache::thrift::HandlerCallback<std::unique_ptr<::std::string>>> callback) = 0;
virtual void async_tm_binaryReturn(std::unique_ptr<apache::thrift::HandlerCallback<std::unique_ptr<::std::string>>> callback) = 0;
virtual folly::Future<std::unique_ptr<::std::string>> future_binaryReturn() = 0;
virtual folly::SemiFuture<std::unique_ptr<::std::string>> semifuture_binaryReturn() = 0;
virtual void async_tm_mapReturn(std::unique_ptr<apache::thrift::HandlerCallback<std::unique_ptr<::std::map<::std::string, ::std::int64_t>>>> callback) = 0;
virtual folly::Future<std::unique_ptr<::std::map<::std::string, ::std::int64_t>>> future_mapReturn() = 0;
virtual folly::SemiFuture<std::unique_ptr<::std::map<::std::string, ::std::int64_t>>> semifuture_mapReturn() = 0;
virtual void async_tm_simpleTypedefReturn(std::unique_ptr<apache::thrift::HandlerCallback<::some::valid::ns::simpleTypeDef>> callback) = 0;
virtual folly::Future<::some::valid::ns::simpleTypeDef> future_simpleTypedefReturn() = 0;
virtual folly::SemiFuture<::some::valid::ns::simpleTypeDef> semifuture_simpleTypedefReturn() = 0;
virtual void async_tm_complexTypedefReturn(std::unique_ptr<apache::thrift::HandlerCallback<std::unique_ptr<::some::valid::ns::complexStructTypeDef>>> callback) = 0;
virtual folly::Future<std::unique_ptr<::some::valid::ns::complexStructTypeDef>> future_complexTypedefReturn() = 0;
virtual folly::SemiFuture<std::unique_ptr<::some::valid::ns::complexStructTypeDef>> semifuture_complexTypedefReturn() = 0;
virtual void async_tm_list_mostComplexTypedefReturn(std::unique_ptr<apache::thrift::HandlerCallback<std::unique_ptr<::std::vector<::some::valid::ns::mostComplexTypeDef>>>> callback) = 0;
virtual folly::Future<std::unique_ptr<::std::vector<::some::valid::ns::mostComplexTypeDef>>> future_list_mostComplexTypedefReturn() = 0;
virtual folly::SemiFuture<std::unique_ptr<::std::vector<::some::valid::ns::mostComplexTypeDef>>> semifuture_list_mostComplexTypedefReturn() = 0;
virtual void async_eb_enumReturn(std::unique_ptr<apache::thrift::HandlerCallback<::some::valid::ns::MyEnumA>> callback) = 0;
virtual void async_eb_list_EnumReturn(std::unique_ptr<apache::thrift::HandlerCallback<std::unique_ptr<::std::vector<::some::valid::ns::MyEnumA>>>> callback) = 0;
virtual void async_tm_structReturn(std::unique_ptr<apache::thrift::HandlerCallback<std::unique_ptr<::some::valid::ns::MyStruct>>> callback) = 0;
virtual folly::Future<std::unique_ptr<::some::valid::ns::MyStruct>> future_structReturn() = 0;
virtual folly::SemiFuture<std::unique_ptr<::some::valid::ns::MyStruct>> semifuture_structReturn() = 0;
virtual void async_tm_set_StructReturn(std::unique_ptr<apache::thrift::HandlerCallback<std::unique_ptr<::std::set<::some::valid::ns::MyStruct>>>> callback) = 0;
virtual folly::Future<std::unique_ptr<::std::set<::some::valid::ns::MyStruct>>> future_set_StructReturn() = 0;
virtual folly::SemiFuture<std::unique_ptr<::std::set<::some::valid::ns::MyStruct>>> semifuture_set_StructReturn() = 0;
virtual void async_eb_unionReturn(std::unique_ptr<apache::thrift::HandlerCallback<std::unique_ptr<::some::valid::ns::ComplexUnion>>> callback) = 0;
virtual void async_tm_list_UnionReturn(std::unique_ptr<apache::thrift::HandlerCallback<std::unique_ptr<::std::vector<::some::valid::ns::ComplexUnion>>>> callback) = 0;
virtual folly::Future<std::unique_ptr<::std::vector<::some::valid::ns::ComplexUnion>>> future_list_UnionReturn() = 0;
virtual folly::SemiFuture<std::unique_ptr<::std::vector<::some::valid::ns::ComplexUnion>>> semifuture_list_UnionReturn() = 0;
virtual void async_eb_readDataEb(std::unique_ptr<apache::thrift::HandlerCallback<std::unique_ptr<::some::valid::ns::IOBuf>>> callback, ::std::int64_t p_size) = 0;
virtual void async_tm_readData(std::unique_ptr<apache::thrift::HandlerCallback<std::unique_ptr<::some::valid::ns::IOBufPtr>>> callback, ::std::int64_t p_size) = 0;
virtual folly::Future<std::unique_ptr<::some::valid::ns::IOBufPtr>> future_readData(::std::int64_t p_size) = 0;
virtual folly::SemiFuture<std::unique_ptr<::some::valid::ns::IOBufPtr>> semifuture_readData(::std::int64_t p_size) = 0;
};
class ReturnServiceAsyncProcessor;
class ReturnServiceSvIf : public ReturnServiceSvAsyncIf, public apache::thrift::ServerInterface {
public:
typedef ReturnServiceAsyncProcessor ProcessorType;
std::unique_ptr<apache::thrift::AsyncProcessor> getProcessor() override;
void async_eb_noReturn(std::unique_ptr<apache::thrift::HandlerCallback<void>> callback) override;
virtual bool boolReturn();
folly::Future<bool> future_boolReturn() override;
folly::SemiFuture<bool> semifuture_boolReturn() override;
void async_tm_boolReturn(std::unique_ptr<apache::thrift::HandlerCallback<bool>> callback) override;
virtual ::std::int16_t i16Return();
folly::Future<::std::int16_t> future_i16Return() override;
folly::SemiFuture<::std::int16_t> semifuture_i16Return() override;
void async_tm_i16Return(std::unique_ptr<apache::thrift::HandlerCallback<::std::int16_t>> callback) override;
virtual ::std::int32_t i32Return();
folly::Future<::std::int32_t> future_i32Return() override;
folly::SemiFuture<::std::int32_t> semifuture_i32Return() override;
void async_tm_i32Return(std::unique_ptr<apache::thrift::HandlerCallback<::std::int32_t>> callback) override;
virtual ::std::int64_t i64Return();
folly::Future<::std::int64_t> future_i64Return() override;
folly::SemiFuture<::std::int64_t> semifuture_i64Return() override;
void async_tm_i64Return(std::unique_ptr<apache::thrift::HandlerCallback<::std::int64_t>> callback) override;
virtual float floatReturn();
folly::Future<float> future_floatReturn() override;
folly::SemiFuture<float> semifuture_floatReturn() override;
void async_tm_floatReturn(std::unique_ptr<apache::thrift::HandlerCallback<float>> callback) override;
virtual double doubleReturn();
folly::Future<double> future_doubleReturn() override;
folly::SemiFuture<double> semifuture_doubleReturn() override;
void async_tm_doubleReturn(std::unique_ptr<apache::thrift::HandlerCallback<double>> callback) override;
void async_eb_stringReturn(std::unique_ptr<apache::thrift::HandlerCallback<std::unique_ptr<::std::string>>> callback) override;
virtual void binaryReturn(::std::string& /*_return*/);
folly::Future<std::unique_ptr<::std::string>> future_binaryReturn() override;
folly::SemiFuture<std::unique_ptr<::std::string>> semifuture_binaryReturn() override;
void async_tm_binaryReturn(std::unique_ptr<apache::thrift::HandlerCallback<std::unique_ptr<::std::string>>> callback) override;
virtual void mapReturn(::std::map<::std::string, ::std::int64_t>& /*_return*/);
folly::Future<std::unique_ptr<::std::map<::std::string, ::std::int64_t>>> future_mapReturn() override;
folly::SemiFuture<std::unique_ptr<::std::map<::std::string, ::std::int64_t>>> semifuture_mapReturn() override;
void async_tm_mapReturn(std::unique_ptr<apache::thrift::HandlerCallback<std::unique_ptr<::std::map<::std::string, ::std::int64_t>>>> callback) override;
virtual ::some::valid::ns::simpleTypeDef simpleTypedefReturn();
folly::Future<::some::valid::ns::simpleTypeDef> future_simpleTypedefReturn() override;
folly::SemiFuture<::some::valid::ns::simpleTypeDef> semifuture_simpleTypedefReturn() override;
void async_tm_simpleTypedefReturn(std::unique_ptr<apache::thrift::HandlerCallback<::some::valid::ns::simpleTypeDef>> callback) override;
virtual void complexTypedefReturn(::some::valid::ns::complexStructTypeDef& /*_return*/);
folly::Future<std::unique_ptr<::some::valid::ns::complexStructTypeDef>> future_complexTypedefReturn() override;
folly::SemiFuture<std::unique_ptr<::some::valid::ns::complexStructTypeDef>> semifuture_complexTypedefReturn() override;
void async_tm_complexTypedefReturn(std::unique_ptr<apache::thrift::HandlerCallback<std::unique_ptr<::some::valid::ns::complexStructTypeDef>>> callback) override;
virtual void list_mostComplexTypedefReturn(::std::vector<::some::valid::ns::mostComplexTypeDef>& /*_return*/);
folly::Future<std::unique_ptr<::std::vector<::some::valid::ns::mostComplexTypeDef>>> future_list_mostComplexTypedefReturn() override;
folly::SemiFuture<std::unique_ptr<::std::vector<::some::valid::ns::mostComplexTypeDef>>> semifuture_list_mostComplexTypedefReturn() override;
void async_tm_list_mostComplexTypedefReturn(std::unique_ptr<apache::thrift::HandlerCallback<std::unique_ptr<::std::vector<::some::valid::ns::mostComplexTypeDef>>>> callback) override;
void async_eb_enumReturn(std::unique_ptr<apache::thrift::HandlerCallback<::some::valid::ns::MyEnumA>> callback) override;
void async_eb_list_EnumReturn(std::unique_ptr<apache::thrift::HandlerCallback<std::unique_ptr<::std::vector<::some::valid::ns::MyEnumA>>>> callback) override;
virtual void structReturn(::some::valid::ns::MyStruct& /*_return*/);
folly::Future<std::unique_ptr<::some::valid::ns::MyStruct>> future_structReturn() override;
folly::SemiFuture<std::unique_ptr<::some::valid::ns::MyStruct>> semifuture_structReturn() override;
void async_tm_structReturn(std::unique_ptr<apache::thrift::HandlerCallback<std::unique_ptr<::some::valid::ns::MyStruct>>> callback) override;
virtual void set_StructReturn(::std::set<::some::valid::ns::MyStruct>& /*_return*/);
folly::Future<std::unique_ptr<::std::set<::some::valid::ns::MyStruct>>> future_set_StructReturn() override;
folly::SemiFuture<std::unique_ptr<::std::set<::some::valid::ns::MyStruct>>> semifuture_set_StructReturn() override;
void async_tm_set_StructReturn(std::unique_ptr<apache::thrift::HandlerCallback<std::unique_ptr<::std::set<::some::valid::ns::MyStruct>>>> callback) override;
void async_eb_unionReturn(std::unique_ptr<apache::thrift::HandlerCallback<std::unique_ptr<::some::valid::ns::ComplexUnion>>> callback) override;
virtual void list_UnionReturn(::std::vector<::some::valid::ns::ComplexUnion>& /*_return*/);
folly::Future<std::unique_ptr<::std::vector<::some::valid::ns::ComplexUnion>>> future_list_UnionReturn() override;
folly::SemiFuture<std::unique_ptr<::std::vector<::some::valid::ns::ComplexUnion>>> semifuture_list_UnionReturn() override;
void async_tm_list_UnionReturn(std::unique_ptr<apache::thrift::HandlerCallback<std::unique_ptr<::std::vector<::some::valid::ns::ComplexUnion>>>> callback) override;
void async_eb_readDataEb(std::unique_ptr<apache::thrift::HandlerCallback<std::unique_ptr<::some::valid::ns::IOBuf>>> callback, ::std::int64_t p_size) override;
virtual void readData(::some::valid::ns::IOBufPtr& /*_return*/, ::std::int64_t /*size*/);
folly::Future<std::unique_ptr<::some::valid::ns::IOBufPtr>> future_readData(::std::int64_t p_size) override;
folly::SemiFuture<std::unique_ptr<::some::valid::ns::IOBufPtr>> semifuture_readData(::std::int64_t p_size) override;
void async_tm_readData(std::unique_ptr<apache::thrift::HandlerCallback<std::unique_ptr<::some::valid::ns::IOBufPtr>>> callback, ::std::int64_t p_size) override;
};
class ReturnServiceSvNull : public ReturnServiceSvIf {
public:
bool boolReturn() override;
::std::int16_t i16Return() override;
::std::int32_t i32Return() override;
::std::int64_t i64Return() override;
float floatReturn() override;
double doubleReturn() override;
void binaryReturn(::std::string& /*_return*/) override;
void mapReturn(::std::map<::std::string, ::std::int64_t>& /*_return*/) override;
::some::valid::ns::simpleTypeDef simpleTypedefReturn() override;
void complexTypedefReturn(::some::valid::ns::complexStructTypeDef& /*_return*/) override;
void list_mostComplexTypedefReturn(::std::vector<::some::valid::ns::mostComplexTypeDef>& /*_return*/) override;
void structReturn(::some::valid::ns::MyStruct& /*_return*/) override;
void set_StructReturn(::std::set<::some::valid::ns::MyStruct>& /*_return*/) override;
void list_UnionReturn(::std::vector<::some::valid::ns::ComplexUnion>& /*_return*/) override;
void readData(::some::valid::ns::IOBufPtr& /*_return*/, ::std::int64_t /*size*/) override;
};
class ReturnServiceAsyncProcessor : public ::apache::thrift::GeneratedAsyncProcessor {
public:
const char* getServiceName() override;
void getServiceMetadata(apache::thrift::metadata::ThriftServiceMetadataResponse& response) override;
using BaseAsyncProcessor = void;
protected:
ReturnServiceSvIf* iface_;
public:
void processSerializedCompressedRequest(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::protocol::PROTOCOL_TYPES protType, apache::thrift::Cpp2RequestContext* context, folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm) override;
protected:
std::shared_ptr<folly::RequestContext> getBaseContextForRequest() override;
public:
using ProcessFunc = GeneratedAsyncProcessor::ProcessFunc<ReturnServiceAsyncProcessor>;
using ProcessMap = GeneratedAsyncProcessor::ProcessMap<ProcessFunc>;
static const ReturnServiceAsyncProcessor::ProcessMap& getBinaryProtocolProcessMap();
static const ReturnServiceAsyncProcessor::ProcessMap& getCompactProtocolProcessMap();
private:
static const ReturnServiceAsyncProcessor::ProcessMap binaryProcessMap_;
static const ReturnServiceAsyncProcessor::ProcessMap compactProcessMap_;
private:
template <typename ProtocolIn_, typename ProtocolOut_>
void setUpAndProcess_noReturn(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx, folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <typename ProtocolIn_, typename ProtocolOut_>
void process_noReturn(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx,folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <class ProtocolIn_, class ProtocolOut_>
static folly::IOBufQueue return_noReturn(int32_t protoSeqId, apache::thrift::ContextStack* ctx);
template <class ProtocolIn_, class ProtocolOut_>
static void throw_wrapped_noReturn(apache::thrift::ResponseChannelRequest::UniquePtr req,int32_t protoSeqId,apache::thrift::ContextStack* ctx,folly::exception_wrapper ew,apache::thrift::Cpp2RequestContext* reqCtx);
template <typename ProtocolIn_, typename ProtocolOut_>
void setUpAndProcess_boolReturn(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx, folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <typename ProtocolIn_, typename ProtocolOut_>
void process_boolReturn(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx,folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <class ProtocolIn_, class ProtocolOut_>
static folly::IOBufQueue return_boolReturn(int32_t protoSeqId, apache::thrift::ContextStack* ctx, bool const& _return);
template <class ProtocolIn_, class ProtocolOut_>
static void throw_wrapped_boolReturn(apache::thrift::ResponseChannelRequest::UniquePtr req,int32_t protoSeqId,apache::thrift::ContextStack* ctx,folly::exception_wrapper ew,apache::thrift::Cpp2RequestContext* reqCtx);
template <typename ProtocolIn_, typename ProtocolOut_>
void setUpAndProcess_i16Return(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx, folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <typename ProtocolIn_, typename ProtocolOut_>
void process_i16Return(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx,folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <class ProtocolIn_, class ProtocolOut_>
static folly::IOBufQueue return_i16Return(int32_t protoSeqId, apache::thrift::ContextStack* ctx, ::std::int16_t const& _return);
template <class ProtocolIn_, class ProtocolOut_>
static void throw_wrapped_i16Return(apache::thrift::ResponseChannelRequest::UniquePtr req,int32_t protoSeqId,apache::thrift::ContextStack* ctx,folly::exception_wrapper ew,apache::thrift::Cpp2RequestContext* reqCtx);
template <typename ProtocolIn_, typename ProtocolOut_>
void setUpAndProcess_i32Return(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx, folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <typename ProtocolIn_, typename ProtocolOut_>
void process_i32Return(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx,folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <class ProtocolIn_, class ProtocolOut_>
static folly::IOBufQueue return_i32Return(int32_t protoSeqId, apache::thrift::ContextStack* ctx, ::std::int32_t const& _return);
template <class ProtocolIn_, class ProtocolOut_>
static void throw_wrapped_i32Return(apache::thrift::ResponseChannelRequest::UniquePtr req,int32_t protoSeqId,apache::thrift::ContextStack* ctx,folly::exception_wrapper ew,apache::thrift::Cpp2RequestContext* reqCtx);
template <typename ProtocolIn_, typename ProtocolOut_>
void setUpAndProcess_i64Return(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx, folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <typename ProtocolIn_, typename ProtocolOut_>
void process_i64Return(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx,folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <class ProtocolIn_, class ProtocolOut_>
static folly::IOBufQueue return_i64Return(int32_t protoSeqId, apache::thrift::ContextStack* ctx, ::std::int64_t const& _return);
template <class ProtocolIn_, class ProtocolOut_>
static void throw_wrapped_i64Return(apache::thrift::ResponseChannelRequest::UniquePtr req,int32_t protoSeqId,apache::thrift::ContextStack* ctx,folly::exception_wrapper ew,apache::thrift::Cpp2RequestContext* reqCtx);
template <typename ProtocolIn_, typename ProtocolOut_>
void setUpAndProcess_floatReturn(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx, folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <typename ProtocolIn_, typename ProtocolOut_>
void process_floatReturn(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx,folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <class ProtocolIn_, class ProtocolOut_>
static folly::IOBufQueue return_floatReturn(int32_t protoSeqId, apache::thrift::ContextStack* ctx, float const& _return);
template <class ProtocolIn_, class ProtocolOut_>
static void throw_wrapped_floatReturn(apache::thrift::ResponseChannelRequest::UniquePtr req,int32_t protoSeqId,apache::thrift::ContextStack* ctx,folly::exception_wrapper ew,apache::thrift::Cpp2RequestContext* reqCtx);
template <typename ProtocolIn_, typename ProtocolOut_>
void setUpAndProcess_doubleReturn(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx, folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <typename ProtocolIn_, typename ProtocolOut_>
void process_doubleReturn(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx,folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <class ProtocolIn_, class ProtocolOut_>
static folly::IOBufQueue return_doubleReturn(int32_t protoSeqId, apache::thrift::ContextStack* ctx, double const& _return);
template <class ProtocolIn_, class ProtocolOut_>
static void throw_wrapped_doubleReturn(apache::thrift::ResponseChannelRequest::UniquePtr req,int32_t protoSeqId,apache::thrift::ContextStack* ctx,folly::exception_wrapper ew,apache::thrift::Cpp2RequestContext* reqCtx);
template <typename ProtocolIn_, typename ProtocolOut_>
void setUpAndProcess_stringReturn(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx, folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <typename ProtocolIn_, typename ProtocolOut_>
void process_stringReturn(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx,folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <class ProtocolIn_, class ProtocolOut_>
static folly::IOBufQueue return_stringReturn(int32_t protoSeqId, apache::thrift::ContextStack* ctx, ::std::string const& _return);
template <class ProtocolIn_, class ProtocolOut_>
static void throw_wrapped_stringReturn(apache::thrift::ResponseChannelRequest::UniquePtr req,int32_t protoSeqId,apache::thrift::ContextStack* ctx,folly::exception_wrapper ew,apache::thrift::Cpp2RequestContext* reqCtx);
template <typename ProtocolIn_, typename ProtocolOut_>
void setUpAndProcess_binaryReturn(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx, folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <typename ProtocolIn_, typename ProtocolOut_>
void process_binaryReturn(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx,folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <class ProtocolIn_, class ProtocolOut_>
static folly::IOBufQueue return_binaryReturn(int32_t protoSeqId, apache::thrift::ContextStack* ctx, ::std::string const& _return);
template <class ProtocolIn_, class ProtocolOut_>
static void throw_wrapped_binaryReturn(apache::thrift::ResponseChannelRequest::UniquePtr req,int32_t protoSeqId,apache::thrift::ContextStack* ctx,folly::exception_wrapper ew,apache::thrift::Cpp2RequestContext* reqCtx);
template <typename ProtocolIn_, typename ProtocolOut_>
void setUpAndProcess_mapReturn(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx, folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <typename ProtocolIn_, typename ProtocolOut_>
void process_mapReturn(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx,folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <class ProtocolIn_, class ProtocolOut_>
static folly::IOBufQueue return_mapReturn(int32_t protoSeqId, apache::thrift::ContextStack* ctx, ::std::map<::std::string, ::std::int64_t> const& _return);
template <class ProtocolIn_, class ProtocolOut_>
static void throw_wrapped_mapReturn(apache::thrift::ResponseChannelRequest::UniquePtr req,int32_t protoSeqId,apache::thrift::ContextStack* ctx,folly::exception_wrapper ew,apache::thrift::Cpp2RequestContext* reqCtx);
template <typename ProtocolIn_, typename ProtocolOut_>
void setUpAndProcess_simpleTypedefReturn(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx, folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <typename ProtocolIn_, typename ProtocolOut_>
void process_simpleTypedefReturn(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx,folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <class ProtocolIn_, class ProtocolOut_>
static folly::IOBufQueue return_simpleTypedefReturn(int32_t protoSeqId, apache::thrift::ContextStack* ctx, ::some::valid::ns::simpleTypeDef const& _return);
template <class ProtocolIn_, class ProtocolOut_>
static void throw_wrapped_simpleTypedefReturn(apache::thrift::ResponseChannelRequest::UniquePtr req,int32_t protoSeqId,apache::thrift::ContextStack* ctx,folly::exception_wrapper ew,apache::thrift::Cpp2RequestContext* reqCtx);
template <typename ProtocolIn_, typename ProtocolOut_>
void setUpAndProcess_complexTypedefReturn(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx, folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <typename ProtocolIn_, typename ProtocolOut_>
void process_complexTypedefReturn(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx,folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <class ProtocolIn_, class ProtocolOut_>
static folly::IOBufQueue return_complexTypedefReturn(int32_t protoSeqId, apache::thrift::ContextStack* ctx, ::some::valid::ns::complexStructTypeDef const& _return);
template <class ProtocolIn_, class ProtocolOut_>
static void throw_wrapped_complexTypedefReturn(apache::thrift::ResponseChannelRequest::UniquePtr req,int32_t protoSeqId,apache::thrift::ContextStack* ctx,folly::exception_wrapper ew,apache::thrift::Cpp2RequestContext* reqCtx);
template <typename ProtocolIn_, typename ProtocolOut_>
void setUpAndProcess_list_mostComplexTypedefReturn(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx, folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <typename ProtocolIn_, typename ProtocolOut_>
void process_list_mostComplexTypedefReturn(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx,folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <class ProtocolIn_, class ProtocolOut_>
static folly::IOBufQueue return_list_mostComplexTypedefReturn(int32_t protoSeqId, apache::thrift::ContextStack* ctx, ::std::vector<::some::valid::ns::mostComplexTypeDef> const& _return);
template <class ProtocolIn_, class ProtocolOut_>
static void throw_wrapped_list_mostComplexTypedefReturn(apache::thrift::ResponseChannelRequest::UniquePtr req,int32_t protoSeqId,apache::thrift::ContextStack* ctx,folly::exception_wrapper ew,apache::thrift::Cpp2RequestContext* reqCtx);
template <typename ProtocolIn_, typename ProtocolOut_>
void setUpAndProcess_enumReturn(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx, folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <typename ProtocolIn_, typename ProtocolOut_>
void process_enumReturn(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx,folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <class ProtocolIn_, class ProtocolOut_>
static folly::IOBufQueue return_enumReturn(int32_t protoSeqId, apache::thrift::ContextStack* ctx, ::some::valid::ns::MyEnumA const& _return);
template <class ProtocolIn_, class ProtocolOut_>
static void throw_wrapped_enumReturn(apache::thrift::ResponseChannelRequest::UniquePtr req,int32_t protoSeqId,apache::thrift::ContextStack* ctx,folly::exception_wrapper ew,apache::thrift::Cpp2RequestContext* reqCtx);
template <typename ProtocolIn_, typename ProtocolOut_>
void setUpAndProcess_list_EnumReturn(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx, folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <typename ProtocolIn_, typename ProtocolOut_>
void process_list_EnumReturn(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx,folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <class ProtocolIn_, class ProtocolOut_>
static folly::IOBufQueue return_list_EnumReturn(int32_t protoSeqId, apache::thrift::ContextStack* ctx, ::std::vector<::some::valid::ns::MyEnumA> const& _return);
template <class ProtocolIn_, class ProtocolOut_>
static void throw_wrapped_list_EnumReturn(apache::thrift::ResponseChannelRequest::UniquePtr req,int32_t protoSeqId,apache::thrift::ContextStack* ctx,folly::exception_wrapper ew,apache::thrift::Cpp2RequestContext* reqCtx);
template <typename ProtocolIn_, typename ProtocolOut_>
void setUpAndProcess_structReturn(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx, folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <typename ProtocolIn_, typename ProtocolOut_>
void process_structReturn(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx,folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <class ProtocolIn_, class ProtocolOut_>
static folly::IOBufQueue return_structReturn(int32_t protoSeqId, apache::thrift::ContextStack* ctx, ::some::valid::ns::MyStruct const& _return);
template <class ProtocolIn_, class ProtocolOut_>
static void throw_wrapped_structReturn(apache::thrift::ResponseChannelRequest::UniquePtr req,int32_t protoSeqId,apache::thrift::ContextStack* ctx,folly::exception_wrapper ew,apache::thrift::Cpp2RequestContext* reqCtx);
template <typename ProtocolIn_, typename ProtocolOut_>
void setUpAndProcess_set_StructReturn(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx, folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <typename ProtocolIn_, typename ProtocolOut_>
void process_set_StructReturn(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx,folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <class ProtocolIn_, class ProtocolOut_>
static folly::IOBufQueue return_set_StructReturn(int32_t protoSeqId, apache::thrift::ContextStack* ctx, ::std::set<::some::valid::ns::MyStruct> const& _return);
template <class ProtocolIn_, class ProtocolOut_>
static void throw_wrapped_set_StructReturn(apache::thrift::ResponseChannelRequest::UniquePtr req,int32_t protoSeqId,apache::thrift::ContextStack* ctx,folly::exception_wrapper ew,apache::thrift::Cpp2RequestContext* reqCtx);
template <typename ProtocolIn_, typename ProtocolOut_>
void setUpAndProcess_unionReturn(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx, folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <typename ProtocolIn_, typename ProtocolOut_>
void process_unionReturn(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx,folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <class ProtocolIn_, class ProtocolOut_>
static folly::IOBufQueue return_unionReturn(int32_t protoSeqId, apache::thrift::ContextStack* ctx, ::some::valid::ns::ComplexUnion const& _return);
template <class ProtocolIn_, class ProtocolOut_>
static void throw_wrapped_unionReturn(apache::thrift::ResponseChannelRequest::UniquePtr req,int32_t protoSeqId,apache::thrift::ContextStack* ctx,folly::exception_wrapper ew,apache::thrift::Cpp2RequestContext* reqCtx);
template <typename ProtocolIn_, typename ProtocolOut_>
void setUpAndProcess_list_UnionReturn(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx, folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <typename ProtocolIn_, typename ProtocolOut_>
void process_list_UnionReturn(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx,folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <class ProtocolIn_, class ProtocolOut_>
static folly::IOBufQueue return_list_UnionReturn(int32_t protoSeqId, apache::thrift::ContextStack* ctx, ::std::vector<::some::valid::ns::ComplexUnion> const& _return);
template <class ProtocolIn_, class ProtocolOut_>
static void throw_wrapped_list_UnionReturn(apache::thrift::ResponseChannelRequest::UniquePtr req,int32_t protoSeqId,apache::thrift::ContextStack* ctx,folly::exception_wrapper ew,apache::thrift::Cpp2RequestContext* reqCtx);
template <typename ProtocolIn_, typename ProtocolOut_>
void setUpAndProcess_readDataEb(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx, folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <typename ProtocolIn_, typename ProtocolOut_>
void process_readDataEb(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx,folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <class ProtocolIn_, class ProtocolOut_>
static folly::IOBufQueue return_readDataEb(int32_t protoSeqId, apache::thrift::ContextStack* ctx, ::some::valid::ns::IOBuf const& _return);
template <class ProtocolIn_, class ProtocolOut_>
static void throw_wrapped_readDataEb(apache::thrift::ResponseChannelRequest::UniquePtr req,int32_t protoSeqId,apache::thrift::ContextStack* ctx,folly::exception_wrapper ew,apache::thrift::Cpp2RequestContext* reqCtx);
template <typename ProtocolIn_, typename ProtocolOut_>
void setUpAndProcess_readData(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx, folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <typename ProtocolIn_, typename ProtocolOut_>
void process_readData(apache::thrift::ResponseChannelRequest::UniquePtr req, apache::thrift::SerializedCompressedRequest&& serializedRequest, apache::thrift::Cpp2RequestContext* ctx,folly::EventBase* eb, apache::thrift::concurrency::ThreadManager* tm);
template <class ProtocolIn_, class ProtocolOut_>
static folly::IOBufQueue return_readData(int32_t protoSeqId, apache::thrift::ContextStack* ctx, ::some::valid::ns::IOBufPtr const& _return);
template <class ProtocolIn_, class ProtocolOut_>
static void throw_wrapped_readData(apache::thrift::ResponseChannelRequest::UniquePtr req,int32_t protoSeqId,apache::thrift::ContextStack* ctx,folly::exception_wrapper ew,apache::thrift::Cpp2RequestContext* reqCtx);
public:
ReturnServiceAsyncProcessor(ReturnServiceSvIf* iface) :
iface_(iface) {}
virtual ~ReturnServiceAsyncProcessor() {}
};
}}} // some::valid::ns
| [
"[email protected]"
] | |
874f518bc83d9acfb92580f74fb66b115350d98a | 325f4a6ce8aa09a019cae883c0db967b615da5db | /SDK/PUBG_ABP_Weapon_Glock18_classes.hpp | 6f883fd652ad42888007495cd69642b60ebcff3a | [] | no_license | Rioo-may/PUBG-SDK | 1c9e18b1dc0f893f5e88d5c2f631651ada7e63a4 | fa64ffdc5924e5f3222a30b051daa3a5b3a86fbf | refs/heads/master | 2023-01-07T22:57:11.560093 | 2020-11-11T05:49:47 | 2020-11-11T05:49:47 | 311,240,310 | 0 | 0 | null | 2020-11-11T05:51:42 | 2020-11-09T06:09:27 | C++ | UTF-8 | C++ | false | false | 2,167 | hpp | #pragma once
// PlayerUnknown's Battlegrounds (2.5.39.19) SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
namespace Classes
{
//---------------------------------------------------------------------------
//Classes
//---------------------------------------------------------------------------
// AnimBlueprintGeneratedClass ABP_Weapon_Glock18.ABP_Weapon_Glock18_C
// 0x0154 (0x06C4 - 0x0570)
class UABP_Weapon_Glock18_C : public UTslGunAnimInstance
{
public:
struct FPointerToUberGraphFrame UberGraphFrame; // 0x0570(0x0008) (CPF_ZeroConstructor, CPF_Transient, CPF_DuplicateTransient)
struct FAnimNode_Root AnimGraphNode_Root_B29CC6C845D4665FCBD2358A11CC8C0F; // 0x0578(0x0048)
struct FAnimNode_RefPose AnimGraphNode_LocalRefPose_CF0013C642186ADF940B94B85CFDCC4B;// 0x05C0(0x0038)
struct FAnimNode_Slot AnimGraphNode_Slot_65C61014433D6E1673D9DDAAFF2ACEA3; // 0x05F8(0x0060)
struct FAnimNode_Slot AnimGraphNode_Slot_467A635F49F9A3D4D29598885FE57EA1; // 0x0658(0x0060)
class ATslWeapon_Gun* ActorRef; // 0x06B8(0x0008) (CPF_Edit, CPF_BlueprintVisible, CPF_ZeroConstructor, CPF_DisableEditOnTemplate, CPF_DisableEditOnInstance, CPF_IsPlainOldData)
int CurrentAmmo; // 0x06C0(0x0004) (CPF_Edit, CPF_BlueprintVisible, CPF_ZeroConstructor, CPF_DisableEditOnInstance, CPF_IsPlainOldData)
static UClass* StaticClass()
{
static auto ptr = UObject::FindClass("AnimBlueprintGeneratedClass ABP_Weapon_Glock18.ABP_Weapon_Glock18_C");
return ptr;
}
void Handle_FireSelector();
void Handle_Fire();
void BlueprintUpdateAnimation(float* DeltaTimeX);
void WeaponFire_Event_1();
void Reload2_Event_1();
void BlueprintInitializeAnimation();
void FireSelect_Event();
void SlideRelease();
void ExecuteUbergraph_ABP_Weapon_Glock18(int EntryPoint);
};
}
#ifdef _MSC_VER
#pragma pack(pop)
#endif
| [
"[email protected]"
] | |
5622e41237d4c31970ab19a2a9c8ae3ad9f94554 | ac2e10e06d4aa423040bca4f6728a786f7bf64ef | /common/src/util.cpp | 242aade1a15de59b428f38b431f74eacd5696ddc | [
"MIT"
] | permissive | sathyamvellal/hpc-experiments | 5c7ec722258663dd534d17c99c501a8f1f96475f | 7ef1557ae6a9c247b844f662ee4ad0fd06ce8bc0 | refs/heads/master | 2021-04-25T18:27:49.221728 | 2017-11-13T18:17:15 | 2017-11-13T18:17:15 | 108,215,773 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 261 | cpp | //
// Created by Sathyam Vellal on 27/10/2017.
//
#include "util.h"
double dmod(double num, double mod)
{
int a;
a = (int) (num/mod);
return (num - mod * a);
}
#if 0
double signr(double val, double x)
{
return (x > 0.0) ? val : -val;
}
#endif | [
"[email protected]"
] | |
4ea363103f15a752d0a542b651e86b861c728b9f | 26cc428b3d87f0cd0f1a2e6a51e9da25cd0b651a | /discretization/Blasius_linearUpwind/0.75/phi | 447069128c02b1337724d1aae5b2d94bef5eb8d6 | [] | no_license | CagriMetin/BlasiusProblem | 8f4fe708df8f3332d054b233d99a33fbb3c15c2a | 32c4aafd6ddd6ba4c39aef04d01b77a9106125b2 | refs/heads/master | 2020-12-24T19:37:14.665700 | 2016-12-27T19:13:04 | 2016-12-27T19:13:04 | 57,833,097 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 72,363 | /*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | OpenFOAM: The Open Source CFD Toolbox |
| \\ / O peration | Version: 2.3.0 |
| \\ / A nd | Web: www.OpenFOAM.org |
| \\/ M anipulation | |
\*---------------------------------------------------------------------------*/
FoamFile
{
version 2.0;
format ascii;
class surfaceScalarField;
location "0.75";
object phi;
}
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
dimensions [0 3 -1 0 0 0 0];
internalField nonuniform List<scalar>
5764
(
1.78524e-08
5.91676e-09
-2.37692e-08
1.2543e-08
5.30943e-09
8.95572e-09
3.58725e-09
6.9103e-09
2.04542e-09
5.84574e-09
1.06456e-09
5.27633e-09
5.69414e-10
4.91285e-09
3.63473e-10
4.62529e-09
2.87562e-10
4.37276e-09
2.52531e-10
4.14775e-09
2.25015e-10
3.94875e-09
1.98995e-10
3.77303e-09
1.75717e-10
3.61692e-09
1.56116e-10
3.47696e-09
1.39955e-10
3.35041e-09
1.26553e-10
3.23515e-09
1.15266e-10
3.12954e-09
1.05609e-10
3.0323e-09
9.72384e-11
2.94239e-09
8.9908e-11
2.85895e-09
8.3438e-11
2.78126e-09
7.76903e-11
2.70871e-09
7.25555e-11
2.64076e-09
6.79449e-11
2.57697e-09
6.3786e-11
2.51696e-09
6.00186e-11
2.46036e-09
5.65928e-11
2.4069e-09
5.34667e-11
2.35629e-09
5.06047e-11
2.30832e-09
4.79768e-11
2.26276e-09
4.55572e-11
2.21943e-09
4.33238e-11
2.17818e-09
4.12576e-11
2.13883e-09
3.93418e-11
2.10127e-09
3.75619e-11
2.06537e-09
3.59051e-11
2.03101e-09
3.43602e-11
1.99809e-09
3.29171e-11
1.96652e-09
3.15668e-11
1.93622e-09
3.03016e-11
1.90711e-09
2.91142e-11
1.87911e-09
2.79982e-11
1.85216e-09
2.69479e-11
1.8262e-09
2.5958e-11
1.80118e-09
2.50238e-11
1.77704e-09
2.4141e-11
1.75373e-09
2.33057e-11
1.73122e-09
2.25144e-11
1.70945e-09
2.17638e-11
1.6884e-09
2.1051e-11
1.66803e-09
2.03734e-11
1.6483e-09
1.97285e-11
1.62919e-09
1.9114e-11
1.61066e-09
1.85281e-11
1.59269e-09
1.7969e-11
1.57526e-09
1.7435e-11
1.55833e-09
1.69249e-11
1.54189e-09
1.64374e-11
1.52592e-09
1.59715e-11
1.5104e-09
1.55266e-11
1.49529e-09
1.51019e-11
1.4806e-09
1.46971e-11
1.46628e-09
1.43123e-11
1.45234e-09
1.39474e-11
1.43873e-09
1.36031e-11
1.42545e-09
1.32805e-11
1.41247e-09
1.29795e-11
1.39977e-09
1.27071e-11
1.38732e-09
1.24475e-11
1.37505e-09
1.22658e-11
1.36311e-09
1.19478e-11
1.35089e-09
1.22136e-11
1.34027e-09
1.06239e-11
1.32578e-09
1.44863e-11
1.32631e-09
-5.31546e-13
2.33447e-11
2.74496e-08
5.94048e-09
-2.74733e-08
2.58754e-08
6.88363e-09
2.34087e-08
6.05397e-09
2.0898e-08
4.55611e-09
1.87466e-08
3.21594e-09
1.70304e-08
2.28558e-09
1.56864e-08
1.70746e-09
1.46202e-08
1.3538e-09
1.37497e-08
1.12301e-09
1.30174e-08
9.57377e-10
1.23863e-08
8.30084e-10
1.1833e-08
7.28953e-10
1.13419e-08
6.47236e-10
1.09016e-08
5.8025e-10
1.05037e-08
5.2451e-10
1.01415e-08
4.77447e-10
9.80991e-09
4.37186e-10
9.50479e-09
4.02351e-10
9.22278e-09
3.7192e-10
8.9611e-09
3.4512e-10
8.71743e-09
3.21355e-10
8.48984e-09
3.00151e-10
8.27665e-09
2.81132e-10
8.07645e-09
2.63987e-10
7.888e-09
2.48465e-10
7.71024e-09
2.34353e-10
7.54223e-09
2.21478e-10
7.38315e-09
2.09691e-10
7.23225e-09
1.98867e-10
7.08891e-09
1.889e-10
6.95254e-09
1.79696e-10
6.82262e-09
1.71179e-10
6.69868e-09
1.63278e-10
6.58031e-09
1.55934e-10
6.46712e-09
1.49094e-10
6.35877e-09
1.42712e-10
6.25494e-09
1.36746e-10
6.15535e-09
1.31161e-10
6.05973e-09
1.25924e-10
5.96783e-09
1.21006e-10
5.87945e-09
1.16379e-10
5.79438e-09
1.12022e-10
5.71242e-09
1.07912e-10
5.63342e-09
1.0403e-10
5.5572e-09
1.00359e-10
5.48362e-09
9.68819e-11
5.41255e-09
9.3585e-11
5.34386e-09
9.04548e-11
5.27743e-09
8.74792e-11
5.21316e-09
8.46472e-11
5.15094e-09
8.19486e-11
5.09068e-09
7.93744e-11
5.03229e-09
7.69162e-11
4.97569e-09
7.45666e-11
4.92081e-09
7.23189e-11
4.86757e-09
7.01671e-11
4.8159e-09
6.81061e-11
4.76574e-09
6.61314e-11
4.71703e-09
6.42393e-11
4.6697e-09
6.2427e-11
4.62371e-09
6.06925e-11
4.57898e-09
5.90347e-11
4.53548e-09
5.74536e-11
4.49313e-09
5.59503e-11
4.45188e-09
5.45276e-11
4.41167e-09
5.31888e-11
4.37244e-09
5.19429e-11
4.3341e-09
5.07848e-11
4.29659e-09
4.97772e-11
4.25983e-09
4.8705e-11
4.22362e-09
4.84217e-11
4.18881e-09
4.54353e-11
4.15206e-09
5.12358e-11
4.13192e-09
1.96155e-11
6.90087e-11
2.89169e-08
5.18736e-09
-2.81638e-08
2.94853e-08
6.31527e-09
2.93168e-08
6.22239e-09
2.84918e-08
5.38111e-09
2.73095e-08
4.3983e-09
2.60173e-08
3.57774e-09
2.47544e-08
2.97037e-09
2.35795e-08
2.52872e-09
2.25075e-08
2.19503e-09
2.15348e-08
1.93001e-09
2.06524e-08
1.71248e-09
1.98502e-08
1.53116e-09
1.91187e-08
1.3788e-09
1.84492e-08
1.24978e-09
1.78341e-08
1.13959e-09
1.72669e-08
1.04465e-09
1.67419e-08
9.6214e-10
1.62544e-08
8.89876e-10
1.58002e-08
8.26126e-10
1.53758e-08
7.69521e-10
1.49782e-08
7.18969e-10
1.46047e-08
6.73586e-10
1.42532e-08
6.32647e-10
1.39216e-08
5.95559e-10
1.36083e-08
5.61824e-10
1.33116e-08
5.31029e-10
1.30303e-08
5.02824e-10
1.2763e-08
4.76911e-10
1.25089e-08
4.53037e-10
1.22668e-08
4.30985e-10
1.20359e-08
4.10567e-10
1.18155e-08
3.91619e-10
1.16048e-08
3.73999e-10
1.14031e-08
3.57581e-10
1.121e-08
3.42256e-10
1.10247e-08
3.27925e-10
1.0847e-08
3.14503e-10
1.06762e-08
3.01913e-10
1.05121e-08
2.90084e-10
1.03541e-08
2.78954e-10
1.0202e-08
2.68468e-10
1.00555e-08
2.58575e-10
9.91416e-09
2.49229e-10
9.7778e-09
2.40388e-10
9.64615e-09
2.32013e-10
9.51896e-09
2.24071e-10
9.39602e-09
2.16529e-10
9.27711e-09
2.09359e-10
9.16206e-09
2.02533e-10
9.05068e-09
1.96028e-10
8.94281e-09
1.8982e-10
8.83829e-09
1.8389e-10
8.73699e-09
1.78219e-10
8.63876e-09
1.72791e-10
8.54349e-09
1.67589e-10
8.45106e-09
1.62601e-10
8.36135e-09
1.57815e-10
8.27426e-09
1.53219e-10
8.1897e-09
1.48806e-10
8.10755e-09
1.44567e-10
8.02775e-09
1.40499e-10
7.95019e-09
1.36597e-10
7.87478e-09
1.3286e-10
7.80144e-09
1.29289e-10
7.73008e-09
1.2589e-10
7.6606e-09
1.22669e-10
7.59291e-09
1.19636e-10
7.52688e-09
1.16811e-10
7.46245e-09
1.14212e-10
7.39938e-09
1.11773e-10
7.33778e-09
1.10019e-10
7.27743e-09
1.05788e-10
7.2179e-09
1.10765e-10
7.16931e-09
6.82049e-11
1.32436e-10
2.94748e-08
4.70973e-09
-2.89972e-08
3.01497e-08
5.64037e-09
3.06751e-08
5.69696e-09
3.0864e-08
5.19218e-09
3.07174e-08
4.54494e-09
3.03214e-08
3.9737e-09
2.97678e-08
3.52402e-09
2.9124e-08
3.17248e-09
2.84332e-08
2.88587e-09
2.77223e-08
2.64088e-09
2.70093e-08
2.42551e-09
2.63062e-08
2.23427e-09
2.56209e-08
2.06404e-09
2.49585e-08
1.91225e-09
2.43215e-08
1.77655e-09
2.37113e-08
1.65484e-09
2.31281e-08
1.54533e-09
2.25715e-08
1.44647e-09
2.20407e-08
1.35694e-09
2.15346e-08
1.27561e-09
2.10521e-08
1.20152e-09
2.05918e-08
1.13382e-09
2.01527e-08
1.07179e-09
1.97334e-08
1.01482e-09
1.93329e-08
9.62366e-10
1.895e-08
9.13947e-10
1.85836e-08
8.69157e-10
1.82329e-08
8.27634e-10
1.78969e-08
7.89063e-10
1.75747e-08
7.53165e-10
1.72656e-08
7.19696e-10
1.69688e-08
6.88438e-10
1.66836e-08
6.59197e-10
1.64093e-08
6.31802e-10
1.61455e-08
6.061e-10
1.58915e-08
5.8195e-10
1.56467e-08
5.59231e-10
1.54108e-08
5.37828e-10
1.51833e-08
5.17641e-10
1.49637e-08
4.98577e-10
1.47516e-08
4.80552e-10
1.45467e-08
4.6349e-10
1.43486e-08
4.4732e-10
1.4157e-08
4.31978e-10
1.39716e-08
4.17405e-10
1.37921e-08
4.03546e-10
1.36183e-08
3.90352e-10
1.34499e-08
3.77777e-10
1.32866e-08
3.65777e-10
1.31283e-08
3.54315e-10
1.29748e-08
3.43353e-10
1.28258e-08
3.32858e-10
1.26813e-08
3.22801e-10
1.25409e-08
3.13152e-10
1.24046e-08
3.03887e-10
1.22722e-08
2.94983e-10
1.21436e-08
2.8642e-10
1.20186e-08
2.78179e-10
1.18972e-08
2.70245e-10
1.17792e-08
2.62607e-10
1.16644e-08
2.55253e-10
1.15528e-08
2.48177e-10
1.14443e-08
2.41377e-10
1.13388e-08
2.34853e-10
1.1236e-08
2.28611e-10
1.1136e-08
2.22663e-10
1.10387e-08
2.1702e-10
1.09437e-08
2.11726e-10
1.08512e-08
2.06763e-10
1.07608e-08
2.02206e-10
1.06725e-08
1.98235e-10
1.0586e-08
1.92322e-10
1.0502e-08
1.94816e-10
1.04231e-08
1.47018e-10
2.15354e-10
3.0317e-08
4.37545e-09
-2.99827e-08
3.07827e-08
5.1746e-09
3.12227e-08
5.25701e-09
3.15446e-08
4.87028e-09
3.17243e-08
4.36523e-09
3.17728e-08
3.92524e-09
3.17114e-08
3.58537e-09
3.15599e-08
3.32403e-09
3.13329e-08
3.1128e-09
3.10427e-08
2.93112e-09
3.07004e-08
2.76774e-09
3.03171e-08
2.61762e-09
2.99026e-08
2.47853e-09
2.94657e-08
2.34916e-09
2.90137e-08
2.22854e-09
2.85527e-08
2.11586e-09
2.80876e-08
2.01047e-09
2.76222e-08
1.91182e-09
2.71597e-08
1.81943e-09
2.67025e-08
1.73286e-09
2.62523e-08
1.65169e-09
2.58105e-08
1.57557e-09
2.53782e-08
1.50415e-09
2.49559e-08
1.43709e-09
2.45442e-08
1.37409e-09
2.41433e-08
1.31486e-09
2.37533e-08
1.25914e-09
2.33742e-08
1.20669e-09
2.3006e-08
1.15727e-09
2.26485e-08
1.11067e-09
2.23015e-08
1.06669e-09
2.19648e-08
1.02516e-09
2.16381e-08
9.85913e-10
2.13211e-08
9.48786e-10
2.10136e-08
9.13641e-10
2.07152e-08
8.80344e-10
2.04256e-08
8.48775e-10
2.01446e-08
8.1882e-10
1.98719e-08
7.90373e-10
1.96072e-08
7.63336e-10
1.93501e-08
7.37619e-10
1.91004e-08
7.13138e-10
1.88579e-08
6.89812e-10
1.86224e-08
6.67568e-10
1.83934e-08
6.46338e-10
1.81709e-08
6.26058e-10
1.79546e-08
6.06666e-10
1.77443e-08
5.88108e-10
1.75397e-08
5.70331e-10
1.73407e-08
5.53285e-10
1.71472e-08
5.36925e-10
1.69588e-08
5.21209e-10
1.67755e-08
5.06097e-10
1.65971e-08
4.91553e-10
1.64235e-08
4.77543e-10
1.62544e-08
4.64037e-10
1.60898e-08
4.51008e-10
1.59296e-08
4.38431e-10
1.57735e-08
4.26286e-10
1.56216e-08
4.14555e-10
1.54736e-08
4.03225e-10
1.53295e-08
3.92287e-10
1.51891e-08
3.81735e-10
1.50524e-08
3.71572e-10
1.49192e-08
3.61803e-10
1.47894e-08
3.52448e-10
1.46629e-08
3.4352e-10
1.45396e-08
3.35081e-10
1.44193e-08
3.27099e-10
1.43017e-08
3.19749e-10
1.4187e-08
3.12945e-10
1.40744e-08
3.0488e-10
1.39656e-08
3.03688e-10
1.38566e-08
2.55987e-10
3.18745e-10
3.12755e-08
4.09267e-09
-3.09927e-08
3.1648e-08
4.80213e-09
3.19813e-08
4.92367e-09
3.22249e-08
4.62674e-09
3.23877e-08
4.20234e-09
3.24928e-08
3.8202e-09
3.25564e-08
3.52179e-09
3.25857e-08
3.29474e-09
3.25812e-08
3.11729e-09
3.25408e-08
2.97146e-09
3.24631e-08
2.84544e-09
3.23482e-08
2.73252e-09
3.21978e-08
2.62896e-09
3.20145e-08
2.53248e-09
3.18015e-08
2.4415e-09
3.15624e-08
2.35496e-09
3.13007e-08
2.27216e-09
3.10199e-08
2.19265e-09
3.07232e-08
2.11615e-09
3.04136e-08
2.04247e-09
3.00938e-08
1.97147e-09
2.97663e-08
1.90307e-09
2.94332e-08
1.83721e-09
2.90965e-08
1.77383e-09
2.87577e-08
1.71286e-09
2.84183e-08
1.65426e-09
2.80795e-08
1.59795e-09
2.77423e-08
1.54387e-09
2.74076e-08
1.49197e-09
2.70761e-08
1.44216e-09
2.67484e-08
1.39438e-09
2.6425e-08
1.34856e-09
2.61063e-08
1.30463e-09
2.57926e-08
1.2625e-09
2.54841e-08
1.22211e-09
2.51811e-08
1.18339e-09
2.48836e-08
1.14625e-09
2.45918e-08
1.11065e-09
2.43057e-08
1.07649e-09
2.40253e-08
1.04372e-09
2.37506e-08
1.01228e-09
2.34817e-08
9.82089e-10
2.32184e-08
9.53097e-10
2.29607e-08
9.25241e-10
2.27086e-08
8.98465e-10
2.24619e-08
8.72711e-10
2.22207e-08
8.47928e-10
2.19847e-08
8.24064e-10
2.1754e-08
8.0107e-10
2.15284e-08
7.78898e-10
2.13078e-08
7.57506e-10
2.10921e-08
7.36849e-10
2.08813e-08
7.16889e-10
2.06753e-08
6.97588e-10
2.04739e-08
6.78912e-10
2.02772e-08
6.60827e-10
2.00849e-08
6.43306e-10
1.9897e-08
6.26323e-10
1.97134e-08
6.09854e-10
1.95341e-08
5.93882e-10
1.93589e-08
5.78393e-10
1.91878e-08
5.63377e-10
1.90207e-08
5.48831e-10
1.88575e-08
5.3476e-10
1.86982e-08
5.21173e-10
1.85425e-08
5.08095e-10
1.83905e-08
4.95548e-10
1.8242e-08
4.83608e-10
1.80968e-08
4.72243e-10
1.79549e-08
4.61703e-10
1.78161e-08
4.51693e-10
1.76797e-08
4.41249e-10
1.75478e-08
4.35587e-10
1.74111e-08
3.92688e-10
4.41818e-10
3.22601e-08
3.84739e-09
-3.20148e-08
3.25877e-08
4.47448e-09
3.28809e-08
4.63053e-09
3.3087e-08
4.42058e-09
3.32153e-08
4.074e-09
3.32941e-08
3.74148e-09
3.33465e-08
3.46938e-09
3.33859e-08
3.2553e-09
3.34172e-08
3.08602e-09
3.34398e-08
2.94889e-09
3.3451e-08
2.83419e-09
3.34481e-08
2.73541e-09
3.34287e-08
2.64838e-09
3.3391e-08
2.57016e-09
3.3334e-08
2.49855e-09
3.32571e-08
2.43188e-09
3.31603e-08
2.36891e-09
3.30442e-08
2.30876e-09
3.29095e-08
2.2508e-09
3.27574e-08
2.19459e-09
3.2589e-08
2.13983e-09
3.24058e-08
2.08632e-09
3.22091e-08
2.03394e-09
3.20003e-08
1.98262e-09
3.17808e-08
1.93232e-09
3.15521e-08
1.88302e-09
3.13153e-08
1.83473e-09
3.10717e-08
1.78747e-09
3.08224e-08
1.74124e-09
3.05685e-08
1.69605e-09
3.0311e-08
1.65194e-09
3.00506e-08
1.60889e-09
2.97883e-08
1.56694e-09
2.95247e-08
1.52607e-09
2.92606e-08
1.48629e-09
2.89963e-08
1.4476e-09
2.87326e-08
1.40999e-09
2.84698e-08
1.37344e-09
2.82084e-08
1.33795e-09
2.79486e-08
1.30348e-09
2.76909e-08
1.27003e-09
2.74354e-08
1.23756e-09
2.71824e-08
1.20606e-09
2.69322e-08
1.17548e-09
2.66848e-08
1.14582e-09
2.64405e-08
1.11703e-09
2.61994e-08
1.08908e-09
2.59615e-08
1.06195e-09
2.57269e-08
1.0356e-09
2.54958e-08
1.01e-09
2.52682e-08
9.85112e-10
2.50442e-08
9.60917e-10
2.48237e-08
9.37381e-10
2.46068e-08
9.14474e-10
2.43935e-08
8.92171e-10
2.41839e-08
8.70444e-10
2.3978e-08
8.49272e-10
2.37756e-08
8.28634e-10
2.3577e-08
8.08511e-10
2.3382e-08
7.88892e-10
2.31906e-08
7.69766e-10
2.30029e-08
7.51129e-10
2.28187e-08
7.32984e-10
2.26381e-08
7.15341e-10
2.24611e-08
6.98218e-10
2.22875e-08
6.81648e-10
2.21174e-08
6.65665e-10
2.19506e-08
6.50361e-10
2.17872e-08
6.35713e-10
2.16268e-08
6.22034e-10
2.14697e-08
6.08854e-10
2.13147e-08
5.96199e-10
2.11645e-08
5.85833e-10
2.10056e-08
5.51611e-10
5.81287e-10
3.32672e-08
3.63481e-09
-3.30546e-08
3.35564e-08
4.18532e-09
3.38248e-08
4.36213e-09
3.40201e-08
4.22524e-09
3.4143e-08
3.95114e-09
3.42151e-08
3.66942e-09
3.42574e-08
3.427e-09
3.42849e-08
3.22788e-09
3.43057e-08
3.06521e-09
3.43235e-08
2.93108e-09
3.43392e-08
2.81851e-09
3.43523e-08
2.72228e-09
3.43619e-08
2.6388e-09
3.43666e-08
2.56545e-09
3.4365e-08
2.50013e-09
3.43558e-08
2.44112e-09
3.43376e-08
2.38707e-09
3.43095e-08
2.3369e-09
3.42705e-08
2.28974e-09
3.42202e-08
2.24493e-09
3.41581e-08
2.20194e-09
3.4084e-08
2.16036e-09
3.39981e-08
2.11988e-09
3.39005e-08
2.08026e-09
3.37914e-08
2.04134e-09
3.36715e-08
2.003e-09
3.35411e-08
1.96514e-09
3.34008e-08
1.92771e-09
3.32514e-08
1.89069e-09
3.30933e-08
1.85407e-09
3.29275e-08
1.81783e-09
3.27544e-08
1.78199e-09
3.25747e-08
1.74657e-09
3.23892e-08
1.71159e-09
3.21984e-08
1.67705e-09
3.20031e-08
1.64299e-09
3.18036e-08
1.60943e-09
3.16007e-08
1.57637e-09
3.13948e-08
1.54385e-09
3.11864e-08
1.51186e-09
3.0976e-08
1.48042e-09
3.0764e-08
1.44954e-09
3.05509e-08
1.41923e-09
3.03369e-08
1.38947e-09
3.01224e-08
1.36028e-09
2.99078e-08
1.33165e-09
2.96933e-08
1.30357e-09
2.94792e-08
1.27604e-09
2.92657e-08
1.24904e-09
2.90532e-08
1.22256e-09
2.88417e-08
1.1966e-09
2.86315e-08
1.17113e-09
2.84227e-08
1.14615e-09
2.82155e-08
1.12164e-09
2.80101e-08
1.09759e-09
2.78066e-08
1.07398e-09
2.76051e-08
1.0508e-09
2.74056e-08
1.02804e-09
2.72085e-08
1.0057e-09
2.70136e-08
9.83778e-10
2.68211e-08
9.62263e-10
2.6631e-08
9.41166e-10
2.64435e-08
9.20498e-10
2.62586e-08
9.00282e-10
2.60763e-08
8.80545e-10
2.58966e-08
8.61334e-10
2.57195e-08
8.42697e-10
2.55452e-08
8.24743e-10
2.53734e-08
8.07465e-10
2.52042e-08
7.91241e-10
2.50376e-08
7.75438e-10
2.48726e-08
7.61196e-10
2.47119e-08
7.46555e-10
2.45397e-08
7.23779e-10
7.31076e-10
3.43006e-08
3.44915e-09
-3.41149e-08
3.45545e-08
3.93135e-09
3.47986e-08
4.11805e-09
3.49849e-08
4.0389e-09
3.51088e-08
3.82726e-09
3.51855e-08
3.59273e-09
3.52315e-08
3.38097e-09
3.52593e-08
3.20013e-09
3.52769e-08
3.04762e-09
3.5289e-08
2.91898e-09
3.52981e-08
2.80943e-09
3.53054e-08
2.71491e-09
3.53117e-08
2.63249e-09
3.53172e-08
2.56e-09
3.53216e-08
2.49569e-09
3.53246e-08
2.43812e-09
3.53256e-08
2.38611e-09
3.53238e-08
2.33867e-09
3.53186e-08
2.295e-09
3.53091e-08
2.25443e-09
3.52946e-08
2.21641e-09
3.52745e-08
2.18045e-09
3.52482e-08
2.14618e-09
3.52152e-08
2.11328e-09
3.51751e-08
2.08147e-09
3.51275e-08
2.05053e-09
3.50724e-08
2.02029e-09
3.50095e-08
1.99061e-09
3.49388e-08
1.96137e-09
3.48604e-08
1.93248e-09
3.47743e-08
1.90387e-09
3.46808e-08
1.8755e-09
3.45801e-08
1.84734e-09
3.44723e-08
1.81935e-09
3.43578e-08
1.79153e-09
3.42369e-08
1.76387e-09
3.411e-08
1.73637e-09
3.39773e-08
1.70904e-09
3.38393e-08
1.68187e-09
3.36963e-08
1.65488e-09
3.35486e-08
1.62808e-09
3.33967e-08
1.60147e-09
3.32409e-08
1.57507e-09
3.30815e-08
1.54889e-09
3.29188e-08
1.52292e-09
3.27533e-08
1.49719e-09
3.25852e-08
1.47168e-09
3.24148e-08
1.44641e-09
3.22425e-08
1.42138e-09
3.20684e-08
1.39659e-09
3.1893e-08
1.37204e-09
3.17164e-08
1.34773e-09
3.15389e-08
1.32366e-09
3.13607e-08
1.29981e-09
3.11821e-08
1.27621e-09
3.10032e-08
1.25283e-09
3.08244e-08
1.22968e-09
3.06456e-08
1.20677e-09
3.04672e-08
1.18409e-09
3.02894e-08
1.16166e-09
3.01122e-08
1.13948e-09
2.99358e-08
1.11756e-09
2.97603e-08
1.09594e-09
2.95859e-08
1.07465e-09
2.94128e-08
1.05372e-09
2.92409e-08
1.03322e-09
2.90704e-08
1.01321e-09
2.89013e-08
9.93821e-10
2.87337e-08
9.75058e-10
2.85676e-08
9.57368e-10
2.8403e-08
9.39974e-10
2.82391e-08
9.25163e-10
2.80783e-08
9.07339e-10
2.79047e-08
8.97331e-10
8.8272e-10
3.53609e-08
3.28543e-09
-3.51971e-08
3.55842e-08
3.70803e-09
3.58051e-08
3.89716e-09
3.5981e-08
3.863e-09
3.61041e-08
3.70415e-09
3.61851e-08
3.51177e-09
3.62369e-08
3.32911e-09
3.62698e-08
3.16721e-09
3.62908e-08
3.02662e-09
3.63044e-08
2.90546e-09
3.6313e-08
2.80078e-09
3.63184e-08
2.70949e-09
3.63217e-08
2.62918e-09
3.63237e-08
2.558e-09
3.63249e-08
2.4945e-09
3.63256e-08
2.43745e-09
3.63259e-08
2.38584e-09
3.63257e-08
2.33883e-09
3.6325e-08
2.29573e-09
3.63234e-08
2.25599e-09
3.63207e-08
2.21909e-09
3.63165e-08
2.18465e-09
3.63104e-08
2.15229e-09
3.6302e-08
2.12173e-09
3.62908e-08
2.09268e-09
3.62764e-08
2.06493e-09
3.62584e-08
2.03827e-09
3.62365e-08
2.01253e-09
3.62102e-08
1.98757e-09
3.61795e-08
1.96325e-09
3.61439e-08
1.93946e-09
3.61033e-08
1.9161e-09
3.60575e-08
1.89311e-09
3.60065e-08
1.87041e-09
3.595e-08
1.84795e-09
3.58882e-08
1.82568e-09
3.5821e-08
1.80357e-09
3.57485e-08
1.78158e-09
3.56707e-08
1.75969e-09
3.55877e-08
1.73788e-09
3.54996e-08
1.71614e-09
3.54066e-08
1.69445e-09
3.53089e-08
1.6728e-09
3.52066e-08
1.6512e-09
3.50999e-08
1.62963e-09
3.4989e-08
1.60809e-09
3.48741e-08
1.58657e-09
3.47554e-08
1.56508e-09
3.46332e-08
1.54361e-09
3.45076e-08
1.52216e-09
3.4379e-08
1.50073e-09
3.42474e-08
1.47932e-09
3.41131e-08
1.45792e-09
3.39764e-08
1.43655e-09
3.38374e-08
1.41519e-09
3.36964e-08
1.39385e-09
3.35535e-08
1.37253e-09
3.3409e-08
1.35124e-09
3.32631e-08
1.32999e-09
3.3116e-08
1.30879e-09
3.29678e-08
1.28766e-09
3.28188e-08
1.26662e-09
3.2669e-08
1.2457e-09
3.25187e-08
1.22495e-09
3.2368e-08
1.20441e-09
3.22171e-08
1.18415e-09
3.2066e-08
1.16426e-09
3.1915e-08
1.14487e-09
3.1764e-08
1.12602e-09
3.16132e-08
1.10821e-09
3.14626e-08
1.09054e-09
3.13114e-08
1.07637e-09
3.11618e-08
1.05695e-09
3.09998e-08
1.05935e-09
1.02662e-09
3.64488e-08
3.13974e-09
-3.63031e-08
3.66458e-08
3.51103e-09
3.68455e-08
3.69752e-09
3.70106e-08
3.69788e-09
3.71313e-08
3.5834e-09
3.72147e-08
3.4284e-09
3.7271e-08
3.27283e-09
3.73086e-08
3.12955e-09
3.73338e-08
3.00144e-09
3.73506e-08
2.88862e-09
3.73617e-08
2.78969e-09
3.73687e-08
2.70253e-09
3.73727e-08
2.62519e-09
3.73745e-08
2.55617e-09
3.73748e-08
2.4942e-09
3.73741e-08
2.43822e-09
3.73726e-08
2.38733e-09
3.73706e-08
2.3408e-09
3.73683e-08
2.29802e-09
3.73658e-08
2.25849e-09
3.73631e-08
2.22178e-09
3.73602e-08
2.18755e-09
3.7357e-08
2.15549e-09
3.73534e-08
2.12534e-09
3.73492e-08
2.09688e-09
3.73442e-08
2.06992e-09
3.73382e-08
2.04427e-09
3.7331e-08
2.01978e-09
3.73222e-08
1.99632e-09
3.73117e-08
1.97377e-09
3.72991e-08
1.952e-09
3.72843e-08
1.93094e-09
3.72669e-08
1.91048e-09
3.72468e-08
1.89054e-09
3.72237e-08
1.87106e-09
3.71974e-08
1.85197e-09
3.71678e-08
1.8332e-09
3.71347e-08
1.81471e-09
3.70979e-08
1.79646e-09
3.70574e-08
1.77838e-09
3.70131e-08
1.76046e-09
3.69649e-08
1.74266e-09
3.69127e-08
1.72494e-09
3.68566e-08
1.70727e-09
3.67966e-08
1.68964e-09
3.67327e-08
1.67202e-09
3.66649e-08
1.65439e-09
3.65932e-08
1.63672e-09
3.65178e-08
1.61901e-09
3.64387e-08
1.60125e-09
3.63561e-08
1.5834e-09
3.62699e-08
1.56547e-09
3.61804e-08
1.54745e-09
3.60876e-08
1.52932e-09
3.59917e-08
1.51108e-09
3.58929e-08
1.49273e-09
3.57911e-08
1.47426e-09
3.56867e-08
1.45567e-09
3.55797e-08
1.43698e-09
3.54703e-08
1.41819e-09
3.53587e-08
1.39932e-09
3.52449e-08
1.38039e-09
3.51292e-08
1.36144e-09
3.50116e-08
1.3425e-09
3.48924e-08
1.32364e-09
3.47716e-08
1.30493e-09
3.46494e-08
1.28646e-09
3.45259e-08
1.26837e-09
3.44012e-08
1.25072e-09
3.42753e-08
1.23406e-09
3.41485e-08
1.21741e-09
3.40199e-08
1.20497e-09
3.38911e-08
1.18573e-09
3.37519e-08
1.19852e-09
1.15394e-09
3.75653e-08
3.00906e-09
-3.74346e-08
3.77398e-08
3.33655e-09
3.79201e-08
3.51715e-09
3.80745e-08
3.54349e-09
3.8192e-08
3.46592e-09
3.82765e-08
3.3439e-09
3.8336e-08
3.21336e-09
3.83774e-08
3.08812e-09
3.84061e-08
2.9727e-09
3.84261e-08
2.86871e-09
3.84397e-08
2.77602e-09
3.84489e-08
2.69342e-09
3.84546e-08
2.61949e-09
3.84577e-08
2.55303e-09
3.84589e-08
2.49301e-09
3.84586e-08
2.43852e-09
3.84571e-08
2.38876e-09
3.84549e-08
2.34308e-09
3.8452e-08
2.30092e-09
3.84486e-08
2.26183e-09
3.8445e-08
2.22543e-09
3.84411e-08
2.19139e-09
3.84372e-08
2.15945e-09
3.84331e-08
2.12938e-09
3.8429e-08
2.10097e-09
3.84249e-08
2.07407e-09
3.84206e-08
2.04852e-09
3.84162e-08
2.0242e-09
3.84115e-08
2.001e-09
3.84065e-08
1.9788e-09
3.8401e-08
1.95753e-09
3.83948e-08
1.93709e-09
3.83879e-08
1.91741e-09
3.838e-08
1.89841e-09
3.83711e-08
1.88004e-09
3.83608e-08
1.86223e-09
3.83491e-08
1.84492e-09
3.83357e-08
1.82806e-09
3.83206e-08
1.81159e-09
3.83035e-08
1.79548e-09
3.82843e-08
1.77966e-09
3.82628e-08
1.76411e-09
3.8239e-08
1.74877e-09
3.82127e-08
1.73361e-09
3.81837e-08
1.71859e-09
3.81521e-08
1.70368e-09
3.81176e-08
1.68884e-09
3.80803e-08
1.67404e-09
3.80401e-08
1.65925e-09
3.79969e-08
1.64444e-09
3.79507e-08
1.62959e-09
3.79015e-08
1.61467e-09
3.78493e-08
1.59965e-09
3.77941e-08
1.58453e-09
3.77359e-08
1.56928e-09
3.76747e-08
1.55388e-09
3.76106e-08
1.53834e-09
3.75437e-08
1.52263e-09
3.74739e-08
1.50675e-09
3.74014e-08
1.49072e-09
3.73262e-08
1.47454e-09
3.72483e-08
1.45823e-09
3.7168e-08
1.44181e-09
3.70851e-08
1.42533e-09
3.69999e-08
1.40884e-09
3.69125e-08
1.39241e-09
3.68228e-08
1.37614e-09
3.6731e-08
1.36019e-09
3.66371e-08
1.34459e-09
3.65412e-08
1.32995e-09
3.64433e-08
1.31527e-09
3.63431e-08
1.30524e-09
3.62411e-08
1.28774e-09
3.61319e-08
1.30771e-09
1.25851e-09
3.87113e-08
2.89102e-09
-3.85933e-08
3.88666e-08
3.18132e-09
3.90295e-08
3.35417e-09
3.91734e-08
3.3996e-09
3.9287e-08
3.3524e-09
3.93716e-08
3.25922e-09
3.94334e-08
3.15161e-09
3.94779e-08
3.04364e-09
3.95097e-08
2.94091e-09
3.95323e-08
2.84606e-09
3.95483e-08
2.76e-09
3.95594e-08
2.68232e-09
3.95668e-08
2.61211e-09
3.95714e-08
2.54848e-09
3.95737e-08
2.49064e-09
3.95744e-08
2.43785e-09
3.95737e-08
2.38943e-09
3.9572e-08
2.3448e-09
3.95695e-08
2.30347e-09
3.95663e-08
2.26503e-09
3.95626e-08
2.22912e-09
3.95585e-08
2.19545e-09
3.95542e-08
2.16377e-09
3.95497e-08
2.13387e-09
3.95451e-08
2.10557e-09
3.95405e-08
2.07871e-09
3.95358e-08
2.05317e-09
3.95312e-08
2.02883e-09
3.95266e-08
2.00558e-09
3.95221e-08
1.98335e-09
3.95175e-08
1.96206e-09
3.9513e-08
1.94164e-09
3.95084e-08
1.92201e-09
3.95036e-08
1.90314e-09
3.94987e-08
1.88496e-09
3.94935e-08
1.86742e-09
3.9488e-08
1.85047e-09
3.9482e-08
1.83407e-09
3.94754e-08
1.81818e-09
3.94681e-08
1.80275e-09
3.946e-08
1.78773e-09
3.94511e-08
1.7731e-09
3.9441e-08
1.75881e-09
3.94298e-08
1.74481e-09
3.94173e-08
1.73108e-09
3.94034e-08
1.71757e-09
3.9388e-08
1.70424e-09
3.9371e-08
1.69107e-09
3.93523e-08
1.67801e-09
3.93317e-08
1.66503e-09
3.93092e-08
1.6521e-09
3.92846e-08
1.63918e-09
3.9258e-08
1.62625e-09
3.92293e-08
1.61328e-09
3.91983e-08
1.60024e-09
3.91651e-08
1.58711e-09
3.91296e-08
1.57386e-09
3.90917e-08
1.5605e-09
3.90515e-08
1.547e-09
3.90088e-08
1.53336e-09
3.89638e-08
1.51958e-09
3.89164e-08
1.50567e-09
3.88665e-08
1.49167e-09
3.88142e-08
1.47759e-09
3.87596e-08
1.46349e-09
3.87026e-08
1.44944e-09
3.86432e-08
1.43554e-09
3.85814e-08
1.42192e-09
3.85173e-08
1.40867e-09
3.84509e-08
1.39636e-09
3.83821e-08
1.38407e-09
3.83108e-08
1.3766e-09
3.82366e-08
1.36189e-09
3.8159e-08
1.38537e-09
1.33807e-09
3.9888e-08
2.78381e-09
-3.97808e-08
4.00267e-08
3.04258e-09
4.01741e-08
3.20677e-09
4.03079e-08
3.26587e-09
4.04169e-08
3.24334e-09
4.0501e-08
3.17514e-09
4.05642e-08
3.08837e-09
4.06112e-08
2.99673e-09
4.06456e-08
2.90647e-09
4.06707e-08
2.82095e-09
4.06889e-08
2.74182e-09
4.07019e-08
2.66935e-09
4.07108e-08
2.60313e-09
4.07167e-08
2.54258e-09
4.07202e-08
2.48713e-09
4.07219e-08
2.43622e-09
4.0722e-08
2.38928e-09
4.0721e-08
2.34583e-09
4.0719e-08
2.30545e-09
4.07163e-08
2.26776e-09
4.0713e-08
2.23245e-09
4.07092e-08
2.19925e-09
4.0705e-08
2.16794e-09
4.07006e-08
2.13831e-09
4.06959e-08
2.11021e-09
4.06911e-08
2.08348e-09
4.06863e-08
2.05801e-09
4.06814e-08
2.0337e-09
4.06766e-08
2.01044e-09
4.06718e-08
1.98816e-09
4.0667e-08
1.9668e-09
4.06624e-08
1.94629e-09
4.06578e-08
1.92657e-09
4.06534e-08
1.9076e-09
4.0649e-08
1.88933e-09
4.06447e-08
1.87172e-09
4.06404e-08
1.85473e-09
4.06362e-08
1.83831e-09
4.06319e-08
1.82245e-09
4.06276e-08
1.80709e-09
4.06231e-08
1.79221e-09
4.06184e-08
1.77777e-09
4.06135e-08
1.76374e-09
4.06082e-08
1.75008e-09
4.06025e-08
1.73676e-09
4.05964e-08
1.72374e-09
4.05896e-08
1.711e-09
4.05822e-08
1.6985e-09
4.0574e-08
1.6862e-09
4.0565e-08
1.67407e-09
4.0555e-08
1.66207e-09
4.0544e-08
1.65019e-09
4.05318e-08
1.63838e-09
4.05185e-08
1.62661e-09
4.05039e-08
1.61486e-09
4.04879e-08
1.6031e-09
4.04704e-08
1.59132e-09
4.04515e-08
1.57948e-09
4.04309e-08
1.56758e-09
4.04086e-08
1.5556e-09
4.03847e-08
1.54355e-09
4.03589e-08
1.53143e-09
4.03313e-08
1.51927e-09
4.03018e-08
1.50708e-09
4.02704e-08
1.49492e-09
4.0237e-08
1.48286e-09
4.02015e-08
1.47098e-09
4.0164e-08
1.45943e-09
4.01244e-08
1.44829e-09
4.00826e-08
1.43813e-09
4.00386e-08
1.42814e-09
3.99923e-08
1.42289e-09
3.99428e-08
1.41139e-09
3.98931e-08
1.43503e-09
1.39418e-09
4.10964e-08
2.686e-09
-4.09986e-08
4.1221e-08
2.91799e-09
4.13545e-08
3.07327e-09
4.14785e-08
3.14183e-09
4.15828e-08
3.13911e-09
4.16655e-08
3.09237e-09
4.17295e-08
3.02435e-09
4.17783e-08
2.94799e-09
4.18149e-08
2.86982e-09
4.18423e-08
2.79364e-09
4.18625e-08
2.72162e-09
4.18772e-08
2.65461e-09
4.18877e-08
2.59262e-09
4.18949e-08
2.53537e-09
4.18995e-08
2.48251e-09
4.19021e-08
2.43364e-09
4.19031e-08
2.38833e-09
4.19027e-08
2.34619e-09
4.19013e-08
2.30684e-09
4.18991e-08
2.26999e-09
4.18962e-08
2.23536e-09
4.18927e-08
2.2027e-09
4.18888e-08
2.17181e-09
4.18846e-08
2.14251e-09
4.18802e-08
2.11466e-09
4.18756e-08
2.08812e-09
4.18708e-08
2.06278e-09
4.18659e-08
2.03854e-09
4.18611e-08
2.01532e-09
4.18562e-08
1.99304e-09
4.18514e-08
1.97164e-09
4.18466e-08
1.95107e-09
4.18419e-08
1.93127e-09
4.18373e-08
1.9122e-09
4.18328e-08
1.89381e-09
4.18284e-08
1.87607e-09
4.18242e-08
1.85895e-09
4.18201e-08
1.84241e-09
4.18161e-08
1.82642e-09
4.18123e-08
1.81095e-09
4.18085e-08
1.79597e-09
4.18048e-08
1.78145e-09
4.18012e-08
1.76737e-09
4.17976e-08
1.75368e-09
4.1794e-08
1.74037e-09
4.17903e-08
1.72741e-09
4.17866e-08
1.71476e-09
4.17827e-08
1.7024e-09
4.17786e-08
1.69029e-09
4.17742e-08
1.67841e-09
4.17696e-08
1.66673e-09
4.17645e-08
1.65522e-09
4.1759e-08
1.64385e-09
4.17531e-08
1.63259e-09
4.17465e-08
1.62142e-09
4.17393e-08
1.61032e-09
4.17313e-08
1.59925e-09
4.17226e-08
1.58821e-09
4.1713e-08
1.57718e-09
4.17025e-08
1.56615e-09
4.16909e-08
1.55513e-09
4.16782e-08
1.5441e-09
4.16644e-08
1.53311e-09
4.16493e-08
1.52216e-09
4.16329e-08
1.51132e-09
4.16151e-08
1.50064e-09
4.15959e-08
1.49022e-09
4.15751e-08
1.48021e-09
4.15527e-08
1.47068e-09
4.15286e-08
1.46219e-09
4.15027e-08
1.45409e-09
4.14751e-08
1.45045e-09
4.14445e-08
1.44202e-09
4.14161e-08
1.46343e-09
1.43114e-09
4.23377e-08
2.59643e-09
-4.22482e-08
4.24501e-08
2.80563e-09
4.25712e-08
2.95215e-09
4.26861e-08
3.02697e-09
4.27852e-08
3.03997e-09
4.28661e-08
3.01146e-09
4.29303e-08
2.96018e-09
4.29803e-08
2.89797e-09
4.30188e-08
2.83137e-09
4.3048e-08
2.7644e-09
4.30701e-08
2.69959e-09
4.30865e-08
2.6382e-09
4.30984e-08
2.58063e-09
4.31069e-08
2.52688e-09
4.31126e-08
2.4768e-09
4.31162e-08
2.43013e-09
4.31179e-08
2.38659e-09
4.31182e-08
2.34586e-09
4.31174e-08
2.30767e-09
4.31157e-08
2.27174e-09
4.31132e-08
2.23785e-09
4.31101e-08
2.20579e-09
4.31065e-08
2.17537e-09
4.31026e-08
2.14645e-09
4.30984e-08
2.11889e-09
4.30939e-08
2.09257e-09
4.30893e-08
2.06738e-09
4.30846e-08
2.04325e-09
4.30798e-08
2.02009e-09
4.3075e-08
1.99784e-09
4.30702e-08
1.97643e-09
4.30655e-08
1.95583e-09
4.30608e-08
1.93597e-09
4.30562e-08
1.91682e-09
4.30516e-08
1.89834e-09
4.30472e-08
1.88049e-09
4.30429e-08
1.86325e-09
4.30387e-08
1.84658e-09
4.30347e-08
1.83045e-09
4.30308e-08
1.81484e-09
4.30271e-08
1.79972e-09
4.30235e-08
1.78506e-09
4.302e-08
1.77084e-09
4.30167e-08
1.75703e-09
4.30134e-08
1.7436e-09
4.30103e-08
1.73053e-09
4.30073e-08
1.7178e-09
4.30043e-08
1.70537e-09
4.30014e-08
1.69322e-09
4.29985e-08
1.68132e-09
4.29955e-08
1.66966e-09
4.29926e-08
1.65819e-09
4.29895e-08
1.64691e-09
4.29863e-08
1.63578e-09
4.2983e-08
1.62478e-09
4.29794e-08
1.61389e-09
4.29756e-08
1.60309e-09
4.29714e-08
1.59237e-09
4.29669e-08
1.58172e-09
4.29619e-08
1.57112e-09
4.29564e-08
1.56059e-09
4.29504e-08
1.55014e-09
4.29437e-08
1.53977e-09
4.29364e-08
1.52952e-09
4.29283e-08
1.51944e-09
4.29193e-08
1.50961e-09
4.29094e-08
1.50011e-09
4.28985e-08
1.49108e-09
4.28866e-08
1.48264e-09
4.28735e-08
1.4753e-09
4.2859e-08
1.46858e-09
4.28435e-08
1.46593e-09
4.28255e-08
1.46006e-09
4.28108e-08
1.47804e-09
1.45431e-09
4.36132e-08
2.51416e-09
-4.35309e-08
4.37149e-08
2.7039e-09
4.3825e-08
2.84203e-09
4.39313e-08
2.92072e-09
4.40252e-08
2.94603e-09
4.41038e-08
2.93287e-09
4.41676e-08
2.89641e-09
4.42184e-08
2.84718e-09
4.42582e-08
2.79153e-09
4.42891e-08
2.73354e-09
4.43127e-08
2.67592e-09
4.43307e-08
2.62026e-09
4.4344e-08
2.56726e-09
4.43538e-08
2.51716e-09
4.43606e-08
2.47e-09
4.4365e-08
2.42569e-09
4.43675e-08
2.38405e-09
4.43685e-08
2.34486e-09
4.43683e-08
2.30791e-09
4.43671e-08
2.27299e-09
4.4365e-08
2.23991e-09
4.43623e-08
2.20851e-09
4.4359e-08
2.17862e-09
4.43554e-08
2.15012e-09
4.43514e-08
2.12288e-09
4.43471e-08
2.09681e-09
4.43427e-08
2.07181e-09
4.43381e-08
2.04781e-09
4.43335e-08
2.02473e-09
4.43288e-08
2.00252e-09
4.43241e-08
1.98113e-09
4.43194e-08
1.9605e-09
4.43148e-08
1.9406e-09
4.43102e-08
1.92139e-09
4.43058e-08
1.90283e-09
4.43014e-08
1.88488e-09
4.42971e-08
1.86753e-09
4.42929e-08
1.85075e-09
4.42889e-08
1.83449e-09
4.4285e-08
1.81875e-09
4.42812e-08
1.80349e-09
4.42775e-08
1.7887e-09
4.42741e-08
1.77433e-09
4.42707e-08
1.76038e-09
4.42675e-08
1.74681e-09
4.42644e-08
1.73361e-09
4.42615e-08
1.72075e-09
4.42586e-08
1.70819e-09
4.42559e-08
1.69593e-09
4.42533e-08
1.68394e-09
4.42508e-08
1.67218e-09
4.42483e-08
1.66065e-09
4.42459e-08
1.64931e-09
4.42435e-08
1.63815e-09
4.42412e-08
1.62714e-09
4.42388e-08
1.61627e-09
4.42364e-08
1.60552e-09
4.42338e-08
1.59489e-09
4.42312e-08
1.58435e-09
4.42284e-08
1.57392e-09
4.42254e-08
1.56359e-09
4.42222e-08
1.55338e-09
4.42186e-08
1.54331e-09
4.42147e-08
1.53341e-09
4.42104e-08
1.52374e-09
4.42057e-08
1.51437e-09
4.42004e-08
1.5054e-09
4.41945e-08
1.49698e-09
4.41879e-08
1.48922e-09
4.41806e-08
1.48259e-09
4.41724e-08
1.47681e-09
4.41636e-08
1.47468e-09
4.41529e-08
1.47076e-09
4.41459e-08
1.4851e-09
1.46862e-09
4.49239e-08
2.43844e-09
-4.48482e-08
4.50163e-08
2.61145e-09
4.51166e-08
2.74171e-09
4.52149e-08
2.8225e-09
4.53036e-08
2.85733e-09
4.53795e-08
2.85698e-09
4.54424e-08
2.8335e-09
4.54935e-08
2.79609e-09
4.55343e-08
2.75071e-09
4.55665e-08
2.70136e-09
4.55916e-08
2.65084e-09
4.56109e-08
2.60093e-09
4.56256e-08
2.55259e-09
4.56364e-08
2.50627e-09
4.56443e-08
2.46217e-09
4.56496e-08
2.42034e-09
4.5653e-08
2.38071e-09
4.56547e-08
2.34316e-09
4.5655e-08
2.30755e-09
4.56543e-08
2.27372e-09
4.56527e-08
2.24154e-09
4.56503e-08
2.21085e-09
4.56474e-08
2.18154e-09
4.5644e-08
2.1535e-09
4.56403e-08
2.12663e-09
4.56362e-08
2.10084e-09
4.5632e-08
2.07606e-09
4.56276e-08
2.05221e-09
4.56231e-08
2.02923e-09
4.56185e-08
2.00708e-09
4.56139e-08
1.98571e-09
4.56093e-08
1.96508e-09
4.56048e-08
1.94515e-09
4.56003e-08
1.92588e-09
4.55959e-08
1.90725e-09
4.55916e-08
1.88922e-09
4.55873e-08
1.87177e-09
4.55832e-08
1.85487e-09
4.55792e-08
1.8385e-09
4.55753e-08
1.82263e-09
4.55715e-08
1.80725e-09
4.55679e-08
1.79232e-09
4.55644e-08
1.77782e-09
4.55611e-08
1.76373e-09
4.55579e-08
1.75003e-09
4.55548e-08
1.73669e-09
4.55518e-08
1.7237e-09
4.5549e-08
1.71102e-09
4.55463e-08
1.69863e-09
4.55437e-08
1.68652e-09
4.55413e-08
1.67466e-09
4.55389e-08
1.66303e-09
4.55366e-08
1.6516e-09
4.55344e-08
1.64036e-09
4.55322e-08
1.62929e-09
4.55301e-08
1.61837e-09
4.55281e-08
1.6076e-09
4.5526e-08
1.59695e-09
4.55239e-08
1.58643e-09
4.55218e-08
1.57604e-09
4.55196e-08
1.56578e-09
4.55173e-08
1.55567e-09
4.55149e-08
1.54574e-09
4.55122e-08
1.53602e-09
4.55094e-08
1.52657e-09
4.55063e-08
1.51747e-09
4.55029e-08
1.50881e-09
4.54991e-08
1.50075e-09
4.54949e-08
1.49343e-09
4.54902e-08
1.48726e-09
4.54849e-08
1.48212e-09
4.54794e-08
1.48021e-09
4.54725e-08
1.47767e-09
4.54688e-08
1.48883e-09
1.47779e-09
4.62711e-08
2.3686e-09
-4.62012e-08
4.63554e-08
2.52719e-09
4.64469e-08
2.65013e-09
4.65377e-08
2.73174e-09
4.66212e-08
2.77382e-09
4.66941e-08
2.78405e-09
4.67558e-08
2.77188e-09
4.68067e-08
2.74512e-09
4.68482e-08
2.70927e-09
4.68814e-08
2.66816e-09
4.69076e-08
2.62457e-09
4.69282e-08
2.58038e-09
4.6944e-08
2.53674e-09
4.6956e-08
2.49428e-09
4.69648e-08
2.45335e-09
4.69711e-08
2.4141e-09
4.69752e-08
2.3766e-09
4.69776e-08
2.34079e-09
4.69785e-08
2.3066e-09
4.69783e-08
2.27394e-09
4.69771e-08
2.24271e-09
4.69752e-08
2.2128e-09
4.69726e-08
2.18413e-09
4.69695e-08
2.1566e-09
4.6966e-08
2.13013e-09
4.69622e-08
2.10465e-09
4.69581e-08
2.0801e-09
4.69539e-08
2.05643e-09
4.69496e-08
2.03358e-09
4.69451e-08
2.01151e-09
4.69407e-08
1.99018e-09
4.69362e-08
1.96955e-09
4.69317e-08
1.9496e-09
4.69273e-08
1.93029e-09
4.6923e-08
1.91159e-09
4.69187e-08
1.89348e-09
4.69146e-08
1.87594e-09
4.69105e-08
1.85894e-09
4.69065e-08
1.84245e-09
4.69027e-08
1.82647e-09
4.6899e-08
1.81096e-09
4.68954e-08
1.7959e-09
4.6892e-08
1.78127e-09
4.68886e-08
1.76705e-09
4.68855e-08
1.75322e-09
4.68824e-08
1.73975e-09
4.68795e-08
1.72663e-09
4.68767e-08
1.71383e-09
4.6874e-08
1.70132e-09
4.68714e-08
1.6891e-09
4.68689e-08
1.67713e-09
4.68666e-08
1.66539e-09
4.68643e-08
1.65387e-09
4.68621e-08
1.64255e-09
4.686e-08
1.6314e-09
4.68579e-08
1.62043e-09
4.68559e-08
1.6096e-09
4.68539e-08
1.59893e-09
4.6852e-08
1.5884e-09
4.685e-08
1.57801e-09
4.6848e-08
1.56778e-09
4.6846e-08
1.55772e-09
4.68439e-08
1.54787e-09
4.68416e-08
1.53826e-09
4.68392e-08
1.52895e-09
4.68367e-08
1.52002e-09
4.68339e-08
1.51158e-09
4.68309e-08
1.50378e-09
4.68275e-08
1.49677e-09
4.68239e-08
1.49093e-09
4.68198e-08
1.48625e-09
4.68155e-08
1.48443e-09
4.68104e-08
1.48282e-09
4.68077e-08
1.49151e-09
1.4842e-09
4.7656e-08
2.3041e-09
-4.75915e-08
4.7733e-08
2.45018e-09
4.78168e-08
2.56638e-09
4.79006e-08
2.64788e-09
4.7979e-08
2.69539e-09
4.80488e-08
2.7143e-09
4.81088e-08
2.71187e-09
4.81593e-08
2.69465e-09
4.8201e-08
2.66758e-09
4.82349e-08
2.63425e-09
4.82621e-08
2.59734e-09
4.82837e-08
2.55878e-09
4.83006e-08
2.51984e-09
4.83136e-08
2.48129e-09
4.83233e-08
2.4436e-09
4.83304e-08
2.40703e-09
4.83353e-08
2.37173e-09
4.83383e-08
2.33775e-09
4.83398e-08
2.30507e-09
4.83401e-08
2.27365e-09
4.83394e-08
2.24344e-09
4.83379e-08
2.21436e-09
4.83356e-08
2.18637e-09
4.83328e-08
2.15938e-09
4.83296e-08
2.13335e-09
4.8326e-08
2.10822e-09
4.83222e-08
2.08394e-09
4.83182e-08
2.06047e-09
4.8314e-08
2.03776e-09
4.83097e-08
2.01579e-09
4.83054e-08
1.99451e-09
4.8301e-08
1.97391e-09
4.82967e-08
1.95394e-09
4.82924e-08
1.9346e-09
4.82881e-08
1.91584e-09
4.82839e-08
1.89766e-09
4.82798e-08
1.88003e-09
4.82758e-08
1.86293e-09
4.82719e-08
1.84634e-09
4.82682e-08
1.83024e-09
4.82645e-08
1.81461e-09
4.8261e-08
1.79943e-09
4.82576e-08
1.78467e-09
4.82543e-08
1.77033e-09
4.82512e-08
1.75637e-09
4.82481e-08
1.74278e-09
4.82452e-08
1.72953e-09
4.82425e-08
1.7166e-09
4.82398e-08
1.70398e-09
4.82373e-08
1.69165e-09
4.82348e-08
1.67957e-09
4.82325e-08
1.66773e-09
4.82302e-08
1.65612e-09
4.82281e-08
1.64472e-09
4.8226e-08
1.6335e-09
4.82239e-08
1.62246e-09
4.82219e-08
1.61159e-09
4.822e-08
1.60088e-09
4.8218e-08
1.59033e-09
4.82161e-08
1.57994e-09
4.82142e-08
1.56973e-09
4.82122e-08
1.55971e-09
4.82101e-08
1.54992e-09
4.8208e-08
1.5404e-09
4.82057e-08
1.53121e-09
4.82033e-08
1.52243e-09
4.82007e-08
1.51417e-09
4.81979e-08
1.50659e-09
4.81948e-08
1.49983e-09
4.81915e-08
1.49425e-09
4.81878e-08
1.48993e-09
4.81841e-08
1.48817e-09
4.81797e-08
1.48718e-09
4.81771e-08
1.49412e-09
1.48919e-09
4.90799e-08
2.24446e-09
-4.90202e-08
4.91504e-08
2.37966e-09
4.92271e-08
2.48967e-09
4.93046e-08
2.57042e-09
4.9378e-08
2.62192e-09
4.94445e-08
2.64786e-09
4.95026e-08
2.65377e-09
4.95522e-08
2.64503e-09
4.95938e-08
2.62597e-09
4.96281e-08
2.59991e-09
4.96561e-08
2.56939e-09
4.96785e-08
2.53633e-09
4.96963e-08
2.50204e-09
4.97102e-08
2.46741e-09
4.97208e-08
2.43299e-09
4.97287e-08
2.39917e-09
4.97343e-08
2.36615e-09
4.9738e-08
2.33406e-09
4.97401e-08
2.30296e-09
4.97409e-08
2.27284e-09
4.97406e-08
2.24371e-09
4.97395e-08
2.21552e-09
4.97376e-08
2.18825e-09
4.97351e-08
2.16185e-09
4.97322e-08
2.1363e-09
4.97288e-08
2.11155e-09
4.97252e-08
2.08756e-09
4.97214e-08
2.06431e-09
4.97174e-08
2.04177e-09
4.97132e-08
2.01991e-09
4.97091e-08
1.9987e-09
4.97048e-08
1.97813e-09
4.97006e-08
1.95816e-09
4.96964e-08
1.93879e-09
4.96923e-08
1.91999e-09
4.96882e-08
1.90175e-09
4.96842e-08
1.88404e-09
4.96803e-08
1.86685e-09
4.96764e-08
1.85015e-09
4.96727e-08
1.83394e-09
4.96692e-08
1.8182e-09
4.96657e-08
1.80289e-09
4.96623e-08
1.78802e-09
4.96591e-08
1.77355e-09
4.9656e-08
1.75946e-09
4.96531e-08
1.74575e-09
4.96502e-08
1.73238e-09
4.96475e-08
1.71934e-09
4.96449e-08
1.7066e-09
4.96424e-08
1.69415e-09
4.96399e-08
1.68197e-09
4.96376e-08
1.67004e-09
4.96354e-08
1.65834e-09
4.96333e-08
1.64686e-09
4.96312e-08
1.63557e-09
4.96292e-08
1.62447e-09
4.96272e-08
1.61356e-09
4.96253e-08
1.60281e-09
4.96234e-08
1.59224e-09
4.96215e-08
1.58186e-09
4.96195e-08
1.57166e-09
4.96176e-08
1.56168e-09
4.96156e-08
1.55195e-09
4.96134e-08
1.54251e-09
4.96112e-08
1.53343e-09
4.96089e-08
1.52479e-09
4.96063e-08
1.51671e-09
4.96036e-08
1.50932e-09
4.96006e-08
1.50279e-09
4.95974e-08
1.49745e-09
4.95939e-08
1.49343e-09
4.95904e-08
1.49174e-09
4.95864e-08
1.49116e-09
4.95836e-08
1.49693e-09
1.49343e-09
5.05439e-08
2.18929e-09
-5.04887e-08
5.06086e-08
2.31497e-09
5.06789e-08
2.41932e-09
5.07505e-08
2.49887e-09
5.08192e-08
2.55322e-09
5.08822e-08
2.58482e-09
5.09382e-08
2.59781e-09
5.09867e-08
2.59654e-09
5.10279e-08
2.58475e-09
5.10624e-08
2.56544e-09
5.10908e-08
2.54098e-09
5.11139e-08
2.51321e-09
5.11325e-08
2.48348e-09
5.11471e-08
2.45274e-09
5.11585e-08
2.42163e-09
5.11671e-08
2.39058e-09
5.11733e-08
2.3599e-09
5.11776e-08
2.32977e-09
5.11803e-08
2.30029e-09
5.11816e-08
2.27154e-09
5.11818e-08
2.24353e-09
5.1181e-08
2.21628e-09
5.11795e-08
2.18977e-09
5.11773e-08
2.164e-09
5.11747e-08
2.13896e-09
5.11716e-08
2.11461e-09
5.11682e-08
2.09095e-09
5.11646e-08
2.06794e-09
5.11608e-08
2.04558e-09
5.11568e-08
2.02385e-09
5.11528e-08
2.00273e-09
5.11487e-08
1.9822e-09
5.11447e-08
1.96225e-09
5.11406e-08
1.94287e-09
5.11365e-08
1.92403e-09
5.11326e-08
1.90573e-09
5.11287e-08
1.88795e-09
5.11248e-08
1.87067e-09
5.11211e-08
1.85388e-09
5.11175e-08
1.83756e-09
5.1114e-08
1.82171e-09
5.11106e-08
1.80629e-09
5.11073e-08
1.79129e-09
5.11042e-08
1.7767e-09
5.11011e-08
1.7625e-09
5.10982e-08
1.74866e-09
5.10954e-08
1.73517e-09
5.10928e-08
1.72202e-09
5.10902e-08
1.70917e-09
5.10877e-08
1.69661e-09
5.10854e-08
1.68433e-09
5.10831e-08
1.67231e-09
5.10809e-08
1.66052e-09
5.10788e-08
1.64896e-09
5.10768e-08
1.6376e-09
5.10748e-08
1.62645e-09
5.10729e-08
1.61549e-09
5.1071e-08
1.60471e-09
5.10691e-08
1.59413e-09
5.10672e-08
1.58374e-09
5.10653e-08
1.57356e-09
5.10634e-08
1.56362e-09
5.10614e-08
1.55395e-09
5.10593e-08
1.54459e-09
5.10571e-08
1.53562e-09
5.10548e-08
1.52712e-09
5.10523e-08
1.5192e-09
5.10496e-08
1.512e-09
5.10467e-08
1.50569e-09
5.10436e-08
1.50058e-09
5.10402e-08
1.49681e-09
5.10367e-08
1.49521e-09
5.1033e-08
1.49489e-09
5.103e-08
1.49991e-09
1.49724e-09
5.20494e-08
2.13824e-09
-5.19984e-08
5.21088e-08
2.25557e-09
5.21734e-08
2.35474e-09
5.22394e-08
2.43282e-09
5.23035e-08
2.48913e-09
5.23631e-08
2.52523e-09
5.24167e-08
2.54418e-09
5.24638e-08
2.54944e-09
5.25044e-08
2.5442e-09
5.25387e-08
2.5311e-09
5.25674e-08
2.51233e-09
5.25909e-08
2.48963e-09
5.26101e-08
2.46434e-09
5.26254e-08
2.43742e-09
5.26374e-08
2.40959e-09
5.26467e-08
2.38134e-09
5.26535e-08
2.35303e-09
5.26584e-08
2.32489e-09
5.26616e-08
2.2971e-09
5.26634e-08
2.26975e-09
5.2664e-08
2.24291e-09
5.26637e-08
2.21663e-09
5.26625e-08
2.19094e-09
5.26607e-08
2.16583e-09
5.26583e-08
2.14132e-09
5.26555e-08
2.11741e-09
5.26524e-08
2.09409e-09
5.2649e-08
2.07135e-09
5.26454e-08
2.04919e-09
5.26416e-08
2.02761e-09
5.26377e-08
2.00658e-09
5.26338e-08
1.98612e-09
5.26299e-08
1.96619e-09
5.2626e-08
1.9468e-09
5.2622e-08
1.92794e-09
5.26182e-08
1.90959e-09
5.26144e-08
1.89174e-09
5.26107e-08
1.87438e-09
5.26071e-08
1.8575e-09
5.26035e-08
1.84109e-09
5.26001e-08
1.82512e-09
5.25968e-08
1.80959e-09
5.25936e-08
1.79448e-09
5.25905e-08
1.77978e-09
5.25876e-08
1.76546e-09
5.25847e-08
1.7515e-09
5.2582e-08
1.7379e-09
5.25794e-08
1.72463e-09
5.25769e-08
1.71168e-09
5.25745e-08
1.69902e-09
5.25722e-08
1.68664e-09
5.257e-08
1.67452e-09
5.25678e-08
1.66265e-09
5.25658e-08
1.65101e-09
5.25638e-08
1.63959e-09
5.25619e-08
1.62838e-09
5.256e-08
1.61737e-09
5.25581e-08
1.60657e-09
5.25563e-08
1.59597e-09
5.25544e-08
1.58558e-09
5.25526e-08
1.57542e-09
5.25507e-08
1.56552e-09
5.25487e-08
1.55591e-09
5.25467e-08
1.54664e-09
5.25445e-08
1.53777e-09
5.25423e-08
1.5294e-09
5.25398e-08
1.52164e-09
5.25372e-08
1.51462e-09
5.25344e-08
1.50853e-09
5.25313e-08
1.50362e-09
5.2528e-08
1.50008e-09
5.25247e-08
1.49858e-09
5.25211e-08
1.49844e-09
5.2518e-08
1.50301e-09
1.50079e-09
5.35976e-08
2.091e-09
-5.35504e-08
5.36522e-08
2.201e-09
5.37115e-08
2.29546e-09
5.37724e-08
2.37188e-09
5.38321e-08
2.42946e-09
5.38882e-08
2.4691e-09
5.39394e-08
2.49303e-09
5.39849e-08
2.50397e-09
5.40245e-08
2.50457e-09
5.40584e-08
2.49716e-09
5.40871e-08
2.48369e-09
5.41109e-08
2.4658e-09
5.41305e-08
2.44477e-09
5.41463e-08
2.4216e-09
5.41589e-08
2.39701e-09
5.41687e-08
2.37154e-09
5.41761e-08
2.34561e-09
5.41815e-08
2.31949e-09
5.41852e-08
2.29341e-09
5.41875e-08
2.2675e-09
5.41885e-08
2.24187e-09
5.41885e-08
2.2166e-09
5.41877e-08
2.19174e-09
5.41862e-08
2.16733e-09
5.41841e-08
2.14339e-09
5.41816e-08
2.11993e-09
5.41787e-08
2.09697e-09
5.41756e-08
2.07452e-09
5.41722e-08
2.05259e-09
5.41686e-08
2.03116e-09
5.41649e-08
2.01025e-09
5.41612e-08
1.98985e-09
5.41574e-08
1.96997e-09
5.41537e-08
1.95058e-09
5.41499e-08
1.9317e-09
5.41462e-08
1.91331e-09
5.41425e-08
1.8954e-09
5.41389e-08
1.87797e-09
5.41354e-08
1.86101e-09
5.4132e-08
1.8445e-09
5.41287e-08
1.82844e-09
5.41255e-08
1.8128e-09
5.41224e-08
1.79758e-09
5.41194e-08
1.78276e-09
5.41165e-08
1.76833e-09
5.41137e-08
1.75426e-09
5.41111e-08
1.74055e-09
5.41086e-08
1.72717e-09
5.41061e-08
1.71411e-09
5.41038e-08
1.70135e-09
5.41015e-08
1.68888e-09
5.40994e-08
1.67667e-09
5.40973e-08
1.66472e-09
5.40953e-08
1.653e-09
5.40934e-08
1.64152e-09
5.40915e-08
1.63026e-09
5.40897e-08
1.61921e-09
5.40879e-08
1.60838e-09
5.40861e-08
1.59776e-09
5.40843e-08
1.58738e-09
5.40825e-08
1.57724e-09
5.40806e-08
1.56737e-09
5.40787e-08
1.55782e-09
5.40767e-08
1.54863e-09
5.40746e-08
1.53987e-09
5.40724e-08
1.53163e-09
5.407e-08
1.52402e-09
5.40674e-08
1.51718e-09
5.40647e-08
1.51128e-09
5.40617e-08
1.50657e-09
5.40586e-08
1.50324e-09
5.40553e-08
1.50184e-09
5.40519e-08
1.50183e-09
5.40488e-08
1.50613e-09
1.50415e-09
5.519e-08
2.04734e-09
-5.51463e-08
5.52401e-08
2.15086e-09
5.52945e-08
2.24104e-09
5.53507e-08
2.31573e-09
5.54061e-08
2.37404e-09
5.54588e-08
2.41645e-09
5.55073e-08
2.44451e-09
5.55509e-08
2.46033e-09
5.55894e-08
2.46611e-09
5.56227e-08
2.46384e-09
5.56511e-08
2.45527e-09
5.5675e-08
2.44191e-09
5.56948e-08
2.42496e-09
5.5711e-08
2.4054e-09
5.5724e-08
2.38398e-09
5.57343e-08
2.36127e-09
5.57422e-08
2.33771e-09
5.57481e-08
2.31362e-09
5.57522e-08
2.28926e-09
5.57549e-08
2.26482e-09
5.57563e-08
2.24043e-09
5.57567e-08
2.2162e-09
5.57563e-08
2.1922e-09
5.57551e-08
2.1685e-09
5.57534e-08
2.14515e-09
5.57511e-08
2.12217e-09
5.57485e-08
2.0996e-09
5.57456e-08
2.07746e-09
5.57424e-08
2.05575e-09
5.5739e-08
2.03451e-09
5.57356e-08
2.01372e-09
5.5732e-08
1.99341e-09
5.57284e-08
1.97356e-09
5.57248e-08
1.9542e-09
5.57212e-08
1.9353e-09
5.57176e-08
1.91688e-09
5.57141e-08
1.89892e-09
5.57107e-08
1.88143e-09
5.57073e-08
1.86439e-09
5.5704e-08
1.84779e-09
5.57008e-08
1.83163e-09
5.56977e-08
1.8159e-09
5.56947e-08
1.80057e-09
5.56918e-08
1.78565e-09
5.5689e-08
1.77111e-09
5.56864e-08
1.75693e-09
5.56838e-08
1.74311e-09
5.56814e-08
1.72963e-09
5.5679e-08
1.71647e-09
5.56768e-08
1.70361e-09
5.56746e-08
1.69104e-09
5.56725e-08
1.67875e-09
5.56705e-08
1.66672e-09
5.56686e-08
1.65493e-09
5.56667e-08
1.64339e-09
5.56649e-08
1.63207e-09
5.56631e-08
1.62099e-09
5.56614e-08
1.61013e-09
5.56596e-08
1.5995e-09
5.56579e-08
1.58912e-09
5.56561e-08
1.579e-09
5.56543e-08
1.56917e-09
5.56525e-08
1.55968e-09
5.56505e-08
1.55057e-09
5.56485e-08
1.54191e-09
5.56463e-08
1.53379e-09
5.5644e-08
1.52633e-09
5.56416e-08
1.51966e-09
5.56389e-08
1.51395e-09
5.5636e-08
1.50943e-09
5.5633e-08
1.50628e-09
5.56299e-08
1.50499e-09
5.56266e-08
1.50507e-09
5.56235e-08
1.50922e-09
1.50738e-09
1.14322e-07
1.97104e-09
-1.14246e-07
1.14409e-07
2.06395e-09
1.14503e-07
2.1468e-09
1.14601e-07
2.21795e-09
1.14699e-07
2.2765e-09
1.14793e-07
2.32244e-09
1.14881e-07
2.35649e-09
1.14961e-07
2.37989e-09
1.15033e-07
2.39406e-09
1.15096e-07
2.40044e-09
1.15151e-07
2.40037e-09
1.15198e-07
2.39505e-09
1.15238e-07
2.38552e-09
1.1527e-07
2.37268e-09
1.15297e-07
2.35725e-09
1.15319e-07
2.33981e-09
1.15335e-07
2.32086e-09
1.15348e-07
2.30077e-09
1.15358e-07
2.27984e-09
1.15364e-07
2.25833e-09
1.15368e-07
2.23644e-09
1.1537e-07
2.21431e-09
1.1537e-07
2.19209e-09
1.15369e-07
2.16986e-09
1.15366e-07
2.14773e-09
1.15363e-07
2.12576e-09
1.15358e-07
2.104e-09
1.15353e-07
2.0825e-09
1.15348e-07
2.06131e-09
1.15342e-07
2.04045e-09
1.15335e-07
2.01995e-09
1.15329e-07
1.99983e-09
1.15323e-07
1.98011e-09
1.15316e-07
1.9608e-09
1.15309e-07
1.94191e-09
1.15303e-07
1.92345e-09
1.15296e-07
1.90542e-09
1.1529e-07
1.88782e-09
1.15284e-07
1.87064e-09
1.15277e-07
1.85389e-09
1.15272e-07
1.83757e-09
1.15266e-07
1.82165e-09
1.1526e-07
1.80613e-09
1.15255e-07
1.79101e-09
1.1525e-07
1.77627e-09
1.15245e-07
1.76189e-09
1.1524e-07
1.74788e-09
1.15235e-07
1.7342e-09
1.15231e-07
1.72085e-09
1.15227e-07
1.70781e-09
1.15223e-07
1.69507e-09
1.15219e-07
1.68261e-09
1.15215e-07
1.67044e-09
1.15212e-07
1.65852e-09
1.15208e-07
1.64686e-09
1.15205e-07
1.63545e-09
1.15201e-07
1.62429e-09
1.15198e-07
1.61339e-09
1.15195e-07
1.60274e-09
1.15192e-07
1.59236e-09
1.15188e-07
1.58228e-09
1.15185e-07
1.57253e-09
1.15182e-07
1.56315e-09
1.15178e-07
1.55419e-09
1.15174e-07
1.54572e-09
1.1517e-07
1.53784e-09
1.15166e-07
1.53065e-09
1.15161e-07
1.52429e-09
1.15156e-07
1.51891e-09
1.15151e-07
1.51473e-09
1.15145e-07
1.5119e-09
1.15139e-07
1.51081e-09
1.15133e-07
1.51107e-09
1.15128e-07
1.51508e-09
1.51342e-09
1.31402e-07
1.90175e-09
-1.31333e-07
1.31481e-07
1.98569e-09
1.31565e-07
2.06203e-09
1.31654e-07
2.12955e-09
1.31743e-07
2.18743e-09
1.3183e-07
2.23541e-09
1.31913e-07
2.2737e-09
1.3199e-07
2.30293e-09
1.3206e-07
2.32393e-09
1.32123e-07
2.33765e-09
1.32178e-07
2.34503e-09
1.32226e-07
2.34698e-09
1.32267e-07
2.34436e-09
1.32302e-07
2.33792e-09
1.32331e-07
2.32832e-09
1.32355e-07
2.31613e-09
1.32374e-07
2.30182e-09
1.32389e-07
2.28582e-09
1.324e-07
2.26846e-09
1.32408e-07
2.25004e-09
1.32414e-07
2.23079e-09
1.32417e-07
2.21093e-09
1.32419e-07
2.19062e-09
1.32419e-07
2.17001e-09
1.32417e-07
2.14923e-09
1.32414e-07
2.12837e-09
1.32411e-07
2.10752e-09
1.32407e-07
2.08677e-09
1.32402e-07
2.06616e-09
1.32396e-07
2.04576e-09
1.32391e-07
2.02561e-09
1.32385e-07
2.00574e-09
1.32379e-07
1.98619e-09
1.32373e-07
1.96698e-09
1.32366e-07
1.94813e-09
1.3236e-07
1.92966e-09
1.32354e-07
1.91158e-09
1.32348e-07
1.89389e-09
1.32342e-07
1.87661e-09
1.32336e-07
1.85972e-09
1.32331e-07
1.84324e-09
1.32325e-07
1.82715e-09
1.3232e-07
1.81146e-09
1.32315e-07
1.79615e-09
1.3231e-07
1.78122e-09
1.32305e-07
1.76666e-09
1.323e-07
1.75245e-09
1.32296e-07
1.73858e-09
1.32292e-07
1.72505e-09
1.32288e-07
1.71183e-09
1.32284e-07
1.69893e-09
1.3228e-07
1.68632e-09
1.32277e-07
1.674e-09
1.32273e-07
1.66196e-09
1.3227e-07
1.65019e-09
1.32267e-07
1.63869e-09
1.32263e-07
1.62746e-09
1.3226e-07
1.61651e-09
1.32257e-07
1.60585e-09
1.32254e-07
1.59548e-09
1.32251e-07
1.58545e-09
1.32248e-07
1.57577e-09
1.32244e-07
1.5665e-09
1.32241e-07
1.55769e-09
1.32237e-07
1.54942e-09
1.32233e-07
1.54176e-09
1.32229e-07
1.53484e-09
1.32224e-07
1.52877e-09
1.3222e-07
1.52371e-09
1.32215e-07
1.51984e-09
1.32209e-07
1.5173e-09
1.32204e-07
1.51643e-09
1.32198e-07
1.51683e-09
1.32192e-07
1.52085e-09
1.51932e-09
1.51024e-07
1.84139e-09
-1.50963e-07
1.51091e-07
1.91803e-09
1.51165e-07
1.98887e-09
1.51241e-07
2.05299e-09
1.51319e-07
2.10969e-09
1.51396e-07
2.15859e-09
1.5147e-07
2.19963e-09
1.5154e-07
2.23303e-09
1.51604e-07
2.25922e-09
1.51663e-07
2.27877e-09
1.51716e-07
2.29228e-09
1.51763e-07
2.30042e-09
1.51803e-07
2.30383e-09
1.51838e-07
2.30312e-09
1.51867e-07
2.29884e-09
1.51892e-07
2.29153e-09
1.51912e-07
2.28164e-09
1.51928e-07
2.26957e-09
1.51941e-07
2.2557e-09
1.51951e-07
2.24032e-09
1.51958e-07
2.22373e-09
1.51963e-07
2.20615e-09
1.51966e-07
2.1878e-09
1.51967e-07
2.16885e-09
1.51966e-07
2.14947e-09
1.51965e-07
2.12978e-09
1.51963e-07
2.1099e-09
1.51959e-07
2.08994e-09
1.51956e-07
2.06997e-09
1.51951e-07
2.05007e-09
1.51947e-07
2.03031e-09
1.51942e-07
2.01073e-09
1.51936e-07
1.99139e-09
1.51931e-07
1.97232e-09
1.51926e-07
1.95355e-09
1.5192e-07
1.9351e-09
1.51915e-07
1.917e-09
1.5191e-07
1.89925e-09
1.51904e-07
1.88188e-09
1.51899e-07
1.86489e-09
1.51894e-07
1.84828e-09
1.51889e-07
1.83205e-09
1.51884e-07
1.8162e-09
1.5188e-07
1.80073e-09
1.51875e-07
1.78562e-09
1.51871e-07
1.77089e-09
1.51867e-07
1.75651e-09
1.51863e-07
1.74247e-09
1.5186e-07
1.72877e-09
1.51856e-07
1.7154e-09
1.51853e-07
1.70234e-09
1.51849e-07
1.68959e-09
1.51846e-07
1.67715e-09
1.51843e-07
1.66499e-09
1.5184e-07
1.65312e-09
1.51837e-07
1.64155e-09
1.51834e-07
1.63026e-09
1.51832e-07
1.61927e-09
1.51829e-07
1.60859e-09
1.51826e-07
1.59825e-09
1.51823e-07
1.58826e-09
1.51821e-07
1.57866e-09
1.51818e-07
1.5695e-09
1.51814e-07
1.56083e-09
1.51811e-07
1.55274e-09
1.51808e-07
1.5453e-09
1.51804e-07
1.53862e-09
1.518e-07
1.53283e-09
1.51795e-07
1.52805e-09
1.51791e-07
1.52445e-09
1.51786e-07
1.52217e-09
1.51781e-07
1.5215e-09
1.51776e-07
1.52205e-09
1.5177e-07
1.52613e-09
1.52471e-09
1.73561e-07
1.79264e-09
-1.73512e-07
1.73615e-07
1.86367e-09
1.73674e-07
1.93014e-09
1.73735e-07
1.99134e-09
1.73798e-07
2.04668e-09
1.73861e-07
2.09574e-09
1.73923e-07
2.13833e-09
1.73981e-07
2.17443e-09
1.74036e-07
2.20423e-09
1.74087e-07
2.228e-09
1.74133e-07
2.24614e-09
1.74174e-07
2.25908e-09
1.74211e-07
2.26729e-09
1.74243e-07
2.27124e-09
1.7427e-07
2.27141e-09
1.74294e-07
2.26823e-09
1.74313e-07
2.26214e-09
1.74329e-07
2.25351e-09
1.74342e-07
2.24272e-09
1.74352e-07
2.23008e-09
1.7436e-07
2.21589e-09
1.74366e-07
2.2004e-09
1.7437e-07
2.18386e-09
1.74372e-07
2.16646e-09
1.74373e-07
2.1484e-09
1.74373e-07
2.12982e-09
1.74372e-07
2.11087e-09
1.74371e-07
2.09167e-09
1.74368e-07
2.07233e-09
1.74365e-07
2.05293e-09
1.74362e-07
2.03357e-09
1.74359e-07
2.0143e-09
1.74355e-07
1.99518e-09
1.74351e-07
1.97627e-09
1.74347e-07
1.9576e-09
1.74343e-07
1.9392e-09
1.74339e-07
1.92111e-09
1.74335e-07
1.90335e-09
1.7433e-07
1.88593e-09
1.74327e-07
1.86886e-09
1.74323e-07
1.85215e-09
1.74319e-07
1.83581e-09
1.74315e-07
1.81984e-09
1.74312e-07
1.80424e-09
1.74308e-07
1.789e-09
1.74305e-07
1.77413e-09
1.74302e-07
1.75961e-09
1.74299e-07
1.74544e-09
1.74296e-07
1.7316e-09
1.74293e-07
1.7181e-09
1.74291e-07
1.70492e-09
1.74288e-07
1.69206e-09
1.74286e-07
1.67951e-09
1.74284e-07
1.66726e-09
1.74282e-07
1.65532e-09
1.7428e-07
1.64368e-09
1.74277e-07
1.63235e-09
1.74275e-07
1.62133e-09
1.74273e-07
1.61065e-09
1.74271e-07
1.60032e-09
1.74269e-07
1.59038e-09
1.74267e-07
1.58085e-09
1.74265e-07
1.57179e-09
1.74262e-07
1.56326e-09
1.7426e-07
1.55532e-09
1.74257e-07
1.54807e-09
1.74254e-07
1.54161e-09
1.74251e-07
1.53604e-09
1.74247e-07
1.5315e-09
1.74244e-07
1.52814e-09
1.7424e-07
1.52607e-09
1.74236e-07
1.52558e-09
1.74231e-07
1.52627e-09
1.74227e-07
1.53045e-09
1.52918e-09
1.99445e-07
1.75915e-09
-1.99412e-07
1.99483e-07
1.82641e-09
1.99523e-07
1.88987e-09
1.99565e-07
1.94894e-09
1.99609e-07
2.00309e-09
1.99653e-07
2.05192e-09
1.99696e-07
2.09517e-09
1.99738e-07
2.13273e-09
1.99777e-07
2.16461e-09
1.99814e-07
2.19097e-09
1.99848e-07
2.21203e-09
1.99879e-07
2.22808e-09
1.99907e-07
2.23947e-09
1.99932e-07
2.24658e-09
1.99954e-07
2.24979e-09
1.99972e-07
2.24951e-09
1.99988e-07
2.24612e-09
2.00002e-07
2.23997e-09
2.00013e-07
2.23143e-09
2.00022e-07
2.22081e-09
2.0003e-07
2.20841e-09
2.00036e-07
2.1945e-09
2.0004e-07
2.17934e-09
2.00044e-07
2.16314e-09
2.00046e-07
2.14609e-09
2.00047e-07
2.12839e-09
2.00048e-07
2.11018e-09
2.00048e-07
2.0916e-09
2.00048e-07
2.07277e-09
2.00047e-07
2.05379e-09
2.00046e-07
2.03476e-09
2.00044e-07
2.01576e-09
2.00042e-07
1.99686e-09
2.00041e-07
1.9781e-09
2.00039e-07
1.95954e-09
2.00037e-07
1.94121e-09
2.00035e-07
1.92316e-09
2.00033e-07
1.90541e-09
2.0003e-07
1.88798e-09
2.00028e-07
1.87088e-09
2.00026e-07
1.85413e-09
2.00025e-07
1.83773e-09
2.00023e-07
1.82169e-09
2.00021e-07
1.80602e-09
2.00019e-07
1.7907e-09
2.00018e-07
1.77574e-09
2.00016e-07
1.76114e-09
2.00015e-07
1.74688e-09
2.00013e-07
1.73296e-09
2.00012e-07
1.71938e-09
2.00011e-07
1.70613e-09
2.0001e-07
1.69319e-09
2.00009e-07
1.68058e-09
2.00008e-07
1.66828e-09
2.00007e-07
1.65629e-09
2.00006e-07
1.64461e-09
2.00005e-07
1.63326e-09
2.00004e-07
1.62224e-09
2.00003e-07
1.61157e-09
2.00002e-07
1.60126e-09
2.00001e-07
1.59136e-09
2e-07
1.5819e-09
1.99999e-07
1.57292e-09
1.99998e-07
1.56449e-09
1.99996e-07
1.55668e-09
1.99995e-07
1.54957e-09
1.99993e-07
1.54326e-09
1.99991e-07
1.53787e-09
1.99989e-07
1.53351e-09
1.99987e-07
1.53032e-09
1.99985e-07
1.52841e-09
1.99982e-07
1.52805e-09
1.9998e-07
1.52885e-09
1.99977e-07
1.53308e-09
1.53187e-09
2.29179e-07
-2.29166e-07
2.29193e-07
2.29209e-07
2.29225e-07
2.29242e-07
2.29259e-07
2.29276e-07
2.29293e-07
2.29309e-07
2.29325e-07
2.29339e-07
2.29352e-07
2.29364e-07
2.29375e-07
2.29385e-07
2.29394e-07
2.29402e-07
2.29408e-07
2.29414e-07
2.2942e-07
2.29424e-07
2.29428e-07
2.29432e-07
2.29434e-07
2.29437e-07
2.29439e-07
2.29441e-07
2.29442e-07
2.29444e-07
2.29445e-07
2.29446e-07
2.29447e-07
2.29448e-07
2.29449e-07
2.29449e-07
2.2945e-07
2.29451e-07
2.29451e-07
2.29452e-07
2.29453e-07
2.29453e-07
2.29454e-07
2.29455e-07
2.29455e-07
2.29456e-07
2.29457e-07
2.29458e-07
2.29458e-07
2.29459e-07
2.2946e-07
2.29461e-07
2.29462e-07
2.29463e-07
2.29464e-07
2.29465e-07
2.29466e-07
2.29467e-07
2.29468e-07
2.29469e-07
2.2947e-07
2.29471e-07
2.29472e-07
2.29473e-07
2.29473e-07
2.29474e-07
2.29475e-07
2.29476e-07
2.29476e-07
2.29477e-07
2.29477e-07
2.29478e-07
2.29478e-07
2.29478e-07
2.29479e-07
2.76776e-08
3.73471e-12
2.7671e-08
1.32036e-11
2.76605e-08
2.4501e-11
2.76466e-08
3.75341e-11
2.76291e-08
5.22077e-11
2.7608e-08
6.84718e-11
2.75833e-08
8.63668e-11
2.75545e-08
1.06032e-10
2.75213e-08
1.27715e-10
2.74831e-08
1.51821e-10
2.74388e-08
1.78917e-10
2.73872e-08
2.10064e-10
2.73262e-08
2.46196e-10
2.72526e-08
2.91444e-10
2.71624e-08
3.43104e-10
2.70425e-08
4.32194e-10
2.68918e-08
4.88261e-10
2.6599e-08
8.5371e-10
2.61884e-08
7.26175e-10
4.46105e-09
2.84886e-08
6.2433e-12
2.84819e-08
1.99687e-11
2.84712e-08
3.51664e-11
2.84569e-08
5.18887e-11
2.84389e-08
7.0164e-11
2.84173e-08
9.00705e-11
2.83919e-08
1.11771e-10
2.83624e-08
1.35533e-10
2.83284e-08
1.61754e-10
2.82891e-08
1.91049e-10
2.82438e-08
2.24262e-10
2.81909e-08
2.62905e-10
2.81286e-08
3.08497e-10
2.80536e-08
3.66438e-10
2.79612e-08
4.35601e-10
2.78426e-08
5.50786e-10
2.76743e-08
6.5656e-10
2.74494e-08
1.07857e-09
2.69017e-08
1.27387e-09
3.88944e-09
2.93235e-08
8.76883e-12
2.93166e-08
2.68817e-11
2.93057e-08
4.60706e-11
2.9291e-08
6.6578e-11
2.92726e-08
8.85492e-11
2.92505e-08
1.12188e-10
2.92245e-08
1.37782e-10
2.91943e-08
1.65726e-10
2.91594e-08
1.96573e-10
2.91194e-08
2.31139e-10
2.90731e-08
2.7055e-10
2.90192e-08
3.16732e-10
2.89559e-08
3.71855e-10
2.88801e-08
4.42195e-10
2.87864e-08
5.29298e-10
2.86701e-08
6.67074e-10
2.84998e-08
8.26883e-10
2.83148e-08
1.26364e-09
2.78848e-08
1.70378e-09
3.61051e-09
3.01828e-08
1.13186e-11
3.01757e-08
3.39377e-11
3.01646e-08
5.72093e-11
3.01496e-08
8.15924e-11
3.01308e-08
1.07349e-10
3.01081e-08
1.34806e-10
3.00816e-08
1.64374e-10
3.00507e-08
1.96576e-10
3.00152e-08
2.32119e-10
2.99743e-08
2.72016e-10
2.99272e-08
3.17668e-10
2.98725e-08
3.71381e-10
2.98084e-08
4.3598e-10
2.97322e-08
5.18385e-10
2.96386e-08
6.22901e-10
2.95243e-08
7.81369e-10
2.93644e-08
9.86736e-10
2.91964e-08
1.43169e-09
2.89068e-08
1.99342e-09
3.52011e-09
3.10672e-08
1.38963e-11
3.106e-08
4.11317e-11
3.10487e-08
6.85787e-11
3.10333e-08
9.69241e-11
3.10141e-08
1.26551e-10
3.0991e-08
1.57905e-10
3.09639e-08
1.91519e-10
3.09324e-08
2.28046e-10
3.08962e-08
2.68339e-10
3.08546e-08
3.13601e-10
3.08068e-08
3.65498e-10
3.07515e-08
4.26677e-10
3.06869e-08
5.00572e-10
3.06107e-08
5.94594e-10
3.05182e-08
7.15404e-10
3.0407e-08
8.92525e-10
3.02607e-08
1.1331e-09
3.011e-08
1.58234e-09
2.99109e-08
2.19259e-09
3.44828e-09
3.19776e-08
1.65037e-11
3.19703e-08
4.84591e-11
3.19587e-08
8.01734e-11
3.19431e-08
1.12564e-10
3.19235e-08
1.46142e-10
3.18999e-08
1.81466e-10
3.18722e-08
2.19192e-10
3.18402e-08
2.60095e-10
3.18034e-08
3.05174e-10
3.17611e-08
3.5581e-10
3.17127e-08
4.13911e-10
3.1657e-08
4.82427e-10
3.15922e-08
5.65324e-10
3.15165e-08
6.70353e-10
3.14259e-08
8.05967e-10
3.13192e-08
9.99194e-10
3.11868e-08
1.26553e-09
3.10562e-08
1.71298e-09
3.09193e-08
2.32944e-09
3.37487e-09
3.29147e-08
1.91421e-11
3.29072e-08
5.59149e-11
3.28954e-08
9.19865e-11
3.28795e-08
1.28502e-10
3.28595e-08
1.66105e-10
3.28355e-08
2.05467e-10
3.28074e-08
2.47358e-10
3.27748e-08
2.92678e-10
3.27374e-08
3.42559e-10
3.26946e-08
3.98548e-10
3.26458e-08
4.62769e-10
3.25898e-08
5.38426e-10
3.25252e-08
6.29918e-10
3.24504e-08
7.45178e-10
3.23625e-08
8.93843e-10
3.22614e-08
1.10028e-09
3.2143e-08
1.38393e-09
3.20326e-08
1.82341e-09
3.19414e-08
2.42064e-09
3.30146e-09
3.38792e-08
2.18125e-11
3.38716e-08
6.34936e-11
3.38596e-08
1.04009e-10
3.38434e-08
1.44725e-10
3.38231e-08
1.86421e-10
3.37987e-08
2.29879e-10
3.377e-08
2.75982e-10
3.3737e-08
3.25742e-10
3.36991e-08
3.8042e-10
3.36559e-08
4.41709e-10
3.36068e-08
5.11919e-10
3.35508e-08
5.94454e-10
3.34867e-08
6.94028e-10
3.34132e-08
8.18594e-10
3.33287e-08
9.78372e-10
3.3234e-08
1.19497e-09
3.31294e-08
1.48852e-09
3.30381e-08
1.91479e-09
3.29804e-08
2.47829e-09
3.22723e-09
3.4872e-08
2.45148e-11
3.48643e-08
7.11888e-11
3.48521e-08
1.1623e-10
3.48356e-08
1.61216e-10
3.48149e-08
2.07068e-10
3.47901e-08
2.54673e-10
3.47611e-08
3.05019e-10
3.47276e-08
3.59228e-10
3.46894e-08
4.18676e-10
3.46459e-08
4.85179e-10
3.45966e-08
5.612e-10
3.45408e-08
6.50281e-10
3.44775e-08
7.57326e-10
3.44059e-08
8.90144e-10
3.43253e-08
1.059e-09
3.42376e-08
1.28268e-09
3.41463e-08
1.57986e-09
3.40723e-08
1.98877e-09
3.40394e-08
2.51111e-09
3.15178e-09
3.58939e-08
2.72485e-11
3.58861e-08
7.89932e-11
3.58737e-08
1.28637e-10
3.58569e-08
1.77957e-10
3.5836e-08
2.2802e-10
3.58108e-08
2.79812e-10
3.57814e-08
3.34422e-10
3.57476e-08
3.93071e-10
3.5709e-08
4.57235e-10
3.56654e-08
5.28835e-10
3.56161e-08
6.10441e-10
3.55607e-08
7.0567e-10
3.54986e-08
8.1949e-10
3.54293e-08
9.59407e-10
3.5353e-08
1.13528e-09
3.52726e-08
1.36307e-09
3.51938e-08
1.65874e-09
3.51354e-08
2.04718e-09
3.5121e-08
2.52545e-09
3.07564e-09
3.69457e-08
3.00123e-11
3.69378e-08
8.68987e-11
3.69252e-08
1.41215e-10
3.69082e-08
1.94928e-10
3.6887e-08
2.49246e-10
3.68616e-08
3.05257e-10
3.68318e-08
3.64136e-10
3.67977e-08
4.27198e-10
3.6759e-08
4.96001e-10
3.67152e-08
5.72543e-10
3.66662e-08
6.59463e-10
3.66115e-08
7.60384e-10
3.65508e-08
8.80212e-10
3.64842e-08
1.02601e-09
3.64126e-08
1.20687e-09
3.63397e-08
1.43599e-09
3.62724e-08
1.72606e-09
3.62277e-08
2.09187e-09
3.62272e-08
2.52597e-09
2.99967e-09
3.80283e-08
3.28042e-11
3.80203e-08
9.48958e-11
3.80076e-08
1.53948e-10
3.79904e-08
2.12104e-10
3.7969e-08
2.70714e-10
3.79433e-08
3.3096e-10
3.79133e-08
3.94102e-10
3.7879e-08
4.61529e-10
3.78401e-08
5.34868e-10
3.77965e-08
6.16166e-10
3.77478e-08
7.08083e-10
3.7694e-08
8.14185e-10
3.76351e-08
9.39201e-10
3.75714e-08
1.08962e-09
3.75048e-08
1.27352e-09
3.74393e-08
1.50147e-09
3.73826e-08
1.78276e-09
3.73498e-08
2.12468e-09
3.73596e-08
2.51615e-09
2.92467e-09
3.91427e-08
3.56216e-11
3.91346e-08
1.02974e-10
3.91218e-08
1.66816e-10
3.91044e-08
2.29457e-10
3.90827e-08
2.92386e-10
3.90568e-08
3.56874e-10
3.90267e-08
4.24253e-10
3.89922e-08
4.95978e-10
3.89534e-08
5.73725e-10
3.891e-08
6.59559e-10
3.88619e-08
7.56117e-10
3.88093e-08
8.66845e-10
3.87523e-08
9.96192e-10
3.86919e-08
1.14997e-09
3.86303e-08
1.33511e-09
3.85721e-08
1.5597e-09
3.85251e-08
1.82982e-09
3.85024e-08
2.14731e-09
3.85199e-08
2.49863e-09
2.85131e-09
4.02897e-08
3.84612e-11
4.02816e-08
1.11121e-10
4.02686e-08
1.79797e-10
4.02511e-08
2.46957e-10
4.02293e-08
3.1422e-10
4.02032e-08
3.82942e-10
4.01729e-08
4.54519e-10
4.01385e-08
5.30455e-10
4.00997e-08
6.12454e-10
4.00567e-08
7.02573e-10
4.00094e-08
8.03381e-10
3.99581e-08
9.18144e-10
3.99034e-08
1.05095e-09
3.98465e-08
1.20686e-09
3.979e-08
1.39158e-09
3.97388e-08
1.61094e-09
3.97004e-08
1.86821e-09
3.96864e-08
2.16133e-09
3.97096e-08
2.47544e-09
2.78011e-09
4.14704e-08
4.13191e-11
4.14622e-08
1.19323e-10
4.14491e-08
1.92869e-10
4.14315e-08
2.6457e-10
4.14095e-08
3.3617e-10
4.13834e-08
4.09105e-10
4.13531e-08
4.84823e-10
4.13187e-08
5.64863e-10
4.12802e-08
6.50935e-10
4.12377e-08
7.45059e-10
4.11914e-08
8.49696e-10
4.11416e-08
9.67879e-10
4.10893e-08
1.10327e-09
4.10361e-08
1.26014e-09
4.09847e-08
1.44295e-09
4.09401e-08
1.65555e-09
4.09094e-08
1.89884e-09
4.09026e-08
2.16812e-09
4.09299e-08
2.44813e-09
2.71145e-09
4.26856e-08
4.41906e-11
4.26774e-08
1.27565e-10
4.26642e-08
2.06004e-10
4.26466e-08
2.82258e-10
4.26245e-08
3.58186e-10
4.25983e-08
4.35298e-10
4.25681e-08
5.15083e-10
4.25338e-08
5.99098e-10
4.24957e-08
6.89042e-10
4.24539e-08
7.86867e-10
4.24087e-08
8.94889e-10
4.23608e-08
1.01586e-09
4.2311e-08
1.15298e-09
4.22615e-08
1.30971e-09
4.22151e-08
1.48933e-09
4.21767e-08
1.69396e-09
4.21529e-08
1.92262e-09
4.21521e-08
2.16893e-09
4.21823e-08
2.41794e-09
2.64557e-09
4.39365e-08
4.70705e-11
4.39282e-08
1.35831e-10
4.3915e-08
2.19175e-10
4.38973e-08
2.99979e-10
4.38753e-08
3.80215e-10
4.38491e-08
4.61453e-10
4.3819e-08
5.45213e-10
4.3785e-08
6.33057e-10
4.37474e-08
7.26649e-10
4.37065e-08
8.27849e-10
4.36626e-08
9.38795e-10
4.36165e-08
1.06193e-09
4.35695e-08
1.19994e-09
4.35237e-08
1.35553e-09
4.34822e-08
1.53086e-09
4.34495e-08
1.72662e-09
4.34317e-08
1.94039e-09
4.34358e-08
2.16483e-09
4.3468e-08
2.38583e-09
2.58262e-09
4.5224e-08
4.99528e-11
4.52157e-08
1.44102e-10
4.52026e-08
2.32348e-10
4.51848e-08
3.1769e-10
4.51629e-08
4.02197e-10
4.51368e-08
4.87495e-10
4.51069e-08
5.75122e-10
4.50733e-08
6.6663e-10
4.50364e-08
7.63629e-10
4.49963e-08
8.67862e-10
4.49539e-08
9.81262e-10
4.49099e-08
1.10594e-09
4.48657e-08
1.24407e-09
4.48236e-08
1.39762e-09
4.47868e-08
1.56775e-09
4.47594e-08
1.754e-09
4.47469e-08
1.95291e-09
4.47549e-08
2.15676e-09
4.47882e-08
2.35256e-09
2.52267e-09
4.65492e-08
5.28313e-11
4.6541e-08
1.52357e-10
4.65279e-08
2.45491e-10
4.65102e-08
3.35343e-10
4.64883e-08
4.24072e-10
4.64625e-08
5.13347e-10
4.64329e-08
6.04718e-10
4.63998e-08
6.99708e-10
4.63636e-08
7.99854e-10
4.63247e-08
9.06767e-10
4.62838e-08
1.02215e-09
4.62419e-08
1.14778e-09
4.62007e-08
1.28531e-09
4.61623e-08
1.43602e-09
4.61298e-08
1.60023e-09
4.61073e-08
1.77657e-09
4.60993e-08
1.96091e-09
4.61105e-08
2.14553e-09
4.61443e-08
2.31874e-09
2.46573e-09
4.79133e-08
5.56987e-11
4.79051e-08
1.60576e-10
4.7892e-08
2.58565e-10
4.78745e-08
3.52886e-10
4.78528e-08
4.45771e-10
4.78272e-08
5.38928e-10
4.7798e-08
6.33902e-10
4.77656e-08
7.32177e-10
4.77302e-08
8.35202e-10
4.76926e-08
9.44434e-10
4.76534e-08
1.06134e-09
4.76138e-08
1.18734e-09
4.75755e-08
1.32362e-09
4.75407e-08
1.47082e-09
4.75123e-08
1.62858e-09
4.74941e-08
1.79481e-09
4.749e-08
1.96505e-09
4.75037e-08
2.13184e-09
4.75376e-08
2.28484e-09
2.41178e-09
4.93174e-08
5.85479e-11
4.93093e-08
1.68733e-10
4.92963e-08
2.71533e-10
4.92789e-08
3.70265e-10
4.92575e-08
4.67227e-10
4.92322e-08
5.64154e-10
4.92036e-08
6.62577e-10
4.91718e-08
7.63927e-10
4.91375e-08
8.69553e-10
4.91011e-08
9.80743e-10
4.90638e-08
1.09872e-09
4.90265e-08
1.22456e-09
4.89911e-08
1.35901e-09
4.89598e-08
1.50216e-09
4.89353e-08
1.65306e-09
4.89209e-08
1.80919e-09
4.89201e-08
1.96592e-09
4.89356e-08
2.11627e-09
4.89692e-08
2.25125e-09
2.36078e-09
5.07626e-08
6.13712e-11
5.07546e-08
1.76803e-10
5.07417e-08
2.8435e-10
5.07246e-08
3.87421e-10
5.07034e-08
4.88366e-10
5.06787e-08
5.88936e-10
5.06506e-08
6.90641e-10
5.06197e-08
7.94847e-10
5.05864e-08
9.02789e-10
5.05516e-08
1.01558e-09
5.05161e-08
1.13421e-09
5.04813e-08
1.25941e-09
5.04488e-08
1.39151e-09
5.04208e-08
1.53017e-09
5.03998e-08
1.674e-09
5.03889e-08
1.82015e-09
5.03907e-08
1.96406e-09
5.04077e-08
2.09934e-09
5.04406e-08
2.21828e-09
2.31267e-09
5.22502e-08
6.41613e-11
5.22423e-08
1.84757e-10
5.22296e-08
2.96974e-10
5.22128e-08
4.04295e-10
5.2192e-08
5.09112e-10
5.21678e-08
6.13185e-10
5.21404e-08
7.17993e-10
5.21104e-08
8.24828e-10
5.20784e-08
9.34804e-10
5.20451e-08
1.04886e-09
5.20116e-08
1.16773e-09
5.19792e-08
1.29185e-09
5.19495e-08
1.4212e-09
5.19246e-08
1.55505e-09
5.19069e-08
1.69167e-09
5.1899e-08
1.82811e-09
5.19031e-08
1.95995e-09
5.19209e-08
2.08148e-09
5.19531e-08
2.18616e-09
2.26738e-09
5.37814e-08
6.6912e-11
5.37736e-08
1.92565e-10
5.37612e-08
3.09356e-10
5.37447e-08
4.20822e-10
5.37244e-08
5.29386e-10
5.37008e-08
6.36809e-10
5.36742e-08
7.44532e-10
5.36453e-08
8.53765e-10
5.36146e-08
9.65493e-10
5.3583e-08
1.08048e-09
5.35515e-08
1.19923e-09
5.35214e-08
1.32189e-09
5.34945e-08
1.44815e-09
5.34726e-08
1.57696e-09
5.34578e-08
1.7064e-09
5.34525e-08
1.83347e-09
5.34584e-08
1.95405e-09
5.34768e-08
2.06307e-09
5.35079e-08
2.15509e-09
2.22484e-09
5.53574e-08
6.96105e-11
5.53498e-08
2.002e-10
5.53377e-08
3.21449e-10
5.53216e-08
4.36934e-10
5.53019e-08
5.49104e-10
5.5279e-08
6.59715e-10
5.52533e-08
7.70158e-10
5.52255e-08
8.81556e-10
5.51963e-08
9.94765e-10
5.51664e-08
1.11037e-09
5.51369e-08
1.22867e-09
5.51093e-08
1.34956e-09
5.50849e-08
1.47246e-09
5.50658e-08
1.59612e-09
5.50537e-08
1.71848e-09
5.50506e-08
1.83661e-09
5.50579e-08
1.94672e-09
5.50765e-08
2.04442e-09
5.51064e-08
2.12521e-09
2.18496e-09
1.14608e-07
7.47388e-11
1.14593e-07
2.14715e-10
1.1457e-07
3.44376e-10
1.1454e-07
4.67378e-10
1.14503e-07
5.86223e-10
1.1446e-07
7.0262e-10
1.14412e-07
8.17843e-10
1.14361e-07
9.32827e-10
1.14307e-07
1.04818e-09
1.14254e-07
1.16416e-09
1.14202e-07
1.28069e-09
1.14154e-07
1.3973e-09
1.14113e-07
1.51303e-09
1.14083e-07
1.62639e-09
1.14066e-07
1.73534e-09
1.14066e-07
1.83725e-09
1.14083e-07
1.92913e-09
1.1412e-07
2.00777e-09
1.14175e-07
2.07022e-09
2.114e-09
1.3165e-07
7.98664e-11
1.31636e-07
2.29156e-10
1.31613e-07
3.6714e-10
1.31583e-07
4.97504e-10
1.31547e-07
6.22762e-10
1.31505e-07
7.44563e-10
1.31458e-07
8.64039e-10
1.31409e-07
9.81928e-10
1.31359e-07
1.09858e-09
1.31309e-07
1.21399e-09
1.31262e-07
1.32776e-09
1.3122e-07
1.43914e-09
1.31186e-07
1.547e-09
1.31163e-07
1.64981e-09
1.31152e-07
1.74573e-09
1.31157e-07
1.83263e-09
1.31178e-07
1.90829e-09
1.31215e-07
1.97057e-09
1.31268e-07
2.01773e-09
2.04848e-09
1.51228e-07
8.47387e-11
1.51214e-07
2.42816e-10
1.51193e-07
3.88607e-10
1.51164e-07
5.25804e-10
1.5113e-07
6.56897e-10
1.51091e-07
7.83459e-10
1.51049e-07
9.06477e-10
1.51004e-07
1.0265e-09
1.50959e-07
1.14366e-09
1.50915e-07
1.25771e-09
1.50875e-07
1.36805e-09
1.5084e-07
1.4738e-09
1.50814e-07
1.57376e-09
1.50797e-07
1.66655e-09
1.50792e-07
1.75061e-09
1.508e-07
1.82437e-09
1.50822e-07
1.88631e-09
1.50858e-07
1.93516e-09
1.50905e-07
1.97006e-09
1.99053e-09
1.73716e-07
8.90059e-11
1.73704e-07
2.54679e-10
1.73686e-07
4.0718e-10
1.73662e-07
5.50192e-10
1.73632e-07
6.86157e-10
1.73599e-07
8.16563e-10
1.73563e-07
9.42271e-10
1.73526e-07
1.06367e-09
1.73489e-07
1.18072e-09
1.73454e-07
1.29301e-09
1.73422e-07
1.39984e-09
1.73396e-07
1.50027e-09
1.73376e-07
1.59317e-09
1.73365e-07
1.67734e-09
1.73364e-07
1.75158e-09
1.73374e-07
1.81477e-09
1.73394e-07
1.86599e-09
1.73425e-07
1.9046e-09
1.73465e-07
1.93032e-09
1.94318e-09
1.99549e-07
9.21668e-11
1.99541e-07
2.63333e-10
1.99527e-07
4.20678e-10
1.9951e-07
5.67849e-10
1.99489e-07
7.07245e-10
1.99465e-07
8.40285e-10
1.99439e-07
9.67736e-10
1.99413e-07
1.08987e-09
1.99387e-07
1.20655e-09
1.99363e-07
1.31728e-09
1.99342e-07
1.42131e-09
1.99324e-07
1.51769e-09
1.99312e-07
1.60541e-09
1.99306e-07
1.68344e-09
1.99307e-07
1.75085e-09
1.99314e-07
1.80685e-09
1.9933e-07
1.8509e-09
1.99351e-07
1.88276e-09
1.99379e-07
1.9025e-09
1.91045e-09
2.29224e-07
2.29221e-07
2.29215e-07
2.29208e-07
2.292e-07
2.2919e-07
2.2918e-07
2.29169e-07
2.29159e-07
2.29149e-07
2.29141e-07
2.29134e-07
2.29129e-07
2.29126e-07
2.29126e-07
2.29129e-07
2.29135e-07
2.29143e-07
2.29154e-07
)
;
boundaryField
{
top
{
type calculated;
value nonuniform List<scalar>
95
(
1.7464e-09
1.81217e-09
1.87441e-09
1.93256e-09
1.98613e-09
2.03471e-09
2.07805e-09
2.11599e-09
2.14851e-09
2.1757e-09
2.19773e-09
2.21485e-09
2.22736e-09
2.2356e-09
2.23993e-09
2.24071e-09
2.23832e-09
2.23312e-09
2.22543e-09
2.21558e-09
2.20388e-09
2.19059e-09
2.17597e-09
2.16024e-09
2.14361e-09
2.12626e-09
2.10834e-09
2.09002e-09
2.0714e-09
2.0526e-09
2.03372e-09
2.01483e-09
1.99602e-09
1.97733e-09
1.95882e-09
1.94054e-09
1.92251e-09
1.90477e-09
1.88734e-09
1.87024e-09
1.85348e-09
1.83707e-09
1.82101e-09
1.80531e-09
1.78997e-09
1.77498e-09
1.76035e-09
1.74606e-09
1.73212e-09
1.7185e-09
1.70522e-09
1.69227e-09
1.67963e-09
1.66731e-09
1.65531e-09
1.64362e-09
1.63226e-09
1.62124e-09
1.61057e-09
1.60028e-09
1.5904e-09
1.58096e-09
1.57202e-09
1.56364e-09
1.55588e-09
1.54883e-09
1.54259e-09
1.53727e-09
1.53298e-09
1.52986e-09
1.52802e-09
1.52771e-09
1.52857e-09
1.53274e-09
1.53183e-09
9.34619e-11
2.66826e-10
4.26123e-10
5.74976e-10
7.15758e-10
8.4986e-10
9.78007e-10
1.10043e-09
1.21694e-09
1.32703e-09
1.42991e-09
1.52467e-09
1.61034e-09
1.68596e-09
1.7507e-09
1.80392e-09
1.84522e-09
1.8745e-09
1.89196e-09
1.89801e-09
)
;
}
inlet
{
type calculated;
value nonuniform List<scalar>
31
(
-1.14613e-07
-1.31656e-07
-1.51233e-07
-1.73721e-07
-1.99553e-07
-2.29226e-07
-2.76801e-08
-2.84911e-08
-2.9326e-08
-3.01853e-08
-3.10698e-08
-3.19802e-08
-3.29173e-08
-3.38819e-08
-3.48747e-08
-3.58966e-08
-3.69484e-08
-3.80311e-08
-3.91455e-08
-4.02926e-08
-4.14732e-08
-4.26885e-08
-4.39394e-08
-4.52269e-08
-4.65521e-08
-4.79162e-08
-4.93203e-08
-5.07655e-08
-5.2253e-08
-5.37841e-08
-5.53601e-08
)
;
}
outlet
{
type calculated;
value nonuniform List<scalar>
31
(
1.15122e-07
1.32186e-07
1.51765e-07
1.74223e-07
1.99974e-07
2.29479e-07
1.30297e-09
4.08625e-09
7.10588e-09
1.03402e-08
1.37532e-08
1.72881e-08
2.08661e-08
2.43899e-08
2.77531e-08
3.08559e-08
3.36246e-08
3.60273e-08
3.80794e-08
3.9837e-08
4.13791e-08
4.27877e-08
4.41316e-08
4.54596e-08
4.68013e-08
4.81721e-08
4.95793e-08
5.10262e-08
5.25145e-08
5.40454e-08
5.56203e-08
)
;
}
plate
{
type calculated;
value uniform 0;
}
symmBound
{
type calculated;
value nonuniform List<scalar>
20
(
-1.28791e-12
-6.54956e-12
-1.40857e-11
-2.35524e-11
-3.47146e-11
-4.74243e-11
-6.16092e-11
-7.72791e-11
-9.45271e-11
-1.13555e-10
-1.34654e-10
-1.58434e-10
-1.85269e-10
-2.17818e-10
-2.52859e-10
-3.123e-10
-3.37614e-10
-5.60889e-10
-3.15579e-10
-2.04181e-09
)
;
}
frontAndBack
{
type empty;
value nonuniform 0();
}
}
// ************************************************************************* //
| [
"[email protected]"
] | ||
d6ab9c59afa228d0cc778c83eded36215f1960ed | ff9ba2b14c79cec6364561ef75bd99e9d3008742 | /src/vmdtab.cpp | f50ef87b03f2338e28f1b514f13208d373e092cf | [
"MIT",
"ISC",
"Apache-2.0",
"GPL-3.0-only",
"BSD-3-Clause"
] | permissive | akkuman/vnote | 9caeb205b86c694e5df896962e132b5c6d35a2e5 | d9a42f74b18cda0179eaf558040dfd6c24c9a859 | refs/heads/master | 2020-03-28T13:57:37.053737 | 2018-09-18T10:00:35 | 2018-09-18T10:00:35 | 148,445,487 | 0 | 0 | MIT | 2018-09-12T08:13:49 | 2018-09-12T08:13:48 | null | UTF-8 | C++ | false | false | 46,079 | cpp | #include <QtWidgets>
#include <QWebChannel>
#include <QFileInfo>
#include <QCoreApplication>
#include <QWebEngineProfile>
#include "vmdtab.h"
#include "vdocument.h"
#include "vnote.h"
#include "utils/vutils.h"
#include "vpreviewpage.h"
#include "pegmarkdownhighlighter.h"
#include "vconfigmanager.h"
#include "vmarkdownconverter.h"
#include "vnotebook.h"
#include "vtableofcontent.h"
#include "dialog/vfindreplacedialog.h"
#include "veditarea.h"
#include "vconstants.h"
#include "vwebview.h"
#include "vmdeditor.h"
#include "vmainwindow.h"
#include "vsnippet.h"
#include "vinsertselector.h"
#include "vsnippetlist.h"
#include "vlivepreviewhelper.h"
#include "vmathjaxinplacepreviewhelper.h"
extern VMainWindow *g_mainWin;
extern VConfigManager *g_config;
VMdTab::VMdTab(VFile *p_file, VEditArea *p_editArea,
OpenFileMode p_mode, QWidget *p_parent)
: VEditTab(p_file, p_editArea, p_parent),
m_editor(NULL),
m_webViewer(NULL),
m_document(NULL),
m_mdConType(g_config->getMdConverterType()),
m_enableHeadingSequence(false),
m_backupFileChecked(false),
m_mode(Mode::InvalidMode),
m_livePreviewHelper(NULL),
m_mathjaxPreviewHelper(NULL)
{
V_ASSERT(m_file->getDocType() == DocType::Markdown);
m_file->open();
HeadingSequenceType headingSequenceType = g_config->getHeadingSequenceType();
if (headingSequenceType == HeadingSequenceType::Enabled) {
m_enableHeadingSequence = true;
} else if (headingSequenceType == HeadingSequenceType::EnabledNoteOnly
&& m_file->getType() == FileType::Note) {
m_enableHeadingSequence = true;
}
setupUI();
m_backupTimer = new QTimer(this);
m_backupTimer->setSingleShot(true);
m_backupTimer->setInterval(g_config->getFileTimerInterval());
connect(m_backupTimer, &QTimer::timeout,
this, [this]() {
writeBackupFile();
});
m_livePreviewTimer = new QTimer(this);
m_livePreviewTimer->setSingleShot(true);
m_livePreviewTimer->setInterval(500);
connect(m_livePreviewTimer, &QTimer::timeout,
this, [this]() {
QString text = m_webViewer->selectedText();
if (text.isEmpty()) {
return;
}
const LivePreviewInfo &info = m_livePreviewHelper->getLivePreviewInfo();
if (info.isValid()) {
m_editor->findTextInRange(text,
FindOption::CaseSensitive,
true,
info.m_startPos,
info.m_endPos);
}
});
if (p_mode == OpenFileMode::Edit) {
showFileEditMode();
} else {
showFileReadMode();
}
}
void VMdTab::setupUI()
{
m_splitter = new QSplitter(this);
m_splitter->setOrientation(Qt::Horizontal);
setupMarkdownViewer();
// Setup editor when we really need it.
m_editor = NULL;
QVBoxLayout *layout = new QVBoxLayout();
layout->addWidget(m_splitter);
layout->setContentsMargins(0, 0, 0, 0);
setLayout(layout);
}
void VMdTab::showFileReadMode()
{
m_isEditMode = false;
// Will recover the header when web side is ready.
m_headerFromEditMode = m_currentHeader;
updateWebView();
setCurrentMode(Mode::Read);
clearSearchedWordHighlight();
updateStatus();
}
void VMdTab::updateWebView()
{
if (m_mdConType == MarkdownConverterType::Hoedown) {
viewWebByConverter();
} else {
m_document->updateText();
updateOutlineFromHtml(m_document->getToc());
}
}
bool VMdTab::scrollWebViewToHeader(const VHeaderPointer &p_header)
{
if (!m_outline.isMatched(p_header)
|| m_outline.getType() != VTableOfContentType::Anchor) {
return false;
}
if (p_header.isValid()) {
const VTableOfContentItem *item = m_outline.getItem(p_header);
if (item) {
if (item->m_anchor.isEmpty()) {
return false;
}
m_currentHeader = p_header;
m_document->scrollToAnchor(item->m_anchor);
} else {
return false;
}
} else {
if (m_outline.isEmpty()) {
// Let it be.
m_currentHeader = p_header;
} else {
// Scroll to top.
m_currentHeader = p_header;
m_document->scrollToAnchor("");
}
}
emit currentHeaderChanged(m_currentHeader);
return true;
}
bool VMdTab::scrollEditorToHeader(const VHeaderPointer &p_header, bool p_force)
{
if (!m_outline.isMatched(p_header)
|| m_outline.getType() != VTableOfContentType::BlockNumber) {
return false;
}
VMdEditor *mdEdit = getEditor();
int blockNumber = -1;
if (p_header.isValid()) {
const VTableOfContentItem *item = m_outline.getItem(p_header);
if (item) {
blockNumber = item->m_blockNumber;
if (blockNumber == -1) {
// Empty item.
return false;
}
} else {
return false;
}
} else {
if (m_outline.isEmpty()) {
// No outline and scroll to -1 index.
// Just let it be.
m_currentHeader = p_header;
return true;
} else {
// Has outline and scroll to -1 index.
// Scroll to top.
blockNumber = 0;
}
}
// If the cursor are now under the right title, we should not change it right at
// the title.
if (!p_force) {
int curBlockNumber = mdEdit->textCursor().block().blockNumber();
if (m_outline.indexOfItemByBlockNumber(curBlockNumber)
== m_outline.indexOfItemByBlockNumber(blockNumber)) {
m_currentHeader = p_header;
return true;
}
}
if (mdEdit->scrollToHeader(blockNumber)) {
m_currentHeader = p_header;
return true;
} else {
return false;
}
}
bool VMdTab::scrollToHeaderInternal(const VHeaderPointer &p_header)
{
if (m_isEditMode) {
return scrollEditorToHeader(p_header);
} else {
return scrollWebViewToHeader(p_header);
}
}
void VMdTab::viewWebByConverter()
{
VMarkdownConverter mdConverter;
QString toc;
QString html = mdConverter.generateHtml(m_file->getContent(),
g_config->getMarkdownExtensions(),
toc);
m_document->setHtml(html);
updateOutlineFromHtml(toc);
}
void VMdTab::showFileEditMode()
{
VHeaderPointer header(m_currentHeader);
m_isEditMode = true;
VMdEditor *mdEdit = getEditor();
setCurrentMode(Mode::Edit);
mdEdit->beginEdit();
// If editor is not init, we need to wait for it to init headers.
// Generally, beginEdit() will generate the headers. Wait is needed when
// highlight completion is going to re-generate the headers.
int nrRetry = 10;
while (header.m_index > -1
&& nrRetry-- > 0
&& (m_outline.isEmpty() || m_outline.getType() != VTableOfContentType::BlockNumber)) {
qDebug() << "wait another 100 ms for editor's headers ready";
VUtils::sleepWait(100);
}
scrollEditorToHeader(header, false);
mdEdit->setFocus();
}
bool VMdTab::closeFile(bool p_forced)
{
if (p_forced && m_isEditMode) {
// Discard buffer content
Q_ASSERT(m_editor);
m_editor->reloadFile();
m_editor->endEdit();
showFileReadMode();
} else {
readFile();
}
return !m_isEditMode;
}
void VMdTab::editFile()
{
if (m_isEditMode) {
return;
}
showFileEditMode();
}
void VMdTab::readFile(bool p_discard)
{
if (!m_isEditMode) {
return;
}
if (m_editor && isModified()) {
// Prompt to save the changes.
bool modifiable = m_file->isModifiable();
int ret = VUtils::showMessage(QMessageBox::Information, tr("Information"),
tr("Note <span style=\"%1\">%2</span> has been modified.")
.arg(g_config->c_dataTextStyle).arg(m_file->getName()),
tr("Do you want to save your changes?"),
modifiable ? (QMessageBox::Save
| QMessageBox::Discard
| QMessageBox::Cancel)
: (QMessageBox::Discard
| QMessageBox::Cancel),
modifiable ? (p_discard ? QMessageBox::Discard: QMessageBox::Save)
: QMessageBox::Cancel,
this);
switch (ret) {
case QMessageBox::Save:
if (!saveFile()) {
return;
}
V_FALLTHROUGH;
case QMessageBox::Discard:
m_editor->reloadFile();
break;
case QMessageBox::Cancel:
// Nothing to do if user cancel this action
return;
default:
qWarning() << "wrong return value from QMessageBox:" << ret;
return;
}
}
if (m_editor) {
m_editor->endEdit();
}
showFileReadMode();
}
bool VMdTab::saveFile()
{
if (!m_isEditMode) {
return true;
}
Q_ASSERT(m_editor);
if (!isModified()) {
return true;
}
QString filePath = m_file->fetchPath();
if (!m_file->isModifiable()) {
VUtils::showMessage(QMessageBox::Warning,
tr("Warning"),
tr("Could not modify a read-only note <span style=\"%1\">%2</span>.")
.arg(g_config->c_dataTextStyle).arg(filePath),
tr("Please save your changes to other notes manually."),
QMessageBox::Ok,
QMessageBox::Ok,
this);
return false;
}
bool ret = true;
// Make sure the file already exists. Temporary deal with cases when user delete or move
// a file.
if (!QFileInfo::exists(filePath)) {
qWarning() << filePath << "being written has been removed";
VUtils::showMessage(QMessageBox::Warning, tr("Warning"), tr("Fail to save note."),
tr("File <span style=\"%1\">%2</span> being written has been removed.")
.arg(g_config->c_dataTextStyle).arg(filePath),
QMessageBox::Ok, QMessageBox::Ok, this);
ret = false;
} else {
m_checkFileChange = false;
m_editor->saveFile();
ret = m_file->save();
if (!ret) {
VUtils::showMessage(QMessageBox::Warning,
tr("Warning"),
tr("Fail to save note."),
tr("Fail to write to disk when saving a note. Please try it again."),
QMessageBox::Ok,
QMessageBox::Ok,
this);
m_editor->setModified(true);
} else {
m_fileDiverged = false;
m_checkFileChange = true;
}
}
updateStatus();
return ret;
}
bool VMdTab::isModified() const
{
return (m_editor ? m_editor->isModified() : false) || m_fileDiverged;
}
void VMdTab::saveAndRead()
{
saveFile();
readFile();
}
void VMdTab::discardAndRead()
{
readFile();
}
void VMdTab::setupMarkdownViewer()
{
m_webViewer = new VWebView(m_file, this);
connect(m_webViewer, &VWebView::editNote,
this, &VMdTab::editFile);
connect(m_webViewer, &VWebView::requestSavePage,
this, &VMdTab::handleSavePageRequested);
connect(m_webViewer, &VWebView::selectionChanged,
this, &VMdTab::handleWebSelectionChanged);
connect(m_webViewer, &VWebView::requestExpandRestorePreviewArea,
this, &VMdTab::expandRestorePreviewArea);
VPreviewPage *page = new VPreviewPage(m_webViewer);
m_webViewer->setPage(page);
m_webViewer->setZoomFactor(g_config->getWebZoomFactor());
connect(page->profile(), &QWebEngineProfile::downloadRequested,
this, &VMdTab::handleDownloadRequested);
connect(page, &QWebEnginePage::linkHovered,
this, &VMdTab::statusMessage);
// Avoid white flash before loading content.
page->setBackgroundColor(Qt::transparent);
m_document = new VDocument(m_file, m_webViewer);
m_documentID = m_document->registerIdentifier();
QWebChannel *channel = new QWebChannel(m_webViewer);
channel->registerObject(QStringLiteral("content"), m_document);
connect(m_document, &VDocument::tocChanged,
this, &VMdTab::updateOutlineFromHtml);
connect(m_document, SIGNAL(headerChanged(const QString &)),
this, SLOT(updateCurrentHeader(const QString &)));
connect(m_document, &VDocument::keyPressed,
this, &VMdTab::handleWebKeyPressed);
connect(m_document, &VDocument::logicsFinished,
this, [this]() {
if (m_ready & TabReady::ReadMode) {
// Recover header from edit mode.
scrollWebViewToHeader(m_headerFromEditMode);
m_headerFromEditMode.clear();
m_document->muteWebView(false);
return;
}
m_ready |= TabReady::ReadMode;
tabIsReady(TabReady::ReadMode);
});
connect(m_document, &VDocument::textToHtmlFinished,
this, [this](int p_identitifer, int p_id, int p_timeStamp, const QString &p_html) {
Q_ASSERT(m_editor);
if (m_documentID != p_identitifer) {
return;
}
m_editor->textToHtmlFinished(p_id, p_timeStamp, m_webViewer->url(), p_html);
});
connect(m_document, &VDocument::htmlToTextFinished,
this, [this](int p_identitifer, int p_id, int p_timeStamp, const QString &p_text) {
Q_ASSERT(m_editor);
if (m_documentID != p_identitifer) {
return;
}
m_editor->htmlToTextFinished(p_id, p_timeStamp, p_text);
});
connect(m_document, &VDocument::wordCountInfoUpdated,
this, [this]() {
VEditTabInfo info = fetchTabInfo(VEditTabInfo::InfoType::All);
if (m_isEditMode) {
info.m_wordCountInfo = m_document->getWordCountInfo();
}
emit statusUpdated(info);
});
page->setWebChannel(channel);
m_webViewer->setHtml(VUtils::generateHtmlTemplate(m_mdConType),
m_file->getBaseUrl());
m_splitter->addWidget(m_webViewer);
}
void VMdTab::setupMarkdownEditor()
{
Q_ASSERT(!m_editor);
m_editor = new VMdEditor(m_file,
m_document,
m_mdConType,
m_editArea->getCompleter(),
this);
m_editor->setProperty("MainEditor", true);
m_editor->setEditTab(this);
int delta = g_config->getEditorZoomDelta();
if (delta > 0) {
m_editor->zoomInW(delta);
} else if (delta < 0) {
m_editor->zoomOutW(-delta);
}
connect(m_editor, &VMdEditor::headersChanged,
this, &VMdTab::updateOutlineFromHeaders);
connect(m_editor, SIGNAL(currentHeaderChanged(int)),
this, SLOT(updateCurrentHeader(int)));
connect(m_editor, &VMdEditor::statusChanged,
this, &VMdTab::updateStatus);
connect(m_editor, &VMdEditor::textChanged,
this, &VMdTab::updateStatus);
connect(g_mainWin, &VMainWindow::editorConfigUpdated,
m_editor, &VMdEditor::updateConfig);
connect(m_editor->object(), &VEditorObject::cursorPositionChanged,
this, &VMdTab::updateCursorStatus);
connect(m_editor->object(), &VEditorObject::saveAndRead,
this, &VMdTab::saveAndRead);
connect(m_editor->object(), &VEditorObject::discardAndRead,
this, &VMdTab::discardAndRead);
connect(m_editor->object(), &VEditorObject::saveNote,
this, &VMdTab::saveFile);
connect(m_editor->object(), &VEditorObject::statusMessage,
this, &VEditTab::statusMessage);
connect(m_editor->object(), &VEditorObject::vimStatusUpdated,
this, &VEditTab::vimStatusUpdated);
connect(m_editor->object(), &VEditorObject::requestCloseFindReplaceDialog,
this, [this]() {
this->m_editArea->getFindReplaceDialog()->closeDialog();
});
connect(m_editor->object(), &VEditorObject::ready,
this, [this]() {
if (m_ready & TabReady::EditMode) {
return;
}
m_ready |= TabReady::EditMode;
tabIsReady(TabReady::EditMode);
});
connect(m_editor, &VMdEditor::requestTextToHtml,
this, &VMdTab::textToHtmlViaWebView);
connect(m_editor, &VMdEditor::requestHtmlToText,
this, &VMdTab::htmlToTextViaWebView);
if (m_editor->getVim()) {
connect(m_editor->getVim(), &VVim::commandLineTriggered,
this, [this](VVim::CommandLineType p_type) {
if (m_isEditMode) {
emit triggerVimCmd(p_type);
}
});
}
enableHeadingSequence(m_enableHeadingSequence);
m_editor->reloadFile();
m_splitter->insertWidget(0, m_editor);
m_livePreviewHelper = new VLivePreviewHelper(m_editor, m_document, this);
connect(m_editor->getMarkdownHighlighter(), &PegMarkdownHighlighter::codeBlocksUpdated,
m_livePreviewHelper, &VLivePreviewHelper::updateCodeBlocks);
connect(m_editor->getPreviewManager(), &VPreviewManager::previewEnabledChanged,
m_livePreviewHelper, &VLivePreviewHelper::setInplacePreviewEnabled);
connect(m_livePreviewHelper, &VLivePreviewHelper::inplacePreviewCodeBlockUpdated,
m_editor->getPreviewManager(), &VPreviewManager::updateCodeBlocks);
connect(m_livePreviewHelper, &VLivePreviewHelper::checkBlocksForObsoletePreview,
m_editor->getPreviewManager(), &VPreviewManager::checkBlocksForObsoletePreview);
m_livePreviewHelper->setInplacePreviewEnabled(m_editor->getPreviewManager()->isPreviewEnabled());
m_mathjaxPreviewHelper = new VMathJaxInplacePreviewHelper(m_editor, m_document, this);
connect(m_editor->getMarkdownHighlighter(), &PegMarkdownHighlighter::mathjaxBlocksUpdated,
m_mathjaxPreviewHelper, &VMathJaxInplacePreviewHelper::updateMathjaxBlocks);
connect(m_editor->getPreviewManager(), &VPreviewManager::previewEnabledChanged,
m_mathjaxPreviewHelper, &VMathJaxInplacePreviewHelper::setEnabled);
connect(m_mathjaxPreviewHelper, &VMathJaxInplacePreviewHelper::inplacePreviewMathjaxBlockUpdated,
m_editor->getPreviewManager(), &VPreviewManager::updateMathjaxBlocks);
connect(m_mathjaxPreviewHelper, &VMathJaxInplacePreviewHelper::checkBlocksForObsoletePreview,
m_editor->getPreviewManager(), &VPreviewManager::checkBlocksForObsoletePreview);
m_mathjaxPreviewHelper->setEnabled(m_editor->getPreviewManager()->isPreviewEnabled());
}
void VMdTab::updateOutlineFromHtml(const QString &p_tocHtml)
{
if (m_isEditMode) {
return;
}
m_outline.clear();
if (m_outline.parseTableFromHtml(p_tocHtml)) {
m_outline.setFile(m_file);
m_outline.setType(VTableOfContentType::Anchor);
}
m_currentHeader.reset();
emit outlineChanged(m_outline);
}
void VMdTab::updateOutlineFromHeaders(const QVector<VTableOfContentItem> &p_headers)
{
if (!m_isEditMode) {
return;
}
m_outline.update(m_file,
p_headers,
VTableOfContentType::BlockNumber);
m_currentHeader.reset();
emit outlineChanged(m_outline);
}
void VMdTab::scrollToHeader(const VHeaderPointer &p_header)
{
if (m_outline.isMatched(p_header)) {
// Scroll only when @p_header is valid.
scrollToHeaderInternal(p_header);
}
}
void VMdTab::updateCurrentHeader(const QString &p_anchor)
{
if (m_isEditMode) {
return;
}
// Find the index of the anchor in outline.
int idx = m_outline.indexOfItemByAnchor(p_anchor);
m_currentHeader.update(m_file, idx);
emit currentHeaderChanged(m_currentHeader);
}
void VMdTab::updateCurrentHeader(int p_blockNumber)
{
if (!m_isEditMode) {
return;
}
// Find the index of the block number in outline.
int idx = m_outline.indexOfItemByBlockNumber(p_blockNumber);
m_currentHeader.update(m_file, idx);
emit currentHeaderChanged(m_currentHeader);
}
void VMdTab::insertImage()
{
if (!m_isEditMode) {
return;
}
Q_ASSERT(m_editor);
m_editor->insertImage();
}
void VMdTab::insertLink()
{
if (!m_isEditMode) {
return;
}
Q_ASSERT(m_editor);
m_editor->insertLink();
}
void VMdTab::findText(const QString &p_text, uint p_options, bool p_peek,
bool p_forward)
{
if (m_isEditMode) {
Q_ASSERT(m_editor);
if (p_peek) {
m_editor->peekText(p_text, p_options);
} else {
m_editor->findText(p_text, p_options, p_forward);
}
} else {
findTextInWebView(p_text, p_options, p_peek, p_forward);
}
}
void VMdTab::replaceText(const QString &p_text, uint p_options,
const QString &p_replaceText, bool p_findNext)
{
if (m_isEditMode) {
Q_ASSERT(m_editor);
m_editor->replaceText(p_text, p_options, p_replaceText, p_findNext);
}
}
void VMdTab::replaceTextAll(const QString &p_text, uint p_options,
const QString &p_replaceText)
{
if (m_isEditMode) {
Q_ASSERT(m_editor);
m_editor->replaceTextAll(p_text, p_options, p_replaceText);
}
}
void VMdTab::findTextInWebView(const QString &p_text, uint p_options,
bool /* p_peek */, bool p_forward)
{
V_ASSERT(m_webViewer);
QWebEnginePage::FindFlags flags;
if (p_options & FindOption::CaseSensitive) {
flags |= QWebEnginePage::FindCaseSensitively;
}
if (!p_forward) {
flags |= QWebEnginePage::FindBackward;
}
m_webViewer->findText(p_text, flags);
}
QString VMdTab::getSelectedText() const
{
if (m_isEditMode) {
Q_ASSERT(m_editor);
QTextCursor cursor = m_editor->textCursor();
return cursor.selectedText();
} else {
return m_webViewer->selectedText();
}
}
void VMdTab::clearSearchedWordHighlight()
{
if (m_webViewer) {
m_webViewer->findText("");
}
if (m_editor) {
m_editor->clearSearchedWordHighlight();
}
}
void VMdTab::handleWebKeyPressed(int p_key, bool p_ctrl, bool p_shift, bool p_meta)
{
V_ASSERT(m_webViewer);
#if defined(Q_OS_MACOS) || defined(Q_OS_MAC)
bool macCtrl = p_meta;
#else
Q_UNUSED(p_meta);
bool macCtrl = false;
#endif
switch (p_key) {
// Esc
case 27:
m_editArea->getFindReplaceDialog()->closeDialog();
break;
// Dash
case 189:
if (p_ctrl || macCtrl) {
// Zoom out.
zoomWebPage(false);
}
break;
// Equal
case 187:
if (p_ctrl || macCtrl) {
// Zoom in.
zoomWebPage(true);
}
break;
// 0
case 48:
if (p_ctrl || macCtrl) {
// Recover zoom.
m_webViewer->setZoomFactor(1);
}
break;
// / or ?
case 191:
if (!p_ctrl) {
VVim::CommandLineType type = VVim::CommandLineType::SearchForward;
if (p_shift) {
// ?, search backward.
type = VVim::CommandLineType::SearchBackward;
}
emit triggerVimCmd(type);
}
break;
// :
case 186:
if (!p_ctrl && p_shift) {
VVim::CommandLineType type = VVim::CommandLineType::Command;
emit triggerVimCmd(type);
}
break;
// n or N
case 78:
if (!p_ctrl) {
if (!m_lastSearchItem.isEmpty()) {
bool forward = !p_shift;
findTextInWebView(m_lastSearchItem.m_text,
m_lastSearchItem.m_options,
false,
forward ? m_lastSearchItem.m_forward : !m_lastSearchItem.m_forward);
}
}
break;
default:
break;
}
}
void VMdTab::zoom(bool p_zoomIn, qreal p_step)
{
if (!m_isEditMode || m_mode == Mode::EditPreview) {
zoomWebPage(p_zoomIn, p_step);
}
}
void VMdTab::zoomWebPage(bool p_zoomIn, qreal p_step)
{
V_ASSERT(m_webViewer);
qreal curFactor = m_webViewer->zoomFactor();
qreal newFactor = p_zoomIn ? curFactor + p_step : curFactor - p_step;
if (newFactor < c_webZoomFactorMin) {
newFactor = c_webZoomFactorMin;
} else if (newFactor > c_webZoomFactorMax) {
newFactor = c_webZoomFactorMax;
}
m_webViewer->setZoomFactor(newFactor);
}
VWebView *VMdTab::getWebViewer() const
{
return m_webViewer;
}
MarkdownConverterType VMdTab::getMarkdownConverterType() const
{
return m_mdConType;
}
void VMdTab::focusChild()
{
if (m_mode == Mode::Read) {
m_webViewer->setFocus();
} else {
m_editor->setFocus();
}
}
void VMdTab::requestUpdateVimStatus()
{
if (m_editor) {
m_editor->requestUpdateVimStatus();
} else {
emit vimStatusUpdated(NULL);
}
}
VEditTabInfo VMdTab::fetchTabInfo(VEditTabInfo::InfoType p_type) const
{
VEditTabInfo info = VEditTab::fetchTabInfo(p_type);
if (m_editor) {
QTextCursor cursor = m_editor->textCursor();
info.m_cursorBlockNumber = cursor.block().blockNumber();
info.m_cursorPositionInBlock = cursor.positionInBlock();
info.m_blockCount = m_editor->document()->blockCount();
}
if (m_isEditMode) {
if (m_editor) {
// We do not get the full word count info in edit mode.
info.m_wordCountInfo.m_mode = VWordCountInfo::Edit;
info.m_wordCountInfo.m_charWithSpacesCount = m_editor->document()->characterCount() - 1;
}
} else {
info.m_wordCountInfo = m_document->getWordCountInfo();
}
info.m_headerIndex = m_currentHeader.m_index;
return info;
}
void VMdTab::decorateText(TextDecoration p_decoration, int p_level)
{
if (m_editor) {
m_editor->decorateText(p_decoration, p_level);
}
}
bool VMdTab::restoreFromTabInfo(const VEditTabInfo &p_info)
{
if (p_info.m_editTab != this) {
return false;
}
bool ret = false;
// Restore cursor position.
if (m_isEditMode
&& m_editor
&& p_info.m_cursorBlockNumber > -1
&& p_info.m_cursorPositionInBlock > -1) {
ret = m_editor->setCursorPosition(p_info.m_cursorBlockNumber, p_info.m_cursorPositionInBlock);
}
// Restore header.
if (!ret) {
VHeaderPointer header(m_file, p_info.m_headerIndex);
ret = scrollToHeaderInternal(header);
}
return ret;
}
void VMdTab::restoreFromTabInfo()
{
restoreFromTabInfo(m_infoToRestore);
// Clear it anyway.
m_infoToRestore.clear();
}
void VMdTab::enableHeadingSequence(bool p_enabled)
{
m_enableHeadingSequence = p_enabled;
if (m_editor) {
VEditConfig &config = m_editor->getConfig();
config.m_enableHeadingSequence = m_enableHeadingSequence;
if (isEditMode()) {
m_editor->updateHeaderSequenceByConfigChange();
}
}
}
bool VMdTab::isHeadingSequenceEnabled() const
{
return m_enableHeadingSequence;
}
void VMdTab::evaluateMagicWords()
{
if (isEditMode() && m_file->isModifiable()) {
getEditor()->evaluateMagicWords();
}
}
void VMdTab::applySnippet(const VSnippet *p_snippet)
{
Q_ASSERT(p_snippet);
if (isEditMode()
&& m_file->isModifiable()
&& p_snippet->getType() == VSnippet::Type::PlainText) {
Q_ASSERT(m_editor);
QTextCursor cursor = m_editor->textCursor();
bool changed = p_snippet->apply(cursor);
if (changed) {
m_editor->setTextCursor(cursor);
m_editor->setVimMode(VimMode::Insert);
g_mainWin->showStatusMessage(tr("Snippet applied"));
focusTab();
}
} else {
g_mainWin->showStatusMessage(tr("Snippet %1 is not applicable").arg(p_snippet->getName()));
}
}
void VMdTab::applySnippet()
{
if (!isEditMode() || !m_file->isModifiable()) {
g_mainWin->showStatusMessage(tr("Snippets are not applicable"));
return;
}
QPoint pos(m_editor->cursorRect().bottomRight());
QMenu menu(this);
VInsertSelector *sel = prepareSnippetSelector(&menu);
if (!sel) {
g_mainWin->showStatusMessage(tr("No available snippets defined with shortcuts"));
return;
}
QWidgetAction *act = new QWidgetAction(&menu);
act->setDefaultWidget(sel);
connect(sel, &VInsertSelector::accepted,
this, [this, &menu]() {
QKeyEvent *escEvent = new QKeyEvent(QEvent::KeyPress, Qt::Key_Escape,
Qt::NoModifier);
QCoreApplication::postEvent(&menu, escEvent);
});
menu.addAction(act);
menu.exec(m_editor->mapToGlobal(pos));
QString chosenItem = sel->getClickedItem();
if (!chosenItem.isEmpty()) {
const VSnippet *snip = g_mainWin->getSnippetList()->getSnippet(chosenItem);
if (snip) {
applySnippet(snip);
}
}
}
static bool selectorItemCmp(const VInsertSelectorItem &p_a, const VInsertSelectorItem &p_b)
{
if (p_a.m_shortcut < p_b.m_shortcut) {
return true;
}
return false;
}
VInsertSelector *VMdTab::prepareSnippetSelector(QWidget *p_parent)
{
auto snippets = g_mainWin->getSnippetList()->getSnippets();
QVector<VInsertSelectorItem> items;
for (auto const & snip : snippets) {
if (!snip.getShortcut().isNull()) {
items.push_back(VInsertSelectorItem(snip.getName(),
snip.getName(),
snip.getShortcut()));
}
}
if (items.isEmpty()) {
return NULL;
}
// Sort items by shortcut.
std::sort(items.begin(), items.end(), selectorItemCmp);
VInsertSelector *sel = new VInsertSelector(7, items, p_parent);
return sel;
}
void VMdTab::reload()
{
// Reload editor.
if (m_editor) {
m_editor->reloadFile();
}
if (m_isEditMode) {
m_editor->endEdit();
m_editor->beginEdit();
updateStatus();
}
if (!m_isEditMode) {
updateWebView();
}
// Reload web viewer.
m_ready &= ~TabReady::ReadMode;
m_webViewer->reload();
if (!m_isEditMode) {
VUtils::sleepWait(500);
showFileReadMode();
}
}
void VMdTab::tabIsReady(TabReady p_mode)
{
bool isCurrentMode = (m_isEditMode && p_mode == TabReady::EditMode)
|| (!m_isEditMode && p_mode == TabReady::ReadMode);
if (isCurrentMode) {
if (p_mode == TabReady::ReadMode) {
m_document->muteWebView(false);
}
restoreFromTabInfo();
if (m_enableBackupFile
&& !m_backupFileChecked
&& m_file->isModifiable()) {
if (!checkPreviousBackupFile()) {
return;
}
}
}
if (m_enableBackupFile
&& m_file->isModifiable()
&& p_mode == TabReady::EditMode) {
// contentsChanged will be emitted even the content is not changed.
connect(m_editor->document(), &QTextDocument::contentsChange,
this, [this]() {
if (m_isEditMode) {
m_backupTimer->stop();
m_backupTimer->start();
}
});
}
if (m_editor
&& p_mode == TabReady::ReadMode
&& m_livePreviewHelper->isPreviewEnabled()) {
// Need to re-preview.
m_editor->getMarkdownHighlighter()->updateHighlight();
}
}
void VMdTab::writeBackupFile()
{
Q_ASSERT(m_enableBackupFile && m_file->isModifiable());
m_file->writeBackupFile(m_editor->getContent());
}
bool VMdTab::checkPreviousBackupFile()
{
m_backupFileChecked = true;
QString preFile = m_file->backupFileOfPreviousSession();
if (preFile.isEmpty()) {
return true;
}
QString backupContent = m_file->readBackupFile(preFile);
if (m_file->getContent() == backupContent) {
// Found backup file with identical content.
// Just discard the backup file.
VUtils::deleteFile(preFile);
return true;
}
QMessageBox box(QMessageBox::Warning,
tr("Backup File Found"),
tr("Found backup file <span style=\"%1\">%2</span> "
"when opening note <span style=\"%1\">%3</span>.")
.arg(g_config->c_dataTextStyle)
.arg(preFile)
.arg(m_file->fetchPath()),
QMessageBox::NoButton,
this);
QString info = tr("VNote may crash while editing this note before.<br/>"
"Please choose to recover from the backup file or delete it.<br/><br/>"
"Note file last modified: <span style=\"%1\">%2</span><br/>"
"Backup file last modified: <span style=\"%1\">%3</span>")
.arg(g_config->c_dataTextStyle)
.arg(VUtils::displayDateTime(QFileInfo(m_file->fetchPath()).lastModified()))
.arg(VUtils::displayDateTime(QFileInfo(preFile).lastModified()));
box.setInformativeText(info);
QPushButton *recoverBtn = box.addButton(tr("Recover From Backup File"), QMessageBox::YesRole);
box.addButton(tr("Discard Backup File"), QMessageBox::NoRole);
QPushButton *cancelBtn = box.addButton(tr("Cancel"), QMessageBox::RejectRole);
box.setDefaultButton(cancelBtn);
box.setTextInteractionFlags(Qt::TextSelectableByMouse);
box.exec();
QAbstractButton *btn = box.clickedButton();
if (btn == cancelBtn || !btn) {
// Close current tab.
emit closeRequested(this);
return false;
} else if (btn == recoverBtn) {
// Load content from the backup file.
if (!m_isEditMode) {
showFileEditMode();
}
Q_ASSERT(m_editor);
m_editor->setContent(backupContent, true);
updateStatus();
}
VUtils::deleteFile(preFile);
return true;
}
void VMdTab::updateCursorStatus()
{
emit statusUpdated(fetchTabInfo(VEditTabInfo::InfoType::Cursor));
}
void VMdTab::handleFileOrDirectoryChange(bool p_isFile, UpdateAction p_act)
{
// Reload the web view with new base URL.
m_headerFromEditMode = m_currentHeader;
m_webViewer->setHtml(VUtils::generateHtmlTemplate(m_mdConType),
m_file->getBaseUrl());
if (m_editor) {
m_editor->updateInitAndInsertedImages(p_isFile, p_act);
// Refresh the previewed images in edit mode.
m_editor->refreshPreview();
}
}
void VMdTab::textToHtmlViaWebView(const QString &p_text, int p_id, int p_timeStamp)
{
int maxRetry = 50;
while (!m_document->isReadyToTextToHtml() && maxRetry > 0) {
qDebug() << "wait for web side ready to convert text to HTML";
VUtils::sleepWait(100);
--maxRetry;
}
if (maxRetry == 0) {
qWarning() << "web side is not ready to convert text to HTML";
return;
}
m_document->textToHtmlAsync(m_documentID, p_id, p_timeStamp, p_text, true);
}
void VMdTab::htmlToTextViaWebView(const QString &p_html, int p_id, int p_timeStamp)
{
int maxRetry = 50;
while (!m_document->isReadyToTextToHtml() && maxRetry > 0) {
qDebug() << "wait for web side ready to convert HTML to text";
VUtils::sleepWait(100);
--maxRetry;
}
if (maxRetry == 0) {
qWarning() << "web side is not ready to convert HTML to text";
return;
}
m_document->htmlToTextAsync(m_documentID, p_id, p_timeStamp, p_html);
}
void VMdTab::handleVimCmdCommandCancelled()
{
if (m_isEditMode) {
VVim *vim = getEditor()->getVim();
if (vim) {
vim->processCommandLineCancelled();
}
}
}
void VMdTab::handleVimCmdCommandFinished(VVim::CommandLineType p_type, const QString &p_cmd)
{
if (m_isEditMode) {
VVim *vim = getEditor()->getVim();
if (vim) {
vim->processCommandLine(p_type, p_cmd);
}
} else {
if (p_type == VVim::CommandLineType::SearchForward
|| p_type == VVim::CommandLineType::SearchBackward) {
m_lastSearchItem = VVim::fetchSearchItem(p_type, p_cmd);
findTextInWebView(m_lastSearchItem.m_text,
m_lastSearchItem.m_options,
false,
m_lastSearchItem.m_forward);
} else {
executeVimCommandInWebView(p_cmd);
}
}
}
void VMdTab::handleVimCmdCommandChanged(VVim::CommandLineType p_type, const QString &p_cmd)
{
Q_UNUSED(p_type);
Q_UNUSED(p_cmd);
if (m_isEditMode) {
VVim *vim = getEditor()->getVim();
if (vim) {
vim->processCommandLineChanged(p_type, p_cmd);
}
} else {
if (p_type == VVim::CommandLineType::SearchForward
|| p_type == VVim::CommandLineType::SearchBackward) {
VVim::SearchItem item = VVim::fetchSearchItem(p_type, p_cmd);
findTextInWebView(item.m_text, item.m_options, true, item.m_forward);
}
}
}
QString VMdTab::handleVimCmdRequestNextCommand(VVim::CommandLineType p_type, const QString &p_cmd)
{
Q_UNUSED(p_type);
Q_UNUSED(p_cmd);
if (m_isEditMode) {
VVim *vim = getEditor()->getVim();
if (vim) {
return vim->getNextCommandHistory(p_type, p_cmd);
}
}
return QString();
}
QString VMdTab::handleVimCmdRequestPreviousCommand(VVim::CommandLineType p_type, const QString &p_cmd)
{
Q_UNUSED(p_type);
Q_UNUSED(p_cmd);
if (m_isEditMode) {
VVim *vim = getEditor()->getVim();
if (vim) {
return vim->getPreviousCommandHistory(p_type, p_cmd);
}
}
return QString();
}
QString VMdTab::handleVimCmdRequestRegister(int p_key, int p_modifiers)
{
Q_UNUSED(p_key);
Q_UNUSED(p_modifiers);
if (m_isEditMode) {
VVim *vim = getEditor()->getVim();
if (vim) {
return vim->readRegister(p_key, p_modifiers);
}
}
return QString();
}
bool VMdTab::executeVimCommandInWebView(const QString &p_cmd)
{
bool validCommand = true;
QString msg;
if (p_cmd.isEmpty()) {
return true;
} else if (p_cmd == "q") {
// :q, close the note.
emit closeRequested(this);
msg = tr("Quit");
} else if (p_cmd == "nohlsearch" || p_cmd == "noh") {
// :nohlsearch, clear highlight search.
m_webViewer->findText("");
} else {
validCommand = false;
}
if (!validCommand) {
g_mainWin->showStatusMessage(tr("Not an editor command: %1").arg(p_cmd));
} else {
g_mainWin->showStatusMessage(msg);
}
return validCommand;
}
void VMdTab::handleDownloadRequested(QWebEngineDownloadItem *p_item)
{
connect(p_item, &QWebEngineDownloadItem::stateChanged,
this, [p_item, this](QWebEngineDownloadItem::DownloadState p_state) {
QString msg;
switch (p_state) {
case QWebEngineDownloadItem::DownloadCompleted:
emit statusMessage(tr("Page saved to %1").arg(p_item->path()));
break;
case QWebEngineDownloadItem::DownloadCancelled:
case QWebEngineDownloadItem::DownloadInterrupted:
emit statusMessage(tr("Fail to save page to %1").arg(p_item->path()));
break;
default:
break;
}
});
}
void VMdTab::handleSavePageRequested()
{
static QString lastPath = g_config->getDocumentPathOrHomePath();
QStringList filters;
filters << tr("Single HTML (*.html)") << tr("Complete HTML (*.html)") << tr("MIME HTML (*.mht)");
QList<QWebEngineDownloadItem::SavePageFormat> formats;
formats << QWebEngineDownloadItem::SingleHtmlSaveFormat
<< QWebEngineDownloadItem::CompleteHtmlSaveFormat
<< QWebEngineDownloadItem::MimeHtmlSaveFormat;
QString selectedFilter = filters[1];
QString fileName = QFileDialog::getSaveFileName(this,
tr("Save Page"),
lastPath,
filters.join(";;"),
&selectedFilter);
if (fileName.isEmpty()) {
return;
}
lastPath = QFileInfo(fileName).path();
QWebEngineDownloadItem::SavePageFormat format = formats.at(filters.indexOf(selectedFilter));
qDebug() << "save page as" << format << "to" << fileName;
emit statusMessage(tr("Saving page to %1").arg(fileName));
m_webViewer->page()->save(fileName, format);
}
VWordCountInfo VMdTab::fetchWordCountInfo(bool p_editMode) const
{
if (p_editMode) {
if (m_editor) {
return m_editor->fetchWordCountInfo();
}
} else {
// Request to update with current text.
if (m_isEditMode) {
const_cast<VMdTab *>(this)->updateWebView();
}
return m_document->getWordCountInfo();
}
return VWordCountInfo();
}
void VMdTab::setCurrentMode(Mode p_mode)
{
if (m_mode == p_mode) {
return;
}
qreal factor = m_webViewer->zoomFactor();
if (m_mode == Mode::Read) {
m_readWebViewState->m_zoomFactor = factor;
} else if (m_mode == Mode::EditPreview) {
m_previewWebViewState->m_zoomFactor = factor;
m_livePreviewHelper->setLivePreviewEnabled(false);
}
m_mode = p_mode;
switch (p_mode) {
case Mode::Read:
if (m_editor) {
m_editor->hide();
}
m_webViewer->setInPreview(false);
m_webViewer->show();
// Fix the bug introduced by 051088be31dbffa3c04e2d382af15beec40d5fdb
// which replace QStackedLayout with QSplitter.
QCoreApplication::sendPostedEvents();
if (m_readWebViewState.isNull()) {
m_readWebViewState.reset(new WebViewState());
m_readWebViewState->m_zoomFactor = factor;
} else if (factor != m_readWebViewState->m_zoomFactor) {
m_webViewer->setZoomFactor(m_readWebViewState->m_zoomFactor);
}
m_document->setPreviewEnabled(false);
break;
case Mode::Edit:
m_document->muteWebView(true);
m_webViewer->hide();
m_editor->show();
QCoreApplication::sendPostedEvents();
break;
case Mode::EditPreview:
Q_ASSERT(m_editor);
m_document->muteWebView(true);
m_webViewer->setInPreview(true);
m_webViewer->show();
m_editor->show();
QCoreApplication::sendPostedEvents();
if (m_previewWebViewState.isNull()) {
m_previewWebViewState.reset(new WebViewState());
m_previewWebViewState->m_zoomFactor = factor;
// Init the size of two splits.
QList<int> sizes = m_splitter->sizes();
Q_ASSERT(sizes.size() == 2);
int a = (sizes[0] + sizes[1]) / 2;
if (a <= 0) {
a = 1;
}
int b = (sizes[0] + sizes[1]) - a;
QList<int> newSizes;
newSizes.append(a);
newSizes.append(b);
m_splitter->setSizes(newSizes);
} else if (factor != m_previewWebViewState->m_zoomFactor) {
m_webViewer->setZoomFactor(m_previewWebViewState->m_zoomFactor);
}
m_document->setPreviewEnabled(true);
m_livePreviewHelper->setLivePreviewEnabled(true);
m_editor->getMarkdownHighlighter()->updateHighlight();
break;
default:
break;
}
focusChild();
}
bool VMdTab::toggleLivePreview()
{
bool ret = false;
switch (m_mode) {
case Mode::EditPreview:
setCurrentMode(Mode::Edit);
ret = true;
break;
case Mode::Edit:
setCurrentMode(Mode::EditPreview);
ret = true;
break;
default:
break;
}
return ret;
}
void VMdTab::handleWebSelectionChanged()
{
if (m_mode != Mode::EditPreview
|| !(g_config->getSmartLivePreview() & SmartLivePreview::WebToEditor)) {
return;
}
m_livePreviewTimer->start();
}
bool VMdTab::expandRestorePreviewArea()
{
if (m_mode != Mode::EditPreview) {
return false;
}
if (m_editor->isVisible()) {
m_editor->hide();
m_webViewer->setFocus();
} else {
m_editor->show();
m_editor->setFocus();
}
return true;
}
| [
"[email protected]"
] | |
e13e59867394b968aef4f1eae54ec37ed3ed2ec3 | 8a274dffceab9d4e63fc0962e20fb7dab761555c | /CodeForce/A. Ultra-Fast Mathematician.cpp | b84942efa9e89eafda2a0712c640fbad8c6bf619 | [] | no_license | mkp0/CP | 669ce9ab399660d90d829f77b05f1462cd92ede5 | 80321819e46ebf4dd6512d6577add645da83708a | refs/heads/master | 2023-06-01T22:07:36.006530 | 2021-06-25T21:41:23 | 2021-06-25T21:41:23 | 273,572,017 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,621 | cpp | #include <bits/stdc++.h>
#define ll long long
#define pi (3.141592653589)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define vi vector<int>
#define pii pair<int, int>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mini(a, b, c) min(c, min(a, b))
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define MOD 1e9 + 7
using namespace std;
template <typename T>
using minpq = priority_queue<T, vector<T>, greater<T>>;
class Graph
{
int V;
list<int> *adj;
void DFSUtil(int v, bool visited[]);
public:
Graph(int V);
void addEdge(int v, int w);
void DFS(int v);
void BFS(int s);
};
Graph::Graph(int V)
{
this->V = V;
adj = new list<int>[V];
}
void Graph::addEdge(int v, int w)
{
adj[v].push_back(w);
}
void Graph::DFSUtil(int v, bool visited[])
{
visited[v] = true;
cout << v << " ";
list<int>::iterator i;
for (i = adj[v].begin(); i != adj[v].end(); ++i)
if (!visited[*i])
DFSUtil(*i, visited);
}
void Graph::DFS(int v)
{
bool *visited = new bool[V];
for (int i = 0; i < V; i++)
visited[i] = false;
DFSUtil(v, visited);
}
void Graph::BFS(int s)
{
bool *visited = new bool[V];
for (int i = 0; i < V; i++)
visited[i] = false;
list<int> queue;
visited[s] = true;
queue.push_back(s);
list<int>::iterator i;
while (!queue.empty())
{
s = queue.front();
cout << s << " ";
queue.pop_front();
for (i = adj[s].begin(); i != adj[s].end(); ++i)
{
if (!visited[*i])
{
visited[*i] = true;
queue.push_back(*i);
}
}
}
}
void SieveOfEratosthenes(int n)
{
bool prime[n + 1];
memset(prime, true, sizeof(prime));
for (int p = 2; p * p <= n; p++)
{
if (prime[p] == true)
{
for (int i = p * p; i <= n; i += p)
prime[i] = false;
}
}
for (int p = 2; p <= n; p++)
if (prime[p])
cout << p << " ";
}
void merge(int arr[], int l, int m, int r)
{
int i, j, k;
int n1 = m - l + 1;
int n2 = r - m;
int L[n1], R[n2];
for (i = 0; i < n1; i++)
L[i] = arr[l + i];
for (j = 0; j < n2; j++)
R[j] = arr[m + 1 + j];
i = 0; // Initial index of first subarray
j = 0; // Initial index of second subarray
k = l; // Initial index of merged subarray
while (i < n1 && j < n2)
{
if (L[i] <= R[j])
{
arr[k] = L[i];
i++;
}
else
{
arr[k] = R[j];
j++;
}
k++;
}
while (i < n1)
{
arr[k] = L[i];
i++;
k++;
}
while (j < n2)
{
arr[k] = R[j];
j++;
k++;
}
}
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l)
{
int mid = l + (r - l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, mid - 1, x);
return binarySearch(arr, mid + 1, r, x);
}
return -1;
}
void solve()
{
string a, b;
int i = 0;
cin >> a >> b;
for (int i = 0; i < a.size(); i++)
{
if (a[i] ^ b[i])
{
cout << 1;
}
else
{
cout << 0;
}
}
}
int32_t main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
solve();
} | [
"[email protected]"
] | |
cb3425fe3f5ce8133e0f5ab6f43bf835b3076dcb | 6c945f5861276389d565fc2326ddfd069f61e6a9 | /src/boost/spirit/home/phoenix/operator/detail/io.hpp | a487e2c48570f06f84cee903094698098f3dfd6c | [] | no_license | Springhead/dependency | 3f78387d2a50439ce2edf7790a296026c6012fa3 | 05d4e6f9a3e9c21aae8db4b47573aa34058c4705 | refs/heads/master | 2023-04-23T23:40:13.402639 | 2021-05-08T05:55:22 | 2021-05-08T05:55:22 | 112,149,782 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,353 | hpp | /*=============================================================================
Copyright (c) 2001-2007 Joel de Guzman
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
==============================================================================*/
#ifndef PHOENIX_OPERATOR_DETAIL_IO_HPP
#define PHOENIX_OPERATOR_DETAIL_IO_HPP
#include <boost/spirit/home/phoenix/operator/bitwise.hpp>
#include <boost/spirit/home/phoenix/core/reference.hpp>
#include <boost/utility/addressof.hpp>
#include <boost/utility/enable_if.hpp>
#include <iostream>
namespace boost { namespace phoenix { namespace detail
{
typedef char(&no)[1];
typedef char(&yes)[2];
template <typename CharType, typename CharTrait>
yes ostream_test(std::basic_ostream<CharType, CharTrait>*);
no ostream_test(...);
template <typename CharType, typename CharTrait>
yes istream_test(std::basic_istream<CharType, CharTrait>*);
no istream_test(...);
template <typename T>
struct is_ostream
{
static T x;
BOOST_STATIC_CONSTANT(bool,
value = sizeof(detail::ostream_test(boost::addressof(x))) == sizeof(yes));
};
template <typename T>
struct is_istream
{
static T x;
BOOST_STATIC_CONSTANT(bool,
value = sizeof(detail::istream_test(boost::addressof(x))) == sizeof(yes));
};
template <typename T0, typename T1>
struct enable_if_ostream :
enable_if<
detail::is_ostream<T0>
, actor<
typename as_composite<
shift_left_eval
, actor<reference<T0> >
, actor<T1>
>::type
>
>
{};
template <typename T0, typename T1>
struct enable_if_istream :
enable_if<
detail::is_istream<T0>
, actor<
typename as_composite<
shift_right_eval
, actor<reference<T0> >
, actor<T1>
>::type
>
>
{};
typedef std::ios_base& (*iomanip_type)(std::ios_base&);
typedef std::istream& (*imanip_type)(std::istream&);
typedef std::ostream& (*omanip_type)(std::ostream&);
}}}
#endif
| [
"[email protected]"
] | |
a4e13f7680d404c8ee4adb637b6e92efb9412901 | b28305dab0be0e03765c62b97bcd7f49a4f8073d | /chrome/browser/printing/cloud_print/gcd_api_flow.h | 3961f35dde66f2909f7d678c215112ab8ae07fe7 | [
"BSD-3-Clause"
] | permissive | svarvel/browser-android-tabs | 9e5e27e0a6e302a12fe784ca06123e5ce090ced5 | bd198b4c7a1aca2f3e91f33005d881f42a8d0c3f | refs/heads/base-72.0.3626.105 | 2020-04-24T12:16:31.442851 | 2019-08-02T19:15:36 | 2019-08-02T19:15:36 | 171,950,555 | 1 | 2 | NOASSERTION | 2019-08-02T19:15:37 | 2019-02-21T21:47:44 | null | UTF-8 | C++ | false | false | 2,724 | h | // Copyright 2014 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef CHROME_BROWSER_PRINTING_CLOUD_PRINT_GCD_API_FLOW_H_
#define CHROME_BROWSER_PRINTING_CLOUD_PRINT_GCD_API_FLOW_H_
#include <memory>
#include <string>
#include <vector>
#include "base/bind.h"
#include "base/callback.h"
#include "base/macros.h"
#include "base/memory/scoped_refptr.h"
#include "google_apis/gaia/oauth2_token_service.h"
#include "net/traffic_annotation/network_traffic_annotation.h"
namespace base {
class DictionaryValue;
}
namespace identity {
class IdentityManager;
}
namespace network {
class SharedURLLoaderFactory;
}
namespace cloud_print {
// API flow for communicating with cloud print and cloud devices.
class GCDApiFlow {
public:
// TODO(noamsml): Better error model for this class.
enum Status {
SUCCESS,
ERROR_TOKEN,
ERROR_NETWORK,
ERROR_HTTP_CODE,
ERROR_FROM_SERVER,
ERROR_MALFORMED_RESPONSE
};
// Provides GCDApiFlowImpl with parameters required to make request.
// Parses results of requests.
class Request {
public:
enum NetworkTrafficAnnotation {
TYPE_SEARCH,
TYPE_PRIVET_REGISTER,
};
virtual ~Request();
// Called if the API flow fails.
virtual void OnGCDApiFlowError(Status status) = 0;
// Called when the API flow finishes.
virtual void OnGCDApiFlowComplete(const base::DictionaryValue& value) = 0;
// Returns the URL for this request.
virtual GURL GetURL() = 0;
// Returns the scope parameter for use with OAuth.
virtual std::string GetOAuthScope() = 0;
// Returns extra headers, if any, to send with this request.
virtual std::vector<std::string> GetExtraRequestHeaders() = 0;
// Returns the network traffic annotation tag for this request.
virtual NetworkTrafficAnnotation GetNetworkTrafficAnnotationType() = 0;
};
GCDApiFlow();
virtual ~GCDApiFlow();
static std::unique_ptr<GCDApiFlow> Create(
scoped_refptr<network::SharedURLLoaderFactory> url_loader_factory,
identity::IdentityManager* identity_manager);
virtual void Start(std::unique_ptr<Request> request) = 0;
private:
DISALLOW_COPY_AND_ASSIGN(GCDApiFlow);
};
class CloudPrintApiFlowRequest : public GCDApiFlow::Request {
public:
CloudPrintApiFlowRequest();
~CloudPrintApiFlowRequest() override;
// GCDApiFlowRequest implementation
std::string GetOAuthScope() override;
std::vector<std::string> GetExtraRequestHeaders() override;
private:
DISALLOW_COPY_AND_ASSIGN(CloudPrintApiFlowRequest);
};
} // namespace cloud_print
#endif // CHROME_BROWSER_PRINTING_CLOUD_PRINT_GCD_API_FLOW_H_
| [
"[email protected]"
] | |
9ebeba03be014a5cd3ab8bd481318821eceab4dc | 1ce740051a6420616f0fc5eb471193dd9643a818 | /psdaq/psdaq/eb/tstNthSet.cc | ee6f6dc7835f3e61513f7bdd45962a3ed7f42d72 | [
"BSD-2-Clause",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | slac-lcls/lcls2 | 25405bd81f8b61b3aa035e4da856402e630afb28 | 7f0401960ceb46551fd926d932c59e96297df6b0 | refs/heads/master | 2023-08-22T17:29:44.193939 | 2023-08-21T20:56:18 | 2023-08-21T20:56:18 | 94,483,750 | 19 | 32 | NOASSERTION | 2023-07-27T01:59:45 | 2017-06-15T22:31:15 | Python | UTF-8 | C++ | false | false | 1,482 | cc | #ifdef NDEBUG
# undef NDEBUG
#endif
#include <cassert>
#include <cstdint>
#include <x86intrin.h>
#include <stdio.h>
inline uint64_t nthset(uint64_t x, unsigned n) {
return _pdep_u64(1ULL << n, x);
}
int main() {
for (unsigned i = 0; i < 64; ++i)
{
uint64_t x = -1ul; //1ul << i;
uint64_t v = nthset(x, i); //0);
int b = __builtin_ffsl(v) - 1;
printf("i = %d, x = %016lx, v = %016lx, Nth bit = %d\n", i, x, v, b);
}
printf("%08lx, %08lx, %08lx\n",
0b00001101100001001100100010100000ul,
0b00000000000000000000000000100000ul,
nthset(0b00001101100001001100100010100000, 0));
printf("%08lx, %08lx, %08llx\n",
0xdeadbeeful, 0xff000000ul, _pdep_u64(0xdeadbeef, 0xff000000));
printf("%08lx, %08lx, %08llx\n",
0xdeadbeeful, 0x00fff000ul, _pdep_u64(0xdeadbeef, 0x00fff000));
printf("%08lx, %08lx, %08llx\n",
0xdeadbeeful, 0x00000ffful, _pdep_u64(0xdeadbeef, 0x00000fff));
assert(nthset(0b00001101100001001100100010100000, 0) ==
0b00000000000000000000000000100000);
assert(nthset(0b00001101100001001100100010100000, 1) ==
0b00000000000000000000000010000000);
assert(nthset(0b00001101100001001100100010100000, 3) ==
0b00000000000000000100000000000000);
assert(nthset(0b00001101100001001100100010100000, 9) ==
0b00001000000000000000000000000000);
assert(nthset(0b00001101100001001100100010100000, 10) ==
0b00000000000000000000000000000000);
}
| [
"[email protected]"
] | |
3c6f6c6097a8520861327f6aa9a43d4fc920f369 | 8c4ad8d91bdd5cc1c0cf2f7b2766d804a21e0ff8 | /kattis/pikemaneasy.cpp | 7e6fc972efd5c8241b3ea96b7e1fb38a94b296c1 | [] | no_license | gabrieltepin/programming-contests | c4da797a80a77ee02b99a74b8469cb77677fd94c | 9dcf56c4b77c5426dd987ebf1f0536aa14fd4858 | refs/heads/master | 2023-03-23T11:36:39.908248 | 2021-03-19T13:43:43 | 2021-03-19T13:43:43 | 349,437,506 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 555 | cpp | #include <iostream>
#include <vector>
#include <algorithm>
#define fori(x, y) for(int i = x; i < y; ++i)
#define MOD 1000000007
typedef long long ll;
using namespace std;
int main() {
int n, A, B, C, t, solved=0;
ll penalty=0, T=0;
cin >> n >> t;
vector <ll> v(n);
cin >> A >> B >> C >> v[0];
fori(1, n)
v[i]=((A%C)*(v[i-1]%C)+(B%C))%C+1;
sort(v.begin(), v.end());
fori(0, n){
if(T+v[i]<=t) {
solved++;
penalty=(v[i]%MOD+T%MOD+penalty%MOD)%MOD;
T+=v[i];
}
else break;
}
cout << solved << " " << penalty << "\n";
return 0;
} | [
"[email protected]"
] | |
98147fc9c979165ea1db827d47e9cc81613fb01c | 043eb9b100070cef1a522ffea1c48f8f8d969ac7 | /ios_proj/wwj/Classes/Native/mscorlib_System_Array_InternalEnumerator_1_gen2950594271.h | 0fba986baff4e2f4836b724aba854ac02e1c1a0d | [] | no_license | spidermandl/wawaji | 658076fcac0c0f5975eb332a52310a61a5396c25 | 209ef57c14f7ddd1b8309fc808501729dda58071 | refs/heads/master | 2021-01-18T16:38:07.528225 | 2017-10-19T09:57:00 | 2017-10-19T09:57:00 | 100,465,677 | 1 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 1,502 | h | #pragma once
#include "il2cpp-config.h"
#ifndef _MSC_VER
# include <alloca.h>
#else
# include <malloc.h>
#endif
#include <stdint.h>
#include "mscorlib_System_ValueType3507792607.h"
// System.Array
struct Il2CppArray;
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Winvalid-offsetof"
#pragma clang diagnostic ignored "-Wunused-variable"
#endif
// System.Array/InternalEnumerator`1<System.Collections.Generic.KeyValuePair`2<System.String,PathologicalGames.SpawnPool>>
struct InternalEnumerator_1_t2950594271
{
public:
// System.Array System.Array/InternalEnumerator`1::array
Il2CppArray * ___array_0;
// System.Int32 System.Array/InternalEnumerator`1::idx
int32_t ___idx_1;
public:
inline static int32_t get_offset_of_array_0() { return static_cast<int32_t>(offsetof(InternalEnumerator_1_t2950594271, ___array_0)); }
inline Il2CppArray * get_array_0() const { return ___array_0; }
inline Il2CppArray ** get_address_of_array_0() { return &___array_0; }
inline void set_array_0(Il2CppArray * value)
{
___array_0 = value;
Il2CppCodeGenWriteBarrier(&___array_0, value);
}
inline static int32_t get_offset_of_idx_1() { return static_cast<int32_t>(offsetof(InternalEnumerator_1_t2950594271, ___idx_1)); }
inline int32_t get_idx_1() const { return ___idx_1; }
inline int32_t* get_address_of_idx_1() { return &___idx_1; }
inline void set_idx_1(int32_t value)
{
___idx_1 = value;
}
};
#ifdef __clang__
#pragma clang diagnostic pop
#endif
| [
"[email protected]"
] | |
bacffcf88e010c0d542883f8c1360043e2116309 | a6a7b331476d448872abca1f62b0dfeecb29bb1a | /GenActor/GenActor/entitydef/datatypes.cpp | 2211dee54a764ca8f6b0a3a034b8f1ca07c73783 | [] | no_license | EvolutionFS/muek | 784909e40fd7f77e238df3be72b087cf8e91c2b6 | 5c6d445d9c8f1722c40721238ed4bec1f7952931 | refs/heads/master | 2022-12-17T22:12:46.320505 | 2020-08-19T11:28:35 | 2020-08-19T11:28:35 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 18,826 | cpp | /*
This source file is part of KBEngine
For the latest info, see http://www.kbengine.org/
Copyright (c) 2008-2016 KBEngine.
KBEngine is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
KBEngine is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with KBEngine. If not, see <http://www.gnu.org/licenses/>.
*/
#include "../stdafx.h"
#include "datatypes.h"
#include<algorithm>
#include <sstream>
namespace KBEngine{
ADataTypes::ADataTypes()
{
}
ADataTypes::~ADataTypes()
{
finalise();
}
void ADataTypes::finalise(void)
{
uid_dataTypes_.clear();
dataTypesLowerName_.clear();
dataTypes_.clear();
}
bool ADataTypes::initialize(std::string file)
{
// 初始化一些基础类别
addDataType("UINT8", new IntType<uint8>);
addDataType("UINT16", new IntType<uint16>);
addDataType("UINT64", new UInt64Type);
addDataType("UINT32", new UInt32Type);
addDataType("INT8", new IntType<int8>);
addDataType("INT16", new IntType<int16>);
addDataType("INT32", new IntType<int32>);
addDataType("INT64", new Int64Type);
addDataType("STRING", new StringType);
addDataType("UNICODE", new UnicodeType);
addDataType("FLOAT", new FloatType);
addDataType("DOUBLE", new DoubleType);
addDataType("PYTHON", new UnicodeType);
addDataType("PY_DICT", new UnicodeType);
addDataType("PY_TUPLE", new UnicodeType);
addDataType("PY_LIST", new UnicodeType);
addDataType("MAILBOX", new MailboxType);
addDataType("BLOB", new BlobType);
addDataType("VECTOR2", new VectorType(2));
addDataType("VECTOR3", new VectorType(3));
addDataType("VECTOR4", new VectorType(4));
return loadAlias(file);
}
bool ADataTypes::loadAlias(std::string& file)
{
TiXmlNode* node = NULL;
XML *xml = new XML(file.c_str());
if(xml == NULL || !xml->isGood())
return false;
node = xml->getRootNode();
if(node == NULL)
{
return true;
}
XML_FOR_BEGIN(node)
{
std::string type = "";
std::string aliasName = xml->getKey(node);
TiXmlNode* childNode = node->FirstChild();
if(childNode != NULL)
{
type = xml->getValStr(childNode);
if(type == "FIXED_DICT")
{
FixedDictType* fixedDict = new FixedDictType;
if(fixedDict->initialize(xml, childNode, this))
{
addDataType(aliasName, fixedDict);
}
else
{
delete fixedDict;
return false;
}
}
else if(type == "ARRAY")
{
FixedArrayType* fixedArray = new FixedArrayType;
if(fixedArray->initialize(xml, childNode,this))
{
addDataType(aliasName, fixedArray);
}
else
{
delete fixedArray;
return false;
}
}
else
{
DataType* dataType = getDataType(type);
if(dataType == NULL)
{
return false;
}
addDataType(aliasName, dataType);
}
}
}
XML_FOR_END(node);
delete xml;
return true;
}
bool ADataTypes::addDataType(std::string name, DataType* dataType)
{
dataType->aliasName(name);
std::string lowername = name;
std::transform(lowername.begin(), lowername.end(), lowername.begin(), tolower);
DATATYPE_MAP::iterator iter = dataTypesLowerName_.find(lowername);
if (iter != dataTypesLowerName_.end())
{
return false;
}
dataTypes_[name] = dataType;
dataTypesLowerName_[lowername] = dataType;
uid_dataTypes_[dataType->id()] = dataType;
return true;
}
bool ADataTypes::addDataType(DATATYPE_UID uid, DataType* dataType)
{
UID_DATATYPE_MAP::iterator iter = uid_dataTypes_.find(uid);
if (iter != uid_dataTypes_.end())
{
return false;
}
uid_dataTypes_[uid] = dataType;
return true;
}
void ADataTypes::delDataType(std::string name)
{
DATATYPE_MAP::iterator iter = dataTypes_.find(name);
if (iter == dataTypes_.end())
{
}
else
{
uid_dataTypes_.erase(iter->second->id());
dataTypes_.erase(iter);
dataTypesLowerName_.erase(iter);
}
}
DataType* ADataTypes::getDataType(std::string name)
{
DATATYPE_MAP::iterator iter = dataTypes_.find(name);
if (iter != dataTypes_.end())
return iter->second;
return NULL;
}
DataType* ADataTypes::getDataType(const char* name)
{
DATATYPE_MAP::iterator iter = dataTypes_.find(name);
if (iter != dataTypes_.end())
return iter->second;
return NULL;
}
DataType* ADataTypes::getDataType(DATATYPE_UID uid)
{
UID_DATATYPE_MAP::iterator iter = uid_dataTypes_.find(uid);
if (iter != uid_dataTypes_.end())
return iter->second;
return NULL;
}
std::string ADataTypes::GetDataBaseTypeName(DataType* dataType)
{
if (dataType->type() == DATA_TYPE_DIGIT)
{
std::string type = "undefine";
if (dataType->getName() == std::string("FLOAT"))
{
return "Float";
}
else if (dataType->getName() == std::string("DOUBLE"))
{
return "Double";
}
else if (dataType->getName() == std::string("INT32"))
{
return "Int32";
}
else if (dataType->getName() == std::string("UINT32"))
{
return "Uint32";
}
else if (dataType->getName() == std::string("INT8"))
{
return "Int8";
}
else if (dataType->getName() == std::string("UINT8"))
{
return "Uint8";
}
else if (dataType->getName() == std::string("INT16"))
{
return "Int16";
}
else if (dataType->getName() == std::string("UINT16"))
{
return "Uint16";
}
else if (dataType->getName() == std::string("INT64"))
{
return "Int64";
}
else if (dataType->getName() == std::string("UINT64"))
{
return "Uint64";
}
return type;
}
else if (dataType->type() == DATA_TYPE_STRING)
{
return "String";
}
else if (dataType->type() == DATA_TYPE_BLOB ||
dataType->type() == DATA_TYPE_UNICODE )
{
return "Blob";
}
else if (dataType->type() == DATA_TYPE_VECTOR)
{
KBEngine::VectorType* vdatatype = (KBEngine::VectorType*)(dataType);
if (vdatatype->GetElemCount() == 2)
{
return "FVector2D";
}
if (vdatatype->GetElemCount() == 3)
{
return "FVector";
}
if (vdatatype->GetElemCount() == 4)
{
return "FVector4";
}
}
return dataType->getName();
}
bool ADataTypes::IsUe4Type(DataType* dataType)
{
if (dataType->type() == DATA_TYPE_PYTHON
|| dataType->type() == DATA_TYPE_MAILBOX
|| dataType->type() == DATA_TYPE_PYDICT
|| dataType->type() == DATA_TYPE_PYTUPLE
|| dataType->type() == DATA_TYPE_PYLIST
)
{
return false;
}
return true;
}
bool ADataTypes::IsBluePrintType(DataType* dataType)
{
if (dataType->type() == DATA_TYPE_DIGIT)
{
if (dataType->getName() == std::string("INT8"))
{
return false;
}
else if (dataType->getName() == std::string("UINT8"))
{
return true;
}
else if (dataType->getName() == std::string("INT16"))
{
return false;
}
else if (dataType->getName() == std::string("UINT16"))
{
return false;
}
else if (dataType->getName() == std::string("INT32"))
{
return true;
}
else if (dataType->getName() == std::string("UINT32"))
{
return false;
}
else if (dataType->getName() == std::string("INT64"))
{
return false;
}
else if (dataType->getName() == std::string("UINT64"))
{
return false;
}
else if (dataType->getName() == std::string("FLOAT"))
{
return true;
}
else if (dataType->getName() == std::string("DOUBLE"))
{
return false;
}
return false;
}
else if (dataType->type() == DATA_TYPE_STRING ||
dataType->type() == DATA_TYPE_BLOB ||
dataType->type() == DATA_TYPE_UNICODE )
{
return true;
}
else if (dataType->type() == DATA_TYPE_VECTOR)
{
return true;
}
return false;
}
std::string ADataTypes::GetDataTypeUE4Type(DataType* dataType)
{
if (dataType->type() == DATA_TYPE_DIGIT)
{
std::string type = "undefine";
if (dataType->getName() == std::string("INT8"))
{
return "int8";
}
else if (dataType->getName() == std::string("UINT8"))
{
return "uint8";
}
else if (dataType->getName() == std::string("INT16"))
{
return "int16";
}
else if (dataType->getName() == std::string("UINT16"))
{
return "uint16";
}
else if (dataType->getName() == std::string("INT32"))
{
return "int32";
}
else if (dataType->getName() == std::string("UINT32"))
{
return "uint32";
}
else if (dataType->getName() == std::string("INT64"))
{
return "int64";
}
else if (dataType->getName() == std::string("UINT64"))
{
return "uint64";
}
else if (dataType->getName() == std::string("FLOAT"))
{
return "float";
}
else if (dataType->getName() == std::string("DOUBLE"))
{
return "double";
}
return type;
}
else if (dataType->type() == DATA_TYPE_STRING )
{
return "FString";
}
else if (dataType->type() == DATA_TYPE_BLOB ||
dataType->type() == DATA_TYPE_UNICODE)
{
return "TArray<uint8>";
}
else if (dataType->type() == DATA_TYPE_VECTOR)
{
KBEngine::VectorType* vdatatype = (KBEngine::VectorType*)(dataType);
if (vdatatype->GetElemCount() == 2)
{
return "FVector2D";
}
if (vdatatype->GetElemCount() == 3)
{
return "FVector";
}
if (vdatatype->GetElemCount() == 4)
{
return "FVector4";
}
}
return dataType->getName();
}
bool ADataTypes::GenDefineList(DataType* dataType, std::vector<std::string> &dlist)
{
KBEngine::FixedDictType* fdatatype = (KBEngine::FixedDictType*)(dataType);
FixedDictType::FIXEDDICT_KEYTYPE_MAP& keyTypes = fdatatype->getKeyTypes();
FixedDictType::FIXEDDICT_KEYTYPE_MAP::iterator itor = keyTypes.begin();
for (; itor != keyTypes.end(); ++itor)
{
if (itor->second->dataType->type() == DATA_TYPE_FIXEDARRAY)
{
KBEngine::FixedArrayType* arraytype = (KBEngine::FixedArrayType*)(itor->second->dataType);
if (arraytype->getDataType()->type() == DATA_TYPE_FIXEDDICT)
{
std::string typeName = arraytype->getDataType()->aliasName();
GenDefineList(arraytype->getDataType(), dlist);
if (std::find(dlist.begin(), dlist.end(), typeName) == dlist.end())
dlist.push_back(typeName);
}
else
{
std::string typeName = ADataTypes::GetDataTypeUE4Type(arraytype->getDataType());
//printf("%s\n", typeName.c_str());
}
}
else if (itor->second->dataType->type() == DATA_TYPE_FIXEDDICT)
{
std::string typeName = itor->second->dataType->aliasName();
GenDefineList(itor->second->dataType, dlist);
if (std::find(dlist.begin(), dlist.end(), typeName) == dlist.end())
dlist.push_back(typeName);
}
else
{
//printf("%s:%s\n", ADataTypes::GetDataTypeUE4Type(itor->second->dataType).c_str(), itor->first.c_str());
}
}
return true;
}
std::string ADataTypes::DataTypeToUE4Struct()
{
std::vector<std::string> blist;
DATATYPE_MAP::iterator it = dataTypes_.begin();
for (; it != dataTypes_.end(); ++it)
{
//if (std::string("HIGH_BUY_BACK_DATA") == it->second->aliasName()
// || std::string("CHAT_DATA") == it->second->aliasName()
// || std::string("CHAT_DATA") == it->second->aliasName()
// )
{
if (it->second->type() == DATA_TYPE_FIXEDDICT)
{
GenDefineList(it->second, blist);
if (std::find(blist.begin(), blist.end(), it->second->aliasName()) == blist.end())
blist.push_back(it->second->aliasName());
}
}
}
std::stringstream ue4struct;
ue4struct << "#pragma once\n";
ue4struct << "#include \"Entity.h\"\n";
ue4struct << "#include \"Alias.generated.h\"\n";
//ue4struct << "#define MAILBOX int32\n";
for (int i = 0; i < blist.size(); i++)
{
DATATYPE_MAP::iterator iter = dataTypes_.find(blist[i]);
if (iter == dataTypes_.end())
continue;
if (iter->second->type() == DATA_TYPE_FIXEDDICT)
{
//std::string th = iter->second->aliasName();
//if ("SPAWN_POINT_DICT" != th)
// continue;
std::stringstream aliasfixeddict;
std::string createFromStream = "\npublic: \n void CreateFromStream(FMemoryStream* Stream){\n";
std::string addToStream = "\n void AddToStream(FBundle *Stream) const{\n";
aliasfixeddict << "USTRUCT(BlueprintType)\nstruct F" +
std::string(iter->second->aliasName()) + "{\n GENERATED_USTRUCT_BODY()\n";
KBEngine::FixedDictType* fdatatype = (KBEngine::FixedDictType*)(iter->second);
FixedDictType::FIXEDDICT_KEYTYPE_MAP& keyTypes = fdatatype->getKeyTypes();
FixedDictType::FIXEDDICT_KEYTYPE_MAP::iterator itor = keyTypes.begin();
int OnelyKBE = 0;
for (; itor != keyTypes.end(); ++itor)
{
if (itor->second->dataType->type() == DATA_TYPE_FIXEDARRAY)
{
KBEngine::FixedArrayType* arraytype = (KBEngine::FixedArrayType*)(itor->second->dataType);
if (arraytype->getDataType()->type() == DATA_TYPE_FIXEDDICT)
{
std::string typeName = arraytype->getDataType()->aliasName();
aliasfixeddict << "\n UPROPERTY(EditAnywhere, BlueprintReadWrite)\n TArray<F" <<
typeName + "> " << itor->first + ";";
createFromStream = createFromStream + \
" " + itor->first + ".Empty();\n"
" int Array" + itor->first + "Num = Stream->ReadUint32();\n" +
" while (Array" + itor->first + "Num > 0){\n" +
" Array" + itor->first + "Num--;\n" +
" F" + typeName + " Value;\n" +
" Value.CreateFromStream(Stream);\n" +
" " + itor->first + ".Add(Value);\n" +
" }\n";
addToStream = addToStream + \
" Stream->WriteUint32(" + itor->first + ".Num());\n" + \
" for (int32 i = 0; i < " + itor->first + ".Num(); i++) {\n" + \
" " + itor->first + "[i].AddToStream(Stream);\n" + \
" }\n";
}
else
{
std::string typeName = ADataTypes::GetDataTypeUE4Type(arraytype->getDataType());
aliasfixeddict << "\n UPROPERTY(EditAnywhere, BlueprintReadWrite)\n TArray<" <<
typeName + "> " << itor->first << ";";
createFromStream = createFromStream + \
" " + itor->first + ".Empty();\n"
" int Array" + itor->first + "Num = Stream->ReadUint32();\n" +
" while (Array" + itor->first + "Num > 0){\n" +
" Array" + itor->first + "Num--;\n" +
" " + typeName + " value = Stream->Read" + GetDataBaseTypeName(arraytype->getDataType())+ "();\n" +
" " + itor->first + ".Add(value);\n" +
" }\n";
addToStream = addToStream + \
" Stream->WriteUint32(" + itor->first + ".Num());\n" + \
" for (int32 i = 0; i < " + itor->first + ".Num(); i++) {\n" + \
" Stream->Write" + GetDataBaseTypeName(arraytype->getDataType()) + "(" + itor->first + "[i]);\n" + \
" }\n";
}
}
else if (itor->second->dataType->type() == DATA_TYPE_FIXEDDICT)
{
std::string typeName = itor->second->dataType->aliasName();
aliasfixeddict << "\n UPROPERTY(EditAnywhere, BlueprintReadWrite)";
aliasfixeddict << "\n F" << typeName << " " + itor->first << ";";
createFromStream = createFromStream + " " + itor->first + ".CreateFromStream(Stream);\n";
addToStream = addToStream + " " + itor->first + ".AddToStream(Stream);\n";
}
else
{
if(!ADataTypes::IsUe4Type(itor->second->dataType))
{
OnelyKBE = 1;
continue;
}
if (ADataTypes::IsBluePrintType(itor->second->dataType))
{
aliasfixeddict << "\n UPROPERTY(EditAnywhere, BlueprintReadWrite)";
}
aliasfixeddict << "\n " << ADataTypes::GetDataTypeUE4Type(itor->second->dataType) << " " + itor->first << ";";
createFromStream = createFromStream + " " + itor->first + \
"= Stream->Read" + GetDataBaseTypeName(itor->second->dataType) + "();\n";
addToStream = addToStream + \
" Stream->Write" + \
GetDataBaseTypeName(itor->second->dataType) + "(" + itor->first + ");\n";
}
}
if (OnelyKBE == 0)
{
ue4struct << aliasfixeddict.str();
ue4struct << createFromStream << " }\n" << addToStream << " }\n";
ue4struct << " \n}; \n";
}
}
}
return ue4struct.str();
}
}
| [
"[email protected]"
] | |
ff0374f5a1a63bb7ce3bb3f114e3991720af2862 | 0eff74b05b60098333ad66cf801bdd93becc9ea4 | /second/download/git/gumtree/git_new_log_223.cpp | e5c9af3a7cf6a74a49d6dc25aec0ea5ec10e3c5e | [] | no_license | niuxu18/logTracker-old | 97543445ea7e414ed40bdc681239365d33418975 | f2b060f13a0295387fe02187543db124916eb446 | refs/heads/master | 2021-09-13T21:39:37.686481 | 2017-12-11T03:36:34 | 2017-12-11T03:36:34 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 39 | cpp | die("BUG: check_apply_state() failed"); | [
"[email protected]"
] | |
949ee64d4348efe41520885a2604bab9ed262b2b | d5264e6ec7905da4875a9862ff00f3fa2ed8376c | /media/mtp/MtpFfsHandle.cpp | f25fc71752c42796616ee0edb13ce427f957fb95 | [
"LicenseRef-scancode-unicode",
"Apache-2.0"
] | permissive | ValidusOs/frameworks_av | 156688bd4f6e5d15dca1dc69a30ba174f0125ab5 | f0397be7a8f5e9c8ca5986fce56b84edcc7e6be0 | refs/heads/9.0 | 2021-06-05T12:15:49.821982 | 2018-12-27T01:48:08 | 2019-08-17T07:07:43 | 114,925,058 | 2 | 11 | NOASSERTION | 2019-08-12T08:53:27 | 2017-12-20T19:48:23 | C++ | UTF-8 | C++ | false | false | 22,841 | cpp | /*
* Copyright (C) 2016 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include <android-base/logging.h>
#include <android-base/properties.h>
#include <asyncio/AsyncIO.h>
#include <dirent.h>
#include <errno.h>
#include <fcntl.h>
#include <memory>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/eventfd.h>
#include <sys/ioctl.h>
#include <sys/mman.h>
#include <sys/poll.h>
#include <sys/stat.h>
#include <sys/types.h>
#include <unistd.h>
#include "PosixAsyncIO.h"
#include "MtpDescriptors.h"
#include "MtpFfsHandle.h"
#include "mtp.h"
namespace {
constexpr unsigned AIO_BUFS_MAX = 128;
constexpr unsigned AIO_BUF_LEN = 16384;
constexpr unsigned FFS_NUM_EVENTS = 5;
constexpr unsigned MAX_FILE_CHUNK_SIZE = AIO_BUFS_MAX * AIO_BUF_LEN;
constexpr uint32_t MAX_MTP_FILE_SIZE = 0xFFFFFFFF;
struct timespec ZERO_TIMEOUT = { 0, 0 };
struct mtp_device_status {
uint16_t wLength;
uint16_t wCode;
};
} // anonymous namespace
namespace android {
int MtpFfsHandle::getPacketSize(int ffs_fd) {
struct usb_endpoint_descriptor desc;
if (ioctl(ffs_fd, FUNCTIONFS_ENDPOINT_DESC, reinterpret_cast<unsigned long>(&desc))) {
PLOG(ERROR) << "Could not get FFS bulk-in descriptor";
return MAX_PACKET_SIZE_HS;
} else {
return desc.wMaxPacketSize;
}
}
MtpFfsHandle::MtpFfsHandle(int controlFd) {
mControl.reset(controlFd);
}
MtpFfsHandle::~MtpFfsHandle() {}
void MtpFfsHandle::closeEndpoints() {
mIntr.reset();
mBulkIn.reset();
mBulkOut.reset();
}
bool MtpFfsHandle::openEndpoints(bool ptp) {
if (mBulkIn < 0) {
mBulkIn.reset(TEMP_FAILURE_RETRY(open(ptp ? FFS_PTP_EP_IN : FFS_MTP_EP_IN, O_RDWR)));
if (mBulkIn < 0) {
PLOG(ERROR) << (ptp ? FFS_PTP_EP_IN : FFS_MTP_EP_IN) << ": cannot open bulk in ep";
return false;
}
}
if (mBulkOut < 0) {
mBulkOut.reset(TEMP_FAILURE_RETRY(open(ptp ? FFS_PTP_EP_OUT : FFS_MTP_EP_OUT, O_RDWR)));
if (mBulkOut < 0) {
PLOG(ERROR) << (ptp ? FFS_PTP_EP_OUT : FFS_MTP_EP_OUT) << ": cannot open bulk out ep";
return false;
}
}
if (mIntr < 0) {
mIntr.reset(TEMP_FAILURE_RETRY(open(ptp ? FFS_PTP_EP_INTR : FFS_MTP_EP_INTR, O_RDWR)));
if (mIntr < 0) {
PLOG(ERROR) << (ptp ? FFS_PTP_EP_INTR : FFS_MTP_EP_INTR) << ": cannot open intr ep";
return false;
}
}
return true;
}
void MtpFfsHandle::advise(int fd) {
for (unsigned i = 0; i < NUM_IO_BUFS; i++) {
if (posix_madvise(mIobuf[i].bufs.data(), MAX_FILE_CHUNK_SIZE,
POSIX_MADV_SEQUENTIAL | POSIX_MADV_WILLNEED) < 0)
PLOG(ERROR) << "Failed to madvise";
}
if (posix_fadvise(fd, 0, 0,
POSIX_FADV_SEQUENTIAL | POSIX_FADV_NOREUSE | POSIX_FADV_WILLNEED) < 0)
PLOG(ERROR) << "Failed to fadvise";
}
bool MtpFfsHandle::writeDescriptors(bool ptp) {
return ::android::writeDescriptors(mControl, ptp);
}
void MtpFfsHandle::closeConfig() {
mControl.reset();
}
int MtpFfsHandle::doAsync(void* data, size_t len, bool read, bool zero_packet) {
struct io_event ioevs[AIO_BUFS_MAX];
size_t total = 0;
while (total < len) {
size_t this_len = std::min(len - total, static_cast<size_t>(AIO_BUF_LEN * AIO_BUFS_MAX));
int num_bufs = this_len / AIO_BUF_LEN + (this_len % AIO_BUF_LEN == 0 ? 0 : 1);
for (int i = 0; i < num_bufs; i++) {
mIobuf[0].buf[i] = reinterpret_cast<unsigned char*>(data) + total + i * AIO_BUF_LEN;
}
int ret = iobufSubmit(&mIobuf[0], read ? mBulkOut : mBulkIn, this_len, read);
if (ret < 0) return -1;
ret = waitEvents(&mIobuf[0], ret, ioevs, nullptr);
if (ret < 0) return -1;
total += ret;
if (static_cast<size_t>(ret) < this_len) break;
}
int packet_size = getPacketSize(read ? mBulkOut : mBulkIn);
if (len % packet_size == 0 && zero_packet) {
int ret = iobufSubmit(&mIobuf[0], read ? mBulkOut : mBulkIn, 0, read);
if (ret < 0) return -1;
ret = waitEvents(&mIobuf[0], ret, ioevs, nullptr);
if (ret < 0) return -1;
}
for (unsigned i = 0; i < AIO_BUFS_MAX; i++) {
mIobuf[0].buf[i] = mIobuf[0].bufs.data() + i * AIO_BUF_LEN;
}
return total;
}
int MtpFfsHandle::read(void* data, size_t len) {
// Zero packets are handled by receiveFile()
return doAsync(data, len, true, false);
}
int MtpFfsHandle::write(const void* data, size_t len) {
return doAsync(const_cast<void*>(data), len, false, true);
}
int MtpFfsHandle::handleEvent() {
std::vector<usb_functionfs_event> events(FFS_NUM_EVENTS);
usb_functionfs_event *event = events.data();
int nbytes = TEMP_FAILURE_RETRY(::read(mControl, event,
events.size() * sizeof(usb_functionfs_event)));
if (nbytes == -1) {
return -1;
}
int ret = 0;
for (size_t n = nbytes / sizeof *event; n; --n, ++event) {
switch (event->type) {
case FUNCTIONFS_BIND:
case FUNCTIONFS_ENABLE:
ret = 0;
errno = 0;
break;
case FUNCTIONFS_UNBIND:
case FUNCTIONFS_DISABLE:
errno = ESHUTDOWN;
ret = -1;
break;
case FUNCTIONFS_SETUP:
if (handleControlRequest(&event->u.setup) == -1)
ret = -1;
break;
case FUNCTIONFS_SUSPEND:
case FUNCTIONFS_RESUME:
break;
default:
LOG(ERROR) << "Mtp Event " << event->type << " (unknown)";
}
}
return ret;
}
int MtpFfsHandle::handleControlRequest(const struct usb_ctrlrequest *setup) {
uint8_t type = setup->bRequestType;
uint8_t code = setup->bRequest;
uint16_t length = setup->wLength;
uint16_t index = setup->wIndex;
uint16_t value = setup->wValue;
std::vector<char> buf;
buf.resize(length);
int ret = 0;
if (!(type & USB_DIR_IN)) {
if (::read(mControl, buf.data(), length) != length) {
PLOG(ERROR) << "Mtp error ctrlreq read data";
}
}
if ((type & USB_TYPE_MASK) == USB_TYPE_CLASS && index == 0 && value == 0) {
switch(code) {
case MTP_REQ_RESET:
case MTP_REQ_CANCEL:
errno = ECANCELED;
ret = -1;
break;
case MTP_REQ_GET_DEVICE_STATUS:
{
if (length < sizeof(struct mtp_device_status) + 4) {
errno = EINVAL;
return -1;
}
struct mtp_device_status *st = reinterpret_cast<struct mtp_device_status*>(buf.data());
st->wLength = htole16(sizeof(st));
if (mCanceled) {
st->wLength += 4;
st->wCode = MTP_RESPONSE_TRANSACTION_CANCELLED;
uint16_t *endpoints = reinterpret_cast<uint16_t*>(st + 1);
endpoints[0] = ioctl(mBulkIn, FUNCTIONFS_ENDPOINT_REVMAP);
endpoints[1] = ioctl(mBulkOut, FUNCTIONFS_ENDPOINT_REVMAP);
mCanceled = false;
} else {
st->wCode = MTP_RESPONSE_OK;
}
length = st->wLength;
break;
}
default:
LOG(ERROR) << "Unrecognized Mtp class request! " << code;
}
} else {
LOG(ERROR) << "Unrecognized request type " << type;
}
if (type & USB_DIR_IN) {
if (::write(mControl, buf.data(), length) != length) {
PLOG(ERROR) << "Mtp error ctrlreq write data";
}
}
return 0;
}
int MtpFfsHandle::start(bool ptp) {
if (!openEndpoints(ptp))
return -1;
for (unsigned i = 0; i < NUM_IO_BUFS; i++) {
mIobuf[i].bufs.resize(MAX_FILE_CHUNK_SIZE);
mIobuf[i].iocb.resize(AIO_BUFS_MAX);
mIobuf[i].iocbs.resize(AIO_BUFS_MAX);
mIobuf[i].buf.resize(AIO_BUFS_MAX);
for (unsigned j = 0; j < AIO_BUFS_MAX; j++) {
mIobuf[i].buf[j] = mIobuf[i].bufs.data() + j * AIO_BUF_LEN;
mIobuf[i].iocb[j] = &mIobuf[i].iocbs[j];
}
}
memset(&mCtx, 0, sizeof(mCtx));
if (io_setup(AIO_BUFS_MAX, &mCtx) < 0) {
PLOG(ERROR) << "unable to setup aio";
return -1;
}
mEventFd.reset(eventfd(0, EFD_NONBLOCK));
mPollFds[0].fd = mControl;
mPollFds[0].events = POLLIN;
mPollFds[1].fd = mEventFd;
mPollFds[1].events = POLLIN;
mCanceled = false;
return 0;
}
void MtpFfsHandle::close() {
io_destroy(mCtx);
closeEndpoints();
closeConfig();
}
int MtpFfsHandle::waitEvents(struct io_buffer *buf, int min_events, struct io_event *events,
int *counter) {
int num_events = 0;
int ret = 0;
int error = 0;
while (num_events < min_events) {
if (poll(mPollFds, 2, 0) == -1) {
PLOG(ERROR) << "Mtp error during poll()";
return -1;
}
if (mPollFds[0].revents & POLLIN) {
mPollFds[0].revents = 0;
if (handleEvent() == -1) {
error = errno;
}
}
if (mPollFds[1].revents & POLLIN) {
mPollFds[1].revents = 0;
uint64_t ev_cnt = 0;
if (::read(mEventFd, &ev_cnt, sizeof(ev_cnt)) == -1) {
PLOG(ERROR) << "Mtp unable to read eventfd";
error = errno;
continue;
}
// It's possible that io_getevents will return more events than the eventFd reported,
// since events may appear in the time between the calls. In this case, the eventFd will
// show up as readable next iteration, but there will be fewer or no events to actually
// wait for. Thus we never want io_getevents to block.
int this_events = TEMP_FAILURE_RETRY(io_getevents(mCtx, 0, AIO_BUFS_MAX, events, &ZERO_TIMEOUT));
if (this_events == -1) {
PLOG(ERROR) << "Mtp error getting events";
error = errno;
}
// Add up the total amount of data and find errors on the way.
for (unsigned j = 0; j < static_cast<unsigned>(this_events); j++) {
if (events[j].res < 0) {
errno = -events[j].res;
PLOG(ERROR) << "Mtp got error event at " << j << " and " << buf->actual << " total";
error = errno;
}
ret += events[j].res;
}
num_events += this_events;
if (counter)
*counter += this_events;
}
if (error) {
errno = error;
ret = -1;
break;
}
}
return ret;
}
void MtpFfsHandle::cancelTransaction() {
// Device cancels by stalling both bulk endpoints.
if (::read(mBulkIn, nullptr, 0) != -1 || errno != EBADMSG)
PLOG(ERROR) << "Mtp stall failed on bulk in";
if (::write(mBulkOut, nullptr, 0) != -1 || errno != EBADMSG)
PLOG(ERROR) << "Mtp stall failed on bulk out";
mCanceled = true;
errno = ECANCELED;
}
int MtpFfsHandle::cancelEvents(struct iocb **iocb, struct io_event *events, unsigned start,
unsigned end) {
// Some manpages for io_cancel are out of date and incorrect.
// io_cancel will return -EINPROGRESS on success and does
// not place the event in the given memory. We have to use
// io_getevents to wait for all the events we cancelled.
int ret = 0;
unsigned num_events = 0;
int save_errno = errno;
errno = 0;
for (unsigned j = start; j < end; j++) {
if (io_cancel(mCtx, iocb[j], nullptr) != -1 || errno != EINPROGRESS) {
PLOG(ERROR) << "Mtp couldn't cancel request " << j;
} else {
num_events++;
}
}
if (num_events != end - start) {
ret = -1;
errno = EIO;
}
int evs = TEMP_FAILURE_RETRY(io_getevents(mCtx, num_events, AIO_BUFS_MAX, events, nullptr));
if (static_cast<unsigned>(evs) != num_events) {
PLOG(ERROR) << "Mtp couldn't cancel all requests, got " << evs;
ret = -1;
}
uint64_t ev_cnt = 0;
if (num_events && ::read(mEventFd, &ev_cnt, sizeof(ev_cnt)) == -1)
PLOG(ERROR) << "Mtp Unable to read event fd";
if (ret == 0) {
// Restore errno since it probably got overriden with EINPROGRESS.
errno = save_errno;
}
return ret;
}
int MtpFfsHandle::iobufSubmit(struct io_buffer *buf, int fd, unsigned length, bool read) {
int ret = 0;
buf->actual = AIO_BUFS_MAX;
for (unsigned j = 0; j < AIO_BUFS_MAX; j++) {
unsigned rq_length = std::min(AIO_BUF_LEN, length - AIO_BUF_LEN * j);
io_prep(buf->iocb[j], fd, buf->buf[j], rq_length, 0, read);
buf->iocb[j]->aio_flags |= IOCB_FLAG_RESFD;
buf->iocb[j]->aio_resfd = mEventFd;
// Not enough data, so table is truncated.
if (rq_length < AIO_BUF_LEN || length == AIO_BUF_LEN * (j + 1)) {
buf->actual = j + 1;
break;
}
}
ret = io_submit(mCtx, buf->actual, buf->iocb.data());
if (ret != static_cast<int>(buf->actual)) {
PLOG(ERROR) << "Mtp io_submit got " << ret << " expected " << buf->actual;
if (ret != -1) {
errno = EIO;
}
ret = -1;
}
return ret;
}
int MtpFfsHandle::receiveFile(mtp_file_range mfr, bool zero_packet) {
// When receiving files, the incoming length is given in 32 bits.
// A >=4G file is given as 0xFFFFFFFF
uint32_t file_length = mfr.length;
uint64_t offset = mfr.offset;
struct aiocb aio;
aio.aio_fildes = mfr.fd;
aio.aio_buf = nullptr;
struct aiocb *aiol[] = {&aio};
int ret = -1;
unsigned i = 0;
size_t length;
struct io_event ioevs[AIO_BUFS_MAX];
bool has_write = false;
bool error = false;
bool write_error = false;
int packet_size = getPacketSize(mBulkOut);
bool short_packet = false;
advise(mfr.fd);
// Break down the file into pieces that fit in buffers
while (file_length > 0 || has_write) {
// Queue an asynchronous read from USB.
if (file_length > 0) {
length = std::min(static_cast<uint32_t>(MAX_FILE_CHUNK_SIZE), file_length);
if (iobufSubmit(&mIobuf[i], mBulkOut, length, true) == -1)
error = true;
}
// Get the return status of the last write request.
if (has_write) {
aio_suspend(aiol, 1, nullptr);
int written = aio_return(&aio);
if (static_cast<size_t>(written) < aio.aio_nbytes) {
errno = written == -1 ? aio_error(&aio) : EIO;
PLOG(ERROR) << "Mtp error writing to disk";
write_error = true;
}
has_write = false;
}
if (error) {
return -1;
}
// Get the result of the read request, and queue a write to disk.
if (file_length > 0) {
unsigned num_events = 0;
ret = 0;
unsigned short_i = mIobuf[i].actual;
while (num_events < short_i) {
// Get all events up to the short read, if there is one.
// We must wait for each event since data transfer could end at any time.
int this_events = 0;
int event_ret = waitEvents(&mIobuf[i], 1, ioevs, &this_events);
num_events += this_events;
if (event_ret == -1) {
cancelEvents(mIobuf[i].iocb.data(), ioevs, num_events, mIobuf[i].actual);
return -1;
}
ret += event_ret;
for (int j = 0; j < this_events; j++) {
// struct io_event contains a pointer to the associated struct iocb as a __u64.
if (static_cast<__u64>(ioevs[j].res) <
reinterpret_cast<struct iocb*>(ioevs[j].obj)->aio_nbytes) {
// We've found a short event. Store the index since
// events won't necessarily arrive in the order they are queued.
short_i = (ioevs[j].obj - reinterpret_cast<uint64_t>(mIobuf[i].iocbs.data()))
/ sizeof(struct iocb) + 1;
short_packet = true;
}
}
}
if (short_packet) {
if (cancelEvents(mIobuf[i].iocb.data(), ioevs, short_i, mIobuf[i].actual)) {
write_error = true;
}
}
if (file_length == MAX_MTP_FILE_SIZE) {
// For larger files, receive until a short packet is received.
if (static_cast<size_t>(ret) < length) {
file_length = 0;
}
} else if (ret < static_cast<int>(length)) {
// If file is less than 4G and we get a short packet, it's an error.
errno = EIO;
LOG(ERROR) << "Mtp got unexpected short packet";
return -1;
} else {
file_length -= ret;
}
if (write_error) {
cancelTransaction();
return -1;
}
// Enqueue a new write request
aio_prepare(&aio, mIobuf[i].bufs.data(), ret, offset);
aio_write(&aio);
offset += ret;
i = (i + 1) % NUM_IO_BUFS;
has_write = true;
}
}
if ((ret % packet_size == 0 && !short_packet) || zero_packet) {
// Receive an empty packet if size is a multiple of the endpoint size
// and we didn't already get an empty packet from the header or large file.
if (read(mIobuf[0].bufs.data(), packet_size) != 0) {
return -1;
}
}
return 0;
}
int MtpFfsHandle::sendFile(mtp_file_range mfr) {
uint64_t file_length = mfr.length;
uint32_t given_length = std::min(static_cast<uint64_t>(MAX_MTP_FILE_SIZE),
file_length + sizeof(mtp_data_header));
uint64_t offset = mfr.offset;
int packet_size = getPacketSize(mBulkIn);
// If file_length is larger than a size_t, truncating would produce the wrong comparison.
// Instead, promote the left side to 64 bits, then truncate the small result.
int init_read_len = std::min(
static_cast<uint64_t>(packet_size - sizeof(mtp_data_header)), file_length);
advise(mfr.fd);
struct aiocb aio;
aio.aio_fildes = mfr.fd;
struct aiocb *aiol[] = {&aio};
int ret = 0;
int length, num_read;
unsigned i = 0;
struct io_event ioevs[AIO_BUFS_MAX];
bool error = false;
bool has_write = false;
// Send the header data
mtp_data_header *header = reinterpret_cast<mtp_data_header*>(mIobuf[0].bufs.data());
header->length = htole32(given_length);
header->type = htole16(2); // data packet
header->command = htole16(mfr.command);
header->transaction_id = htole32(mfr.transaction_id);
// Some hosts don't support header/data separation even though MTP allows it
// Handle by filling first packet with initial file data
if (TEMP_FAILURE_RETRY(pread(mfr.fd, mIobuf[0].bufs.data() +
sizeof(mtp_data_header), init_read_len, offset))
!= init_read_len) return -1;
if (doAsync(mIobuf[0].bufs.data(), sizeof(mtp_data_header) + init_read_len,
false, false /* zlps are handled below */) == -1)
return -1;
file_length -= init_read_len;
offset += init_read_len;
ret = init_read_len + sizeof(mtp_data_header);
// Break down the file into pieces that fit in buffers
while(file_length > 0 || has_write) {
if (file_length > 0) {
// Queue up a read from disk.
length = std::min(static_cast<uint64_t>(MAX_FILE_CHUNK_SIZE), file_length);
aio_prepare(&aio, mIobuf[i].bufs.data(), length, offset);
aio_read(&aio);
}
if (has_write) {
// Wait for usb write. Cancel unwritten portion if there's an error.
int num_events = 0;
if (waitEvents(&mIobuf[(i-1)%NUM_IO_BUFS], mIobuf[(i-1)%NUM_IO_BUFS].actual, ioevs,
&num_events) != ret) {
error = true;
cancelEvents(mIobuf[(i-1)%NUM_IO_BUFS].iocb.data(), ioevs, num_events,
mIobuf[(i-1)%NUM_IO_BUFS].actual);
}
has_write = false;
}
if (file_length > 0) {
// Wait for the previous read to finish
aio_suspend(aiol, 1, nullptr);
num_read = aio_return(&aio);
if (static_cast<size_t>(num_read) < aio.aio_nbytes) {
errno = num_read == -1 ? aio_error(&aio) : EIO;
PLOG(ERROR) << "Mtp error reading from disk";
cancelTransaction();
return -1;
}
file_length -= num_read;
offset += num_read;
if (error) {
return -1;
}
// Queue up a write to usb.
if (iobufSubmit(&mIobuf[i], mBulkIn, num_read, false) == -1) {
return -1;
}
has_write = true;
ret = num_read;
}
i = (i + 1) % NUM_IO_BUFS;
}
if (ret % packet_size == 0) {
// If the last packet wasn't short, send a final empty packet
if (write(mIobuf[0].bufs.data(), 0) != 0) {
return -1;
}
}
return 0;
}
int MtpFfsHandle::sendEvent(mtp_event me) {
// Mimic the behavior of f_mtp by sending the event async.
// Events aren't critical to the connection, so we don't need to check the return value.
char *temp = new char[me.length];
memcpy(temp, me.data, me.length);
me.data = temp;
std::thread t([this, me]() { return this->doSendEvent(me); });
t.detach();
return 0;
}
void MtpFfsHandle::doSendEvent(mtp_event me) {
unsigned length = me.length;
int ret = ::write(mIntr, me.data, length);
if (static_cast<unsigned>(ret) != length)
PLOG(ERROR) << "Mtp error sending event thread!";
delete[] reinterpret_cast<char*>(me.data);
}
} // namespace android
| [
"[email protected]"
] | |
6d3ef83ae93cfd03e3c5d4be71e01940326bc80c | 7e48d392300fbc123396c6a517dfe8ed1ea7179f | /RodentVR/Intermediate/Build/Win64/RodentVR/Inc/Engine/DocumentationActor.gen.cpp | ace37a7892e27434804afcab529960c02f74fdf5 | [] | no_license | WestRyanK/Rodent-VR | f4920071b716df6a006b15c132bc72d3b0cba002 | 2033946f197a07b8c851b9a5075f0cb276033af6 | refs/heads/master | 2021-06-14T18:33:22.141793 | 2020-10-27T03:25:33 | 2020-10-27T03:25:33 | 154,956,842 | 1 | 1 | null | 2018-11-29T09:56:21 | 2018-10-27T11:23:11 | C++ | UTF-8 | C++ | false | false | 6,438 | cpp | // Copyright Epic Games, Inc. All Rights Reserved.
/*===========================================================================
Generated code exported from UnrealHeaderTool.
DO NOT modify this manually! Edit the corresponding .h files instead!
===========================================================================*/
#include "UObject/GeneratedCppIncludes.h"
#include "Engine/Classes/Engine/DocumentationActor.h"
#ifdef _MSC_VER
#pragma warning (push)
#pragma warning (disable : 4883)
#endif
PRAGMA_DISABLE_DEPRECATION_WARNINGS
void EmptyLinkFunctionForGeneratedCodeDocumentationActor() {}
// Cross Module References
ENGINE_API UClass* Z_Construct_UClass_ADocumentationActor_NoRegister();
ENGINE_API UClass* Z_Construct_UClass_ADocumentationActor();
ENGINE_API UClass* Z_Construct_UClass_AActor();
UPackage* Z_Construct_UPackage__Script_Engine();
ENGINE_API UClass* Z_Construct_UClass_UMaterialBillboardComponent_NoRegister();
// End Cross Module References
void ADocumentationActor::StaticRegisterNativesADocumentationActor()
{
}
UClass* Z_Construct_UClass_ADocumentationActor_NoRegister()
{
return ADocumentationActor::StaticClass();
}
struct Z_Construct_UClass_ADocumentationActor_Statics
{
static UObject* (*const DependentSingletons[])();
#if WITH_METADATA
static const UE4CodeGen_Private::FMetaDataPairParam Class_MetaDataParams[];
#endif
#if WITH_EDITORONLY_DATA
#if WITH_METADATA
static const UE4CodeGen_Private::FMetaDataPairParam NewProp_Billboard_MetaData[];
#endif
static const UE4CodeGen_Private::FObjectPropertyParams NewProp_Billboard;
#if WITH_METADATA
static const UE4CodeGen_Private::FMetaDataPairParam NewProp_DocumentLink_MetaData[];
#endif
static const UE4CodeGen_Private::FStrPropertyParams NewProp_DocumentLink;
static const UE4CodeGen_Private::FPropertyParamsBase* const PropPointers[];
#endif // WITH_EDITORONLY_DATA
static const FCppClassTypeInfoStatic StaticCppClassTypeInfo;
static const UE4CodeGen_Private::FClassParams ClassParams;
};
UObject* (*const Z_Construct_UClass_ADocumentationActor_Statics::DependentSingletons[])() = {
(UObject* (*)())Z_Construct_UClass_AActor,
(UObject* (*)())Z_Construct_UPackage__Script_Engine,
};
#if WITH_METADATA
const UE4CodeGen_Private::FMetaDataPairParam Z_Construct_UClass_ADocumentationActor_Statics::Class_MetaDataParams[] = {
{ "HideCategories", "Sprite MaterialSprite Actor Transform Tags Materials Rendering Components Blueprint bject Collision Display Physics Input Lighting Layers" },
{ "IncludePath", "Engine/DocumentationActor.h" },
{ "ModuleRelativePath", "Classes/Engine/DocumentationActor.h" },
};
#endif
#if WITH_EDITORONLY_DATA
#if WITH_METADATA
const UE4CodeGen_Private::FMetaDataPairParam Z_Construct_UClass_ADocumentationActor_Statics::NewProp_Billboard_MetaData[] = {
{ "AllowPrivateAccess", "true" },
{ "Category", "Sprite" },
{ "EditInline", "true" },
{ "ModuleRelativePath", "Classes/Engine/DocumentationActor.h" },
};
#endif
const UE4CodeGen_Private::FObjectPropertyParams Z_Construct_UClass_ADocumentationActor_Statics::NewProp_Billboard = { "Billboard", nullptr, (EPropertyFlags)0x00400008000a001d, UE4CodeGen_Private::EPropertyGenFlags::Object, RF_Public|RF_Transient|RF_MarkAsNative, 1, STRUCT_OFFSET(ADocumentationActor, Billboard), Z_Construct_UClass_UMaterialBillboardComponent_NoRegister, METADATA_PARAMS(Z_Construct_UClass_ADocumentationActor_Statics::NewProp_Billboard_MetaData, UE_ARRAY_COUNT(Z_Construct_UClass_ADocumentationActor_Statics::NewProp_Billboard_MetaData)) };
#if WITH_METADATA
const UE4CodeGen_Private::FMetaDataPairParam Z_Construct_UClass_ADocumentationActor_Statics::NewProp_DocumentLink_MetaData[] = {
{ "Category", "HelpDocumentation" },
{ "Comment", "/** Link to a help document. */" },
{ "ModuleRelativePath", "Classes/Engine/DocumentationActor.h" },
{ "ToolTip", "Link to a help document." },
};
#endif
const UE4CodeGen_Private::FStrPropertyParams Z_Construct_UClass_ADocumentationActor_Statics::NewProp_DocumentLink = { "DocumentLink", nullptr, (EPropertyFlags)0x0010040800000005, UE4CodeGen_Private::EPropertyGenFlags::Str, RF_Public|RF_Transient|RF_MarkAsNative, 1, STRUCT_OFFSET(ADocumentationActor, DocumentLink), METADATA_PARAMS(Z_Construct_UClass_ADocumentationActor_Statics::NewProp_DocumentLink_MetaData, UE_ARRAY_COUNT(Z_Construct_UClass_ADocumentationActor_Statics::NewProp_DocumentLink_MetaData)) };
const UE4CodeGen_Private::FPropertyParamsBase* const Z_Construct_UClass_ADocumentationActor_Statics::PropPointers[] = {
(const UE4CodeGen_Private::FPropertyParamsBase*)&Z_Construct_UClass_ADocumentationActor_Statics::NewProp_Billboard,
(const UE4CodeGen_Private::FPropertyParamsBase*)&Z_Construct_UClass_ADocumentationActor_Statics::NewProp_DocumentLink,
};
#endif // WITH_EDITORONLY_DATA
const FCppClassTypeInfoStatic Z_Construct_UClass_ADocumentationActor_Statics::StaticCppClassTypeInfo = {
TCppClassTypeTraits<ADocumentationActor>::IsAbstract,
};
const UE4CodeGen_Private::FClassParams Z_Construct_UClass_ADocumentationActor_Statics::ClassParams = {
&ADocumentationActor::StaticClass,
"Engine",
&StaticCppClassTypeInfo,
DependentSingletons,
nullptr,
IF_WITH_EDITORONLY_DATA(Z_Construct_UClass_ADocumentationActor_Statics::PropPointers, nullptr),
nullptr,
UE_ARRAY_COUNT(DependentSingletons),
0,
IF_WITH_EDITORONLY_DATA(UE_ARRAY_COUNT(Z_Construct_UClass_ADocumentationActor_Statics::PropPointers), 0),
0,
0x009000A4u,
METADATA_PARAMS(Z_Construct_UClass_ADocumentationActor_Statics::Class_MetaDataParams, UE_ARRAY_COUNT(Z_Construct_UClass_ADocumentationActor_Statics::Class_MetaDataParams))
};
UClass* Z_Construct_UClass_ADocumentationActor()
{
static UClass* OuterClass = nullptr;
if (!OuterClass)
{
UE4CodeGen_Private::ConstructUClass(OuterClass, Z_Construct_UClass_ADocumentationActor_Statics::ClassParams);
}
return OuterClass;
}
IMPLEMENT_CLASS(ADocumentationActor, 1801441115);
template<> ENGINE_API UClass* StaticClass<ADocumentationActor>()
{
return ADocumentationActor::StaticClass();
}
static FCompiledInDefer Z_CompiledInDefer_UClass_ADocumentationActor(Z_Construct_UClass_ADocumentationActor, &ADocumentationActor::StaticClass, TEXT("/Script/Engine"), TEXT("ADocumentationActor"), false, nullptr, nullptr, nullptr);
DEFINE_VTABLE_PTR_HELPER_CTOR(ADocumentationActor);
PRAGMA_ENABLE_DEPRECATION_WARNINGS
#ifdef _MSC_VER
#pragma warning (pop)
#endif
| [
"[email protected]"
] | |
f4babb89fbbf25e707574fc3e49577413b0285b2 | 22fb52fc26ab1da21ab837a507524f111df5b694 | /v3/io.cpp | d8b1f01363ae5a7371c3907980a3d82b831c50d5 | [] | no_license | yangguang-ecnu/voxelbrain | b343cec00e7b76bc46cc12723f750185fa84e6d2 | 82e1912ff69998077a5d7ecca9b5b1f9d7c1b948 | refs/heads/master | 2021-01-10T01:21:59.902255 | 2009-02-10T05:24:40 | 2009-02-10T05:24:40 | 52,189,505 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,320 | cpp | #include "io.h"
#include <zlib.h>
using namespace std;
Io::Io(string content): position_(0) {
content_ = content;
rewind();
};
Io::~Io(){};
//technical
int Io::size(){return content_.size();};
Io & Io::rewind(){position_=0; return *this;};
int Io::get_position(){return position_;};
Io & Io::set_position( int position){
if(position < 0 || position > content().size()){
valid(false);
}else{
position_ = position;
};
};
std::string Io::content(){return content_;};
//Parametrized function to read different types using IO.
template<class T>
Io & Read(Io & in, T * result){
if ((in.content_.size() - in.position_)>=sizeof(T)) {
for (int i = 0; i < sizeof(T); i++) {
((char *)result)[i] = in.content_[in.position_ + sizeof(T) - i - 1];
};
in.position_ += sizeof(T); // Updating position.
} else {
in.valid(false);
};
return in;
};
//If we do not want to use out-parameter.
template<class T>
T ReadDirectly(Io & in){
T result;
Read<T>(in, &result);
return result;
};
//Parametrized function to write different types using IO.
template<class T>
Io & Write(Io & in, T * result){
//Extend the string if current position is exactly at the end.
if (in.get_position() == in.size()) //Append string of spaces.
in.content_ += string (sizeof(T), ' ');
if ((in.size() - in.get_position()) >= sizeof(T)) { //Replace.
for (int i = 0; i < sizeof(T); i++){ //Copy bytes.
in.content_[in.get_position() + sizeof(T) - i - 1] = ((char *)result)[i];
};
in.position_ += sizeof(T); // Updating position.
} else { //Too little space to replace and not appending; Error.
in.valid(false);
};
return in;
};
//reading
Io & Io::GetInt(int * result){ return Read<int>(*this, result); };
Io & Io::GetFloat(float * result){return Read<float>(*this, result); };
Io & Io::GetShort(short * result){return Read<short>(*this, result); };
Io & Io::GetChar(char * result){return Read<char>(*this, result); };
//reading
int Io::GetInt(){ return ReadDirectly<int>(*this); };
float Io::GetFloat(){return ReadDirectly<float>(*this); };
short Io::GetShort(){return ReadDirectly<short>(*this); };
char Io::GetChar(){return ReadDirectly<char>(*this); };
//writing
Io & Io::PutInt(int result){return Write<int>(*this, &result); };
Io & Io::PutFloat(float result){return Write<float>(*this, &result); };
Io & Io::PutShort(short result){return Write<short>(*this, &result); };
Io & Io::PutChar(char result){return Write<char>(*this, &result); };
//Auxiliary methods.
Io & Io::ReplaceContent(string new_content){
content_ = new_content;
rewind();
};
//File io.
string ReadFile(string name){
FILE* file = fopen(name.c_str(), "rb");
if (file == NULL) return "";
fseek(file, 0, SEEK_END);
int size = ftell(file);
rewind(file);
char* chars = new char[size];
for (int i = 0; i < size;) {
int read = fread(&chars[i], 1, size - i, file);
i += read;
}
fclose(file);
string result(chars, size);
delete[] chars;
return result;
};
string ReadGzipFile(string name){
gzFile fd; //file descriptor
const int BUF_SIZE=16384;
char buf [BUF_SIZE]; //for reading from the file
std::string contents; //vector of strings, to be composed later into one vec.
fd = gzopen(name.c_str(),"rb");
if(fd == NULL) return ""; //cannot read file.
int cnt = 0;
while((cnt = gzread(fd, (void *) buf, BUF_SIZE))){
contents+=std::string((char *)buf, cnt);
};
::gzclose(fd);
printf("Acqured %d bytes.\n", (int)contents.size());
//getting additional information
// get_mgz_info(name);
return contents;
};
//Write file
bool WriteFile( std::string name, std::string contents){
FILE* file = fopen(name.c_str(), "wb");
if (file == NULL) return false;
int bytes_written = fwrite(contents.c_str(),
1,
contents.size(),
file);
fclose(file);
return bytes_written == contents.size();
};
bool WriteGzipFile( std::string name, std::string contents){
printf("file %s\n", name.c_str());
gzFile fd = gzopen(name.c_str(), "wb");
//still cannot - fail:
if(fd == NULL) return false; // Opening file failed.
int cnt = gzwrite(fd, contents.c_str(), contents.size());
gzflush(fd, Z_FINISH);
gzclose(fd);
return (cnt == contents.size());
};
| [
"konstantin.levinski@04f5dad0-e037-0410-8c28-d9c1d3725aa7"
] | konstantin.levinski@04f5dad0-e037-0410-8c28-d9c1d3725aa7 |
c5faf6adeb9b10c19fd8b0e65af21f5b547b258a | de0ac859dc3279eca1baa8da22ccc22700b170a4 | /src/lib/include/application.h | cc7a3d6bdaa09738f9156c96cdce5576fe737c24 | [
"MIT"
] | permissive | codeosynthesis/NS-3_LXC | 519f9100d755e4577cafa3d6f9e4f7e981446079 | 7b1ea7d67c0b4c4691b1dd6c351b30bd21eddf88 | refs/heads/master | 2021-06-16T03:12:20.255436 | 2017-05-09T00:29:16 | 2017-05-09T00:29:16 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 373 | h | #ifndef __APPLICATION_H_INCLUDED__
#define __APPLICATION_H_INCLUDED__
// forward declared dependencies
class Node;
// include dependencies
#include <vector>
#include <string>
#include <map>
#include "nameable.h"
namespace ns3lxc {
// declarations
class Application: public Nameable {
public:
std::string path;
std::map<std::string, std::string> argMap;
};
}
#endif | [
"[email protected]"
] | |
cb186d00e910d8e71f6972cf0da5b0cb767615a5 | feff5dadc85629c0947abf87a79f86ace8c84539 | /poj/2104-persist.cpp | 8b90df76d2f8c25c0ed29bb230a9f19342c08acd | [] | no_license | Redleaf23477/ojcodes | af7582d9de8619509fa4ffa5338b2a59d9176608 | 7ee3053a88a78f74764bc473b3bd4887ceac6734 | refs/heads/master | 2023-08-13T22:34:58.000532 | 2023-08-10T15:54:05 | 2023-08-10T15:54:05 | 107,507,680 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,522 | cpp | // 2104 - kth number using persistance segment tree
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long int ll;
const int N = 100005;
struct Node
{
int sum;
Node *lchild, *rchild;
Node()
{
sum = 0;
lchild = rchild = NULL;
}
void up()
{
sum = 0;
if(lchild) sum += lchild->sum;
if(rchild) sum += rchild->sum;
}
};
int n, q, newSz;
int arr[N];
int rank2data[N];
Node buf[N*(2+20)];
Node *bufptr;
Node *root[N];
Node *buildTree(int l, int r)
{
Node *nd = new (bufptr++) Node();
if(l == r)
{
nd->sum = 0;
return nd;
}
int mid = (l+r)/2;
nd->lchild = buildTree(l, mid);
nd->rchild = buildTree(mid+1, r);
nd->up();
return nd;
}
Node *modify(int l, int r, Node *copyFrom, int pos, int val)
{
if(pos < l || r < pos) return copyFrom;
Node *nd = new (bufptr++) Node(*copyFrom);
if(l == pos && r == pos)
{
nd->sum += val;
return nd;
}
int mid = (l+r)/2;
nd->lchild = modify(l, mid, copyFrom->lchild, pos, val);
nd->rchild = modify(mid+1, r, copyFrom->rchild, pos, val);
nd->up();
return nd;
}
int query(int l, int r, Node *ltree, Node *rtree, int k)
{
if(l == r)
{
return l;
}
int mid = (l+r)/2, leftSum = rtree->lchild->sum - ltree->lchild->sum;
if(leftSum < k)
{
return query(mid+1, r, ltree->rchild, rtree->rchild, k-leftSum);
}
else
{
return query(l, mid, ltree->lchild, rtree->lchild, k);
}
}
void init();
void process();
int main()
{
init();
process();
return 0;
}
void init()
{
bufptr = &buf[0];
scanf("%d %d", &n, &q);
vector<int> tmp(n);
for(int i = 0; i < n; i++)
{
scanf("%d", &arr[i]);
tmp[i] = arr[i];
}
// data to rank
sort(tmp.begin(), tmp.end());
newSz = unique(tmp.begin(), tmp.end()) - tmp.begin();
tmp.resize(newSz);
for(int i = 0; i < n; i++)
{
int rk = lower_bound(tmp.begin(), tmp.end(), arr[i]) - tmp.begin();
rank2data[rk] = arr[i];
arr[i] = rk;
}
// build st
root[0] = buildTree(0, newSz-1);
for(int i = 0; i < n; i++)
{
root[i+1] = modify(0, newSz-1, root[i], arr[i], 1);
}
}
void process()
{
int l, r, k;
while(q--)
{
scanf("%d %d %d", &l, &r, &k);
printf("%d\n", rank2data[query(0, newSz-1, root[l-1], root[r], k)]);
}
}
| [
"[email protected]"
] | |
f30f7e4753a61d16fbcad8a51b19478f76988807 | 2813d78eb6a2597123deec6c9e71caca9613a476 | /src/min-heap.h | 5fbeac80413972331a58c59e5909cacc33943d4e | [] | no_license | irakr/Minimal-File-Compression-Tool | 204f1b460c2bb2b6e4c2e979fd26546ef4fbf58c | c41cda3cb57ba43551b4e5d0c8964a7363e33299 | refs/heads/master | 2021-06-29T00:47:39.151260 | 2020-09-05T17:41:58 | 2020-09-05T17:41:58 | 142,700,878 | 6 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 7,882 | h | #ifndef MINHEAP_H_
#define MINHEAP_H_
#include <iostream>
#include <climits>
#include <typeinfo>
#include <queue>
#include "logger.h"
// A Huffman tree node as a min heap node
template <class T, class FrequencyValType>
struct MinHeapNode {
T data; // One of the input characters
FrequencyValType freq; // No of occurences of the object type T
MinHeapNode *left, *right; // Left and right child
bool m_isInternalNode;
MinHeapNode() {
left = right = NULL;
m_isInternalNode = false;
}
MinHeapNode(T data, FrequencyValType freq, bool isInternalNode = false) {
left = right = NULL;
this->data = data;
this->freq = freq;
m_isInternalNode = isInternalNode;
}
~MinHeapNode() {
delete left;
delete right;
}
// Useful by Huffman tree algorithm
inline bool isInternalNode() {
return m_isInternalNode;
}
// Utility function to check if this node is leaf
inline bool isLeaf() {
return !left && !right;
}
// Print the data members
// XXX... the member 'T data' must be printable by << operator
void printContents() {
std::cout << "-------------------------" << std::endl;
std::cout << /* "(" << typeid(data).name() << ")" <<" */ "data = " << data
<< std::endl << /* "(" << typeid(freq).name() << ")" <<" */ "freq = " << freq
<< std::endl << "left = " << left
<< std::endl << "right =" << right
<< std::endl;
}
};
// For comparison of two heap nodes (needed in min heap)
template <class T, class U>
struct compare {
bool operator()(MinHeapNode<T, U>* l, MinHeapNode<T, U>* r) {
return (l->freq > r->freq); // Change '>' to '<' to make
// it a Max heap.
}
};
// This is the Min heap data structure
// !!! So simple it is in C++ !!!
template <class T, class U>
using MinHeap = std::priority_queue<MinHeapNode<T, U>*,
std::vector<MinHeapNode<T, U>*>, compare<T, U>>;
// Print the contents of each node in the heap
// XXX... Note that this function pops out all the elements in the heap.
// So only use it if u just wanna debug.
template <class T, class U>
void printMinheap(const MinHeap<T, U> &heap) {
Log_static("Started...");
std::cout << "------------------" << std::endl;
MinHeap<T, U> temp = heap;
while(!temp.empty()) {
temp.top()->printContents();
temp.pop();
}
}
// Preorderly traverse the heap by following the 'left' and 'right' pointer
// structure member of struct MinHeap.
template <class T, class U>
void traversePreorder(MinHeapNode<T, U> *root, const std::string &str) {
if(root) {
if(!root->isInternalNode())
std::cout << root->data << ": " << str << std::endl;
traversePreorder(root->left, str + "0");
traversePreorder(root->right, str + "1");
}
}
////////////////////////////////////////////////////////////////////////
/////////////////////////// CONTAMINATED AREA //////////////////////////
////////////////////////////////////////////////////////////////////////
/*************************************************************
* We don't need the complexities of maintaining a separate
* class for MinHeap since it can directly be done using
* std::priority_queue.
*************************************************************
*/
#ifdef CRAP
/* XXX... A severe bug in insertNode() */
// A Min Heap: Collection of min heap (or Hufmman tree) nodes
template <class T, class U>
class MinHeap {
private:
// Internal array type of MinHeap class
typedef std::priority_queue<MinHeapNode<T, U>*, std::vector<MinHeapNode<T, U>*>, compare<T, U>> HeapArray;
// No. of bytes to be reserved by the internal vector 'm_array'
// at each resizing event.
//@@@ static const typename HeapArray::size_type PerReservableSize = 2048;
// Array/vector of minheap node pointers
HeapArray m_array;
//@@@ int m_size; // Current size of min heap
//@@@ int m_capacity; // capacity of min heap
// Allocate and return a new min heap node with given data(symbol)
// and frequency of the character
inline MinHeapNode<T, U>* newNode(const T& data, const U& freq, bool internal = false);
// The standard minHeapify function.
// idx -> Index of the first node at which the minHeapify()
// algorithm will begin.
void minHeapify(int idx);
// A utility function to swap two min heap nodes by array index
void swap(int index1, int index2);
public:
MinHeap() {
//@@@ m_array = new HeapArray();
//@@@ m_array.reserve(PerReservableSize);
}
~MinHeap() {
//m_array.clear();
}
// Returns no of elements
inline int size() {
return m_array.size();
}
// Returns current capacity
inline int capacity() {
return -1;//m_array.capacity();
}
// Insert a new node to Min Heap
void insertNode(const T& data, const U& freq);
// Print the content of m_array[][]
void printArray() {
if(size() == 0)
throw 20;
for(auto& i : m_array)
i.printContents();
}
// Returns the 0th MinHeapNode pointer from *m_array[] and removes it
// from the array. The array is then heapified again.
MinHeapNode<T, U>* extractMin();
// Build the min heap into m_array using bottom-up approach
void buildMinHeap();
};
/* ============================= Definitions ================================ */
// Allocate a new min heap node with given character
// and frequency of the character
template <class T, class U>
inline MinHeapNode<T, U>*
MinHeap<T, U> :: newNode(const T& data, const U& freq, bool internal)
{
MinHeapNode<T, U>* temp = new MinHeapNode<T, U>(data, freq, internal);
return temp;
}
//XXX
// A utility function to swap two min heap nodes by array index
template <class T, class U>
void MinHeap<T, U> :: swap(int index1, int index2) {
if((index1 < 0) || (index2 < 0))
throw 20;
MinHeapNode<T, U> t = m_array[index1];
m_array[index1] = m_array[index2];
m_array[index2] = t;
}
// Insert a new node to Min Heap
template <class T, class U>
void MinHeap<T, U> :: insertNode(const T& data, const U& freq) {
MinHeapNode<T, U> *n = newNode(data, freq);
int i;
if(m_array.size() == 0) { // XXX ... Careful with delete() implementation
m_array.push_back(*n);
return;
}
i = m_array.size();
while ((i > 0) && (n->freq < m_array.at((i - 1)/2).freq)) {
m_array[i] = m_array[(i - 1)/2];
i = (i - 1) / 2;
}
m_array[i] = *n;
}
// The standard minHeapify function.
// idx -> Index of the first node at which the minHeapify()
// algorithm will begin.
template <class T, class U>
void MinHeap<T, U> :: minHeapify(int idx) {
int smallest = idx;
int left = 2 * idx + 1;
int right = 2 * idx + 2;
if (left < m_array.size() &&
m_array[left].freq < m_array[smallest].freq)
smallest = left;
if (right < m_array.size() &&
m_array[right].freq < m_array[smallest].freq)
smallest = right;
if (smallest != idx) {
swap(smallest, idx);
minHeapify(smallest);
}
}
// Returns the 0th MinHeapNode pointer from *m_array[] and removes it
// from the array. The array is then heapified again.
template <class T, class U>
MinHeapNode<T, U>* MinHeap<T, U> :: extractMin() {
if(size() == 0)
return NULL;
MinHeapNode<T, U>* ret = new MinHeapNode<T, U>(m_array.front());
m_array[0] = m_array[m_array.size() - 1];
minHeapify(0);
return ret;
}
// Build the min heap into m_array using bottom using bottom-up approach
template <class T, class U>
void MinHeap<T, U> :: buildMinHeap() {
if(m_array.size() == 0)
throw "[Error] Heap size = 0";
int n = m_array.size() - 1;
int i;
for (i = (n - 1) / 2; i >= 0; --i)
minHeapify(i);
}
#endif /* CRAP */
#endif /* MINHEAP_H_ */
| [
"[email protected]"
] | |
fe6671cd82040b4bb9cd6cd4b0a37b353485069c | 7860e371941db698ad8d0f330a666ead958d8145 | /Backtracking/Medium/lc22-alternate.cpp | 8562087d9b23ca95e98e26c50bcf28877790933e | [
"MIT"
] | permissive | lukasHsieh/leetcode-patterns | 06fc5286cc23b945e595fef82fbf7c0389640e2d | ff5cfc3effe060c01c294a4b2fbb14a0b8775931 | refs/heads/master | 2023-03-17T09:25:23.495729 | 2020-07-10T04:55:54 | 2020-07-10T04:55:54 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,194 | cpp | class Solution {
public:
vector<string> generateParenthesis(int n) {
vector<string> ans;
if (n == 0) {
ans.push_back("");
}
else {
for (int i = 0; i < n; i++) {
vector<string> leftParts = generateParenthesis(i);
vector<string> rightParts = generateParenthesis(n - i - 1);
for (auto& left : leftParts) {
for (auto& right : rightParts) {
// A balanced parentheses string ALWAYS starts with "(".
// We use this fact to generate a new string using:
// 1. One part inside a pair of parentheses.
// 2. Another part outside of this pair of parentheses.
ans.push_back("(" + left + ")" + right);
// These options would also be fine:
// ans.push_back(left + "(" + right + ")");
// ans.push_back(right + "(" + left + ")");
// ans.push_back("(" + right + ")" + left);
}
}
}
}
return ans;
}
};
| [
"[email protected]"
] | |
07dd2f6c84c039b1307fe539951106debd8ded54 | fee783abde5891cb3936d68b0fc51e5bca720304 | /Projectfile/Source/BasicStudy/CustomHUD.h | 49d44a73e3bd5e8882613b06f5edd8efc0125560 | [] | no_license | JJIKKYU/UnrealEngine_Study | a4d8eec27d668ed0288a31179d40f9925b4070ed | dcf4db94316f2317bdecc26387059ab8b5f78116 | refs/heads/master | 2022-02-13T07:56:41.844138 | 2019-08-21T14:35:48 | 2019-08-21T14:35:48 | 200,591,654 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 319 | h | // Fill out your copyright notice in the Description page of Project Settings.
#pragma once
#include "CoreMinimal.h"
#include "GameFramework/HUD.h"
#include "CustomHUD.generated.h"
/**
*
*/
UCLASS()
class BASICSTUDY_API ACustomHUD : public AHUD
{
GENERATED_BODY()
public:
virtual void DrawHUD() override;
};
| [
"[email protected]"
] | |
2197ea072334e15ec87b0fdc32f5c1aafdc752ce | 495d052b7bf8bd4733bc46ff17131889b732da71 | /Project2/Calc.h | f9a3ee44d1a084d9433869c42602b3cbf0f0b1cc | [] | no_license | Inco83/Calc | 079c08e1936da210fb9f38b64580352c9301e672 | d60627c2afd0450309938ad00864daad0fdfcbe2 | refs/heads/master | 2023-07-30T15:03:35.679249 | 2021-09-28T12:11:20 | 2021-09-28T12:11:20 | 411,266,789 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 88 | h | #pragma once
class Calc
{
public:
double Calculate(double x, char oper, double y);
};
| [
"User@ANDREYPC"
] | User@ANDREYPC |
541a232314a5226137903cd43b7b78d24a212298 | bbddb944026a8d3b1e761d49c6678af82a918796 | /Section04/Ex8/sampling_vectors.cpp | 7061ab90939bb423050aacc0ad9c652fdbabf83a | [
"MIT"
] | permissive | hoverzhao/CPlusPlus17-STL-Solutions | 8b4b04e11a491a4138dd814b2a59c3fb6a06d164 | b3078c15b106e8ac65e7f269b20ab8422fd38409 | refs/heads/master | 2023-02-02T11:21:59.565220 | 2020-12-16T08:56:10 | 2020-12-16T08:56:10 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 892 | cpp | #include <iostream>
#include <vector>
#include <random>
#include <algorithm>
#include <iterator>
#include <map>
#include <sstream>
#include <iomanip>
using namespace std;
int main()
{
const size_t data_points {100000};
const size_t sample_points {100};
const int mean {10};
const size_t dev {3};
random_device rd;
mt19937 gen {rd()};
normal_distribution<> d {mean, dev};
vector<int> v;
v.reserve(data_points);
generate_n(back_inserter(v), data_points, [&] { return d(gen); });
vector<int> samples;
v.reserve(sample_points);
sample(begin(v), end(v), back_inserter(samples), sample_points, mt19937{random_device{}()});
map<int, size_t> hist;
for (int i : samples) { ++hist[i]; }
for (const auto &[value, count] : hist) {
cout << setw(2) << value << " "
<< string(count, '*') << '\n';
}
}
| [
"[email protected]"
] | |
ce4d21e0e64e60df95f8f95d3175534b989dd1e1 | 4709bfb60208ffe4c7874883fd501e97fb3479bc | /src/lp_data/sparse_vector.h | 3e73449ef37e44c916edeb5d8dd7c513f5467292 | [
"Apache-2.0",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | AlperSaltabas/OR_Tools_Google_API | 7e8bf0697063ad89c624268bdf36e09fb82b306f | 7ee31efec888adb3692e613e8c3f85ad06140af8 | refs/heads/master | 2016-09-06T03:27:28.926323 | 2015-03-15T21:16:20 | 2015-03-15T21:16:20 | 32,277,224 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 28,946 | h | // Copyright 2010-2014 Google
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
// Classes to represent sparse vectors.
//
// The following are very good references for terminology, data structures,
// and algorithms:
//
// I.S. Duff, A.M. Erisman and J.K. Reid, "Direct Methods for Sparse Matrices",
// Clarendon, Oxford, UK, 1987, ISBN 0-19-853421-3,
// http://www.amazon.com/dp/0198534213
//
// T.A. Davis, "Direct methods for Sparse Linear Systems", SIAM, Philadelphia,
// 2006, ISBN-13: 978-0-898716-13, http://www.amazon.com/dp/0898716136
//
// Both books also contain a wealth of references.
#ifndef OR_TOOLS_LP_DATA_SPARSE_VECTOR_H_
#define OR_TOOLS_LP_DATA_SPARSE_VECTOR_H_
#include <algorithm>
#include <string>
#include "base/logging.h" // for CHECK*
#include "base/integral_types.h"
#include "lp_data/lp_types.h"
#include "lp_data/permutation.h"
#include "util/iterators.h"
#include "util/return_macros.h"
namespace operations_research {
namespace glop {
// --------------------------------------------------------
// SparseVector
// --------------------------------------------------------
// This class allows to store a vector taking advantage of its sparsity.
// Space complexity is in O(num_entries).
// In the current implementation, entries are stored in a first-in order (order
// of SetCoefficient() calls) when they are added; then the "cleaning" process
// sorts them by index (and duplicates are removed: the last entry takes
// precedence).
// Many methods assume that the entries are sorted by index and without
// duplicates, and DCHECK() that.
//
// Default copy construction is fully supported.
//
// This class uses strong integer types (i.e. no implicit cast to/from other
// integer types) for both:
// - the index of entries (eg. SparseVector<RowIndex> is a SparseColumn,
// see ./sparse_column.h).
// - the *internal* indices of entries in the internal storage, which is an
// entirely different type: EntryType.
// TODO(user): un-expose this type to client; by getting rid of the
// index-based APIs and leveraging iterator-based APIs; if possible.
template <typename IndexType>
class SparseVector {
public:
typedef IndexType Index;
typedef StrictITIVector<Index, Fractional> DenseVector;
typedef Permutation<Index> IndexPermutation;
SparseVector();
// Read-only API for a given SparseVector entry. The typical way for a
// client to use this is to use the natural range iteration defined by the
// Iterator class below:
// SparseVector<int> v;
// ...
// for (const SparseVector<int>::Entry e : v) {
// LOG(INFO) << "Index: " << e.index() << ", Coeff: " << e.coefficient();
// }
//
// Note that this can only be used when the vector has no duplicates.
//
// Note(user): using either "const SparseVector<int>::Entry&" or
// "const SparseVector<int>::Entry" yields the exact same performance on the
// netlib, thus we recommend to use the latter version, for consistency.
class Entry;
class Iterator;
Iterator begin() const;
Iterator end() const;
// Clears the vector, i.e. removes all entries.
void Clear();
// Clears the vector and releases the memory it uses.
void ClearAndRelease();
// Reserve the underlying storage for the given number of entries.
void Reserve(EntryIndex size);
// Returns true if the vector is empty.
bool IsEmpty() const;
// Cleans the vector, i.e. removes zero-values entries, removes duplicates
// entries and sorts remaining entries in increasing index order.
// Runs in O(num_entries * log(num_entries)).
void CleanUp();
// Returns true if the entries of this SparseVector are in strictly increasing
// index order and if the vector contains no duplicates nor zero coefficients.
// Runs in O(num_entries). It is not const because it modifies
// possibly_contains_duplicates_.
bool IsCleanedUp() const;
// Swaps the content of this sparse vector with the one passed as argument.
// Works in O(1).
void Swap(SparseVector* other);
// Populates the current vector from sparse_vector.
// Runs in O(num_entries).
void PopulateFromSparseVector(const SparseVector& sparse_vector);
// Populates the current vector from dense_vector.
// Runs in O(num_indices_in_dense_vector).
void PopulateFromDenseVector(const DenseVector& dense_vector);
// Returns true when the vector contains no duplicates. Runs in
// O(max_index + num_entries), max_index being the largest index in entry.
// This method allocates (and deletes) a Boolean array of size max_index.
// Note that we use a mutable Boolean to make subsequent call runs in O(1).
bool CheckNoDuplicates() const;
// Same as CheckNoDuplicates() except it uses a reusable boolean vector
// to make the code more efficient. Runs in O(num_entries).
// Note that boolean_vector should be initialized to false before calling this
// method; It will remain equal to false after calls to CheckNoDuplicates().
// Note that we use a mutable Boolean to make subsequent call runs in O(1).
bool CheckNoDuplicates(StrictITIVector<Index, bool>* boolean_vector) const;
// Defines the coefficient at index, i.e. vector[index] = value;
void SetCoefficient(Index index, Fractional value);
// Removes an entry from the vector if present. The order of the other entries
// is preserved. Runs in O(num_entries).
void DeleteEntry(Index index);
// Sets to 0.0 (i.e. remove) all entries whose fabs() is lower or equal to
// the given threshold.
void RemoveNearZeroEntries(Fractional threshold);
// Same as RemoveNearZeroEntries, but the entry magnitude of each row is
// multiplied by weights[row] before being compared with threshold.
void RemoveNearZeroEntriesWithWeights(Fractional threshold,
const DenseVector& weights);
// Moves the entry with given Index to the first position in the vector. If
// the entry is not present, nothing happens.
void MoveEntryToFirstPosition(Index index);
// Moves the entry with given Index to the last position in the vector. If
// the entry is not present, nothing happens.
void MoveEntryToLastPosition(Index index);
// Multiplies all entries by factor.
// i.e. entry.coefficient *= factor.
void MultiplyByConstant(Fractional factor);
// Multiplies all entries by its corresponding factor,
// i.e. entry.coefficient *= factors[entry.index].
void ComponentWiseMultiply(const StrictITIVector<Index, Fractional>& factors);
// Divides all entries by factor.
// i.e. entry.coefficient /= factor.
void DivideByConstant(Fractional factor);
// Divides all entries by its corresponding factor,
// i.e. entry.coefficient /= factors[entry.index].
void ComponentWiseDivide(const DenseVector& factors);
// Populates a dense vector from the sparse vector.
// Runs in O(num_indices) as the dense vector values have to be reset to 0.0.
void CopyToDenseVector(Index num_indices, DenseVector* dense_vector) const;
// Populates a dense vector from the permuted sparse vector.
// Runs in O(num_indices) as the dense vector values have to be reset to 0.0.
void PermutedCopyToDenseVector(const IndexPermutation& index_perm,
Index num_indices,
DenseVector* dense_vector) const;
// Performs the operation dense_vector += multiplier * this.
// This is known as multiply-accumulate or (fused) multiply-add.
void AddMultipleToDenseVector(Fractional multiplier,
DenseVector* dense_vector) const;
// WARNING: BOTH vectors (the current and the destination) MUST be "clean",
// i.e. sorted and without duplicates.
// Performs the operation accumulator_vector += multiplier * this, removing
// a given index which must be in both vectors, and pruning new entries that
// are zero with a relative precision of 2 * std::numeric_limits::epsilon().
void AddMultipleToSparseVectorAndDeleteCommonIndex(
Fractional multiplier, Index removed_common_index,
SparseVector* accumulator_vector) const;
// Same as AddMultipleToSparseVectorAndDeleteCommonIndex() but instead of
// deleting the common index, leave it unchanged.
void AddMultipleToSparseVectorAndIgnoreCommonIndex(
Fractional multiplier, Index ignored_common_index,
SparseVector* accumulator_vector) const;
// Applies the index permutation to all entries: index = index_perm[index];
void ApplyIndexPermutation(const IndexPermutation& index_perm);
// Same as ApplyIndexPermutation but deletes the index if index_perm[index]
// is negative.
void ApplyPartialIndexPermutation(const IndexPermutation& index_perm);
// Removes the entries for which index_perm[index] is non-negative and appends
// them to output. Note that the index of the entries are NOT permuted.
void MoveTaggedEntriesTo(const IndexPermutation& index_perm,
SparseVector* output);
// Returns the coefficient at position index.
// Call with care: runs in O(number-of-entries) as entries may not be sorted.
Fractional LookUpCoefficient(Index index) const;
// Note this method can only be used when the vector has no duplicates.
EntryIndex num_entries() const {
DCHECK(CheckNoDuplicates());
return EntryIndex(entry_.size());
}
// Returns the first entry's index and coefficient; note that 'first' doesn't
// mean 'entry with the smallest index'.
// Runs in O(1).
// Note this method can only be used when the vector has no duplicates.
Index GetFirstIndex() const {
DCHECK(CheckNoDuplicates());
return entry_.front().index;
}
Fractional GetFirstCoefficient() const {
DCHECK(CheckNoDuplicates());
return entry_.front().coefficient;
}
// Like GetFirst*, but for the last entry.
Index GetLastIndex() const {
DCHECK(CheckNoDuplicates());
return entry_.back().index;
}
Fractional GetLastCoefficient() const {
DCHECK(CheckNoDuplicates());
return entry_.back().coefficient;
}
// Allows to loop over the entry indices like this:
// for (const EntryIndex i : sparse_vector.AllEntryIndices()) { ... }
// TODO(user): consider removing this, in favor of the natural range
// iteration.
IntegerRange<EntryIndex> AllEntryIndices() const {
return IntegerRange<EntryIndex>(EntryIndex(0), entry_.size());
}
// Returns true if this vector is exactly equal to the given one, i.e. all its
// index indices and coefficients appear in the same order and are equal.
bool IsEqualTo(const SparseVector& other) const;
// An exhaustive, pretty-printed listing of the entries, in their
// internal order. a.DebugString() == b.DebugString() iff a.IsEqualTo(b).
std::string DebugString() const;
protected:
// The internal storage of entries.
struct InternalEntry {
Index index;
Fractional coefficient;
// TODO(user): Evaluate the impact of having padding (12 bytes struct when
// Fractional is a double).
// Note(user): The two constructors below are not needed when we switch
// to initializer lists.
InternalEntry() : index(0), coefficient(0.0) {}
InternalEntry(Index i, Fractional c) : index(i), coefficient(c) {}
bool operator<(const InternalEntry& other) const {
return index < other.index;
}
};
// TODO(user): Consider making this public and using it instead of EntryRow()
// EntryCoefficient() in SparseColumn.
const InternalEntry& entry(EntryIndex i) const { return entry_[i]; }
// Vector of entries. Not necessarily sorted.
// TODO(user): try splitting the std::vector<InternalEntry> into two vectors
// of index and coefficient, like it is done in SparseMatrix.
StrictITIVector<EntryIndex, InternalEntry> entry_;
// This is here to speed up the CheckNoDuplicates() methods and is mutable
// so we can perform checks on const argument.
mutable bool may_contain_duplicates_;
private:
// Actual implementation of AddMultipleToSparseVectorAndDeleteCommonIndex()
// and AddMultipleToSparseVectorAndIgnoreCommonIndex() which is shared.
void AddMultipleToSparseVectorInternal(
bool delete_common_index, Fractional multiplier, Index common_index,
SparseVector* accumulator_vector) const;
};
template <class Index>
class SparseVector<Index>::Entry {
public:
Index index() const { return sparse_vector_.entry(i_).index; }
Fractional coefficient() const {
return sparse_vector_.entry(i_).coefficient;
}
protected:
Entry(const SparseVector& sparse_vector, EntryIndex i)
: sparse_vector_(sparse_vector), i_(i) {}
const SparseVector& sparse_vector_;
EntryIndex i_;
};
template <class Index>
class SparseVector<Index>::Iterator : private SparseVector<Index>::Entry {
public:
void operator++() { ++Entry::i_; }
bool operator!=(const Iterator& other) const {
// This operator is intended for use in natural range iteration ONLY.
// Therefore, we prefer to use '<' so that a buggy range iteration which
// start point is *after* its end point stops immediately, instead of
// iterating 2^(number of bits of EntryIndex) times.
return internal_entry_index() < other.internal_entry_index();
}
const Entry& operator*() const { return *static_cast<const Entry*>(this); }
private:
explicit Iterator(const SparseVector& sparse_vector, EntryIndex i)
: Entry(sparse_vector, i) {
DCHECK(sparse_vector.CheckNoDuplicates());
}
inline EntryIndex internal_entry_index() const { return Entry::i_; }
friend class SparseVector;
};
template <class Index>
typename SparseVector<Index>::Iterator SparseVector<Index>::begin() const {
return Iterator(*this, EntryIndex(0));
}
template <class Index>
typename SparseVector<Index>::Iterator SparseVector<Index>::end() const {
return Iterator(*this, EntryIndex(entry_.size()));
}
// --------------------------------------------------------
// SparseVector implementation
// --------------------------------------------------------
template <typename IndexType>
SparseVector<IndexType>::SparseVector()
: entry_(), may_contain_duplicates_(false) {}
template <typename IndexType>
void SparseVector<IndexType>::Clear() {
entry_.clear();
may_contain_duplicates_ = false;
}
template <typename IndexType>
void SparseVector<IndexType>::ClearAndRelease() {
StrictITIVector<EntryIndex, InternalEntry> empty;
empty.swap(entry_);
may_contain_duplicates_ = false;
}
template <typename IndexType>
void SparseVector<IndexType>::Reserve(EntryIndex size) {
entry_.reserve(size.value());
}
template <typename IndexType>
bool SparseVector<IndexType>::IsEmpty() const {
return entry_.empty();
}
template <typename IndexType>
void SparseVector<IndexType>::Swap(SparseVector* other) {
entry_.swap(other->entry_);
std::swap(may_contain_duplicates_, other->may_contain_duplicates_);
}
template <typename IndexType>
void SparseVector<IndexType>::CleanUp() {
std::stable_sort(entry_.begin(), entry_.end());
EntryIndex new_index(0);
const EntryIndex num_entries = entry_.size();
for (EntryIndex i(0); i < num_entries; ++i) {
if (i + 1 < num_entries && entry_[i + 1].index == entry_[i].index) continue;
if (entry_[i].coefficient != 0.0) {
entry_[new_index] = entry_[i];
++new_index;
}
}
entry_.resize_down(new_index);
may_contain_duplicates_ = false;
}
template <typename IndexType>
bool SparseVector<IndexType>::IsCleanedUp() const {
Index previous_index(-1);
for (const EntryIndex i : AllEntryIndices()) {
const Index index = entry(i).index;
if (index <= previous_index || entry(i).coefficient == 0.0) return false;
previous_index = index;
}
may_contain_duplicates_ = false;
return true;
}
template <typename IndexType>
void SparseVector<IndexType>::PopulateFromSparseVector(
const SparseVector& sparse_vector) {
entry_ = sparse_vector.entry_;
may_contain_duplicates_ = sparse_vector.may_contain_duplicates_;
}
template <typename IndexType>
void SparseVector<IndexType>::PopulateFromDenseVector(
const DenseVector& dense_vector) {
Clear();
const Index num_indices(dense_vector.size());
for (Index index(0); index < num_indices; ++index) {
if (dense_vector[index] != 0.0) {
SetCoefficient(index, dense_vector[index]);
}
}
may_contain_duplicates_ = false;
}
template <typename IndexType>
bool SparseVector<IndexType>::CheckNoDuplicates(
StrictITIVector<IndexType, bool>* boolean_vector) const {
RETURN_VALUE_IF_NULL(boolean_vector, false);
// Note(user): Using num_entries() or any function that call
// CheckNoDuplicates() again will cause an infinite loop!
if (!may_contain_duplicates_ || entry_.size() <= 1) return true;
// Update size if needed.
const Index max_index = std::max_element(entry_.begin(), entry_.end())->index;
if (boolean_vector->size() <= max_index) {
boolean_vector->resize(max_index + 1, false);
}
may_contain_duplicates_ = false;
for (const EntryIndex i : AllEntryIndices()) {
const Index index = entry(i).index;
if ((*boolean_vector)[index]) {
may_contain_duplicates_ = true;
break;
}
(*boolean_vector)[index] = true;
}
// Reset boolean_vector to false.
for (const EntryIndex i : AllEntryIndices()) {
(*boolean_vector)[entry(i).index] = false;
}
return !may_contain_duplicates_;
}
template <typename IndexType>
bool SparseVector<IndexType>::CheckNoDuplicates() const {
// Using num_entries() or any function in that will call CheckNoDuplicates()
// again will cause an infinite loop!
if (!may_contain_duplicates_ || entry_.size() <= 1) return true;
StrictITIVector<Index, bool> boolean_vector;
return CheckNoDuplicates(&boolean_vector);
}
// Do not filter out zero values, as a zero value can be added to reset a
// previous value. Zero values and duplicates will be removed by CleanUp.
template <typename IndexType>
void SparseVector<IndexType>::SetCoefficient(Index index, Fractional value) {
DCHECK_GE(index, 0);
// TODO(user): when we drop MSVC2012 in the open-source project,
// use initializer list-based idiom: entry_.push_back({index, value});
entry_.push_back(InternalEntry(index, value));
may_contain_duplicates_ = true;
}
template <typename IndexType>
void SparseVector<IndexType>::DeleteEntry(Index index) {
DCHECK(CheckNoDuplicates());
EntryIndex i(0);
const EntryIndex end(num_entries());
while (i < end && entry(i).index != index) {
++i;
}
if (i == end) return;
entry_.erase(entry_.begin() + i.value());
}
template <typename IndexType>
void SparseVector<IndexType>::RemoveNearZeroEntries(Fractional threshold) {
DCHECK(CheckNoDuplicates());
EntryIndex new_index(0);
for (const EntryIndex i : AllEntryIndices()) {
const Fractional magnitude = fabs(entry(i).coefficient);
if (magnitude > threshold) {
entry_[new_index] = entry_[i];
++new_index;
}
}
entry_.resize_down(new_index);
}
template <typename IndexType>
void SparseVector<IndexType>::RemoveNearZeroEntriesWithWeights(
Fractional threshold, const DenseVector& weights) {
DCHECK(CheckNoDuplicates());
EntryIndex new_index(0);
for (const EntryIndex i : AllEntryIndices()) {
if (fabs(entry_[i].coefficient) * weights[entry_[i].index] > threshold) {
entry_[new_index] = entry_[i];
++new_index;
}
}
entry_.resize_down(new_index);
}
template <typename IndexType>
void SparseVector<IndexType>::MoveEntryToFirstPosition(Index index) {
DCHECK(CheckNoDuplicates());
for (const EntryIndex i : AllEntryIndices()) {
if (entry(i).index == index) {
std::swap(entry_[EntryIndex(0)], entry_[i]);
return;
}
}
}
template <typename IndexType>
void SparseVector<IndexType>::MoveEntryToLastPosition(Index index) {
DCHECK(CheckNoDuplicates());
for (const EntryIndex i : AllEntryIndices()) {
if (entry(i).index == index) {
std::swap(entry_[num_entries() - 1], entry_[i]);
return;
}
}
}
template <typename IndexType>
void SparseVector<IndexType>::MultiplyByConstant(Fractional factor) {
for (const EntryIndex i : AllEntryIndices()) {
entry_[i].coefficient *= factor;
}
}
template <typename IndexType>
void SparseVector<IndexType>::ComponentWiseMultiply(
const DenseVector& factors) {
for (const EntryIndex i : AllEntryIndices()) {
entry_[i].coefficient *= factors[entry(i).index];
}
}
template <typename IndexType>
void SparseVector<IndexType>::DivideByConstant(Fractional factor) {
for (const EntryIndex i : AllEntryIndices()) {
entry_[i].coefficient /= factor;
}
}
template <typename IndexType>
void SparseVector<IndexType>::ComponentWiseDivide(const DenseVector& factors) {
for (const EntryIndex i : AllEntryIndices()) {
entry_[i].coefficient /= factors[entry(i).index];
}
}
template <typename IndexType>
void SparseVector<IndexType>::CopyToDenseVector(
Index num_indices, DenseVector* dense_vector) const {
RETURN_IF_NULL(dense_vector);
dense_vector->AssignToZero(num_indices);
for (const EntryIndex i : AllEntryIndices()) {
(*dense_vector)[entry(i).index] = entry(i).coefficient;
}
}
template <typename IndexType>
void SparseVector<IndexType>::PermutedCopyToDenseVector(
const IndexPermutation& index_perm, Index num_indices,
DenseVector* dense_vector) const {
RETURN_IF_NULL(dense_vector);
dense_vector->AssignToZero(num_indices);
for (const EntryIndex i : AllEntryIndices()) {
(*dense_vector)[index_perm[entry(i).index]] = entry(i).coefficient;
}
}
template <typename IndexType>
void SparseVector<IndexType>::AddMultipleToDenseVector(
Fractional multiplier, DenseVector* dense_vector) const {
RETURN_IF_NULL(dense_vector);
if (multiplier == 0.0) return;
for (const EntryIndex i : AllEntryIndices()) {
(*dense_vector)[entry(i).index] += multiplier * entry(i).coefficient;
}
}
template <typename IndexType>
void SparseVector<IndexType>::AddMultipleToSparseVectorAndDeleteCommonIndex(
Fractional multiplier, Index removed_common_index,
SparseVector* accumulator_vector) const {
AddMultipleToSparseVectorInternal(true, multiplier, removed_common_index,
accumulator_vector);
}
template <typename IndexType>
void SparseVector<IndexType>::AddMultipleToSparseVectorAndIgnoreCommonIndex(
Fractional multiplier, Index removed_common_index,
SparseVector* accumulator_vector) const {
AddMultipleToSparseVectorInternal(false, multiplier, removed_common_index,
accumulator_vector);
}
template <typename IndexType>
void SparseVector<IndexType>::AddMultipleToSparseVectorInternal(
bool delete_common_index, Fractional multiplier, Index common_index,
SparseVector* accumulator_vector) const {
// DCHECK that the input is correct.
DCHECK(IsCleanedUp());
DCHECK(accumulator_vector->IsCleanedUp());
DCHECK(CheckNoDuplicates());
DCHECK(accumulator_vector->CheckNoDuplicates());
DCHECK_NE(0.0, LookUpCoefficient(common_index));
DCHECK_NE(0.0, accumulator_vector->LookUpCoefficient(common_index));
// Implementation notes: we create a temporary SparseVector "c" to hold the
// result. We call "a" the first vector (i.e. the current object, which will
// be multiplied by "multiplier"), and "b" the second vector (which will be
// swapped with "c" at the end to hold the result).
// We incrementally build c as: a * multiplier + b.
const SparseVector& a = *this;
const SparseVector& b = *accumulator_vector;
SparseVector c;
EntryIndex ia(0); // Index in the vector "a"
EntryIndex ib(0); // ... and "b"
EntryIndex ic(0); // ... and "c"
const EntryIndex size_a = a.num_entries();
const EntryIndex size_b = b.num_entries();
const int size_adjustment = delete_common_index ? -2 : 0;
c.entry_.resize(size_a + size_b + size_adjustment, InternalEntry());
while ((ia < size_a) && (ib < size_b)) {
const Index index_a = a.entry(ia).index;
const Index index_b = b.entry(ib).index;
// Benchmarks done by fdid@ in 2012 showed that it was faster to put the
// "if" clauses in that specific order.
if (index_a == index_b) {
if (index_a != common_index) {
const Fractional a_coeff_mul = multiplier * a.entry(ia).coefficient;
const Fractional b_coeff = b.entry(ib).coefficient;
const Fractional sum = a_coeff_mul + b_coeff;
// We use the factor 2.0 because the error can be slightly greater than
// 1ulp, and we don't want to leave such near zero entries.
if (fabs(sum) > 2.0 * std::numeric_limits<Fractional>::epsilon() *
std::max(fabs(a_coeff_mul), fabs(b_coeff))) {
c.entry_[ic] = InternalEntry(index_a, sum);
++ic;
}
} else if (!delete_common_index) {
c.entry_[ic] = b.entry(ib);
++ic;
}
++ia;
++ib;
} else if (index_a < index_b) {
c.entry_[ic] =
InternalEntry(index_a, multiplier * a.entry(ia).coefficient);
++ia;
++ic;
} else { // index_b < index_a
c.entry_[ic] = b.entry_[ib];
++ib;
++ic;
}
}
while (ia < size_a) {
c.entry_[ic] =
InternalEntry(a.entry(ia).index, multiplier * a.entry(ia).coefficient);
++ia;
++ic;
}
while (ib < size_b) {
c.entry_[ic] = b.entry_[ib];
++ib;
++ic;
}
c.entry_.resize_down(ic);
c.may_contain_duplicates_ = false;
c.Swap(accumulator_vector);
}
template <typename IndexType>
void SparseVector<IndexType>::ApplyIndexPermutation(
const IndexPermutation& index_perm) {
for (const EntryIndex i : AllEntryIndices()) {
entry_[i].index = index_perm[entry_[i].index];
}
}
template <typename IndexType>
void SparseVector<IndexType>::ApplyPartialIndexPermutation(
const IndexPermutation& index_perm) {
EntryIndex new_index(0);
for (const EntryIndex i : AllEntryIndices()) {
const Index index = entry_[i].index;
if (index_perm[index] >= 0) {
entry_[new_index].index = index_perm[index];
entry_[new_index].coefficient = entry_[i].coefficient;
++new_index;
}
}
entry_.resize_down(new_index);
}
template <typename IndexType>
void SparseVector<IndexType>::MoveTaggedEntriesTo(
const IndexPermutation& index_perm, SparseVector* output) {
// Note that this function is called many times, so performance does matter
// and it is why we optimized the "nothing to do" case.
const EntryIndex end(entry_.size());
EntryIndex i(0);
while (true) {
if (i >= end) return; // "nothing to do" case.
if (index_perm[entry_[i].index] >= 0) break;
++i;
}
output->entry_.push_back(entry_[i]);
for (EntryIndex j(i + 1); j < end; ++j) {
if (index_perm[entry_[j].index] < 0) {
entry_[i] = entry_[j];
++i;
} else {
output->entry_.push_back(entry_[j]);
}
}
entry_.resize_down(i);
// TODO(user): In the way we use this function, we know that will not
// happen, but it is better to be careful so we can check that properly in
// debug mode.
output->may_contain_duplicates_ = true;
}
template <typename IndexType>
Fractional SparseVector<IndexType>::LookUpCoefficient(Index index) const {
Fractional value(0.0);
for (const EntryIndex i : AllEntryIndices()) {
if (entry(i).index == index) {
// Keep in mind the vector may contains several entries with the same
// index. In such a case the last one is returned.
// TODO(user): investigate whether an optimized version of
// LookUpCoefficient for "clean" columns yields speed-ups.
value = entry(i).coefficient;
}
}
return value;
}
template <typename IndexType>
bool SparseVector<IndexType>::IsEqualTo(const SparseVector& other) const {
// We do not take into account the mutable value may_contain_duplicates_.
if (num_entries() != other.num_entries()) return false;
for (const EntryIndex i : AllEntryIndices()) {
if (entry(i).index != other.entry(i).index) return false;
if (entry(i).coefficient != other.entry(i).coefficient) return false;
}
return true;
}
template <typename IndexType>
std::string SparseVector<IndexType>::DebugString() const {
std::string s;
for (const EntryIndex i : AllEntryIndices()) {
if (i != 0) s += ", ";
StringAppendF(&s, "[%d]=%g", entry(i).index.value(), entry(i).coefficient);
}
return s;
}
} // namespace glop
} // namespace operations_research
#endif // OR_TOOLS_LP_DATA_SPARSE_VECTOR_H_
| [
"[email protected]@59fed7e4-672f-1a80-1451-5ac2ff6d83f1"
] | [email protected]@59fed7e4-672f-1a80-1451-5ac2ff6d83f1 |
0ddcb52ad9dc5f99e814bdb612cc0f6f98ba867a | 2ff2d4e80e61e9912f7c95af48a54f0f494826aa | /markredeman-cpp/raffle.cpp | e8a1dd4ac0904e1d68f46a5e302553034736e1e5 | [] | no_license | borkdude/rafflers | cd3b064241ef891fdd58d9af98857fb45a022f3b | c8b471b92ec1108fa2ec4bbfa44d9539ea702a84 | refs/heads/master | 2020-12-31T00:41:10.186942 | 2017-02-02T09:11:09 | 2017-02-02T09:11:09 | 80,631,413 | 2 | 0 | null | 2017-02-01T15:07:10 | 2017-02-01T15:07:10 | null | UTF-8 | C++ | false | false | 884 | cpp | #include <iostream>
#include <fstream>
#include <algorithm>
#include <iterator>
#include <chrono>
int main(int argc, char **argv)
{
if (argc < 2)
{
std::cout << "You forgot the filename!";
return 0;
}
// Get the number of participants
std::ifstream raffle(argv[1]);
size_t names = std::count(std::istreambuf_iterator<char>(raffle),
std::istreambuf_iterator<char>(), '\n');
// Random stuff
std::mt19937 generator(std::chrono::system_clock::now().time_since_epoch().count());;
std::uniform_int_distribution<size_t> distribution(0, names);
size_t winner_id = distribution(generator);
std::string winner;
//skip the first N names
raffle.seekg(std::ios::beg);
for(size_t idx = 0; idx <= winner_id; ++idx)
std::getline(raffle, winner);
std::cout << "And the winner is.. " << winner << "!\n";
} | [
"[email protected]"
] | |
bfa1e116644ee40aa5de0d03a5930a7176986761 | 9824d607fab0a0a827abff255865f320e2a7a692 | /企业定做/PcShare/MyMultView.h | 87592870de096155a6e5b79ea1fd6dd289972a75 | [] | no_license | tuian/pcshare | 013b24af954b671aaf98604d6ab330def675a561 | 5d6455226d9720d65cfce841f8d00ef9eb09a5b8 | refs/heads/master | 2021-01-23T19:16:44.227266 | 2014-09-18T02:31:05 | 2014-09-18T02:31:05 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,362 | h | #if !defined(AFX_MYMULTVIEW_H__ED1450FE_6009_4148_BD6F_A3789F17B20D__INCLUDED_)
#define AFX_MYMULTVIEW_H__ED1450FE_6009_4148_BD6F_A3789F17B20D__INCLUDED_
#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000
// MyMultView.h : header file
//
/////////////////////////////////////////////////////////////////////////////
// CMyMultView view
typedef struct _PSPOINT_
{
short x;
short y;
}PSPOINT, *LPPSPOINT;
typedef struct _MYFRAMEINFO_
{
WORD m_Width;
WORD m_Height;
WORD m_RectSize;
}MYFRAMEINFO, *LPMYFRAMEINFO;
class CMyMultView : public CScrollView
{
protected:
CMyMultView(); // protected constructor used by dynamic creation
DECLARE_DYNCREATE(CMyMultView)
// Attributes
public:
// Operations
public:
BOOL IsCanRecord();
BOOL IsInit();
void Start();
void Stop();
void Save();
void StartWork(TCPCONNECTINFO m_SocketInfo, BOOL IsFrame);
void SaveToAVI();
BOOL IsRecord();
CString GetXy();
BOOL InitRecord();
BOOL m_IsInput;
HBITMAP hMainBitmap;
BOOL m_IsRecord;
BITMAPINFO m_gBitmapInfo;
AVISTREAMINFO m_AviInfo;
PAVIFILE pAviFile;
PAVISTREAM pAviStream, pCompressStream;
int nFrames;
CSize m_FrameSize;
BYTE* pRecordData;
MyServerTran m_Tran;
HANDLE hMetux, hRecordThread, hRecvThread, hWaitRecordEvent;
DWORD nBitLen;
HGLOBAL hMemBmp;
IStream* pStmBmp;
ULARGE_INTEGER len;
DWORD nAviHz;
LPPSPOINT pImagePoint;
void SendCtrlInfo();
void SetInputEnable(BOOL bIsEnable);
BOOL ExecCmd(LPMOUSEINFO Info);
void DoRecord();
static void DoRecordThread(LPVOID lPvoid);
void TransVideo();
static void TransVideoThread(LPVOID lPvoid);
void TransFrame();
static void TransFrameThread(LPVOID lPvoid);
private:
void GetMouseXy(MOUSEINFO& m_MouseInfo, CPoint point);
// Overrides
// ClassWizard generated virtual function overrides
//{{AFX_VIRTUAL(CMyMultView)
protected:
virtual BOOL PreCreateWindow(CREATESTRUCT& cs);
virtual void OnDraw(CDC* pDC); // overridden to draw this view
virtual void OnInitialUpdate(); // first time after construct
//}}AFX_VIRTUAL
// Implementation
protected:
virtual ~CMyMultView();
#ifdef _DEBUG
virtual void AssertValid() const;
virtual void Dump(CDumpContext& dc) const;
#endif
// Generated message map functions
//{{AFX_MSG(CMyMultView)
afx_msg void OnPaint();
afx_msg BOOL OnEraseBkgnd(CDC* pDC);
afx_msg void OnDestroy();
afx_msg void OnLButtonDown(UINT nFlags, CPoint point);
afx_msg void OnLButtonUp(UINT nFlags, CPoint point);
afx_msg void OnRButtonDown(UINT nFlags, CPoint point);
afx_msg void OnRButtonUp(UINT nFlags, CPoint point);
afx_msg void OnLButtonDblClk(UINT nFlags, CPoint point);
afx_msg void OnRButtonDblClk(UINT nFlags, CPoint point);
afx_msg void OnMouseMove(UINT nFlags, CPoint point);
afx_msg void OnKeyDown(UINT nChar, UINT nRepCnt, UINT nFlags);
afx_msg void OnSysKeyDown(UINT nChar, UINT nRepCnt, UINT nFlags);
afx_msg BOOL OnCopyData(CWnd* pWnd, COPYDATASTRUCT* pCopyDataStruct);
//}}AFX_MSG
afx_msg LRESULT OnConnBreak(WPARAM wParam, LPARAM lParam);
DECLARE_MESSAGE_MAP()
};
/////////////////////////////////////////////////////////////////////////////
//{{AFX_INSERT_LOCATION}}
// Microsoft Visual C++ will insert additional declarations immediately before the previous line.
#endif // !defined(AFX_MYMULTVIEW_H__ED1450FE_6009_4148_BD6F_A3789F17B20D__INCLUDED_)
| [
"[email protected]"
] | |
a4ee2dbf0f2a66acc600e317241f89d0092764d7 | d21b1f2bb185bb9ccb4c46a1d97a2b62bcc0b1a3 | /30 Days of Code/Day 08: Dictionaries and Maps.cpp | 99e3551822dc4390e3524d9b4cc2ff4c8feb307c | [
"MIT"
] | permissive | Yogeshwarans007/HackerRank-Solutions | ba24ec03541916a1c6f097e77dd6fce6ab5f2f66 | 29c3ebd87723e1237866a551783bf62cf470d919 | refs/heads/master | 2023-08-06T22:51:19.882554 | 2021-10-13T04:11:05 | 2021-10-13T04:11:05 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 410 | cpp | #include<iostream>
#include<map>
using namespace std;
int main()
{
int n;
string name;
long num;
cin>>n;
cin.ignore();
map <string, long> pBook;
for (int i = 0; i < n; i++) {
cin >> name;
cin >> num;
pBook[name] = num;
}
while(cin >> name) {
if (pBook.find(name) != pBook.end()) {
cout << name << "=" << pBook.find(name)->second << endl;
} else {
cout << "Not found" << endl;
}
}
}
| [
"[email protected]"
] | |
b3be669c8925e4680f6fa375ccec9db32e6df07b | bdabad720f77b1debc1095fd013a2e81a9a46c1a | /Simu_SyntheticNetwork/rand.cpp | 5095505640bd66dd0e875b4b1fcf39f20a02cb78 | [
"MIT"
] | permissive | leizhougetbetter/TemporalNetworks | f43fd8b5e993aec8733778f5a6d1c6b9ac58ec62 | 22ae2f70b2ade4aee50064a439d4ca376ba41a5e | refs/heads/master | 2022-07-06T14:28:45.338483 | 2022-06-20T14:16:39 | 2022-06-20T14:16:39 | 252,776,313 | 9 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 451 | cpp | #include <stdlib.h>
#include <stdio.h>
#include <time.h>
//Return a double in range [0,1)
double rand_double1()
{
return (double) rand()/((double)RAND_MAX+1);
}
//Return a double in range [0,1]
double rand_double2()
{
double p = (double) (rand())/((double)RAND_MAX);
if (p>1.0)
{
p = 1.0;
}
return p;
}
//Return a int in range [0,max)
int rand_int(int max)
{
double a = rand_double1();
return (int)(a*max)%max;
} | [
"[email protected]"
] | |
ce268c838b3d590bd4f74810e8ff245e68f601ab | 1ac2d374099f0d265e0d78f0fc811da2c0b4f084 | /Ch03/04_SignalSlot/01_CustomSignalSlot/widget.cpp | 81249150cb302482e94fd49854bc01e4c95dff5b | [] | no_license | kwoss2341/qt_ex | e3d0aa179667409a8878572c481667142debf42a | e3bc7b11e624b5f230d9b17e9ac970f36d18bb2f | refs/heads/master | 2023-03-24T03:00:41.744163 | 2021-03-20T14:21:46 | 2021-03-20T14:21:46 | 337,698,939 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 608 | cpp | #include "widget.h"
Widget::Widget(QWidget *parent)
: QWidget(parent)
{
lbl = new QLabel("", this);
lbl->setGeometry(10, 10, 250, 40);
SignalSlot myObject;
// New Style
connect(&myObject, &SignalSlot::valueChanged,
this, &Widget::setValue);
//Old Style
/*
connect(&myObject, SIGNAL(valueChanged(int)),
this, SLOT(setValue(int)));
*/
myObject.setValue(50);
}
void Widget::setValue(int val)
{
QString labelText = QString("시그널 발생, Value : %1").arg(val);
lbl->setText(labelText);
}
Widget::~Widget()
{
}
| [
"[email protected]"
] | |
3085109e30dc2535cc0dd488f4bdb943bfc2a744 | 67fc9e51437e351579fe9d2d349040c25936472a | /wrappers/8.1.1/vtkCircularLayoutStrategyWrap.h | 96dd725c7c113f71cbf39a4cb111c51437c6d47e | [] | permissive | axkibe/node-vtk | 51b3207c7a7d3b59a4dd46a51e754984c3302dec | 900ad7b5500f672519da5aa24c99aa5a96466ef3 | refs/heads/master | 2023-03-05T07:45:45.577220 | 2020-03-30T09:31:07 | 2020-03-30T09:31:07 | 48,490,707 | 6 | 0 | BSD-3-Clause | 2022-12-07T20:41:45 | 2015-12-23T12:58:43 | C++ | UTF-8 | C++ | false | false | 1,333 | h | /* this file has been autogenerated by vtkNodeJsWrap */
/* editing this might proof futile */
#ifndef NATIVE_EXTENSION_VTK_VTKCIRCULARLAYOUTSTRATEGYWRAP_H
#define NATIVE_EXTENSION_VTK_VTKCIRCULARLAYOUTSTRATEGYWRAP_H
#include <nan.h>
#include <vtkSmartPointer.h>
#include <vtkCircularLayoutStrategy.h>
#include "vtkGraphLayoutStrategyWrap.h"
#include "../../plus/plus.h"
class VtkCircularLayoutStrategyWrap : public VtkGraphLayoutStrategyWrap
{
public:
using Nan::ObjectWrap::Wrap;
static void Init(v8::Local<v8::Object> exports);
static void InitPtpl();
static void ConstructorGetter(
v8::Local<v8::String> property,
const Nan::PropertyCallbackInfo<v8::Value>& info);
VtkCircularLayoutStrategyWrap(vtkSmartPointer<vtkCircularLayoutStrategy>);
VtkCircularLayoutStrategyWrap();
~VtkCircularLayoutStrategyWrap( );
static Nan::Persistent<v8::FunctionTemplate> ptpl;
private:
static void New(const Nan::FunctionCallbackInfo<v8::Value>& info);
static void Layout(const Nan::FunctionCallbackInfo<v8::Value>& info);
static void NewInstance(const Nan::FunctionCallbackInfo<v8::Value>& info);
static void SafeDownCast(const Nan::FunctionCallbackInfo<v8::Value>& info);
#ifdef VTK_NODE_PLUS_VTKCIRCULARLAYOUTSTRATEGYWRAP_CLASSDEF
VTK_NODE_PLUS_VTKCIRCULARLAYOUTSTRATEGYWRAP_CLASSDEF
#endif
};
#endif
| [
"[email protected]"
] | |
3460445229d2662bd7c2cd4afb2c18be1e6f08c1 | 89a7fc84adee392c6fe7b9cf654b2f73a3c82903 | /src/mediachooserpopup.h | 37926474ed614076b9d64e8f7cff8865e7058fe1 | [] | no_license | app211/jaqet | 401609e0ac0721846abba77777a1c9d14ba025f5 | 3b5cb9945705a911b188b371b42def715b9e7d21 | refs/heads/master | 2021-01-19T08:55:00.938449 | 2015-11-24T21:50:57 | 2015-11-24T21:50:57 | 18,848,873 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,317 | h | #ifndef MEDIACHOOSERWIDGET_H
#define MEDIACHOOSERWIDGET_H
#include <QWidget>
#include <QFlags>
#include <QUrl>
#include "mediachoosermediatype.h"
class QGraphicsScene;
class QCloseEvent;
class MediaChooserGraphicsObject;
class MediaChooserButton;
class Scraper;
class QNetworkAccessManager;
class ClickButtonMediaChooserGraphicsObject;
namespace Ui {
class MediaChooserPopup;
}
class MediaChooserPopup: public QWidget
{
Q_OBJECT
public:
Q_DECLARE_FLAGS(imageFilter, ImageType)
explicit MediaChooserPopup(QWidget *parent = 0);
~MediaChooserPopup();
void clear();
void addImageFromUrl(const QUrl& url, QFlags<ImageType> type);
void addImageFromFile(const QString& localFile, QFlags<ImageType> type);
void addImageFromScraper(const Scraper* scraper, const QString& imageRef , const QSize &originalSize, QFlags<ImageType> type);
void popup(MediaChooserButton *button, QFlags<ImageType> filter=ImageType::All);
QFlags<ImageType> currentFilter();
uint getMediaWidth() const {
return 200;
}
uint getMediaHeigth() const {
return 200;
}
protected:
void closeEvent(QCloseEvent *event);
void doFilter( QFlags<ImageType> filter);
signals:
void mediaChoosed(const MediaChoosed& url);
void popupClosed();
private slots:
void refilter();
void on_pushButton_clicked();
public slots:
void mediaSelected(const MediaChoosed& url);
void reload(const QUrl& url, QPointer<MediaChooserGraphicsObject> itemToUpdate, QPointer<QGraphicsProxyWidget> busyIndicator, QPointer<ClickButtonMediaChooserGraphicsObject> chooseButton, QPointer<ClickButtonMediaChooserGraphicsObject> reloadButton);
private:
Ui::MediaChooserPopup *ui;
void setImageFromInternet(const QPixmap& pixmap, QPointer<MediaChooserGraphicsObject> itemToUpdate);
void addFile(const QUrl& url, QPointer<MediaChooserGraphicsObject> itemToUpdate, QPointer<QGraphicsProxyWidget> busyIndicator , QPointer<ClickButtonMediaChooserGraphicsObject> chooseButton,QPointer<ClickButtonMediaChooserGraphicsObject> reloadButton);
void addError(const QString& errorMessage, QPointer<MediaChooserGraphicsObject> itemToUpdate, QPointer<QGraphicsProxyWidget> busyIndicator, QPointer<ClickButtonMediaChooserGraphicsObject> chooseButton, QPointer<ClickButtonMediaChooserGraphicsObject> reloadButton);
void addHttpRequest(const QUrl& url, QPointer<MediaChooserGraphicsObject> itemToUpdate, QPointer<QGraphicsProxyWidget> busyIndicator, QPointer<ClickButtonMediaChooserGraphicsObject> chooseButton, QPointer<ClickButtonMediaChooserGraphicsObject> reloadButton );
void addImage(const QUrl&, const MediaChoosed &mediaChoosed, QFlags<ImageType> type);
void addPixmap(const QPixmap& pixmap, QPointer<MediaChooserGraphicsObject> itemToUpdate,QPointer<QGraphicsProxyWidget> busyIndicator, QPointer<ClickButtonMediaChooserGraphicsObject> chooseButton,QPointer<ClickButtonMediaChooserGraphicsObject> reloadButton);
void startPromise( QNetworkAccessManager* manager);
QPixmap createDefaultPoster() const;
QFlags<ImageType> _currentFilter;
};
Q_DECLARE_OPERATORS_FOR_FLAGS(MediaChooserPopup::imageFilter)
#endif // MEDIACHOOSERWIDGET_H
| [
"[email protected]"
] | |
1b50f376e0ed5da1699de107cf07c516203511b2 | 01528a046e1c5bfaa1e1b94d30babb35675c9f3a | /trunk/iWinOnline-cocos2dx/iwin/Classes/Services/ReviewService.cpp | e6e3ee22415bdb5ba3b5120eef1b8cf58f15da69 | [] | no_license | flowerfx/cc_iw_game | f48802b355baaaff887e289d7cd97d2ba8f58082 | 81309a8651e2ec089d1bd08a07cacb0949d05df7 | refs/heads/master | 2021-01-21T15:32:22.670075 | 2020-05-08T09:15:50 | 2020-05-08T09:15:50 | 81,444,503 | 0 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 1,706 | cpp | #include "ReviewService.h"
using namespace cocos2d::network;
ReviewService* ReviewService::s_instance = nullptr;
ReviewService* ReviewService::getInstance()
{
if (s_instance == nullptr) {
s_instance = new ReviewService();
}
return s_instance;
}
ReviewService::ReviewService()
{
//_isLoadDataFromServerOK = false;
}
void ReviewService::requestAllHelp()
{
/*final HttpRequest httpRequest = new HttpRequest(HttpMethods.GET);
httpRequest.setUrl(URL_REQUEST_ALL_HELP);
HttpRequestManager.getInstance().post(URL_REQUEST_ALL_HELP,
httpRequest, this);*/
//HttpRequest* request = new (std::nothrow) HttpRequest();
//request->setUrl(URL_REQUEST_ALL_HELP);
//request->setRequestType(HttpRequest::Type::GET);
//request->setResponseCallback(CC_CALLBACK_2(GuideService::onHttpRequestCompleted, this));
//request->setTag(URL_REQUEST_ALL_HELP);
//HttpClient::getInstance()->send(request);
//request->release();
}
void ReviewService::onHttpRequestCompleted(cocos2d::network::HttpClient *sender, cocos2d::network::HttpResponse *response)
{
//if (strcmp(response->getHttpRequest()->getTag(), URL_REQUEST_ALL_HELP) == 0)
//{
// std::string jsonString;
// std::vector<char>* data_response = response->getResponseData();
// for (int i = 0; i < data_response->size(); i++)
// {
// jsonString += data_response->at(i);
// }
// //std::string jsonString = response->getResponseDataString();
// CCLOG("TTTTTTTTTTTTTTTTTTTTTTTT %s", jsonString.c_str());
// if (jsonString.size() > 0)
// {
// _isLoadDataFromServerOK = true;
// _guides.toData(jsonString);
// }
// //if (!Utility.isNullOrEmpty(jsonString)) {
// // isLoadDataFromServerOK = true;
// // setGuides(jsonString);
// //}
//}
} | [
"[email protected]"
] | |
ae201d885392c9da4138ba6746ffcc86e6d3b1f3 | 8dc84558f0058d90dfc4955e905dab1b22d12c08 | /ash/wm/property_util.cc | 320545c4c484f3164134e86253c3fb6bca1e70a4 | [
"LicenseRef-scancode-unknown-license-reference",
"BSD-3-Clause"
] | permissive | meniossin/src | 42a95cc6c4a9c71d43d62bc4311224ca1fd61e03 | 44f73f7e76119e5ab415d4593ac66485e65d700a | refs/heads/master | 2022-12-16T20:17:03.747113 | 2020-09-03T10:43:12 | 2020-09-03T10:43:12 | 263,710,168 | 1 | 0 | BSD-3-Clause | 2020-05-13T18:20:09 | 2020-05-13T18:20:08 | null | UTF-8 | C++ | false | false | 3,507 | cc | // Copyright 2015 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "ash/wm/property_util.h"
#include "ash/public/cpp/window_style.h"
#include "ash/public/interfaces/window_style.mojom.h"
#include "services/ui/public/cpp/property_type_converters.h"
#include "services/ui/public/interfaces/window_manager.mojom.h"
#include "ui/aura/mus/property_converter.h"
#include "ui/aura/window.h"
#include "ui/display/types/display_constants.h"
#include "ui/gfx/geometry/rect.h"
#include "ui/gfx/geometry/size.h"
namespace ash {
int64_t GetInitialDisplayId(const InitProperties& properties) {
auto iter =
properties.find(ui::mojom::WindowManager::kDisplayId_InitProperty);
return iter == properties.end() ? display::kInvalidDisplayId
: mojo::ConvertTo<int64_t>(iter->second);
}
bool GetInitialContainerId(const InitProperties& properties,
int* container_id) {
auto iter =
properties.find(ui::mojom::WindowManager::kContainerId_InitProperty);
if (iter == properties.end())
return false;
*container_id = mojo::ConvertTo<int32_t>(iter->second);
return true;
}
bool GetInitialBounds(const InitProperties& properties, gfx::Rect* bounds) {
auto iter = properties.find(ui::mojom::WindowManager::kBounds_InitProperty);
if (iter == properties.end())
return false;
*bounds = mojo::ConvertTo<gfx::Rect>(iter->second);
return true;
}
bool GetWindowPreferredSize(const InitProperties& properties, gfx::Size* size) {
auto iter =
properties.find(ui::mojom::WindowManager::kPreferredSize_Property);
if (iter == properties.end())
return false;
*size = mojo::ConvertTo<gfx::Size>(iter->second);
return true;
}
bool ShouldRemoveStandardFrame(const InitProperties& properties) {
auto iter = properties.find(
ui::mojom::WindowManager::kRemoveStandardFrame_InitProperty);
return iter != properties.end() && mojo::ConvertTo<bool>(iter->second);
}
base::Optional<SkColor> GetFrameColor(const InitProperties& properties,
bool active) {
base::Optional<SkColor> color;
auto iter = properties.find(
active ? ui::mojom::WindowManager::kActiveFrameColor_InitProperty
: ui::mojom::WindowManager::kInactiveFrameColor_InitProperty);
if (iter != properties.end())
color = mojo::ConvertTo<int32_t>(iter->second);
return color;
}
bool ShouldEnableImmersive(const InitProperties& properties) {
auto iter =
properties.find(ui::mojom::WindowManager::kDisableImmersive_InitProperty);
return iter == properties.end() || !mojo::ConvertTo<bool>(iter->second);
}
mojom::WindowStyle GetWindowStyle(const InitProperties& properties) {
auto iter = properties.find(mojom::kAshWindowStyle_InitProperty);
if (iter == properties.end())
return mojom::WindowStyle::DEFAULT;
const int32_t value = mojo::ConvertTo<int32_t>(iter->second);
return IsValidWindowStyle(value) ? static_cast<mojom::WindowStyle>(value)
: mojom::WindowStyle::DEFAULT;
}
void ApplyProperties(
aura::Window* window,
aura::PropertyConverter* property_converter,
const std::map<std::string, std::vector<uint8_t>>& properties) {
for (auto& property_pair : properties) {
property_converter->SetPropertyFromTransportValue(
window, property_pair.first, &property_pair.second);
}
}
} // namespace ash
| [
"[email protected]"
] | |
7c43d1f97fba70cc2ff2d9a9163969d147923ec9 | 997e6464caca89940666193c2e94d8c6abb33048 | /Janela_Automatica_v_2_1/Janela_Automatica_v_2_1.ino | f615048ec34c473e176f7f966545b2edfbb51799 | [] | no_license | mmcromero/historico-de-codigos-arduino | bcb48dc9952b24c99962be3a17534bcdd4d9b6db | 32a23d559f54cc586689b3e99ce9ffbebac75767 | refs/heads/master | 2021-04-26T23:44:57.097035 | 2018-03-05T01:53:45 | 2018-03-05T01:53:45 | 123,849,599 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 10,406 | ino | /*
//Programa : Controle de Janela de 2 folhas
Sensor Ldr: Quando esta de dia, janela de aluminio abre e quando escurece janela de aluminio fecha.
setLimiteDelayLdr = variavel que determina tempo do delay para inicio da ação
Sensor Chuva: Quando chove, janela de vidro fecha e quando para de chover janela de vidro abre.
setLimiteDelayChuva = variavel que determina tempo do delay para inicio da ação
Autor : Marco Romero
*/
int ledRed = 13;
int ledGreen = 12;
byte pinoBotaoTone = 2;//
int NEGATIVOBUZZER = A5;
//Definicoes pinos Arduino ligados a entrada da Ponte H
int IN1 = 4;
int IN2 = 5;
int IN3 = 6;
int IN4 = 7;
// Definiçõe Ldr
int sensorLdr = 0;//
int valorSensorLdr = 0;
int timeOffDelayLdr = 0;
int setLimiteDelayLdr = 1000;
//Definiçõe sensor de chuva
int sensordechuva = 3;
int timeOffDelayChuva = 0;
int setLimiteDelayChuva = 500;
//bt
byte pinoBotao1 = 11;
byte pinoBotao2 = 10;
byte pinoBotao3 = 9;
byte pinoBotao4 = 8;
int statusChave1;
int statusChave2;
int statusChave3;
int statusChave4;
//----------------------------
/// Variaveis de controle
int mostrasensorLdr;
int mostrasensorChuva;
String statusEsq = "p";
String statusDir = "p";
String statusEsq_Db;
String statusDir_Db;
String cmd = "";
void setup()
{
Serial.begin(9600);
pinMode(NEGATIVOBUZZER, OUTPUT);
pinMode(ledRed, OUTPUT);
pinMode(ledGreen, OUTPUT);
//Define os pinos ponte H como saida
pinMode(IN1, OUTPUT);
pinMode(IN2, OUTPUT);
pinMode(IN3, OUTPUT);
pinMode(IN4, OUTPUT);
//Define sensor de chuva como entrada
pinMode(sensordechuva,INPUT);
//Define o pino como entrada (Pino do botao)
pinMode(pinoBotao1, INPUT);//bt1
pinMode(pinoBotao2, INPUT);//bt2
pinMode(pinoBotao3, INPUT);//bt3
pinMode(pinoBotao4, INPUT);//bt4
digitalWrite(ledRed, HIGH); // turn the LED on (HIGH is the voltage level)
tone(pinoBotaoTone,900,20); //aqui sai o som
delay(100); // wait for a second
digitalWrite(ledRed, LOW); // turn the LED off by making the voltage LOW
tone(pinoBotaoTone,900,40); //aqui sai o som
delay(100);
digitalWrite(ledGreen, HIGH); // turn the LED on (HIGH is the voltage level)
tone(pinoBotaoTone,900,60); //aqui sai o som
delay(100); // wait for a second
digitalWrite(ledGreen, LOW); // turn the LED off by making the voltage LOW
tone(pinoBotaoTone,900,80); //aqui sai o som
delay(100);
}
void loop()
{
/////// RECEBE SERIAL //-----------------------------------------------------------------------------------------------------------
if(Serial.available() > 0) // serial pc
{
while(Serial.available() > 0)
{
cmd += char(Serial.read());
delay(10);
}
Serial.println(cmd);
}
if (cmd.length() >0) {
if(cmd == "ldr on") { mostrasensorLdr = 1;}
if(cmd == "ldr off"){ mostrasensorLdr = 0;}
if(cmd == "esq h"){ statusEsq = "h";}
if(cmd == "esq a") { statusEsq = "a";}
if(cmd == "esq p"){ statusEsq = "p";}
if(cmd == "dir h"){ statusDir = "h";}
if(cmd == "dir a") { statusDir = "a";}
if(cmd == "dir p"){ statusDir = "p";}
cmd = "";
}
botoes();
sensorLuz();
sensorChuva();
if(statusEsq == "h" && statusChave1 == 0 && statusChave2 == 0){
giraEsquedoHorario();
}else if(statusEsq == "h" && statusChave1 == 1 && statusChave2 == 0){
paraEsquerdo();
};
if(statusEsq == "a" && statusChave1 == 0 && statusChave2 == 0){
giraEsquedoAntiHorario();
}else if(statusEsq == "a" && statusChave1 == 0 && statusChave2 == 1){
paraEsquerdo();
};
if(statusDir == "h" && statusChave3 == 0 && statusChave4 == 0){
giraDireitoHorario();
}else if(statusDir == "h" && statusChave3 == 1 && statusChave4 == 0){
paraDireito();
};
if(statusDir == "a" && statusChave3 == 0 && statusChave4 == 0){
giraDireitoAntiHorario();
}else if(statusDir == "a" && statusChave3 == 0 && statusChave4 == 1){
paraDireito();
};
delay(10);
}//------------------------------------- fim loop
//////////////////////////////////////////////////////////////////////////////////////////////////
void giraEsquedoHorario()
{
digitalWrite(IN1, HIGH);
digitalWrite(IN2, LOW);
digitalWrite(ledRed, HIGH); // turn the LED on (HIGH is the voltage level)
tone(pinoBotaoTone,900,20); //aqui sai o som
delay(100); // wait for a second
digitalWrite(ledRed, LOW); // turn the LED off by making the voltage LOW
delay(100);
}
void giraEsquedoAntiHorario()
{
digitalWrite(IN1, LOW);
digitalWrite(IN2, HIGH);
tone(pinoBotaoTone,900,40); //aqui sai o som
digitalWrite(ledRed, HIGH); // turn the LED on (HIGH is the voltage level)
delay(100); // wait for a second
digitalWrite(ledRed, LOW); // turn the LED off by making the voltage LOW
delay(100);
}
void paraEsquerdo()
{
digitalWrite(IN1, HIGH);
digitalWrite(IN2, HIGH);
}
//////////////////////////////////////////////////////////////////////////////////////////////////
void giraDireitoHorario()
{
digitalWrite(IN3, HIGH);
digitalWrite(IN4, LOW);
tone(pinoBotaoTone,900,60); //aqui sai o som
digitalWrite(ledGreen, HIGH); // turn the LED on (HIGH is the voltage level)
delay(100); // wait for a second
digitalWrite(ledGreen, LOW); // turn the LED off by making the voltage LOW
delay(100);
}
void giraDireitoAntiHorario()
{
digitalWrite(IN3, LOW);
digitalWrite(IN4, HIGH);
tone(pinoBotaoTone,900,80); //aqui sai o som
digitalWrite(ledGreen, HIGH); // turn the LED on (HIGH is the voltage level)
delay(100); // wait for a second
digitalWrite(ledGreen, LOW); // turn the LED off by making the voltage LOW
delay(100);
}
void paraDireito()
{
digitalWrite(IN3, HIGH);
digitalWrite(IN4, HIGH);
}
//////////////////////////////////////////////////////////////////////////////////////////////////
void sensorLuz()
{
int valorSensorLdr = analogRead(sensorLdr);
if(valorSensorLdr > 500){
if(statusEsq_Db != "h"){
statusEsq_Db = "h";
timeOffDelayLdr = 0;
}else{
if(timeOffDelayLdr > setLimiteDelayLdr){
if(statusEsq != "h"){
statusEsq = "h";
statusChave2 = 0;
Serial.println("Dia - Abre Aluminio");
Serial.print("Status Giro Motor Esq: ");
Serial.print(statusEsq);
Serial.print(" Status Chave 1: ");
Serial.print(statusChave1);
Serial.print(" Status Chave 2: ");
Serial.println(statusChave2);
}
timeOffDelayLdr = 0;
}
timeOffDelayLdr++;
}
}else if(valorSensorLdr < 500){
if(statusEsq_Db != "a"){
statusEsq_Db = "a";
timeOffDelayLdr = 0;
}else{
if(timeOffDelayLdr > setLimiteDelayLdr){
if(statusEsq != "a"){
statusEsq = "a";
statusChave1 = 0;
Serial.println("Noite - Fecha Aluminio");
Serial.print("Status Giro Motor Esq: ");
Serial.print(statusEsq);
Serial.print(" Status Chave 1: ");
Serial.print(statusChave1);
Serial.print(" Status Chave 2: ");
Serial.println(statusChave2);
}
timeOffDelayLdr = 0;
}
timeOffDelayLdr++;
}
}
//Exibindo o valor do sensor no serial monitor.
if(mostrasensorLdr == 1){
Serial.print("LDR - Motor Esq: ");
Serial.print(valorSensorLdr);
Serial.print(" - ");
Serial.print(statusEsq);
Serial.print(" - ");
Serial.print(statusEsq_Db);
Serial.print(" - ");
Serial.println(timeOffDelayLdr);
}
}
//-----------------------------------------------------------------------------------------------------------------------------
void sensorChuva()
{
if(digitalRead(sensordechuva) == 0)
{
if(timeOffDelayChuva > setLimiteDelayChuva){
if(statusDir != "h"){
statusDir = "h";
statusChave4 = 0;
Serial.println("Com Chuva - Fecha Vidro");
Serial.print("Status Giro Motor Dir: ");
Serial.print(statusDir);
Serial.print(" Status Chave 3: ");
Serial.print(statusChave3);
Serial.print(" Status Chave 4: ");
Serial.println(statusChave4);
}
timeOffDelayChuva = 0;
}
timeOffDelayChuva++;
}
else if(digitalRead(sensordechuva) == 1)
{
if(timeOffDelayChuva > setLimiteDelayChuva){
if(statusDir != "a"){
statusDir = "a";
statusChave3 = 0;
Serial.println("Sem Chuva - Abre Vidro");
Serial.print("Status Giro Motor Dir: ");
Serial.print(statusDir);
Serial.print(" Status Chave 3: ");
Serial.print(statusChave3);
Serial.print(" Status Chave 4: ");
Serial.println(statusChave4);
}
timeOffDelayChuva = 0;
}
timeOffDelayChuva++;
}
if(mostrasensorChuva == 1){
Serial.print("Chuva - Motor Dir: ");
Serial.println(sensordechuva);
}
}
void botoes()
{
if (digitalRead(pinoBotao1) == HIGH)
{
if(statusChave1 != 1){
statusEsq == "p";
Serial.println("Chave1 acionada");
statusChave1 = 1;
}
}else if (digitalRead(pinoBotao1) == LOW) {
if(statusChave1 != 0){
Serial.println("Chave1 desligada");
statusChave1 = 0;
}
}
if (digitalRead(pinoBotao2) == HIGH)
{
if(statusChave2 != 1){
statusEsq == "p";
Serial.println("Chave2 acionada");
statusChave2 = 1;
}
}else if (digitalRead(pinoBotao2) == LOW) {
if(statusChave2 != 0){
Serial.println("Chave2 desligada");
statusChave2 = 0;
}
}
if (digitalRead(pinoBotao3) == HIGH)
{
if(statusChave3 != 1){
statusEsq == "p";
Serial.println("Chave3 acionada");
statusChave3 = 1;
}
}else if (digitalRead(pinoBotao3) == LOW) {
if(statusChave3 != 0){
Serial.println("Chave3 desligada");
statusChave3 = 0;
}
}
if (digitalRead(pinoBotao4) == HIGH)
{
if(statusChave4 != 1){
statusEsq == "p";
Serial.println("Chave4 acionada");
statusChave4 = 1;
}
}else if (digitalRead(pinoBotao4) == LOW) {
if(statusChave4 != 0){
Serial.println("Chave4 desligada");
statusChave4 = 0;
}
}
}
| [
"[email protected]"
] | |
a2cf9bf55875934bd6c50b7c66ebac7634e81f8e | 19f039b593be9401d479b15f97ecb191ef478f46 | /RSA-SW/PSME/common/agent-framework/tests/configuration/validators/address_test.cpp | d46ef7f6cd1ce37875041f330f7f66bf30bf7926 | [
"MIT",
"BSD-3-Clause",
"Apache-2.0"
] | permissive | isabella232/IntelRackScaleArchitecture | 9a28e34a7f7cdc21402791f24dad842ac74d07b6 | 1206d2316e1bd1889b10a1c4f4a39f71bdfa88d3 | refs/heads/master | 2021-06-04T08:33:27.191735 | 2016-09-29T09:18:10 | 2016-09-29T09:18:10 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,897 | cpp | /*!
* @section LICENSE
*
* @copyright
* Copyright (c) 2015 Intel Corporation
*
* @copyright
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* @copyright
* http://www.apache.org/licenses/LICENSE-2.0
*
* @copyright
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
* @section DESCRIPTION
* */
#include <cstdio>
#include "configuration/validators/address.hpp"
#include "gtest/gtest.h"
#include "gmock/gmock.h"
#include "json/json.hpp"
using namespace configuration;
using namespace json;
using ::testing::Return;
using ::testing::Throw;
class AddressValidatorTest : public ::testing::Test {
protected:
static constexpr const char ADDRESS_VALUE[] = "TestAddressValue";
static constexpr const char VALID_STRING_VALUE[] = "localhost";
static constexpr const char VALID_ADDRESS_VALUE[] = "127.0.0.1";
static constexpr const char INVALID_ADDRESS_VALUE[] = "InvalidTestValue";
static constexpr const int INVALID_TYPE_VALUE = 5;
virtual ~AddressValidatorTest();
};
constexpr char AddressValidatorTest::ADDRESS_VALUE[];
constexpr char AddressValidatorTest::VALID_STRING_VALUE[];
constexpr char AddressValidatorTest::VALID_ADDRESS_VALUE[];
constexpr char AddressValidatorTest::INVALID_ADDRESS_VALUE[];
AddressValidatorTest::~AddressValidatorTest() {}
/* Positive. */
TEST_F(AddressValidatorTest, PositiveValidStringValueTest) {
std::unique_ptr<configuration::AddressValidator> address_validator(new configuration::AddressValidator(ADDRESS_VALUE));
json::Value json_val(VALID_STRING_VALUE);
ASSERT_EQ(address_validator->is_valid(json_val), true);
}
TEST_F(AddressValidatorTest, PositiveValidAddressTest) {
std::unique_ptr<configuration::AddressValidator> address_validator(new configuration::AddressValidator(ADDRESS_VALUE));
json::Value json_val(VALID_ADDRESS_VALUE);
ASSERT_EQ(address_validator->is_valid(json_val), true);
}
/* Negative. */
TEST_F(AddressValidatorTest, NegativeInvalidTypeTest) {
std::unique_ptr<configuration::AddressValidator> address_validator(new configuration::AddressValidator(ADDRESS_VALUE));
json::Value json_val(INVALID_TYPE_VALUE);
ASSERT_EQ(address_validator->is_valid(json_val), false);
}
TEST_F(AddressValidatorTest, NegativeInvalidAddressTest) {
std::unique_ptr<configuration::AddressValidator> address_validator(new configuration::AddressValidator(ADDRESS_VALUE));
json::Value json_val(INVALID_TYPE_VALUE);
ASSERT_EQ(address_validator->is_valid(json_val), false);
}
| [
"[email protected]"
] | |
8b688dee6c565046b566d535d80a96149f3c9458 | f7b876a11cc15cec6a5b377df3e915aaf5bcc289 | /5_tree/depth_of_btree.cpp | 52d33a6053b1090da8ca0d36566e21c9cfa345b5 | [] | no_license | AniRobotics/CPP-Fundamental-Problems | 01a25962f998689364a52ed2c04f544a75ec2d7d | 9f0c2641a54022a4acee8f21cad22db261c4aeff | refs/heads/master | 2021-04-22T02:00:15.944414 | 2020-09-15T16:42:31 | 2020-09-15T16:42:31 | 249,841,528 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,019 | cpp | #include <iostream>
#include <vector>
#include <queue>
#include <memory>
using namespace std;
/*
10
/ \
20 30 <----- Tree used for this problem
/ \ / \
40 50 60 70
/ \
80 90
*/
class Node {
private:
int value;
std::shared_ptr<Node> left;
std::shared_ptr<Node> right;
public:
Node(int value) {this->value = value;}
void set_left(int value) {left = std::make_shared<Node>(Node(value));}
void set_right(int value) {right = std::make_shared<Node>(Node(value));}
int get_value() { return value; }
std::shared_ptr<Node> get_left() {return left;}
std::shared_ptr<Node> get_right() {return right;}
};
std::shared_ptr<Node> build_btree(std::vector<int> node_vals) {
// Build the tree
int i = 0;
std::shared_ptr<Node> root = std::make_shared<Node> (Node(node_vals[i++]));
std::queue<std::shared_ptr<Node>> temp_q;
temp_q.push(root);
while (i < node_vals.size()) {
auto current_parent = temp_q.front();
temp_q.pop();
if (current_parent->get_left() == nullptr) {
current_parent->set_left(node_vals[i++]);
temp_q.push(current_parent->get_left());
}
if (current_parent->get_right() == nullptr && i < node_vals.size()) {
current_parent->set_right(node_vals[i++]);
temp_q.push(current_parent->get_right());
}
}
std::cout << "Tree building completed" << std::endl;
return std::move(root);
}
int find_depth_btree(std::shared_ptr<Node> node) {
if (node->get_left() == nullptr && node->get_right() == nullptr) {
return 1;
}
return max(find_depth_btree(node->get_left()), find_depth_btree(node->get_right())) + 1;
}
int main (int argc, char** argv) {
// Build the tree
std::vector<int> node_val = {10, 20, 30, 40, 50, 60, 70, 80, 90};
std::shared_ptr<Node> root = build_btree(node_val);
// Find depth of binary tree
int depth = find_depth_btree(root);
std::cout << "depth of binary tree: " << depth << std::endl;
return 0;
}
| [
"[email protected]"
] | |
204e8aa80ec5dd60a2ce6178fe7154f9eed695ae | 76c247d000c261dd521768cf45e0aafa9839935c | /Clients.cpp | c0e1b4d5c483c5e3aef1e7bf33ca3ef53f71a88e | [] | no_license | Skynet2020/Lab_4_LinkedList | 5eb79f6d4da2fb203737951e3adc066439088280 | e7b5124d1fa9848f904e03ac69528ac49baec0df | refs/heads/master | 2020-08-09T20:38:20.470000 | 2019-10-10T11:55:08 | 2019-10-10T11:55:08 | 214,170,046 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 401 | cpp | /*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
#include "Clients.h"
// Функция пустая, надо написать
template<typename ItemType>
bool Clients<ItemType>::isEmpty(){
bool result = true;
return result;
}
| [
"[email protected]"
] | |
d42a7c559862a372d05bdddbdbb7a3cc2f6a9dc8 | 00f964ab109f17423617037fe48ab2d823bcde2b | /src/applications/pingapp/PingApp.h | 7324209ae75de0afad7e31dd394ecda93359b878 | [] | no_license | PASER/Simulation-INETMANET | 2c18bc6d076d425a6660ecea699df5ae80f73273 | 47c30f967ce6135c4e07399ecfad32590348f1d3 | refs/heads/master | 2016-08-05T19:57:54.742163 | 2012-12-18T11:30:21 | 2012-12-18T11:30:21 | 7,203,912 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,221 | h | //
// Copyright (C) 2001, 2003, 2004 Johnny Lai, Monash University, Melbourne, Australia
// Copyright (C) 2005 Andras Varga
//
// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public License
// as published by the Free Software Foundation; either version 2
// of the License, or (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with this program; if not, see <http://www.gnu.org/licenses/>.
//
#include "INETDefs.h"
#include "IPvXAddress.h"
class PingPayload;
/**
* Generates ping requests and calculates the packet loss and round trip
* parameters of the replies.
*
* See NED file for detailed description of operation.
*/
class INET_API PingApp : public cSimpleModule
{
protected:
virtual void initialize(int stage);
virtual int numInitStages() const { return 4; }
virtual void handleMessage(cMessage *msg);
virtual void finish();
protected:
virtual void sendPing();
virtual void scheduleNextPing(cMessage *timer);
virtual void sendToICMP(cMessage *payload, const IPvXAddress& destAddr, const IPvXAddress& srcAddr, int hopLimit);
virtual void processPingResponse(PingPayload *msg);
virtual void countPingResponse(int bytes, long seqNo, simtime_t rtt);
protected:
// configuration
IPvXAddress destAddr;
IPvXAddress srcAddr;
int packetSize;
cPar *sendIntervalp;
int hopLimit;
int count;
simtime_t startTime;
simtime_t stopTime;
bool printPing;
// state
long sendSeqNo;
long expectedReplySeqNo;
// statistics
cStdDev rttStat;
static simsignal_t rttSignal;
static simsignal_t numLostSignal;
static simsignal_t outOfOrderArrivalsSignal;
static simsignal_t pingTxSeqSignal;
static simsignal_t pingRxSeqSignal;
long lossCount;
long outOfOrderArrivalCount;
long numPongs;
};
| [
"[email protected]"
] | |
3898884ef82aef36f6790da00f745e046a614670 | 1dc6d0b43ae1471aa030214dc06fe9269a7bfd7f | /l12-13/75.cpp | 7c5949cc9aa787ce5f012706fac126735a3d801a | [] | no_license | kskeshav/Codeforces-Contests | 5e52e7c802b8e62f80c81e61aebb300536f5181c | cde885818be5fe9d07ffbd4cabeda2aa42dd3a39 | refs/heads/main | 2023-06-10T21:52:24.911333 | 2021-07-09T09:51:53 | 2021-07-09T09:51:53 | 384,392,773 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 413 | cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(int argc, char const *argv[])
{
int n,a,b,c,m = 0;
cin>>n>>a>>b>>c;
int x = n/a;
int r = 0;
for (int i = 0; i <= x; ++i)
{
r = n-i*a;
int y = r/b;
for (int j = 0; j <= y; ++j)
{
int t = n-a*i-b*j;
if (t%c == 0)
{
int z = t/c;
if (i+j+z>m)
{
m = i+j+z;
}
}
}
}
cout<<m<<endl;
return 0;
} | [
"[email protected]"
] | |
475609a090cc1d797930211603cd630411c69f39 | 594aba22b8185ed8f43804c7b0b6738e9e5d031c | /Source/Shooter_3rdPerson/Shooter_3rdPersonGameModeBase.h | 8800171281dbb4d1b5855e3a28858e6619d33e92 | [] | no_license | branthompson/3rdPersonShooter | 2acc7050e5d30bca483704bcdc60c24609a98625 | 337296f72e7b0908ae8293969f0bd42a9c23e452 | refs/heads/main | 2023-07-08T20:08:31.107346 | 2021-08-08T05:06:48 | 2021-08-08T05:06:48 | 393,859,915 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 330 | h | // Copyright Epic Games, Inc. All Rights Reserved.
#pragma once
#include "CoreMinimal.h"
#include "GameFramework/GameModeBase.h"
#include "Shooter_3rdPersonGameModeBase.generated.h"
/**
*
*/
UCLASS()
class SHOOTER_3RDPERSON_API AShooter_3rdPersonGameModeBase : public AGameModeBase
{
GENERATED_BODY()
};
| [
"[email protected]"
] | |
3edd70d87d1ae5ffc284cbd35899a054a955c699 | e98b8922ee3d566d7b7193bc71d269ce69b18b49 | /include/qpid/sys/SaslFactory.h | 7ba41e67ad005eebb9c7e75796ed2c9dc0880126 | [] | no_license | QuarkCloud/qpid-lite | bfcf275eb5a99be3a1defb18331780d1b242dfa6 | 3818811d1b2eb70c9603c1e74045072b9a9b8cbc | refs/heads/master | 2020-04-14T17:18:28.441389 | 2019-02-18T02:20:56 | 2019-02-18T02:20:56 | 163,975,774 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,879 | h | #ifndef QPID_SYS_SASL_FACTORY_H
#define QPID_SYS_SASL_FACTORY_H 1
/*
*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you may not use this file except in compliance
* with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* KIND, either express or implied. See the License for the
* specific language governing permissions and limitations
* under the License.
*
*/
#include "qpid/sys/Compile.h"
#include "qpid/sys/Sasl.h"
#include "qpid/sys/Mutex.h"
#include "qpid/sys/SaslServer.h"
#include <memory>
namespace qpid {
namespace sys {
/**
* Factory for instances of the Sasl interface through which Sasl
* support is provided to a ConnectionHandler.
*/
class SaslFactory
{
public:
QPID_SYS_EXTERN std::auto_ptr<Sasl> create(const std::string & userName, const std::string & password, const std::string & serviceName, const std::string & hostName, int minSsf, int maxSsf, bool allowInteraction = true);
QPID_SYS_EXTERN std::auto_ptr<SaslServer> createServer(const std::string& realm, const std::string& service, bool encryptionRequired, const qpid::sys::SecuritySettings&);
QPID_SYS_EXTERN static SaslFactory& getInstance();
QPID_SYS_EXTERN ~SaslFactory();
private:
SaslFactory();
static qpid::sys::Mutex lock;
static std::auto_ptr<SaslFactory> instance;
};
}
} // namespace qpid
#endif /*!QPID_SYS_SASL_FACTORY_H*/
| [
"[email protected]"
] | |
78b01cff5c52a0c50ce8bfc0856a08722eee16fb | 75452de12ec9eea346e3b9c7789ac0abf3eb1d73 | /src/camera/lib/fake_legacy_stream/test/test.cc | cd395b553207d50fcd730fe00622a4d6ebbc4d0a | [
"BSD-3-Clause"
] | permissive | oshunter/fuchsia | c9285cc8c14be067b80246e701434bbef4d606d1 | 2196fc8c176d01969466b97bba3f31ec55f7767b | refs/heads/master | 2022-12-22T11:30:15.486382 | 2020-08-16T03:41:23 | 2020-08-16T03:41:23 | 287,920,017 | 2 | 2 | BSD-3-Clause | 2022-12-16T03:30:27 | 2020-08-16T10:18:30 | C++ | UTF-8 | C++ | false | false | 4,030 | cc |
// Copyright 2019 The Fuchsia Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include <fuchsia/camera2/cpp/fidl.h>
#include <fuchsia/sysmem/cpp/fidl.h>
#include <lib/async-loop/cpp/loop.h>
#include <lib/async-loop/default.h>
#include <lib/gtest/test_loop_fixture.h>
#include <zircon/errors.h>
#include "src/camera/lib/fake_legacy_stream/fake_legacy_stream.h"
class FakeLegacyStreamTest : public gtest::TestLoopFixture {
protected:
void SetUp() override {
auto result = camera::FakeLegacyStream::Create(stream_.NewRequest(), dispatcher());
ASSERT_TRUE(result.is_ok());
fake_legacy_stream_ = result.take_value();
stream_.set_error_handler(
[](zx_status_t status) { ADD_FAILURE() << "Stream server disconnected: " << status; });
stream_.events().OnFrameAvailable = [this](fuchsia::camera2::FrameAvailableInfo info) {
stream_->ReleaseFrame(info.buffer_id);
frames_.push_back(std::move(info));
};
stream_->Start();
RunLoopUntilIdle();
}
void TearDown() override {
stream_ = nullptr;
fake_legacy_stream_ = nullptr;
}
fuchsia::camera2::StreamPtr stream_;
std::unique_ptr<camera::FakeLegacyStream> fake_legacy_stream_;
std::vector<fuchsia::camera2::FrameAvailableInfo> frames_;
};
// Conformant Stream client.
TEST_F(FakeLegacyStreamTest, GoodClient) {
bool callback_called = false;
stream_->GetImageFormats([&](std::vector<fuchsia::sysmem::ImageFormat_2> formats) {
callback_called = true;
ASSERT_GT(formats.size(), 0u);
});
RunLoopUntilIdle();
EXPECT_TRUE(callback_called);
EXPECT_EQ(frames_.size(), 0u);
const fuchsia::camera2::FrameAvailableInfo kFrame{
.frame_status = fuchsia::camera2::FrameStatus::OK,
.buffer_id = 42,
};
fuchsia::camera2::FrameAvailableInfo frame_copy;
ASSERT_EQ(kFrame.Clone(&frame_copy), ZX_OK);
EXPECT_EQ(fake_legacy_stream_->SendFrameAvailable(std::move(frame_copy)), ZX_OK);
RunLoopUntilIdle();
ASSERT_EQ(frames_.size(), 1u);
EXPECT_EQ(frames_[0].frame_status, kFrame.frame_status);
EXPECT_EQ(frames_[0].buffer_id, kFrame.buffer_id);
callback_called = false;
stream_->SetImageFormat(0, [&](zx_status_t status) {
callback_called = true;
EXPECT_EQ(status, ZX_OK);
});
RunLoopUntilIdle();
EXPECT_TRUE(callback_called);
callback_called = false;
stream_->SetRegionOfInterest(0, 0, 1, 1, [&](zx_status_t status) {
callback_called = true;
EXPECT_EQ(status, ZX_OK);
});
RunLoopUntilIdle();
EXPECT_TRUE(callback_called);
auto result = fake_legacy_stream_->StreamClientStatus();
EXPECT_TRUE(result.is_ok());
}
// Calls Start while started.
TEST_F(FakeLegacyStreamTest, BadClient1) {
stream_->Start();
RunLoopUntilIdle();
auto result = fake_legacy_stream_->StreamClientStatus();
ASSERT_TRUE(result.is_error());
std::cerr << result.error() << std::endl;
}
// Releases an unheld frame.
TEST_F(FakeLegacyStreamTest, BadClient2) {
stream_->ReleaseFrame(0);
RunLoopUntilIdle();
auto result = fake_legacy_stream_->StreamClientStatus();
ASSERT_TRUE(result.is_error());
std::cerr << result.error() << std::endl;
}
// Invalid region of interest.
TEST_F(FakeLegacyStreamTest, BadClient3) {
bool callback_called = false;
stream_->SetRegionOfInterest(1, 1, 0, 0, [&](zx_status_t status) {
callback_called = true;
EXPECT_EQ(status, ZX_ERR_INVALID_ARGS);
});
RunLoopUntilIdle();
EXPECT_TRUE(callback_called);
auto result = fake_legacy_stream_->StreamClientStatus();
ASSERT_TRUE(result.is_error());
std::cerr << result.error() << std::endl;
}
// Threading assert.
TEST_F(FakeLegacyStreamTest, WrongDispatcher) {
fuchsia::camera2::StreamPtr stream;
async::Loop other(&kAsyncLoopConfigNoAttachToCurrentThread);
auto result = camera::FakeLegacyStream::Create(stream.NewRequest(), other.dispatcher());
ASSERT_TRUE(result.is_ok());
auto fake = result.take_value();
ASSERT_DEATH(fake->IsStreaming(), ".*thread.*");
}
| [
"[email protected]"
] | |
e917527f46621d53623512861639cccd2dcb38d5 | ea401c3e792a50364fe11f7cea0f35f99e8f4bde | /hackathon/2010/brunsc/python_console/generated_code/TriviewControl.pypp.hpp | 2184c98bda5f23f043affd824893937b1d917c0e | [
"MIT",
"Apache-2.0"
] | permissive | Vaa3D/vaa3d_tools | edb696aa3b9b59acaf83d6d27c6ae0a14bf75fe9 | e6974d5223ae70474efaa85e1253f5df1814fae8 | refs/heads/master | 2023-08-03T06:12:01.013752 | 2023-08-02T07:26:01 | 2023-08-02T07:26:01 | 50,527,925 | 107 | 86 | MIT | 2023-05-22T23:43:48 | 2016-01-27T18:19:17 | C++ | UTF-8 | C++ | false | false | 223 | hpp | // This file has been generated by Py++.
#ifndef TriviewControl_hpp__pyplusplus_wrapper
#define TriviewControl_hpp__pyplusplus_wrapper
void register_TriviewControl_class();
#endif//TriviewControl_hpp__pyplusplus_wrapper
| [
"[email protected]"
] | |
b8a866627f55314408d4c62c82099fd3ce2c806a | ac8813f98a2e7054768e9e9db26bfd7a3fa1a70d | /PAT/有理数四则运算.cpp | ceb6e66ecd68ca79f43aef6f269ef190ed6051eb | [] | no_license | lxsshgdl/ACM | 684b692b974204d7f5f384336061ea3b3ecb4c69 | b1d7e5c5540146d8273fa0c531d063933de42b41 | refs/heads/master | 2023-07-18T09:30:24.212227 | 2021-08-27T15:48:27 | 2021-08-27T15:48:27 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,456 | cpp | // https://pintia.cn/problem-sets/994805260223102976/problems/994805287624491008
// 错因：爆数
// 改正：用long long
#include <bits/stdc++.h>
#define ios \
ios::sync_with_stdio(false); \
cin.tie(0);
using namespace std;
const int maxn = 1e5 + 5;
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;
typedef long long ll;
typedef unsigned long long ull;
void hj(ll a, ll b)
{
if (!b) {
cout << "Inf";
return;
}
if (b < 0) {
a *= -1;
b *= -1;
}
if (a < 0) cout << '(';
int gcd = abs(__gcd(a, b));
a /= gcd;
b /= gcd;
if (b == 1)
cout << a;
else {
bool j = 0;
if (a / b) {
j = 1;
cout << a / b << ' ';
}
if (!j)
cout << a % b << '/' << b;
else
cout << abs(a % b) << '/' << b;
}
if (a < 0) cout << ')';
}
int main()
{
ios;
ll a, b, c, d;
char ch;
cin>>a>>ch>>b>>c>>ch>>d;
hj(a, b);
cout << " + ";
hj(c, d);
cout << " = ";
hj(a * d + b * c, b * d);
cout << '\n';
hj(a, b);
cout << " - ";
hj(c, d);
cout << " = ";
hj(a * d - b * c, b * d);
cout << '\n';
hj(a, b);
cout << " * ";
hj(c, d);
cout << " = ";
hj(a * c, b * d);
cout << '\n';
hj(a, b);
cout << " / ";
hj(c, d);
cout << " = ";
hj(a * d, b * c);
cout << '\n';
return 0;
} | [
"[email protected]"
] | |
3913b7ecb8281626da99ddff8475974dcfe4b038 | 911bc2d4464948f76de4568aa01f3272e0bb39bf | /include/Toolbar.h | 166a33d8afd5510d177f7b9542e3e4ce6b6bba4b | [] | no_license | TomCollingwood/ParticlePanic | aec1af60a9fe94468fc93e522de51981ebaf921f | 50d5559f25b1a548ff78986434824b8ce77238a3 | refs/heads/master | 2021-01-10T15:16:39.276708 | 2016-05-02T12:17:00 | 2016-05-02T12:17:00 | 54,407,663 | 3 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 6,675 | h | /// \file Toolbar.h
/// \brief GUI implementation from scratch, includes draw and input interaction.
/// \author Thomas Collingwood
/// \version 1.0
/// \date 26/4/16 Updated to NCCA Coding standard
/// Revision History : See https://github.com/TomCollingwood/ParticlePanic
#ifndef _TOOLBAR_H_
#define _TOOLBAR_H_
#ifdef __APPLE__
#include <OpenGL/gl.h>
#include <OpenGL/glu.h>
#include <SDL.h>
#include <SDL_image.h>
#else
#include <GL/gl.h>
#include <GL/glu.h>
#include <SDL2/SDL.h>
#include <SDL2/SDL_image.h>
#endif
#include <iostream>
#include <time.h>
#include <include/World.h>
class Toolbar
{
public:
Toolbar() :
m_draw(true),
m_drag(false),
m_tap(false),
m_clear(false),
m_help(false),
m_gravity(true),
m_erase(false),
m_randomize(false),
m_camera(false),
m_dropdownopen(false),
m_dropdownselect(0),
m_helpscreen(false){}
//----------------------------------------------------------------------------------------------------------------------
/// \brief drawToolbar draws the toolbar on screen
/// \param _h window height in pixels
//----------------------------------------------------------------------------------------------------------------------
void drawToolbar(int _h) const;
//----------------------------------------------------------------------------------------------------------------------
/// \brief handleClickDown handles click on the toolbar
/// \param[in] _x x coordinate of mouse on screen in pixels
/// \param[in] _y y coordinate of mouse on screen in pixels
/// \param[in] _WIDTH width of window in pixels
/// \param[in] _HEIGHT height of window in pixels
/// \return if click is on screen returns true else false
//----------------------------------------------------------------------------------------------------------------------
bool handleClickDown(int _x, int _y, int _WIDTH, int _HEIGHT);
//----------------------------------------------------------------------------------------------------------------------
/// \brief handleClickUp used when toolbar button only recesses while clicked down
//----------------------------------------------------------------------------------------------------------------------
void handleClickUp();
//----------------------------------------------------------------------------------------------------------------------
/// \brief handleClickDropDown handles clicks on the dropdown menu
/// \param[in] _x x coordinate of mouse on screen in pixels
/// \param[in] _y y coordinate of mouse on screen in pixels
/// \param[in] _WIDTH width of window in pixels
/// \param[in] _HEIGHT height of window in pixels
//----------------------------------------------------------------------------------------------------------------------
void handleClickDropDown(int _x, int _y, int _WIDTH, int _HEIGHT);
//----------------------------------------------------------------------------------------------------------------------
/// \brief toggleBool toggles the bool
/// \param[inout] io_toggleme pointer to the bool to toggle
//----------------------------------------------------------------------------------------------------------------------
void toggleBool(bool *io_toggleme);
bool getDrag();
bool getDraw();
bool getHelp();
bool getErase();
//----------------------------------------------------------------------------------------------------------------------
/// \brief getdropdownopen returns bool saying whether the dropdown menu is open
/// \return bool saying whether the dropdown menu is open
//----------------------------------------------------------------------------------------------------------------------
bool getdropdownopen();
//----------------------------------------------------------------------------------------------------------------------
/// \brief setWorld sets m_world to the pointer input
/// \param[in] _world the pointer to set m_world to
//----------------------------------------------------------------------------------------------------------------------
void setWorld(World *_world);
// Functions below are called to toggle bools when button is pressed
void pressDraw();
void pressDrag();
void pressErase();
void pressGravity();
void pressClear();
void pressHelp();
void pressTap();
void pressDropDownMenu();
void pressRandomize();
void pressCamera();
//----------------------------------------------------------------------------------------------------------------------
/// \brief removeNumber removes number from the seed for the randomised particle
//----------------------------------------------------------------------------------------------------------------------
void removeNumber();
//----------------------------------------------------------------------------------------------------------------------
/// \brief drawNumbers draws the random seed numbers on screen
/// \param[in] _x x coordinate of mouse on screen in pixels
/// \param[in] _y y coordinate of mouse on screen in pixels
/// \param[in] _h height of window in pixels
/// \param[in] _numbers numbers to draw
//----------------------------------------------------------------------------------------------------------------------
void drawNumbers(float _x, float _y, int _h, std::string _numbers) const;
//----------------------------------------------------------------------------------------------------------------------
/// \brief handleKeys makes sure relevant keys affect the toolbar buttons
/// \param[in] _input the character to handle
//----------------------------------------------------------------------------------------------------------------------
void handleKeys(char _input);
//----------------------------------------------------------------------------------------------------------------------
/// \brief addNumber adds number to the random seed (in char form)
/// \param[in] _p character to add
//----------------------------------------------------------------------------------------------------------------------
void addNumber(char p);
void drawHelpScreen(float _buttonwidth) const;
private:
bool m_draw, m_erase, m_drag, m_tap, m_gravity, m_clear, m_help, m_randomize, m_camera;
bool m_dropdownopen;
int m_dropdownselect;
bool m_helpscreen;
GLuint m_iconsTexture; //
int m_clickdownbutton; //
World *m_world;
std::string m_randomSeed;
};
#endif // TOOLBAR_H
| [
"[email protected]"
] | |
a67b649d76715a7551f9dc9dfb04211123565c09 | 70d0efb3b61e0d4b9843f806a5461b10a3ff2af9 | /src/drivers/common/ttf_font.cpp | 1444ae702491ca77e35cae3396da89edd376f4e1 | [
"MIT"
] | permissive | Dwedit/sdlretro | a2bacb623d464940afc912ce5008df908a7016ff | 521c5558cb55d4028210529e336d8a8622037358 | refs/heads/master | 2021-04-12T00:38:10.157128 | 2020-01-20T13:16:04 | 2020-01-20T13:16:04 | 249,069,950 | 0 | 0 | MIT | 2020-03-21T22:12:48 | 2020-03-21T22:12:48 | null | UTF-8 | C++ | false | false | 4,987 | cpp | #include "ttf_font.h"
#include "stb_rect_pack.h"
#ifdef USE_STB_TRUETYPE
#define STB_TRUETYPE_IMPLEMENTATION
#include "stb_truetype.h"
#include <fstream>
#else
#include <ft2build.h>
#include FT_FREETYPE_H
#endif
#include <climits>
namespace drivers {
enum :uint16_t {
RECTPACK_WIDTH = 1024
};
struct rect_pack_data {
stbrp_context context;
stbrp_node nodes[RECTPACK_WIDTH];
uint8_t pixels[RECTPACK_WIDTH * RECTPACK_WIDTH];
};
ttf_font::ttf_font() {
#ifndef USE_STB_TRUETYPE
FT_Init_FreeType(&ft_lib);
#endif
}
ttf_font::~ttf_font() {
for (auto *&p: rectpack_data) delete p;
rectpack_data.clear();
for (auto &p: fonts) {
#ifdef USE_STB_TRUETYPE
delete static_cast<stbtt_fontinfo *>(p.font);
delete p.ttf_buffer;
#else
FT_Done_Face(p.face);
#endif
}
#ifndef USE_STB_TRUETYPE
FT_Done_FreeType(ft_lib);
#endif
}
void ttf_font::init(int size, uint8_t width) {
font_size = size;
mono_width = width;
}
bool ttf_font::add(const std::string &filename, int index) {
font_info fi;
#ifdef USE_STB_TRUETYPE
auto *info = new stbtt_fontinfo;
std::ifstream fin(filename, std::ios::binary);
if (fin.fail()) return false;
fin.seekg(0, std::ios::end);
size_t sz = fin.tellg();
fi.ttf_buffer = new uint8_t[sz];
fin.seekg(0, std::ios::beg);
fin.read(reinterpret_cast<char*>(fi.ttf_buffer), sz);
fin.close();
stbtt_InitFont(info, fi.ttf_buffer, stbtt_GetFontOffsetForIndex(fi.ttf_buffer, index));
fi.font_scale = stbtt_ScaleForMappingEmToPixels(info, static_cast<float>(font_size));
fi.font = info;
#else
if (FT_New_Face(ft_lib, filename.c_str(), index, &fi.face)) return false;
FT_Set_Pixel_Sizes(fi.face, 0, font_size);
#endif
fonts.push_back(fi);
new_rect_pack();
return true;
}
uint8_t ttf_font::get_char_width(uint16_t ch) const {
auto ite = font_cache.find(ch);
if (ite == font_cache.end()) return 0;
if (mono_width)
return std::max(ite->second.advW, mono_width);
return ite->second.advW;
}
const ttf_font::font_data *ttf_font::make_cache(uint16_t ch) {
font_info *fi = nullptr;
#ifdef USE_STB_TRUETYPE
stbtt_fontinfo *info;
#endif
uint32_t index = 0;
for (auto &f: fonts) {
fi = &f;
#ifdef USE_STB_TRUETYPE
info = static_cast<stbtt_fontinfo*>(f.font);
index = stbtt_FindGlyphIndex(info, ch);
if (index == 0) continue;
#else
index = FT_Get_Char_Index(f.face, ch);
if (index == 0) continue;
if (!FT_Load_Glyph(f.face, index, FT_LOAD_DEFAULT)) break;
#endif
}
font_data *fd = &font_cache[ch];
if (fi == nullptr) {
memset(fd, 0, sizeof(font_data));
return nullptr;
}
#ifdef USE_STB_TRUETYPE
/* Read font data to cache */
int advW, leftB;
stbtt_GetGlyphHMetrics(info, index, &advW, &leftB);
fd->advW = static_cast<uint8_t>(fi->font_scale * advW);
leftB = static_cast<uint8_t>(fi->font_scale * leftB);
int ix0, iy0, ix1, iy1;
stbtt_GetGlyphBitmapBoxSubpixel(info, index, fi->font_scale, fi->font_scale, 3, 3, &ix0, &iy0, &ix1, &iy1);
fd->ix0 = leftB;
fd->iy0 = iy0;
fd->w = ix1 - ix0;
fd->h = iy1 - iy0;
#else
unsigned char *src_ptr;
int bitmap_pitch;
if (FT_Render_Glyph(fi->face->glyph, FT_RENDER_MODE_NORMAL)) return nullptr;
FT_GlyphSlot slot = fi->face->glyph;
fd->ix0 = slot->bitmap_left;
fd->iy0 = -slot->bitmap_top;
fd->w = slot->bitmap.width;
fd->h = slot->bitmap.rows;
fd->advW = slot->advance.x >> 6;
src_ptr = slot->bitmap.buffer;
bitmap_pitch = slot->bitmap.pitch;
#endif
/* Get last rect pack bitmap */
auto rpidx = rectpack_data.size() - 1;
auto *rpd = rectpack_data[rpidx];
stbrp_rect rc = {0, fd->w, fd->h};
if (!stbrp_pack_rects(&rpd->context, &rc, 1)) {
/* No space to hold the bitmap,
* create a new bitmap */
new_rect_pack();
rpidx = rectpack_data.size() - 1;
rpd = rectpack_data[rpidx];
stbrp_pack_rects(&rpd->context, &rc, 1);
}
/* Do rect pack */
fd->rpx = rc.x;
fd->rpy = rc.y;
fd->rpidx = rpidx;
#ifdef USE_STB_TRUETYPE
stbtt_MakeGlyphBitmapSubpixel(info, &rpd->pixels[rc.y * RECTPACK_WIDTH + rc.x], fd->w, fd->h, RECTPACK_WIDTH, fi->font_scale, fi->font_scale, 3, 3, index);
#else
auto *dst_ptr = &rpd->pixels[rc.y * RECTPACK_WIDTH + rc.x];
for (int k = 0; k < fd->h; ++k) {
memcpy(dst_ptr, src_ptr, fd->w);
src_ptr += bitmap_pitch;
dst_ptr += RECTPACK_WIDTH;
}
#endif
return fd;
}
void ttf_font::new_rect_pack() {
auto *rpd = new rect_pack_data;
stbrp_init_target(&rpd->context, RECTPACK_WIDTH, RECTPACK_WIDTH, rpd->nodes, RECTPACK_WIDTH);
rectpack_data.push_back(rpd);
}
const uint8_t *ttf_font::get_rect_pack_data(uint8_t idx, int16_t x, int16_t y) {
return &rectpack_data[idx]->pixels[y * RECTPACK_WIDTH + x];
}
uint16_t ttf_font::get_rect_pack_width() {
return RECTPACK_WIDTH;
}
}
| [
"[email protected]"
] | |
43e4881ec0ee25320874c28c439eb74ced17c8ce | da3dde37cfab6ac43640f13b08e6de9e90070f9c | /include/gtkmm-3.0/gtkmm/widget.h | d1672c6830f7923bb5e2d813ff00182a120d3ecc | [] | no_license | codenotes/gtk2-gtk3-sdk-2.24.30-3.20.2-2016-04-09-ts-win64 | 27ca673a945c76bd9ace095c510e703b52ddc9f7 | 952b68aebdf1c41e856db8a2f7efd120485ae9eb | refs/heads/master | 2020-12-25T14:58:10.876852 | 2016-09-08T18:19:25 | 2016-09-08T18:19:25 | 67,728,820 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 218,646 | h | // Generated by gmmproc 2.48.0 -- DO NOT MODIFY!
#ifndef _GTKMM_WIDGET_H
#define _GTKMM_WIDGET_H
#include <gtkmmconfig.h>
#include <glibmm/ustring.h>
#include <sigc++/sigc++.h>
/* Copyright (C) 2002, 2003 The gtkmm Development Team
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include <vector>
#include <pangomm/context.h>
#include <pangomm/layout.h>
#ifdef GTKMM_ATKMM_ENABLED
#include <atkmm/object.h>
#include <atkmm/implementor.h>
#endif //GTKMM_ATKMM_ENABLED
#include <gtkmm/object.h>
#include <gtkmm/buildable.h>
#include <gdkmm/event.h>
#include <gdkmm/types.h>
#include <gdkmm/window.h>
#include <gdkmm/dragcontext.h>
#include <gdkmm/pixbuf.h>
#include <gdkmm/screen.h>
#include <gtkmm/enums.h>
#include <gdkmm/display.h>
#include <gtkmm/targetlist.h>
#include <gtkmm/clipboard.h>
#include <gtkmm/requisition.h>
#include <gtkmm/stylecontext.h>
#include <gtkmm/widgetpath.h>
#include <giomm/actiongroup.h>
#ifndef DOXYGEN_SHOULD_SKIP_THIS
extern "C"
{
typedef struct _GtkTargetEntry GtkTargetEntry;
}
#endif /* DOXYGEN_SHOULD_SKIP_THIS */
#ifndef DOXYGEN_SHOULD_SKIP_THIS
typedef struct _GtkWidget GtkWidget;
typedef struct _GtkWidgetClass GtkWidgetClass;
#endif /* DOXYGEN_SHOULD_SKIP_THIS */
#ifndef DOXYGEN_SHOULD_SKIP_THIS
namespace Gtk
{ class Widget_Class; } // namespace Gtk
#endif //DOXYGEN_SHOULD_SKIP_THIS
namespace Gtk
{
/** @addtogroup gtkmmEnums gtkmm Enums and Flags */
/**
* @var DestDefaults DEST_DEFAULT_MOTION
* If set for a widget, GTK+, during a drag over this
* widget will check if the drag matches this widget’s list of possible targets
* and actions.
* GTK+ will then call gdk_drag_status() as appropriate.
*
* @var DestDefaults DEST_DEFAULT_HIGHLIGHT
* If set for a widget, GTK+ will draw a highlight on
* this widget as long as a drag is over this widget and the widget drag format
* and action are acceptable.
*
* @var DestDefaults DEST_DEFAULT_DROP
* If set for a widget, when a drop occurs, GTK+ will
* will check if the drag matches this widget’s list of possible targets and
* actions. If so, GTK+ will call gtk_drag_get_data() on behalf of the widget.
* Whether or not the drop is successful, GTK+ will call gtk_drag_finish(). If
* the action was a move, then if the drag was successful, then <tt>true</tt> will be
* passed for the @a delete parameter to gtk_drag_finish().
*
* @var DestDefaults DEST_DEFAULT_ALL
* If set, specifies that all default actions should
* be taken.
*
* @enum DestDefaults
*
* The Gtk::DestDefaults enumeration specifies the various
* types of action that will be taken on behalf
* of the user for a drag destination site.
*
* @ingroup gtkmmEnums
* @par Bitwise operators:
* <tt>%DestDefaults operator|(DestDefaults, DestDefaults)</tt><br>
* <tt>%DestDefaults operator&(DestDefaults, DestDefaults)</tt><br>
* <tt>%DestDefaults operator^(DestDefaults, DestDefaults)</tt><br>
* <tt>%DestDefaults operator~(DestDefaults)</tt><br>
* <tt>%DestDefaults& operator|=(DestDefaults&, DestDefaults)</tt><br>
* <tt>%DestDefaults& operator&=(DestDefaults&, DestDefaults)</tt><br>
* <tt>%DestDefaults& operator^=(DestDefaults&, DestDefaults)</tt><br>
*/
enum DestDefaults
{
DEST_DEFAULT_MOTION = 1 << 0,
DEST_DEFAULT_HIGHLIGHT = 1 << 1,
DEST_DEFAULT_DROP = 1 << 2,
DEST_DEFAULT_ALL = 0x07
};
/** @ingroup gtkmmEnums */
inline DestDefaults operator|(DestDefaults lhs, DestDefaults rhs)
{ return static_cast<DestDefaults>(static_cast<unsigned>(lhs) | static_cast<unsigned>(rhs)); }
/** @ingroup gtkmmEnums */
inline DestDefaults operator&(DestDefaults lhs, DestDefaults rhs)
{ return static_cast<DestDefaults>(static_cast<unsigned>(lhs) & static_cast<unsigned>(rhs)); }
/** @ingroup gtkmmEnums */
inline DestDefaults operator^(DestDefaults lhs, DestDefaults rhs)
{ return static_cast<DestDefaults>(static_cast<unsigned>(lhs) ^ static_cast<unsigned>(rhs)); }
/** @ingroup gtkmmEnums */
inline DestDefaults operator~(DestDefaults flags)
{ return static_cast<DestDefaults>(~static_cast<unsigned>(flags)); }
/** @ingroup gtkmmEnums */
inline DestDefaults& operator|=(DestDefaults& lhs, DestDefaults rhs)
{ return (lhs = static_cast<DestDefaults>(static_cast<unsigned>(lhs) | static_cast<unsigned>(rhs))); }
/** @ingroup gtkmmEnums */
inline DestDefaults& operator&=(DestDefaults& lhs, DestDefaults rhs)
{ return (lhs = static_cast<DestDefaults>(static_cast<unsigned>(lhs) & static_cast<unsigned>(rhs))); }
/** @ingroup gtkmmEnums */
inline DestDefaults& operator^=(DestDefaults& lhs, DestDefaults rhs)
{ return (lhs = static_cast<DestDefaults>(static_cast<unsigned>(lhs) ^ static_cast<unsigned>(rhs))); }
} // namespace Gtk
#ifndef DOXYGEN_SHOULD_SKIP_THIS
namespace Glib
{
template <>
class Value<Gtk::DestDefaults> : public Glib::Value_Flags<Gtk::DestDefaults>
{
public:
static GType value_type() G_GNUC_CONST;
};
} // namespace Glib
#endif /* DOXYGEN_SHOULD_SKIP_THIS */
namespace Gtk
{
/**
* @var WidgetHelpType WIDGET_HELP_TOOLTIP
* Tooltip.
*
* @var WidgetHelpType WIDGET_HELP_WHATS_THIS
* What’s this.
*
* @enum WidgetHelpType
*
* Kinds of widget-specific help. Used by the signal_show_help() signal.
*
* @ingroup gtkmmEnums
*/
enum WidgetHelpType
{
WIDGET_HELP_TOOLTIP,
WIDGET_HELP_WHATS_THIS
};
} // namespace Gtk
#ifndef DOXYGEN_SHOULD_SKIP_THIS
namespace Glib
{
template <>
class Value<Gtk::WidgetHelpType> : public Glib::Value_Enum<Gtk::WidgetHelpType>
{
public:
static GType value_type() G_GNUC_CONST;
};
} // namespace Glib
#endif /* DOXYGEN_SHOULD_SKIP_THIS */
namespace Gtk
{
/**
* @var DragResult DRAG_RESULT_SUCCESS
* The drag operation was successful.
*
* @var DragResult DRAG_RESULT_NO_TARGET
* No suitable drag target.
*
* @var DragResult DRAG_RESULT_USER_CANCELLED
* The user cancelled the drag operation.
*
* @var DragResult DRAG_RESULT_TIMEOUT_EXPIRED
* The drag operation timed out.
*
* @var DragResult DRAG_RESULT_GRAB_BROKEN
* The pointer or keyboard grab used
* for the drag operation was broken.
*
* @var DragResult DRAG_RESULT_ERROR
* The drag operation failed due to some
* unspecified error.
*
* @enum DragResult
*
* Gives an indication why a drag operation failed.
* The value can by obtained by connecting to the
* Gtk::Widget::signal_drag_failed() signal.
*
* @ingroup gtkmmEnums
*/
enum DragResult
{
DRAG_RESULT_SUCCESS,
DRAG_RESULT_NO_TARGET,
DRAG_RESULT_USER_CANCELLED,
DRAG_RESULT_TIMEOUT_EXPIRED,
DRAG_RESULT_GRAB_BROKEN,
DRAG_RESULT_ERROR
};
} // namespace Gtk
#ifndef DOXYGEN_SHOULD_SKIP_THIS
namespace Glib
{
template <>
class Value<Gtk::DragResult> : public Glib::Value_Enum<Gtk::DragResult>
{
public:
static GType value_type() G_GNUC_CONST;
};
} // namespace Glib
#endif /* DOXYGEN_SHOULD_SKIP_THIS */
namespace Gtk
{
class Action;
class Style;
class AccelGroup;
class Adjustment;
class Window;
class Container;
class Settings;
class Tooltip;
class StockID; //deprecated.
// Gtk::Allocation is a typedef of Gdk::Rectangle because GtkAllocation is
// a typedef of GdkRectangle.
typedef Gdk::Rectangle Allocation;
/** @defgroup Widgets Widgets
*/
//TODO: Deal with the GtkObject->GObject change:
/** Abstract Widget (Base class for all widgets)
*
* As the base class of all widgets this contains all of the properties
* and methods common to all widgets. It is an abstract class that
* can not be instantiated.
*
* Important part of widgets are the *_event signals and virtual methods
* that every widget have. Those are events coming directly from gdk and
* thus also from XLib. By overriding those virtual methods you can
* trap everything a widget can ever do.
* In order to capture events from a widget, the event mask must
* first be set with ().
*
* Only widgets with a Gdk::Window on the server side are allowed to
* capture events. Widgets in the Gtk::Misc group for example lack
* a Gdk::Window.
*/
class Widget
: public Object,
public Buildable
#ifdef GTKMM_ATKMM_ENABLED
,public Atk::Implementor
#endif //GTKMM_ATKMM_ENABLED
{
public:
#ifndef DOXYGEN_SHOULD_SKIP_THIS
typedef Widget CppObjectType;
typedef Widget_Class CppClassType;
typedef GtkWidget BaseObjectType;
typedef GtkWidgetClass BaseClassType;
#endif /* DOXYGEN_SHOULD_SKIP_THIS */
Widget(Widget&& src) noexcept;
Widget& operator=(Widget&& src) noexcept;
// noncopyable
Widget(const Widget&) = delete;
Widget& operator=(const Widget&) = delete;
/** Destroys the widget. The widget will be automatically removed from the parent container.
*/
~Widget() noexcept override;
#ifndef DOXYGEN_SHOULD_SKIP_THIS
private:
friend class Widget_Class;
static CppClassType widget_class_;
protected:
explicit Widget(const Glib::ConstructParams& construct_params);
explicit Widget(GtkWidget* castitem);
#endif /* DOXYGEN_SHOULD_SKIP_THIS */
public:
/** Get the GType for this class, for use with the underlying GObject type system.
*/
static GType get_type() G_GNUC_CONST;
#ifndef DOXYGEN_SHOULD_SKIP_THIS
static GType get_base_type() G_GNUC_CONST;
#endif
///Provides access to the underlying C GtkObject.
GtkWidget* gobj() { return reinterpret_cast<GtkWidget*>(gobject_); }
///Provides access to the underlying C GtkObject.
const GtkWidget* gobj() const { return reinterpret_cast<GtkWidget*>(gobject_); }
public:
//C++ methods used to invoke GTK+ virtual functions:
protected:
//GTK+ Virtual Functions (override these to change behaviour):
//Default Signal Handlers::
/// This is a default handler for the signal signal_show().
virtual void on_show();
/// This is a default handler for the signal signal_hide().
virtual void on_hide();
/// This is a default handler for the signal signal_map().
virtual void on_map();
/// This is a default handler for the signal signal_unmap().
virtual void on_unmap();
/// This is a default handler for the signal signal_realize().
virtual void on_realize();
/// This is a default handler for the signal signal_unrealize().
virtual void on_unrealize();
/// This is a default handler for the signal signal_size_allocate().
virtual void on_size_allocate(Allocation& allocation);
/// This is a default handler for the signal signal_state_changed().
virtual void on_state_changed(Gtk::StateType previous_state);
/// This is a default handler for the signal signal_parent_changed().
virtual void on_parent_changed(Widget* previous_parent);
/// This is a default handler for the signal signal_hierarchy_changed().
virtual void on_hierarchy_changed(Widget* previous_toplevel);
/// This is a default handler for the signal signal_style_updated().
virtual void on_style_updated();
/// This is a default handler for the signal signal_direction_changed().
virtual void on_direction_changed(TextDirection direction);
/// This is a default handler for the signal signal_grab_notify().
virtual void on_grab_notify(bool was_grabbed);
/// This is a default handler for the signal signal_child_notify().
virtual void on_child_notify(GParamSpec* pspec);
/// This is a default handler for the signal signal_mnemonic_activate().
virtual bool on_mnemonic_activate(bool group_cycling);
/// This is a default handler for the signal signal_grab_focus().
virtual void on_grab_focus();
/// This is a default handler for the signal signal_focus().
virtual bool on_focus(DirectionType direction);
/// This is a default handler for the signal signal_event().
virtual bool on_event(GdkEvent* gdk_event);
/// This is a default handler for the signal signal_button_press_event().
virtual bool on_button_press_event(GdkEventButton* button_event);
/// This is a default handler for the signal signal_button_release_event().
virtual bool on_button_release_event(GdkEventButton* release_event);
/// This is a default handler for the signal signal_scroll_event().
virtual bool on_scroll_event(GdkEventScroll* scroll_event);
/// This is a default handler for the signal signal_motion_notify_event().
virtual bool on_motion_notify_event(GdkEventMotion* motion_event);
/// This is a default handler for the signal signal_delete_event().
virtual bool on_delete_event(GdkEventAny* any_event);
/// This is a default handler for the signal signal_draw().
virtual bool on_draw(const ::Cairo::RefPtr< ::Cairo::Context>& cr);
/// This is a default handler for the signal signal_key_press_event().
virtual bool on_key_press_event(GdkEventKey* key_event);
/// This is a default handler for the signal signal_key_release_event().
virtual bool on_key_release_event(GdkEventKey* key_event);
/// This is a default handler for the signal signal_enter_notify_event().
virtual bool on_enter_notify_event(GdkEventCrossing* crossing_event);
/// This is a default handler for the signal signal_leave_notify_event().
virtual bool on_leave_notify_event(GdkEventCrossing* crossing_event);
/// This is a default handler for the signal signal_configure_event().
virtual bool on_configure_event(GdkEventConfigure* configure_event);
/// This is a default handler for the signal signal_focus_in_event().
virtual bool on_focus_in_event(GdkEventFocus* focus_event);
/// This is a default handler for the signal signal_focus_out_event().
virtual bool on_focus_out_event(GdkEventFocus* gdk_event);
/// This is a default handler for the signal signal_map_event().
virtual bool on_map_event(GdkEventAny* any_event);
/// This is a default handler for the signal signal_unmap_event().
virtual bool on_unmap_event(GdkEventAny* any_event);
/// This is a default handler for the signal signal_property_notify_event().
virtual bool on_property_notify_event(GdkEventProperty* property_event);
/// This is a default handler for the signal signal_selection_clear_event().
virtual bool on_selection_clear_event(GdkEventSelection* selection_event);
/// This is a default handler for the signal signal_selection_request_event().
virtual bool on_selection_request_event(GdkEventSelection* selection_event);
/// This is a default handler for the signal signal_selection_notify_event().
virtual bool on_selection_notify_event(GdkEventSelection* selection_event);
/// This is a default handler for the signal signal_proximity_in_event().
virtual bool on_proximity_in_event(GdkEventProximity* proximity_event);
/// This is a default handler for the signal signal_proximity_out_event().
virtual bool on_proximity_out_event(GdkEventProximity* proximity_event);
/// This is a default handler for the signal signal_visibility_notify_event().
virtual bool on_visibility_notify_event(GdkEventVisibility* visibility_event);
/// This is a default handler for the signal signal_window_state_event().
virtual bool on_window_state_event(GdkEventWindowState* window_state_event);
/// This is a default handler for the signal signal_selection_get().
virtual void on_selection_get(SelectionData& selection_data, guint info, guint time);
/// This is a default handler for the signal signal_selection_received().
virtual void on_selection_received(const SelectionData& selection_data, guint time);
/// This is a default handler for the signal signal_drag_begin().
virtual void on_drag_begin(const Glib::RefPtr<Gdk::DragContext>& context);
/// This is a default handler for the signal signal_drag_end().
virtual void on_drag_end(const Glib::RefPtr<Gdk::DragContext>& context);
/// This is a default handler for the signal signal_drag_data_get().
virtual void on_drag_data_get(const Glib::RefPtr<Gdk::DragContext>& context, SelectionData& selection_data, guint info, guint time);
/// This is a default handler for the signal signal_drag_data_delete().
virtual void on_drag_data_delete(const Glib::RefPtr<Gdk::DragContext>& context);
/// This is a default handler for the signal signal_drag_leave().
virtual void on_drag_leave(const Glib::RefPtr<Gdk::DragContext>& context, guint time);
/// This is a default handler for the signal signal_drag_motion().
virtual bool on_drag_motion(const Glib::RefPtr<Gdk::DragContext>& context, int x, int y, guint time);
/// This is a default handler for the signal signal_drag_drop().
virtual bool on_drag_drop(const Glib::RefPtr<Gdk::DragContext>& context, int x, int y, guint time);
/// This is a default handler for the signal signal_drag_data_received().
virtual void on_drag_data_received(const Glib::RefPtr<Gdk::DragContext>& context, int x, int y, const SelectionData& selection_data, guint info, guint time);
/// This is a default handler for the signal signal_screen_changed().
virtual void on_screen_changed(const Glib::RefPtr<Gdk::Screen>& previous_screen);
private:
public:
friend class Main;
/** Flags a widget to be displayed. Any widget that isn’t shown will
* not appear on the screen. If you want to show all the widgets in a
* container, it’s easier to call show_all() on the
* container, instead of individually showing the widgets.
*
* Remember that you have to show the containers containing a widget,
* in addition to the widget itself, before it will appear onscreen.
*
* When a toplevel container is shown, it is immediately realized and
* mapped; other shown widgets are realized and mapped when their
* toplevel container is realized and mapped.
*/
void show();
/** Shows a widget. If the widget is an unmapped toplevel widget
* (i.e. a Gtk::Window that has not yet been shown), enter the main
* loop and wait for the window to actually be mapped. Be careful;
* because the main loop is running, anything can happen during
* this function.
*/
void show_now();
/** Reverses the effects of show(), causing the widget to be
* hidden (invisible to the user).
*/
void hide();
/** Recursively shows a widget, and any child widgets (if the widget is
* a container).
*/
void show_all();
/* QUEUE DRAWS */
/** Equivalent to calling queue_draw_area() for the
* entire area of a widget.
*/
void queue_draw();
/** Convenience function that calls queue_draw_region() on
* the region created from the given coordinates.
*
* The region here is specified in widget coordinates.
* Widget coordinates are a bit odd; for historical reasons, they are
* defined as @a widget->window coordinates for widgets that return <tt>true</tt> for
* get_has_window(), and are relative to @a widget->allocation.x,
* @a widget->allocation.y otherwise.
*
* @a width or @a height may be 0, in this case this function does
* nothing. Negative values for @a width and @a height are not allowed.
*
* @param x X coordinate of upper-left corner of rectangle to redraw.
* @param y Y coordinate of upper-left corner of rectangle to redraw.
* @param width Width of region to draw.
* @param height Height of region to draw.
*/
void queue_draw_area(int x, int y, int width, int height);
/** Invalidates the area of @a widget defined by @a region by calling
* gdk_window_invalidate_region() on the widget’s window and all its
* child windows. Once the main loop becomes idle (after the current
* batch of events has been processed, roughly), the window will
* receive expose events for the union of all regions that have been
* invalidated.
*
* Normally you would only use this function in widget
* implementations. You might also use it to schedule a redraw of a
* Gtk::DrawingArea or some portion thereof.
*
* @newin{3,0}
*
* @param region Region to draw.
*/
void queue_draw_region(const ::Cairo::RefPtr<const ::Cairo::Region>& region);
/** This function is only for use in widget implementations.
* Flags a widget to have its size renegotiated; should
* be called when a widget for some reason has a new size request.
* For example, when you change the text in a Gtk::Label, Gtk::Label
* queues a resize to ensure there’s enough space for the new text.
*
* Note that you cannot call queue_resize() on a widget
* from inside its implementation of the GtkWidgetClass::size_allocate
* virtual method. Calls to queue_resize() from inside
* GtkWidgetClass::size_allocate will be silently ignored.
*/
void queue_resize();
/** This function is only for use in widget implementations.
*
* Flags the widget for a rerun of the GtkWidgetClass::size_allocate
* function. Use this function instead of queue_resize()
* when the @a widget's size request didn't change but it wants to
* reposition its contents.
*
* An example user of this function is set_halign().
*/
void queue_allocate();
/** This function is only used by Gtk::Container subclasses, to assign a size
* and position to their child widgets.
*
* In this function, the allocation may be adjusted. It will be forced
* to a 1x1 minimum size, and the adjust_size_allocation virtual
* method on the child will be used to adjust the allocation. Standard
* adjustments include removing the widget’s margins, and applying the
* widget’s Gtk::Widget::property_halign() and Gtk::Widget::property_valign() properties.
*
* For baseline support in containers you need to use size_allocate_with_baseline()
* instead.
*
* @param allocation Position and size to be allocated to @a widget.
*/
void size_allocate(const Allocation& allocation);
/** This function is only used by Gtk::Container subclasses, to assign a size,
* position and (optionally) baseline to their child widgets.
*
* In this function, the allocation and baseline may be adjusted. It
* will be forced to a 1x1 minimum size, and the
* adjust_size_allocation virtual and adjust_baseline_allocation
* methods on the child will be used to adjust the allocation and
* baseline. Standard adjustments include removing the widget's
* margins, and applying the widget’s Gtk::Widget::property_halign() and
* Gtk::Widget::property_valign() properties.
*
* If the child widget does not have a valign of Gtk::ALIGN_BASELINE the
* baseline argument is ignored and -1 is used instead.
*
* @newin{3,10}
*
* @param allocation Position and size to be allocated to @a widget.
* @param baseline The baseline of the child, or -1.
*/
void size_allocate(const Allocation& allocation, int baseline);
//deprecated
/** Gets whether the widget prefers a height-for-width layout
* or a width-for-height layout.
*
* Gtk::Bin widgets generally propagate the preference of
* their child, container widgets need to request something either in
* context of their children or in context of their allocation
* capabilities.
*
* @newin{3,0}
*
* @return The Gtk::SizeRequestMode preferred by @a widget.
*/
SizeRequestMode get_request_mode() const;
/** Retrieves a widget’s initial minimum and natural width.
*
* This call is specific to height-for-width requests.
*
* The returned request will be modified by the
* GtkWidgetClass::adjust_size_request virtual method and by any
* Gtk::SizeGroups that have been applied. That is, the returned request
* is the one that should be used for layout, not necessarily the one
* returned by the widget itself.
*
* @newin{3,0}
*
* @param minimum_width Location to store the minimum width, or <tt>nullptr</tt>.
* @param natural_width Location to store the natural width, or <tt>nullptr</tt>.
*/
void get_preferred_width(int& minimum_width, int& natural_width) const;
/** Retrieves a widget’s minimum and natural height if it would be given
* the specified @a width.
*
* The returned request will be modified by the
* GtkWidgetClass::adjust_size_request virtual method and by any
* Gtk::SizeGroups that have been applied. That is, the returned request
* is the one that should be used for layout, not necessarily the one
* returned by the widget itself.
*
* @newin{3,0}
*
* @param width The width which is available for allocation.
* @param minimum_height Location for storing the minimum height, or <tt>nullptr</tt>.
* @param natural_height Location for storing the natural height, or <tt>nullptr</tt>.
*/
void get_preferred_height_for_width(int width, int& minimum_height, int& natural_height) const;
/** Retrieves a widget’s minimum and natural height and the corresponding baselines if it would be given
* the specified @a width, or the default height if @a width is -1. The baselines may be -1 which means
* that no baseline is requested for this widget.
*
* The returned request will be modified by the
* GtkWidgetClass::adjust_size_request and GtkWidgetClass::adjust_baseline_request virtual methods
* and by any Gtk::SizeGroups that have been applied. That is, the returned request
* is the one that should be used for layout, not necessarily the one
* returned by the widget itself.
*
* @newin{3,10}
*
* @param width The width which is available for allocation, or -1 if none.
* @param minimum_height Location for storing the minimum height, or <tt>nullptr</tt>.
* @param natural_height Location for storing the natural height, or <tt>nullptr</tt>.
* @param minimum_baseline Location for storing the baseline for the minimum height, or <tt>nullptr</tt>.
* @param natural_baseline Location for storing the baseline for the natural height, or <tt>nullptr</tt>.
*/
void get_preferred_height_for_width(int width, int& minimum_height, int& natural_height, int& minimum_baseline, int& natural_baseline) const;
/** Retrieves a widget’s initial minimum and natural height.
*
* This call is specific to width-for-height requests.
*
* The returned request will be modified by the
* GtkWidgetClass::adjust_size_request virtual method and by any
* Gtk::SizeGroups that have been applied. That is, the returned request
* is the one that should be used for layout, not necessarily the one
* returned by the widget itself.
*
* @newin{3,0}
*
* @param minimum_height Location to store the minimum height, or <tt>nullptr</tt>.
* @param natural_height Location to store the natural height, or <tt>nullptr</tt>.
*/
void get_preferred_height(int& minimum_height, int& natural_height) const;
/** Retrieves a widget’s minimum and natural width if it would be given
* the specified @a height.
*
* The returned request will be modified by the
* GtkWidgetClass::adjust_size_request virtual method and by any
* Gtk::SizeGroups that have been applied. That is, the returned request
* is the one that should be used for layout, not necessarily the one
* returned by the widget itself.
*
* @newin{3,0}
*
* @param height The height which is available for allocation.
* @param minimum_width Location for storing the minimum width, or <tt>nullptr</tt>.
* @param natural_width Location for storing the natural width, or <tt>nullptr</tt>.
*/
void get_preferred_width_for_height(int height, int& minimum_width, int& natural_width) const;
/** Retrieves the minimum and natural size of a widget, taking
* into account the widget’s preference for height-for-width management.
*
* This is used to retrieve a suitable size by container widgets which do
* not impose any restrictions on the child placement. It can be used
* to deduce toplevel window and menu sizes as well as child widgets in
* free-form containers such as GtkLayout.
*
* Handle with care. Note that the natural height of a height-for-width
* widget will generally be a smaller size than the minimum height, since the required
* height for the natural width is generally smaller than the required height for
* the minimum width.
*
* Use get_preferred_height_and_baseline_for_width() if you want to support
* baseline alignment.
*
* @newin{3,0}
*
* @param minimum_size Location for storing the minimum size, or <tt>nullptr</tt>.
* @param natural_size Location for storing the natural size, or <tt>nullptr</tt>.
*/
void get_preferred_size(Requisition& minimum_size, Requisition& natural_size) const;
/** Installs an accelerator for this @a widget in @a accel_group that causes
* @a accel_signal to be emitted if the accelerator is activated.
* The @a accel_group needs to be added to the widget’s toplevel via
* Gtk::Window::add_accel_group(), and the signal must be of type SIGNAL_ACTION.
* Accelerators added through this function are not user changeable during
* runtime. If you want to support accelerators that can be changed by the
* user, use Gtk::AccelMap::add_entry() and set_accel_path() or
* Gtk::MenuItem::set_accel_path() instead.
*
* @param accel_signal Widget signal to emit on accelerator activation.
* @param accel_group Accel group for this widget, added to its toplevel.
* @param accel_key GDK keyval of the accelerator.
* @param accel_mods Modifier key combination of the accelerator.
* @param accel_flags Flag accelerators, e.g. Gtk::ACCEL_VISIBLE.
*/
void add_accelerator(const Glib::ustring& accel_signal, const Glib::RefPtr<AccelGroup>& accel_group, guint accel_key, Gdk::ModifierType accel_mods, AccelFlags accel_flags);
/** Removes an accelerator from @a widget, previously installed with
* add_accelerator().
*
* @param accel_group Accel group for this widget.
* @param accel_key GDK keyval of the accelerator.
* @param accel_mods Modifier key combination of the accelerator.
* @return Whether an accelerator was installed and could be removed.
*/
bool remove_accelerator(const Glib::RefPtr<AccelGroup>& accel_group, guint accel_key, Gdk::ModifierType accel_mods);
/** Given an accelerator group, @a accel_group, and an accelerator path,
* @a accel_path, sets up an accelerator in @a accel_group so whenever the
* key binding that is defined for @a accel_path is pressed, @a widget
* will be activated. This removes any accelerators (for any
* accelerator group) installed by previous calls to
* set_accel_path(). Associating accelerators with
* paths allows them to be modified by the user and the modifications
* to be saved for future use. (See Gtk::AccelMap::save().)
*
* This function is a low level function that would most likely
* be used by a menu creation system like Gtk::UIManager. If you
* use Gtk::UIManager, setting up accelerator paths will be done
* automatically.
*
* Even when you you aren’t using Gtk::UIManager, if you only want to
* set up accelerators on menu items Gtk::MenuItem::set_accel_path()
* provides a somewhat more convenient interface.
*
* Note that @a accel_path string will be stored in a Quark. Therefore, if you
* pass a static string, you can save some memory by interning it first with
* Glib::intern_static_string().
*
* @param accel_path Path used to look up the accelerator.
* @param accel_group A Gtk::AccelGroup.
*/
void set_accel_path(const Glib::ustring& accel_path, const Glib::RefPtr<AccelGroup>& accel_group);
//GList* gtk_widget_list_accel_closures();
/** Emits the Gtk::Widget::signal_mnemonic_activate() signal.
*
* The default handler for this signal activates the @a widget if
* @a group_cycling is <tt>false</tt>, and just grabs the focus if @a group_cycling
* is <tt>true</tt>.
*
* @param group_cycling <tt>true</tt> if there are other widgets with the same mnemonic.
* @return <tt>true</tt> if the signal has been handled.
*/
bool mnemonic_activate(bool group_cycling);
//Probably not useful. Too C-specific: _WRAP_METHOD(bool can_activate_accel(guint signal_id) const, gtk_widget_can_activate_accel)
//TODO: Use C++ type
/** Rarely-used function. This function is used to emit
* the event signals on a widget (those signals should never
* be emitted without using this function to do so).
* If you want to synthesize an event though, don’t use this function;
* instead, use gtk_main_do_event() so the event will behave as if
* it were in the event queue. Don’t synthesize expose events; instead,
* use gdk_window_invalidate_rect() to invalidate a region of the
* window.
*
* @param gdk_event A Gdk::Event.
* @return Return from the event signal emission (<tt>true</tt> if
* the event was handled).
*/
bool event(GdkEvent* gdk_event);
/** Very rarely-used function. This function is used to emit
* an expose event on a widget. This function is not normally used
* directly. The only time it is used is when propagating an expose
* event to a windowless child widget (get_has_window() is <tt>false</tt>),
* and that is normally done using Gtk::Container::propagate_draw().
*
* If you want to force an area of a window to be redrawn,
* use gdk_window_invalidate_rect() or gdk_window_invalidate_region().
* To cause the redraw to be done immediately, follow that call
* with a call to gdk_window_process_updates().
*
* @param gdk_event A expose Gdk::Event.
* @return Return from the event signal emission (<tt>true</tt> if
* the event was handled).
*/
int send_expose(GdkEvent* gdk_event);
/** Sends the focus change @a gdk_event to @a widget
*
* This function is not meant to be used by applications. The only time it
* should be used is when it is necessary for a Gtk::Widget to assign focus
* to a widget that is semantically owned by the first widget even though
* it’s not a direct child - for instance, a search entry in a floating
* window similar to the quick search in Gtk::TreeView.
*
* An example of its usage is:
*
*
* [C example ellipted]
*
* @newin{2,20}
*
* @param gdk_event A Gdk::Event of type GDK_FOCUS_CHANGE.
* @return The return value from the event signal emission: <tt>true</tt>
* if the event was handled, and <tt>false</tt> otherwise.
*/
bool send_focus_change(GdkEvent* gdk_event);
/** For widgets that can be “activated” (buttons, menu items, etc.)
* this function activates them. Activation is what happens when you
* press Enter on a widget during key navigation. If @a widget isn't
* activatable, the function returns <tt>false</tt>.
*
* @return <tt>true</tt> if the widget was activatable.
*/
bool activate();
//TODO: When we can break ABI/API, change to void reparent(Container& new_parent).
// gtk_widget_reparent() is deprecated, but we want to keep Gtk::Widget::reparent().
/** Moves a widget from one Gtk::Container to another, handling reference
* count issues to avoid destroying the widget.
*
* @param new_parent A Gtk::Container to move the widget into.
*/
void reparent(Widget& new_parent);
bool intersect(const Gdk::Rectangle& area) const;
/** Computes the intersection of a @a widget’s area and @a area, storing
* the intersection in @a intersection, and returns <tt>true</tt> if there was
* an intersection. @a intersection may be <tt>nullptr</tt> if you’re only
* interested in whether there was an intersection.
*
* @param area A rectangle.
* @param intersection Rectangle to store intersection of @a widget and @a area.
* @return <tt>true</tt> if there was an intersection.
*/
bool intersect(const Gdk::Rectangle& area, Gdk::Rectangle& intersection) const;
#ifndef GTKMM_DISABLE_DEPRECATED
/** Computes the intersection of a @a widget’s area and @a region, returning
* the intersection. The result may be empty, use cairo_region_is_empty() to
* check.
*
* Deprecated: 3.14: Use get_allocation() and
* cairo_region_intersect_rectangle() to get the same behavior.
*
* @deprecated Use get_allocation() and Cairo::Region::intersect(const Cairo::RectangleInt&) to get the same behavior.
*
* @param region A #cairo_region_t, in the same coordinate system as
* @a widget->allocation. That is, relative to @a widget->window
* for widgets which return <tt>false</tt> from get_has_window();
* relative to the parent window of @a widget->window otherwise.
* @return A newly allocated region holding the intersection of @a widget
* and @a region.
*/
::Cairo::RefPtr< ::Cairo::Region> region_intersect(const ::Cairo::RefPtr< ::Cairo::Region>& region) const;
#endif // GTKMM_DISABLE_DEPRECATED
/** Stops emission of Gtk::Widget::signal_child_notify() signals on @a widget. The
* signals are queued until thaw_child_notify() is called
* on @a widget.
*
* This is the analogue of Glib::object_freeze_notify() for child properties.
*/
void freeze_child_notify();
/** Emits a Gtk::Widget::signal_child_notify() signal for the
* [child property][child-properties] @a child_property
* on @a widget.
*
* This is the analogue of Glib::object_notify() for child properties.
*
* Also see Gtk::Container::child_notify().
*
* @param child_property The name of a child property installed on the
* class of @a widget’s parent.
*/
void child_notify(const Glib::ustring& child_property);
/** Reverts the effect of a previous call to freeze_child_notify().
* This causes all queued Gtk::Widget::signal_child_notify() signals on @a widget to be
* emitted.
*/
void thaw_child_notify();
/** Specifies whether @a widget can own the input focus. See
* grab_focus() for actually setting the input focus on a
* widget.
*
* @newin{2,18}
*
* @param can_focus Whether or not @a widget can own the input focus.
*/
void set_can_focus(bool can_focus = true);
/** Determines whether @a widget can own the input focus. See
* set_can_focus().
*
* @newin{2,18}
*
* @return <tt>true</tt> if @a widget can own the input focus, <tt>false</tt> otherwise.
*/
bool get_can_focus() const;
/** Determines if the widget has the global input focus. See
* is_focus() for the difference between having the global
* input focus, and only having the focus within a toplevel.
*
* @newin{2,18}
*
* @return <tt>true</tt> if the widget has the global input focus.
*/
bool has_focus() const;
/** Determines if the widget is the focus widget within its
* toplevel. (This does not mean that the Gtk::Widget::property_has_focus() property is
* necessarily set; Gtk::Widget::property_has_focus() will only be set if the
* toplevel widget additionally has the global input focus.)
*
* @return <tt>true</tt> if the widget is the focus widget.
*/
bool is_focus() const;
/** Determines if the widget should show a visible indication that
* it has the global input focus. This is a convenience function for
* use in signal_draw() handlers that takes into account whether focus
* indication should currently be shown in the toplevel window of
* @a widget. See Gtk::Window::get_focus_visible() for more information
* about focus indication.
*
* To find out if the widget has the global input focus, use
* has_focus().
*
* @newin{3,2}
*
* @return <tt>true</tt> if the widget should display a “focus rectangle”.
*/
bool has_visible_focus() const;
/** Causes @a widget to have the keyboard focus for the Gtk::Window it's
* inside. @a widget must be a focusable widget, such as a Gtk::Entry;
* something like Gtk::Frame won’t work.
*
* More precisely, it must have the Gtk::CAN_FOCUS flag set. Use
* set_can_focus() to modify that flag.
*
* The widget also needs to be realized and mapped. This is indicated by the
* related signals. Grabbing the focus immediately after creating the widget
* will likely fail and cause critical warnings.
*/
void grab_focus();
/** Sets whether the widget should grab focus when it is clicked with the mouse.
* Making mouse clicks not grab focus is useful in places like toolbars where
* you don’t want the keyboard focus removed from the main area of the
* application.
*
* @newin{3,20}
*
* @param focus_on_click Whether the widget should grab focus when clicked with the mouse.
*/
void set_focus_on_click(bool focus_on_click = true);
/** Returns whether the widget should grab focus when it is clicked with the mouse.
* See set_focus_on_click().
*
* @newin{3,20}
*
* @return <tt>true</tt> if the widget should grab focus when it is clicked with
* the mouse.
*/
bool get_focus_on_click() const;
/** Specifies whether @a widget can be a default widget. See
* grab_default() for details about the meaning of
* “default”.
*
* @newin{2,18}
*
* @param can_default Whether or not @a widget can be a default widget.
*/
void set_can_default(bool can_default = true);
/** Determines whether @a widget can be a default widget. See
* set_can_default().
*
* @newin{2,18}
*
* @return <tt>true</tt> if @a widget can be a default widget, <tt>false</tt> otherwise.
*/
bool get_can_default() const;
/** Determines whether @a widget is the current default widget within its
* toplevel. See set_can_default().
*
* @newin{2,18}
*
* @return <tt>true</tt> if @a widget is the current default widget within
* its toplevel, <tt>false</tt> otherwise.
*/
bool has_default() const;
/** Causes @a widget to become the default widget. @a widget must be able to be
* a default widget; typically you would ensure this yourself
* by calling set_can_default() with a <tt>true</tt> value.
* The default widget is activated when
* the user presses Enter in a window. Default widgets must be
* activatable, that is, activate() should affect them. Note
* that Gtk::Entry widgets require the “activates-default” property
* set to <tt>true</tt> before they activate the default widget when Enter
* is pressed and the Gtk::Entry is focused.
*/
void grab_default();
/** Specifies whether @a widget will be treated as the default widget
* within its toplevel when it has the focus, even if another widget
* is the default.
*
* See grab_default() for details about the meaning of
* “default”.
*
* @newin{2,18}
*
* @param receives_default Whether or not @a widget can be a default widget.
*/
void set_receives_default(bool receives_default = true);
/** Determines whether @a widget is always treated as the default widget
* within its toplevel when it has the focus, even if another widget
* is the default.
*
* See set_receives_default().
*
* @newin{2,18}
*
* @return <tt>true</tt> if @a widget acts as the default widget when focused,
* <tt>false</tt> otherwise.
*/
bool get_receives_default() const;
/** Determines whether the widget is currently grabbing events, so it
* is the only widget receiving input events (keyboard and mouse).
*
* See also gtk_grab_add().
*
* @newin{2,18}
*
* @return <tt>true</tt> if the widget is in the grab_widgets stack.
*/
bool has_grab() const;
/** Returns <tt>true</tt> if @a device has been shadowed by a GTK+
* device grab on another widget, so it would stop sending
* events to @a widget. This may be used in the
* Gtk::Widget::signal_grab_notify() signal to check for specific
* devices. See gtk_device_grab_add().
*
* @newin{3,0}
*
* @param device A Gdk::Device.
* @return <tt>true</tt> if there is an ongoing grab on @a device
* by another Gtk::Widget than @a widget.
*/
bool device_is_shadowed(const Glib::RefPtr<const Gdk::Device>& device);
/** Block events to everything else than this widget and its children. This
* way you can get modal behaviour (usually not recommended). One practical
* example could be when implementing a key-binding widget that needs
* exclusive access to the key combination that the user presses next.
*
* Calls to add_modal_grab should be paired with calls to remove_modal_grab.
*/
void add_modal_grab();
/** Remove the modal grab of the widget in case it was previously grabbed.
*/
void remove_modal_grab();
/** Retrieve the widget which is currently grabbing all events.
*/
static Widget* get_current_modal_grab();
/** Widgets can be named, which allows you to refer to them from a
* CSS file. You can apply a style to widgets with a particular name
* in the CSS file. See the documentation for the CSS syntax (on the
* same page as the docs for Gtk::StyleContext).
*
* Note that the CSS syntax has certain special characters to delimit
* and represent elements in a selector (period, #, >, *...), so using
* these will make your widget impossible to match by name. Any combination
* of alphanumeric symbols, dashes and underscores will suffice.
*
* @param name Name for the widget.
*/
void set_name(const Glib::ustring& name);
void unset_name();
/** Retrieves the name of a widget. See set_name() for the
* significance of widget names.
*
* @return Name of the widget. This string is owned by GTK+ and
* should not be modified or freed.
*/
Glib::ustring get_name() const;
#ifndef GTKMM_DISABLE_DEPRECATED
/** This function is for use in widget implementations. Sets the state
* of a widget (insensitive, prelighted, etc.) Usually you should set
* the state using wrapper functions such as set_sensitive().
*
* Deprecated: 3.0: Use set_state_flags() instead.
*
* @deprecated Use set_state_flags() instead.
*
* @param state New state for @a widget.
*/
void set_state(StateType state);
#endif // GTKMM_DISABLE_DEPRECATED
#ifndef GTKMM_DISABLE_DEPRECATED
/** Returns the widget’s state. See set_state().
*
* @newin{2,18}
*
* Deprecated: 3.0: Use get_state_flags() instead.
*
* @deprecated Use get_state_flags() instead.
*
* @return The state of @a widget.
*/
StateType get_state() const;
#endif // GTKMM_DISABLE_DEPRECATED
/** This function is for use in widget implementations. Turns on flag
* values in the current widget state (insensitive, prelighted, etc.).
*
* This function accepts the values Gtk::STATE_FLAG_DIR_LTR and
* Gtk::STATE_FLAG_DIR_RTL but ignores them. If you want to set the widget's
* direction, use set_direction().
*
* It is worth mentioning that any other state than Gtk::STATE_FLAG_INSENSITIVE,
* will be propagated down to all non-internal children if @a widget is a
* Gtk::Container, while Gtk::STATE_FLAG_INSENSITIVE itself will be propagated
* down to all Gtk::Container children by different means than turning on the
* state flag down the hierarchy, both get_state_flags() and
* is_sensitive() will make use of these.
*
* @newin{3,0}
*
* @param flags State flags to turn on.
* @param clear Whether to clear state before turning on @a flags.
*/
void set_state_flags(StateFlags flags, bool clear = true);
/** This function is for use in widget implementations. Turns off flag
* values for the current widget state (insensitive, prelighted, etc.).
* See set_state_flags().
*
* @newin{3,0}
*
* @param flags State flags to turn off.
*/
void unset_state_flags(StateFlags flags);
/** Returns the widget state as a flag set. It is worth mentioning
* that the effective Gtk::STATE_FLAG_INSENSITIVE state will be
* returned, that is, also based on parent insensitivity, even if
* @a widget itself is sensitive.
*
* Also note that if you are looking for a way to obtain the
* Gtk::StateFlags to pass to a Gtk::StyleContext method, you
* should look at Gtk::StyleContext::get_state().
*
* @newin{3,0}
*
* @return The state flags for widget.
*/
StateFlags get_state_flags() const;
/** Sets the sensitivity of a widget. A widget is sensitive if the user
* can interact with it. Insensitive widgets are “grayed out” and the
* user can’t interact with them. Insensitive widgets are known as
* “inactive”, “disabled”, or “ghosted” in some other toolkits.
*
* @param sensitive <tt>true</tt> to make the widget sensitive.
*/
void set_sensitive(bool sensitive = true);
/** Returns the widget’s sensitivity (in the sense of returning
* the value that has been set using set_sensitive()).
*
* The effective sensitivity of a widget is however determined by both its
* own and its parent widget’s sensitivity. See is_sensitive().
*
* @newin{2,18}
*
* @return <tt>true</tt> if the widget is sensitive.
*/
bool get_sensitive() const;
/** Returns the widget’s effective sensitivity, which means
* it is sensitive itself and also its parent widget is sensitive
*
* @newin{2,18}
*
* @return <tt>true</tt> if the widget is effectively sensitive.
*/
bool is_sensitive() const;
/** Sets the visibility state of @a widget. Note that setting this to
* <tt>true</tt> doesn’t mean the widget is actually viewable, see
* get_visible().
*
* This function simply calls show() or hide()
* but is nicer to use when the visibility of the widget depends on
* some condition.
*
* @newin{2,18}
*
* @param visible Whether the widget should be shown or not.
*/
void set_visible(bool visible = true);
/** Determines whether the widget is visible. If you want to
* take into account whether the widget’s parent is also marked as
* visible, use is_visible() instead.
*
* This function does not check if the widget is obscured in any way.
*
* See set_visible().
*
* @newin{2,18}
*
* @return <tt>true</tt> if the widget is visible.
*/
bool get_visible() const;
/** Determines whether the widget and all its parents are marked as
* visible.
*
* This function does not check if the widget is obscured in any way.
*
* See also get_visible() and set_visible()
*
* @newin{3,8}
*
* @return <tt>true</tt> if the widget and all its parents are visible.
*/
bool is_visible() const;
/** Determines whether @a widget has a Gdk::Window of its own. See
* set_has_window().
*
* @newin{2,18}
*
* @return <tt>true</tt> if @a widget has a window, <tt>false</tt> otherwise.
*/
bool get_has_window() const;
/** Determines whether @a widget is a toplevel widget.
*
* Currently only Gtk::Window and Gtk::Invisible (and out-of-process
* Gtk::Plugs) are toplevel widgets. Toplevel widgets have no parent
* widget.
*
* @newin{2,18}
*
* @return <tt>true</tt> if @a widget is a toplevel, <tt>false</tt> otherwise.
*/
bool get_is_toplevel() const;
/** Determines whether @a widget can be drawn to. A widget can be drawn
* to if it is mapped and visible.
*
* @newin{2,18}
*
* @return <tt>true</tt> if @a widget is drawable, <tt>false</tt> otherwise.
*/
bool get_is_drawable() const;
/** Determines whether @a widget is realized.
*
* @newin{2,20}
*
* @return <tt>true</tt> if @a widget is realized, <tt>false</tt> otherwise.
*/
bool get_realized() const;
/** Whether the widget is mapped.
*
* @newin{2,20}
*
* @return <tt>true</tt> if the widget is mapped, <tt>false</tt> otherwise.
*/
bool get_mapped() const;
/** Sets whether the application intends to draw on the widget in
* an Gtk::Widget::signal_draw() handler.
*
* This is a hint to the widget and does not affect the behavior of
* the GTK+ core; many widgets ignore this flag entirely. For widgets
* that do pay attention to the flag, such as Gtk::EventBox and Gtk::Window,
* the effect is to suppress default themed drawing of the widget's
* background. (Children of the widget will still be drawn.) The application
* is then entirely responsible for drawing the widget background.
*
* Note that the background is still drawn when the widget is mapped.
*
* @param app_paintable <tt>true</tt> if the application will paint on the widget.
*/
void set_app_paintable(bool app_paintable = true);
/** Determines whether the application intends to draw on the widget in
* an Gtk::Widget::signal_draw() handler.
*
* See set_app_paintable()
*
* @newin{2,18}
*
* @return <tt>true</tt> if the widget is app paintable.
*/
bool get_app_paintable() const;
#ifndef GTKMM_DISABLE_DEPRECATED
/** Widgets are double buffered by default; you can use this function
* to turn off the buffering. “Double buffered” simply means that
* gdk_window_begin_paint_region() and gdk_window_end_paint() are called
* automatically around expose events sent to the
* widget. gdk_window_begin_paint_region() diverts all drawing to a widget's
* window to an offscreen buffer, and gdk_window_end_paint() draws the
* buffer to the screen. The result is that users see the window
* update in one smooth step, and don’t see individual graphics
* primitives being rendered.
*
* In very simple terms, double buffered widgets don’t flicker,
* so you would only use this function to turn off double buffering
* if you had special needs and really knew what you were doing.
*
* @note if you turn off double-buffering, you have to handle
* expose events, since even the clearing to the background color or
* pixmap will not happen automatically (as it is done in
* gdk_window_begin_paint_region()).
*
* In 3.10 GTK and GDK have been restructured for translucent drawing. Since
* then expose events for double-buffered widgets are culled into a single
* event to the toplevel GDK window. If you now unset double buffering, you
* will cause a separate rendering pass for every widget. This will likely
* cause rendering problems - in particular related to stacking - and usually
* increases rendering times significantly.
*
* Deprecated: 3.14: This function does not work under non-X11 backends or with
* non-native windows.
* It should not be used in newly written code.
*
* @deprecated This does not work under non-X11 backends, and it should not be used in newly written code.
*
* @param double_buffered <tt>true</tt> to double-buffer a widget.
*/
void set_double_buffered(bool double_buffered = true);
#endif // GTKMM_DISABLE_DEPRECATED
#ifndef GTKMM_DISABLE_DEPRECATED
/** Determines whether the widget is double buffered.
*
* See set_double_buffered()
*
* @newin{2,18}
*
* @deprecated This should not be used in newly written code.
*
* @return <tt>true</tt> if the widget is double buffered.
*/
bool get_double_buffered() const;
#endif // GTKMM_DISABLE_DEPRECATED
/** Sets whether the entire widget is queued for drawing when its size
* allocation changes. By default, this setting is <tt>true</tt> and
* the entire widget is redrawn on every size change. If your widget
* leaves the upper left unchanged when made bigger, turning this
* setting off will improve performance.
*
* Note that for widgets where get_has_window() is <tt>false</tt>
* setting this flag to <tt>false</tt> turns off all allocation on resizing:
* the widget will not even redraw if its position changes; this is to
* allow containers that don’t draw anything to avoid excess
* invalidations. If you set this flag on a widget with no window that
* does draw on @a widget->window, you are
* responsible for invalidating both the old and new allocation of the
* widget when the widget is moved and responsible for invalidating
* regions newly when the widget increases size.
*
* @param redraw_on_allocate If <tt>true</tt>, the entire widget will be redrawn
* when it is allocated to a new size. Otherwise, only the
* new portion of the widget will be redrawn.
*/
void set_redraw_on_allocate(bool redraw_on_allocate = true);
/** Sets whether @a widget should be mapped along with its when its parent
* is mapped and @a widget has been shown with show().
*
* The child visibility can be set for widget before it is added to
* a container with set_parent(), to avoid mapping
* children unnecessary before immediately unmapping them. However
* it will be reset to its default state of <tt>true</tt> when the widget
* is removed from a container.
*
* Note that changing the child visibility of a widget does not
* queue a resize on the widget. Most of the time, the size of
* a widget is computed from all visible children, whether or
* not they are mapped. If this is not the case, the container
* can queue a resize itself.
*
* This function is only useful for container implementations and
* never should be called by an application.
*
* @param visible If <tt>true</tt>, @a widget should be mapped along with its parent.
*/
void set_child_visible(bool visible = true);
/** Gets the value set with set_child_visible().
* If you feel a need to use this function, your code probably
* needs reorganization.
*
* This function is only useful for container implementations and
* never should be called by an application.
*
* @return <tt>true</tt> if the widget is mapped with the parent.
*/
bool get_child_visible() const;
/** Returns the widget’s window if it is realized, <tt>nullptr</tt> otherwise
*
* @newin{2,14}
*
* @return @a widget’s window.
*/
Glib::RefPtr<Gdk::Window> get_window();
/** Returns the widget’s window if it is realized, <tt>nullptr</tt> otherwise
*
* @newin{2,14}
*
* @return @a widget’s window.
*/
Glib::RefPtr<const Gdk::Window> get_window() const;
/** Registers a Gdk::Window with the widget and sets it up so that
* the widget receives events for it. Call unregister_window()
* when destroying the window.
*
* Before 3.8 you needed to call gdk_window_set_user_data() directly to set
* this up. This is now deprecated and you should use register_window()
* instead. Old code will keep working as is, although some new features like
* transparency might not work perfectly.
*
* @newin{3,8}
*
* @param window A Gdk::Window.
*/
void register_window(const Glib::RefPtr<Gdk::Window>& window);
/** Unregisters a Gdk::Window from the widget that was previously set up with
* register_window(). You need to call this when the window is
* no longer used by the widget, such as when you destroy it.
*
* @newin{3,8}
*
* @param window A Gdk::Window.
*/
void unregister_window(const Glib::RefPtr<Gdk::Window>& window);
/** Returns the width that has currently been allocated to @a widget.
* This function is intended to be used when implementing handlers
* for the Gtk::Widget::signal_draw() function.
*
* @return The width of the @a widget.
*/
int get_allocated_width() const;
/** Returns the height that has currently been allocated to @a widget.
* This function is intended to be used when implementing handlers
* for the Gtk::Widget::signal_draw() function.
*
* @return The height of the @a widget.
*/
int get_allocated_height() const;
/** Returns the baseline that has currently been allocated to @a widget.
* This function is intended to be used when implementing handlers
* for the Gtk::Widget::signal_draw() function, and when allocating child
* widgets in Gtk::Widget::size_allocate.
*
* @newin{3,10}
*
* @return The baseline of the @a widget, or -1 if none.
*/
int get_allocated_baseline() const;
/** Retrieves the widget’s allocated size.
*
* This function returns the last values passed to
* size_allocate_with_baseline(). The value differs from
* the size returned in get_allocation() in that functions
* like set_halign() can adjust the allocation, but not
* the value returned by this function.
*
* If a widget is not visible, its allocated size is 0.
*
* @newin{3,20}
*
* @param allocation A pointer to a Gtk::Allocation to copy to.
* @param baseline A pointer to an integer to copy to.
*/
void get_allocated_size(Allocation& allocation, int& baseline) const;
/** Retrieves the widget's location.
* Note, when implementing a Container: a widget's allocation will be its "adjusted" allocation,
* that is, the widget's parent container typically calls size_allocate() with an allocation,
* and that allocation is then adjusted (to handle margin and alignment for example) before
* assignment to the widget. get_allocation() returns the adjusted allocation that was actually
* assigned to the widget. The adjusted allocation is guaranteed to be completely contained
* within the size_allocate() allocation, however. So a Container is guaranteed that its
* children stay inside the assigned bounds, but not that they have exactly the bounds the
* container assigned. There is no way to get the original allocation assigned by
* size_allocate(), since it isn't stored. If a container implementation needs that information
* it will have to track it itself.
*
* @return The widget's allocated area.
*/
Allocation get_allocation() const;
/** Sets the widget’s allocation. This should not be used
* directly, but from within a widget’s size_allocate method.
*
* The allocation set should be the “adjusted” or actual
* allocation. If you’re implementing a Gtk::Container, you want to use
* size_allocate() instead of set_allocation().
* The GtkWidgetClass::adjust_size_allocation virtual method adjusts the
* allocation inside size_allocate() to create an adjusted
* allocation.
*
* @newin{2,18}
*
* @param allocation A pointer to a Gtk::Allocation to copy from.
*/
void set_allocation(const Allocation& allocation);
/** Sets the widget’s clip. This must not be used directly,
* but from within a widget’s size_allocate method.
* It must be called after set_allocation() (or after chaining up
* to the parent class), because that function resets the clip.
*
* The clip set should be the area that @a widget draws on. If @a widget is a
* Gtk::Container, the area must contain all children's clips.
*
* If this function is not called by @a widget during a signal_size_allocate() handler,
* the clip will be set to @a widget's allocation.
*
* @newin{3,14}
*
* @param clip A pointer to a Gtk::Allocation to copy from.
*/
void set_clip(const Allocation& clip);
/** Retrieves the widget’s clip area.
*
* The clip area is the area in which all of the widget's drawing will
* happen. Other toolkits call it the bounding box.
*
* Historically, in GTK+ the clip area has been equal to the allocation
* retrieved via get_allocation().
*
* @newin{3,14}
*/
Allocation get_clip() const;
/** Returns the parent container of @a widget.
*
* @return The parent container of @a widget, or <tt>nullptr</tt>.
*/
Container* get_parent();
/** Returns the parent container of @a widget.
*
* @return The parent container of @a widget, or <tt>nullptr</tt>.
*/
const Container* get_parent() const;
/** Gets @a widget’s parent window.
*
* @return The parent window of @a widget.
*/
Glib::RefPtr<Gdk::Window> get_parent_window();
/** Gets @a widget’s parent window.
*
* @return The parent window of @a widget.
*/
Glib::RefPtr<const Gdk::Window> get_parent_window() const;
/** Sets a non default parent window for @a widget.
*
* For Gtk::Window classes, setting a @a parent_window effects whether
* the window is a toplevel window or can be embedded into other
* widgets.
*
* For Gtk::Window classes, this needs to be called before the
* window is realized.
*
* @param parent_window The new parent window.
*/
void set_parent_window(const Glib::RefPtr<const Gdk::Window>& parent_window);
/** This function is used by custom widget implementations; if you're
* writing an app, you’d use grab_focus() to move the focus
* to a particular widget, and Gtk::Container::set_focus_chain() to
* change the focus tab order. So you may want to investigate those
* functions instead.
*
* child_focus() is called by containers as the user moves
* around the window using keyboard shortcuts. @a direction indicates
* what kind of motion is taking place (up, down, left, right, tab
* forward, tab backward). child_focus() emits the
* Gtk::Widget::signal_focus() signal; widgets override the default handler
* for this signal in order to implement appropriate focus behavior.
*
* The default signal_focus() handler for a widget should return <tt>true</tt> if
* moving in @a direction left the focus on a focusable location inside
* that widget, and <tt>false</tt> if moving in @a direction moved the focus
* outside the widget. If returning <tt>true</tt>, widgets normally
* call grab_focus() to place the focus accordingly;
* if returning <tt>false</tt>, they don’t modify the current focus location.
*
* @param direction Direction of focus movement.
* @return <tt>true</tt> if focus ended up inside @a widget.
*/
bool child_focus(DirectionType direction);
/** This function should be called whenever keyboard navigation within
* a single widget hits a boundary. The function emits the
* Gtk::Widget::signal_keynav_failed() signal on the widget and its return
* value should be interpreted in a way similar to the return value of
* child_focus():
*
* When <tt>true</tt> is returned, stay in the widget, the failed keyboard
* navigation is OK and/or there is nowhere we can/should move the
* focus to.
*
* When <tt>false</tt> is returned, the caller should continue with keyboard
* navigation outside the widget, e.g. by calling
* child_focus() on the widget’s toplevel.
*
* The default signal_keynav_failed() handler returns <tt>true</tt> for
* Gtk::DIR_TAB_FORWARD and Gtk::DIR_TAB_BACKWARD. For the other
* values of Gtk::DirectionType it returns <tt>false</tt>.
*
* Whenever the default handler returns <tt>true</tt>, it also calls
* error_bell() to notify the user of the failed keyboard
* navigation.
*
* A use case for providing an own implementation of signal_keynav_failed()
* (either by connecting to it or by overriding it) would be a row of
* Gtk::Entry widgets where the user should be able to navigate the
* entire row with the cursor keys, as e.g. known from user interfaces
* that require entering license keys.
*
* @newin{2,12}
*
* @param direction Direction of focus movement.
* @return <tt>true</tt> if stopping keyboard navigation is fine, <tt>false</tt>
* if the emitting widget should try to handle the keyboard
* navigation attempt in its parent container(s).
*/
bool keynav_failed(DirectionType direction);
/** Notifies the user about an input-related error on this widget.
* If the Gtk::Settings gtk-error-bell property is true, it calls
* Gdk::Window::beep(), otherwise it does nothing.
*
* Note that the effect of Gdk::Window::beep() can be configured in many
* ways, depending on the windowing backend and the desktop environment
* or window manager that is used.
*
* @newin{2,12}
*/
void error_bell();
/** Sets the minimum size of a widget; that is, the widget’s size
* request will be at least @a width by @a height. You can use this
* function to force a widget to be larger than it normally would be.
*
* In most cases, Gtk::Window::set_default_size() is a better choice for
* toplevel windows than this function; setting the default size will
* still allow users to shrink the window. Setting the size request
* will force them to leave the window at least as large as the size
* request. When dealing with window sizes,
* Gtk::Window::set_geometry_hints() can be a useful function as well.
*
* Note the inherent danger of setting any fixed size - themes,
* translations into other languages, different fonts, and user action
* can all change the appropriate size for a given widget. So, it's
* basically impossible to hardcode a size that will always be
* correct.
*
* The size request of a widget is the smallest size a widget can
* accept while still functioning well and drawing itself correctly.
* However in some strange cases a widget may be allocated less than
* its requested size, and in many cases a widget may be allocated more
* space than it requested.
*
* If the size request in a given direction is -1 (unset), then
* the “natural” size request of the widget will be used instead.
*
* The size request set here does not include any margin from the
* Gtk::Widget properties margin-left, margin-right, margin-top, and
* margin-bottom, but it does include pretty much all other padding
* or border properties set by any subclass of Gtk::Widget.
*
* @param width Width @a widget should request, or -1 to unset.
* @param height Height @a widget should request, or -1 to unset.
*/
void set_size_request(int width = -1, int height = -1);
/** Gets the size request that was explicitly set for the widget using
* set_size_request(). A value of -1 stored in @a width or
* @a height indicates that that dimension has not been set explicitly
* and the natural requisition of the widget will be used instead. See
* set_size_request(). To get the size a widget will
* actually request, call get_preferred_size() instead of
* this function.
*
* @param width Return location for width, or <tt>nullptr</tt>.
* @param height Return location for height, or <tt>nullptr</tt>.
*/
void get_size_request(int& width, int& height) const;
/** Sets the event mask (see Gdk::EventMask) for a widget. The event
* mask determines which events a widget will receive. Keep in mind
* that different widgets have different default event masks, and by
* changing the event mask you may disrupt a widget’s functionality,
* so be careful. This function must be called while a widget is
* unrealized. Consider add_events() for widgets that are
* already realized, or if you want to preserve the existing event
* mask. This function can’t be used with widgets that have no window.
* (See get_has_window()). To get events on those widgets,
* place them inside a Gtk::EventBox and receive events on the event
* box.
*
* @param events Event mask.
*/
void set_events(Gdk::EventMask events);
/** Adds the events in the bitfield @a events to the event mask for
* @a widget. See set_events() and the
* [input handling overview][event-masks] for details.
*
* @param events An event mask, see Gdk::EventMask.
*/
void add_events(Gdk::EventMask events);
/** Sets the device event mask (see Gdk::EventMask) for a widget. The event
* mask determines which events a widget will receive from @a device. Keep
* in mind that different widgets have different default event masks, and by
* changing the event mask you may disrupt a widget’s functionality,
* so be careful. This function must be called while a widget is
* unrealized. Consider add_device_events() for widgets that are
* already realized, or if you want to preserve the existing event
* mask. This function can’t be used with windowless widgets (which return
* <tt>false</tt> from get_has_window());
* to get events on those widgets, place them inside a Gtk::EventBox
* and receive events on the event box.
*
* @newin{3,0}
*
* @param device A Gdk::Device.
* @param events Event mask.
*/
void set_device_events(const Glib::RefPtr<const Gdk::Device>& device, Gdk::EventMask events);
/** Adds the device events in the bitfield @a events to the event mask for
* @a widget. See set_device_events() for details.
*
* @newin{3,0}
*
* @param device A Gdk::Device.
* @param events An event mask, see Gdk::EventMask.
*/
void add_device_events(const Glib::RefPtr<const Gdk::Device>& device, Gdk::EventMask events);
/** Request the @a widget to be rendered partially transparent,
* with opacity 0 being fully transparent and 1 fully opaque. (Opacity values
* are clamped to the [0,1] range.).
* This works on both toplevel widget, and child widgets, although there
* are some limitations:
*
* For toplevel widgets this depends on the capabilities of the windowing
* system. On X11 this has any effect only on X screens with a compositing manager
* running. See is_composited(). On Windows it should work
* always, although setting a window’s opacity after the window has been
* shown causes it to flicker once on Windows.
*
* For child widgets it doesn’t work if any affected widget has a native window, or
* disables double buffering.
*
* @newin{3,8}
*
* @param opacity Desired opacity, between 0 and 1.
*/
void set_opacity(double opacity);
/** Fetches the requested opacity for this widget.
* See set_opacity().
*
* @newin{3,8}
*
* @return The requested opacity for this widget.
*/
double get_opacity() const;
/** Enables or disables a Gdk::Device to interact with @a widget
* and all its children.
*
* It does so by descending through the Gdk::Window hierarchy
* and enabling the same mask that is has for core events
* (i.e. the one that gdk_window_get_events() returns).
*
* @newin{3,0}
*
* @param device A Gdk::Device.
* @param enabled Whether to enable the device.
*/
void set_device_enabled(const Glib::RefPtr<Gdk::Device>& device, bool enabled = true);
/** Returns whether @a device can interact with @a widget and its
* children. See set_device_enabled().
*
* @newin{3,0}
*
* @param device A Gdk::Device.
* @return <tt>true</tt> is @a device is enabled for @a widget.
*/
bool get_device_enabled(const Glib::RefPtr<const Gdk::Device>& device) const;
/** This function returns the topmost widget in the container hierarchy
* @a widget is a part of. If @a widget has no parent widgets, it will be
* returned as the topmost widget. No reference will be added to the
* returned widget; it should not be unreferenced.
*
* Note the difference in behavior vs. get_ancestor();
* `gtk_widget_get_ancestor (widget, GTK_TYPE_WINDOW)`
* would return
* <tt>nullptr</tt> if @a widget wasn’t inside a toplevel window, and if the
* window was inside a Gtk::Window-derived widget which was in turn
* inside the toplevel Gtk::Window. While the second case may
* seem unlikely, it actually happens when a Gtk::Plug is embedded
* inside a Gtk::Socket within the same application.
*
* To reliably find the toplevel Gtk::Window, use
* get_toplevel() and call is_toplevel()
* on the result.
*
* [C example ellipted]
*
* @return The topmost ancestor of @a widget, or @a widget itself
* if there’s no ancestor.
*/
Container* get_toplevel();
/** This function returns the topmost widget in the container hierarchy
* @a widget is a part of. If @a widget has no parent widgets, it will be
* returned as the topmost widget. No reference will be added to the
* returned widget; it should not be unreferenced.
*
* Note the difference in behavior vs. get_ancestor();
* `gtk_widget_get_ancestor (widget, GTK_TYPE_WINDOW)`
* would return
* <tt>nullptr</tt> if @a widget wasn’t inside a toplevel window, and if the
* window was inside a Gtk::Window-derived widget which was in turn
* inside the toplevel Gtk::Window. While the second case may
* seem unlikely, it actually happens when a Gtk::Plug is embedded
* inside a Gtk::Socket within the same application.
*
* To reliably find the toplevel Gtk::Window, use
* get_toplevel() and call is_toplevel()
* on the result.
*
* [C example ellipted]
*
* @return The topmost ancestor of @a widget, or @a widget itself
* if there’s no ancestor.
*/
const Container* get_toplevel() const;
/** Gets the first ancestor of @a widget with type @a widget_type. For example,
* `gtk_widget_get_ancestor (widget, GTK_TYPE_BOX)` gets
* the first Gtk::Box that’s an ancestor of @a widget. No reference will be
* added to the returned widget; it should not be unreferenced. See note
* about checking for a toplevel Gtk::Window in the docs for
* get_toplevel().
*
* Note that unlike is_ancestor(), get_ancestor()
* considers @a widget to be an ancestor of itself.
*
* @param widget_type Ancestor type.
* @return The ancestor widget, or <tt>nullptr</tt> if not found.
*/
Widget* get_ancestor(GType widget_type);
/** Gets the first ancestor of @a widget with type @a widget_type. For example,
* `gtk_widget_get_ancestor (widget, GTK_TYPE_BOX)` gets
* the first Gtk::Box that’s an ancestor of @a widget. No reference will be
* added to the returned widget; it should not be unreferenced. See note
* about checking for a toplevel Gtk::Window in the docs for
* get_toplevel().
*
* Note that unlike is_ancestor(), get_ancestor()
* considers @a widget to be an ancestor of itself.
*
* @param widget_type Ancestor type.
* @return The ancestor widget, or <tt>nullptr</tt> if not found.
*/
const Widget* get_ancestor(GType widget_type) const;
/** Gets the visual that will be used to render @a widget.
*
* @return The visual for @a widget.
*/
Glib::RefPtr<Gdk::Visual> get_visual();
/** Get the Gdk::Screen from the toplevel window associated with
* this widget. This function can only be called after the widget
* has been added to a widget hierarchy with a Gtk::Window
* at the top.
*
* In general, you should only create screen specific
* resources when a widget has been realized, and you should
* free those resources when the widget is unrealized.
*
* @newin{2,2}
*
* @return The Gdk::Screen for the toplevel for this widget.
*/
Glib::RefPtr<Gdk::Screen> get_screen();
/** Get the Gdk::Screen from the toplevel window associated with
* this widget. This function can only be called after the widget
* has been added to a widget hierarchy with a Gtk::Window
* at the top.
*
* In general, you should only create screen specific
* resources when a widget has been realized, and you should
* free those resources when the widget is unrealized.
*
* @newin{2,2}
*
* @return The Gdk::Screen for the toplevel for this widget.
*/
Glib::RefPtr<const Gdk::Screen> get_screen() const;
/** Checks whether there is a Gdk::Screen is associated with
* this widget. All toplevel widgets have an associated
* screen, and all widgets added into a hierarchy with a toplevel
* window at the top.
*
* @newin{2,2}
*
* @return <tt>true</tt> if there is a Gdk::Screen associated
* with the widget.
*/
bool has_screen() const;
/** Retrieves the internal scale factor that maps from window coordinates
* to the actual device pixels. On traditional systems this is 1, on
* high density outputs, it can be a higher value (typically 2).
*
* See gdk_window_get_scale_factor().
*
* @newin{3,10}
*
* @return The scale factor for @a widget.
*/
int get_scale_factor() const;
/** Get the Gdk::Display for the toplevel window associated with
* this widget. This function can only be called after the widget
* has been added to a widget hierarchy with a Gtk::Window at the top.
*
* In general, you should only create display specific
* resources when a widget has been realized, and you should
* free those resources when the widget is unrealized.
*
* @newin{2,2}
*
* @return The Gdk::Display for the toplevel for this widget.
*/
Glib::RefPtr<Gdk::Display> get_display();
/** Get the Gdk::Display for the toplevel window associated with
* this widget. This function can only be called after the widget
* has been added to a widget hierarchy with a Gtk::Window at the top.
*
* In general, you should only create display specific
* resources when a widget has been realized, and you should
* free those resources when the widget is unrealized.
*
* @newin{2,2}
*
* @return The Gdk::Display for the toplevel for this widget.
*/
Glib::RefPtr<const Gdk::Display> get_display() const;
#ifndef GTKMM_DISABLE_DEPRECATED
/** Get the root window where this widget is located. This function can
* only be called after the widget has been added to a widget
* hierarchy with Gtk::Window at the top.
*
* The root window is useful for such purposes as creating a popup
* Gdk::Window associated with the window. In general, you should only
* create display specific resources when a widget has been realized,
* and you should free those resources when the widget is unrealized.
*
* @newin{2,2}
*
* Deprecated: 3.12: Use gdk_screen_get_root_window() instead
*
* @deprecated Use Gdk::Screen::get_root_window() instead.
*
* @return The Gdk::Window root window for the toplevel for this widget.
*/
Glib::RefPtr<Gdk::Window> get_root_window();
#endif // GTKMM_DISABLE_DEPRECATED
#ifndef GTKMM_DISABLE_DEPRECATED
/** Get the root window where this widget is located. This function can
* only be called after the widget has been added to a widget
* hierarchy with Gtk::Window at the top.
*
* The root window is useful for such purposes as creating a popup
* Gdk::Window associated with the window. In general, you should only
* create display specific resources when a widget has been realized,
* and you should free those resources when the widget is unrealized.
*
* @newin{2,2}
*
* Deprecated: 3.12: Use gdk_screen_get_root_window() instead
*
* @deprecated Use Gdk::Screen::get_root_window() instead.
*
* @return The Gdk::Window root window for the toplevel for this widget.
*/
Glib::RefPtr<const Gdk::Window> get_root_window() const;
#endif // GTKMM_DISABLE_DEPRECATED
/** Gets the settings object holding the settings used for this widget.
*
* Note that this function can only be called when the Gtk::Widget
* is attached to a toplevel, since the settings object is specific
* to a particular Gdk::Screen.
*
* @return The relevant Gtk::Settings object.
*/
Glib::RefPtr<Settings> get_settings();
/** Returns the clipboard object for the given selection to
* be used with @a widget. @a widget must have a Gdk::Display
* associated with it, so must be attached to a toplevel
* window.
*
* @newin{2,2}
*
* @param selection A Gdk::Atom which identifies the clipboard
* to use. Gdk::SELECTION_CLIPBOARD gives the
* default clipboard. Another common value
* is Gdk::SELECTION_PRIMARY, which gives
* the primary X selection.
* @return The appropriate clipboard object. If no
* clipboard already exists, a new one will
* be created. Once a clipboard object has
* been created, it is persistent for all time.
*/
Glib::RefPtr<Clipboard> get_clipboard(const Glib::ustring& selection);
/** Returns the clipboard object for the given selection to
* be used with @a widget. @a widget must have a Gdk::Display
* associated with it, so must be attached to a toplevel
* window.
*
* @newin{2,2}
*
* @param selection A Gdk::Atom which identifies the clipboard
* to use. Gdk::SELECTION_CLIPBOARD gives the
* default clipboard. Another common value
* is Gdk::SELECTION_PRIMARY, which gives
* the primary X selection.
* @return The appropriate clipboard object. If no
* clipboard already exists, a new one will
* be created. Once a clipboard object has
* been created, it is persistent for all time.
*/
Glib::RefPtr<const Clipboard> get_clipboard(const Glib::ustring& selection) const;
/** Gets whether the widget would like any available extra horizontal
* space. When a user resizes a Gtk::Window, widgets with expand=<tt>true</tt>
* generally receive the extra space. For example, a list or
* scrollable area or document in your window would often be set to
* expand.
*
* Containers should use compute_expand() rather than
* this function, to see whether a widget, or any of its children,
* has the expand flag set. If any child of a widget wants to
* expand, the parent may ask to expand also.
*
* This function only looks at the widget’s own hexpand flag, rather
* than computing whether the entire widget tree rooted at this widget
* wants to expand.
*
* @return Whether hexpand flag is set.
*/
bool get_hexpand() const;
/** Sets whether the widget would like any available extra horizontal
* space. When a user resizes a Gtk::Window, widgets with expand=<tt>true</tt>
* generally receive the extra space. For example, a list or
* scrollable area or document in your window would often be set to
* expand.
*
* Call this function to set the expand flag if you would like your
* widget to become larger horizontally when the window has extra
* room.
*
* By default, widgets automatically expand if any of their children
* want to expand. (To see if a widget will automatically expand given
* its current children and state, call compute_expand(). A
* container can decide how the expandability of children affects the
* expansion of the container by overriding the compute_expand virtual
* method on Gtk::Widget.).
*
* Setting hexpand explicitly with this function will override the
* automatic expand behavior.
*
* This function forces the widget to expand or not to expand,
* regardless of children. The override occurs because
* set_hexpand() sets the hexpand-set property (see
* set_hexpand_set()) which causes the widget’s hexpand
* value to be used, rather than looking at children and widget state.
*
* @param expand Whether to expand.
*/
void set_hexpand(bool expand = true);
/** Gets whether set_hexpand() has been used to
* explicitly set the expand flag on this widget.
*
* If hexpand is set, then it overrides any computed
* expand value based on child widgets. If hexpand is not
* set, then the expand value depends on whether any
* children of the widget would like to expand.
*
* There are few reasons to use this function, but it’s here
* for completeness and consistency.
*
* @return Whether hexpand has been explicitly set.
*/
bool get_hexpand_set() const;
/** Sets whether the hexpand flag (see get_hexpand()) will
* be used.
*
* The hexpand-set property will be set automatically when you call
* set_hexpand() to set hexpand, so the most likely
* reason to use this function would be to unset an explicit expand
* flag.
*
* If hexpand is set, then it overrides any computed
* expand value based on child widgets. If hexpand is not
* set, then the expand value depends on whether any
* children of the widget would like to expand.
*
* There are few reasons to use this function, but it’s here
* for completeness and consistency.
*
* @param set Value for hexpand-set property.
*/
void set_hexpand_set(bool set = true);
/** Gets whether the widget would like any available extra vertical
* space.
*
* See get_hexpand() for more detail.
*
* @return Whether vexpand flag is set.
*/
bool get_vexpand() const;
/** Sets whether the widget would like any available extra vertical
* space.
*
* See set_hexpand() for more detail.
*
* @param expand Whether to expand.
*/
void set_vexpand(bool expand = true);
/** Gets whether set_vexpand() has been used to
* explicitly set the expand flag on this widget.
*
* See get_hexpand_set() for more detail.
*
* @return Whether vexpand has been explicitly set.
*/
bool get_vexpand_set() const;
/** Sets whether the vexpand flag (see get_vexpand()) will
* be used.
*
* See set_hexpand_set() for more detail.
*
* @param set Value for vexpand-set property.
*/
void set_vexpand_set(bool set = true);
/** Mark @a widget as needing to recompute its expand flags. Call
* this function when setting legacy expand child properties
* on the child of a container.
*
* See compute_expand().
*/
void queue_compute_expand();
/** Computes whether a container should give this widget extra space
* when possible. Containers should check this, rather than
* looking at get_hexpand() or get_vexpand().
*
* This function already checks whether the widget is visible, so
* visibility does not need to be checked separately. Non-visible
* widgets are not expanded.
*
* The computed expand value uses either the expand setting explicitly
* set on the widget itself, or, if none has been explicitly set,
* the widget may expand if some of its children do.
*
* @param orientation Expand direction.
* @return Whether widget tree rooted here should be expanded.
*/
bool compute_expand(Orientation orientation);
/** Returns <tt>true</tt> if @a widget is multiple pointer aware. See
* set_support_multidevice() for more information.
*
* @return <tt>true</tt> if @a widget is multidevice aware.
*/
bool get_support_multidevice() const;
/** Enables or disables multiple pointer awareness. If this setting is <tt>true</tt>,
* @a widget will start receiving multiple, per device enter/leave events. Note
* that if custom Gdk::Windows are created in Gtk::Widget::signal_realize(),
* gdk_window_set_support_multidevice() will have to be called manually on them.
*
* @newin{3,0}
*
* @param support_multidevice <tt>true</tt> to support input from multiple devices.
*/
void set_support_multidevice(bool support_multidevice = true);
#ifdef GTKMM_ATKMM_ENABLED
/** Returns the accessible object that describes the widget to an
* assistive technology.
*
* If accessibility support is not available, this Atk::Object
* instance may be a no-op. Likewise, if no class-specific Atk::Object
* implementation is available for the widget instance in question,
* it will inherit an Atk::Object implementation from the first ancestor
* class for which such an implementation is defined.
*
* The documentation of the
* [ATK](http://developer.gnome.org/atk/stable/)
* library contains more information about accessible objects and their uses.
*
* @return The Atk::Object associated with @a widget.
*/
Glib::RefPtr<Atk::Object> get_accessible();
#endif // GTKMM_ATKMM_ENABLED
#ifdef GTKMM_ATKMM_ENABLED
/** Returns the accessible object that describes the widget to an
* assistive technology.
*
* If accessibility support is not available, this Atk::Object
* instance may be a no-op. Likewise, if no class-specific Atk::Object
* implementation is available for the widget instance in question,
* it will inherit an Atk::Object implementation from the first ancestor
* class for which such an implementation is defined.
*
* The documentation of the
* [ATK](http://developer.gnome.org/atk/stable/)
* library contains more information about accessible objects and their uses.
*
* @return The Atk::Object associated with @a widget.
*/
Glib::RefPtr<const Atk::Object> get_accessible() const;
#endif // GTKMM_ATKMM_ENABLED
/** Gets the value of the Gtk::Widget::property_halign() property.
*
* For backwards compatibility reasons this method will never return
* Gtk::ALIGN_BASELINE, but instead it will convert it to
* Gtk::ALIGN_FILL. Baselines are not supported for horizontal
* alignment.
*
* @return The horizontal alignment of @a widget.
*/
Align get_halign() const;
/** Sets the horizontal alignment of @a widget.
* See the Gtk::Widget::property_halign() property.
*
* @param align The horizontal alignment.
*/
void set_halign(Align align);
/** Gets the value of the Gtk::Widget::property_valign() property.
*
* For backwards compatibility reasons this method will never return
* Gtk::ALIGN_BASELINE, but instead it will convert it to
* Gtk::ALIGN_FILL. If your widget want to support baseline aligned
* children it must use get_valign_with_baseline(), or
* `g_object_get (widget, "valign", &value, <tt>nullptr</tt>)`, which will
* also report the true value.
*
* @return The vertical alignment of @a widget, ignoring baseline alignment.
*/
Align get_valign() const;
/** Gets the value of the Gtk::Widget::property_valign() property, including
* Gtk::ALIGN_BASELINE.
*
* @newin{3,10}
*
* @return The vertical alignment of @a widget.
*/
Align get_valign_with_baseline() const;
/** Sets the vertical alignment of @a widget.
* See the Gtk::Widget::property_valign() property.
*
* @param align The vertical alignment.
*/
void set_valign(Align align);
#ifndef GTKMM_DISABLE_DEPRECATED
/** Gets the value of the Gtk::Widget::property_margin_left() property.
*
* Deprecated: 3.12: Use get_margin_start() instead.
*
* @newin{3,0}
*
* @deprecated Use get_margin_start() instead.
*
* @return The left margin of @a widget.
*/
int get_margin_left() const;
#endif // GTKMM_DISABLE_DEPRECATED
#ifndef GTKMM_DISABLE_DEPRECATED
/** Sets the left margin of @a widget.
* See the Gtk::Widget::property_margin_left() property.
*
* Deprecated: 3.12: Use set_margin_start() instead.
*
* @newin{3,0}
*
* @deprecated Use set_margin_start() instead.
*
* @param margin The left margin.
*/
void set_margin_left(int margin);
#endif // GTKMM_DISABLE_DEPRECATED
#ifndef GTKMM_DISABLE_DEPRECATED
/** Gets the value of the Gtk::Widget::property_margin_right() property.
*
* Deprecated: 3.12: Use get_margin_end() instead.
*
* @newin{3,0}
*
* @deprecated Use get_margin_end() instead.
*
* @return The right margin of @a widget.
*/
int get_margin_right() const;
#endif // GTKMM_DISABLE_DEPRECATED
#ifndef GTKMM_DISABLE_DEPRECATED
/** Sets the right margin of @a widget.
* See the Gtk::Widget::property_margin_right() property.
*
* Deprecated: 3.12: Use set_margin_end() instead.
*
* @newin{3,0}
*
* @deprecated Use set_margin_end() instead.
*
* @param margin The right margin.
*/
void set_margin_right(int margin);
#endif // GTKMM_DISABLE_DEPRECATED
/** Gets the value of the Gtk::Widget::property_margin_start() property.
*
* @newin{3,12}
*
* @return The start margin of @a widget.
*/
int get_margin_start() const;
/** Sets the start margin of @a widget.
* See the Gtk::Widget::property_margin_start() property.
*
* @newin{3,12}
*
* @param margin The start margin.
*/
void set_margin_start(int margin);
/** Gets the value of the Gtk::Widget::property_margin_end() property.
*
* @newin{3,12}
*
* @return The end margin of @a widget.
*/
int get_margin_end() const;
/** Sets the end margin of @a widget.
* See the Gtk::Widget::property_margin_end() property.
*
* @newin{3,12}
*
* @param margin The end margin.
*/
void set_margin_end(int margin);
/** Gets the value of the Gtk::Widget::property_margin_top() property.
*
* @newin{3,0}
*
* @return The top margin of @a widget.
*/
int get_margin_top() const;
/** Sets the top margin of @a widget.
* See the Gtk::Widget::property_margin_top() property.
*
* @newin{3,0}
*
* @param margin The top margin.
*/
void set_margin_top(int margin);
/** Gets the value of the Gtk::Widget::property_margin_bottom() property.
*
* @newin{3,0}
*
* @return The bottom margin of @a widget.
*/
int get_margin_bottom() const;
/** Sets the bottom margin of @a widget.
* See the Gtk::Widget::property_margin_bottom() property.
*
* @newin{3,0}
*
* @param margin The bottom margin.
*/
void set_margin_bottom(int margin);
/** Returns the event mask (see Gdk::EventMask) for the widget. These are the
* events that the widget will receive.
*
* @note Internally, the widget event mask will be the logical OR of the event
* mask set through set_events() or add_events(), and the
* event mask necessary to cater for every Gtk::EventController created for the
* widget.
*
* @return Event mask for @a widget.
*/
Gdk::EventMask get_events() const;
/** Returns the events mask for the widget corresponding to an specific device. These
* are the events that the widget will receive when @a device operates on it.
*
* @newin{3,0}
*
* @param device A Gdk::Device.
* @return Device event mask for @a widget.
*/
Gdk::EventMask get_device_events(const Glib::RefPtr<const Gdk::Device>& device) const;
#ifndef GTKMM_DISABLE_DEPRECATED
/** Obtains the location of the mouse pointer in widget coordinates.
* Widget coordinates are a bit odd; for historical reasons, they are
* defined as @a widget->window coordinates for widgets that return <tt>true</tt> for
* get_has_window(); and are relative to @a widget->allocation.x,
* @a widget->allocation.y otherwise.
*
* Deprecated: 3.4: Use gdk_window_get_device_position() instead.
*
* @deprecated Use Gdk::Window::get_device_position instead.
*
* @param x Return location for the X coordinate, or <tt>nullptr</tt>.
* @param y Return location for the Y coordinate, or <tt>nullptr</tt>.
*/
void get_pointer(int & x, int & y) const;
#endif // GTKMM_DISABLE_DEPRECATED
/** Determines whether @a widget is somewhere inside @a ancestor, possibly with
* intermediate containers.
*
* @param ancestor Another Gtk::Widget.
* @return <tt>true</tt> if @a ancestor contains @a widget as a child,
* grandchild, great grandchild, etc.
*/
bool is_ancestor(Widget & ancestor) const;
/** Translate coordinates relative to @a src_widget’s allocation to coordinates
* relative to @a dest_widget’s allocations. In order to perform this
* operation, both widgets must be realized, and must share a common
* toplevel.
*
* @param dest_widget A Gtk::Widget.
* @param src_x X position relative to @a src_widget.
* @param src_y Y position relative to @a src_widget.
* @param dest_x Location to store X position relative to @a dest_widget.
* @param dest_y Location to store Y position relative to @a dest_widget.
* @return <tt>false</tt> if either widget was not realized, or there
* was no common ancestor. In this case, nothing is stored in
* * @a dest_x and * @a dest_y. Otherwise <tt>true</tt>.
*/
bool translate_coordinates(Widget& dest_widget, int src_x, int src_y, int& dest_x, int& dest_y);
//deprecated broadly in favour of StyleContext.;
#ifndef GTKMM_DISABLE_DEPRECATED
/** Sets the color to use for a widget.
*
* All other style values are left untouched.
*
* This function does not act recursively. Setting the color of a
* container does not affect its children. Note that some widgets that
* you may not think of as containers, for instance Gtk::Buttons,
* are actually containers.
*
* This API is mostly meant as a quick way for applications to
* change a widget appearance. If you are developing a widgets
* library and intend this change to be themeable, it is better
* done by setting meaningful CSS classes in your
* widget/container implementation through Gtk::StyleContext::add_class().
*
* This way, your widget library can install a Gtk::CssProvider
* with the Gtk::STYLE_PROVIDER_PRIORITY_FALLBACK priority in order
* to provide a default styling for those widgets that need so, and
* this theming may fully overridden by the user’s theme.
*
* Note that for complex widgets this may bring in undesired
* results (such as uniform background color everywhere), in
* these cases it is better to fully style such widgets through a
* Gtk::CssProvider with the Gtk::STYLE_PROVIDER_PRIORITY_APPLICATION
* priority.
*
* @newin{3,0}
*
* Deprecated:3.16: Use a custom style provider and style classes instead
*
* @deprecated Use a custom style provider and style classes instead.
*
* @param state The state for which to set the color.
* @param color The color to assign, or <tt>nullptr</tt> to undo the effect
* of previous calls to override_color().
*/
void override_color(const Gdk::RGBA& color, StateFlags state = STATE_FLAG_NORMAL);
#endif // GTKMM_DISABLE_DEPRECATED
#ifndef GTKMM_DISABLE_DEPRECATED
/** Undoes the effect of previous calls to override_color().
*
* @newin{3,0}
* @deprecated Use a custom style provider and style classes instead.
*
* @param state The state for which to use the color of the user's theme.
*/
void unset_color(StateFlags state = STATE_FLAG_NORMAL);
#endif // GTKMM_DISABLE_DEPRECATED
#ifndef GTKMM_DISABLE_DEPRECATED
/** Sets the background color to use for a widget.
*
* All other style values are left untouched.
* See override_color().
*
* @newin{3,0}
*
* Deprecated: 3.16: This function is not useful in the context of CSS-based
* rendering. If you wish to change the way a widget renders its background
* you should use a custom CSS style, through an application-specific
* Gtk::StyleProvider and a CSS style class. You can also override the default
* drawing of a widget through the Gtk::Widget::signal_draw() signal, and use Cairo to
* draw a specific color, regardless of the CSS style.
*
* @deprecated Use a custom style provider and style classes instead.
*
* @param state The state for which to set the background color.
* @param color The color to assign, or <tt>nullptr</tt> to undo the effect
* of previous calls to override_background_color().
*/
void override_background_color(const Gdk::RGBA& color, StateFlags state = STATE_FLAG_NORMAL);
#endif // GTKMM_DISABLE_DEPRECATED
#ifndef GTKMM_DISABLE_DEPRECATED
/** Undoes the effect of previous calls to override_background_color().
*
* @newin{3,0}
* @deprecated Use a custom style provider and style classes instead.
*
* @param state The state for which to use the background color of the user's theme.
*/
void unset_background_color(StateFlags state = STATE_FLAG_NORMAL);
#endif // GTKMM_DISABLE_DEPRECATED
#ifndef GTKMM_DISABLE_DEPRECATED
/** Sets the font to use for a widget. All other style values are
* left untouched. See override_color().
*
* @newin{3,0}
*
* Deprecated: 3.16: This function is not useful in the context of CSS-based
* rendering. If you wish to change the font a widget uses to render its text
* you should use a custom CSS style, through an application-specific
* Gtk::StyleProvider and a CSS style class.
*
* @deprecated Use a custom style provider and style classes instead.
*
* @param font_desc The font description to use, or <tt>nullptr</tt> to undo
* the effect of previous calls to override_font().
*/
void override_font(const Pango::FontDescription& font_desc);
#endif // GTKMM_DISABLE_DEPRECATED
#ifndef GTKMM_DISABLE_DEPRECATED
/** Undoes the effect of previous calls to override_font().
*
* @newin{3,0}
* @deprecated Use a custom style provider and style classes instead.
*/
void unset_font();
#endif // GTKMM_DISABLE_DEPRECATED
#ifndef GTKMM_DISABLE_DEPRECATED
/** Sets a symbolic color for a widget.
*
* All other style values are left untouched.
* See override_color() for overriding the foreground
* or background color.
*
* @newin{3,0}
*
* Deprecated: 3.16: This function is not useful in the context of CSS-based
* rendering. If you wish to change the color used to render symbolic icons
* you should use a custom CSS style, through an application-specific
* Gtk::StyleProvider and a CSS style class.
*
* @deprecated Use a custom style provider and style classes instead.
*
* @param name The name of the symbolic color to modify.
* @param color The color to assign (does not need
* to be allocated), or <tt>nullptr</tt> to undo the effect of previous
* calls to override_symbolic_color().
*/
void override_symbolic_color(const Glib::ustring& name, const Gdk::RGBA& color);
#endif // GTKMM_DISABLE_DEPRECATED
#ifndef GTKMM_DISABLE_DEPRECATED
/** Undoes the effect of previous calls to override_symbolic_color().
*
* @newin{3,0}
* @deprecated Use a custom style provider and style classes instead.
*
* @param name The name of the symbolic color to fetch from the user's theme.
*/
void unset_symbolic_color(const Glib::ustring& name);
#endif // GTKMM_DISABLE_DEPRECATED
#ifndef GTKMM_DISABLE_DEPRECATED
/** Sets the cursor color to use in a widget, overriding the
* cursor-color and secondary-cursor-color
* style properties. All other style values are left untouched.
* See also modify_style().
*
* Note that the underlying properties have the Gdk::Color type,
* so the alpha value in @a primary and @a secondary will be ignored.
*
* @newin{3,0}
*
* Deprecated: 3.16: This function is not useful in the context of CSS-based
* rendering. If you wish to change the color used to render the primary
* and secondary cursors you should use a custom CSS style, through an
* application-specific Gtk::StyleProvider and a CSS style class.
*
* @deprecated Use a custom style provider and style classes instead.
*
* @param cursor The color to use for primary cursor (does not need to be
* allocated), or <tt>nullptr</tt> to undo the effect of previous calls to
* of override_cursor().
* @param secondary_cursor The color to use for secondary cursor (does not
* need to be allocated), or <tt>nullptr</tt> to undo the effect of previous
* calls to of override_cursor().
*/
void override_cursor(const Gdk::RGBA& cursor, const Gdk::RGBA& secondary_cursor);
#endif // GTKMM_DISABLE_DEPRECATED
#ifndef GTKMM_DISABLE_DEPRECATED
/** Undoes the effect of previous calls to override_cursor().
*
* @newin{3,0}
* @deprecated Use a custom style provider and style classes instead.
*/
void unset_cursor();
#endif // GTKMM_DISABLE_DEPRECATED
//deprecated
/** Updates the style context of @a widget and all descendants
* by updating its widget path. Gtk::Containers may want
* to use this on a child when reordering it in a way that a different
* style might apply to it. See also Gtk::Container::get_path_for_child().
*
* @newin{3,0}
*/
void reset_style();
//The parameter name is "the_property_name" to avoid a warning because there is a method with the "property_name" name.
/** Gets the value of a style property of @a widget.
* @param the_property_name The name of a style property.
* @param value Location to return the property value.
*/
template <class PropertyType>
void get_style_property(const Glib::ustring& the_property_name, PropertyType& value) const;
/** Creates a new Pango::Context with the appropriate font map,
* font options, font description, and base direction for drawing
* text for this widget. See also get_pango_context().
*
* @return The new Pango::Context.
*/
Glib::RefPtr<Pango::Context> create_pango_context();
/** Gets a Pango::Context with the appropriate font map, font description,
* and base direction for this widget. Unlike the context returned
* by create_pango_context(), this context is owned by
* the widget (it can be used until the screen for the widget changes
* or the widget is removed from its toplevel), and will be updated to
* match any changes to the widget’s attributes. This can be tracked
* by using the Gtk::Widget::signal_screen_changed() signal on the widget.
*
* @return The Pango::Context for the widget.
*/
Glib::RefPtr<Pango::Context> get_pango_context();
/** Sets the #cairo_font_options_t used for Pango rendering in this widget.
* When not set, the default font options for the Gdk::Screen will be used.
*
* @newin{3,18}
*
* @param options A #cairo_font_options_t, or <tt>nullptr</tt> to unset any
* previously set default font options.
*/
void set_font_options(const ::Cairo::FontOptions& options);
/** Undoes the effect of previous calls to set_font_options().
*
* @newin{3,20}
*/
void unset_font_options();
// This returns a const, so we assume that we must copy it:
/** Returns the #cairo_font_options_t used for Pango rendering. When not set,
* the defaults font options for the Gdk::Screen will be used.
*
* @newin{3,18}
*
* @return The #cairo_font_options_t or <tt>nullptr</tt> if not set.
*/
::Cairo::FontOptions get_font_options() const;
/** Creates a new Pango::Layout with the appropriate font map,
* font description, and base direction for drawing text for
* this widget.
*
* If you keep a Pango::Layout created in this way around, you need
* to re-create it when the widget Pango::Context is replaced.
* This can be tracked by using the Gtk::Widget::signal_screen_changed() signal
* on the widget.
*
* @param text Text to set on the layout (can be <tt>nullptr</tt>).
* @return The new Pango::Layout.
*/
Glib::RefPtr<Pango::Layout> create_pango_layout(const Glib::ustring& text);
//deprecated.
#ifndef GTKMM_DISABLE_DEPRECATED
/** A convenience function that uses the theme engine and style
* settings for @a widget to look up @a stock_id and render it to
* a pixbuf. @a stock_id should be a stock icon ID such as
* Gtk::STOCK_OPEN or Gtk::STOCK_OK. @a size should be a size
* such as Gtk::ICON_SIZE_MENU.
*
* The pixels in the returned Gdk::Pixbuf are shared with the rest of
* the application and should not be modified. The pixbuf should be freed
* after use with Glib::object_unref().
*
* @newin{3,0}
*
* Deprecated: 3.10: Use Gtk::IconTheme::load_icon() instead.
*
* @deprecated Use IconTheme::load_icon() instead.
*
* @param stock_id A stock ID.
* @param size A stock size (Gtk::IconSize). A size of `(GtkIconSize)-1`
* means render at the size of the source and don’t scale (if there are
* multiple source sizes, GTK+ picks one of the available sizes).
* @return A new pixbuf, or <tt>nullptr</tt> if the
* stock ID wasn’t known.
*/
Glib::RefPtr<Gdk::Pixbuf> render_icon_pixbuf(const StockID& stock_id, IconSize size);
#endif // GTKMM_DISABLE_DEPRECATED
#ifndef GTKMM_DISABLE_DEPRECATED
/** Sets a widgets composite name. The widget must be
* a composite child of its parent; see push_composite_child().
*
* Deprecated: 3.10: Use class_set_template(), or don’t use this API at all.
*
* @deprecated Use gtk_widget_class_set_template(), or don't use this API at all.
*
* @param name The name to set.
*/
void set_composite_name(const Glib::ustring& name);
#endif // GTKMM_DISABLE_DEPRECATED
#ifndef GTKMM_DISABLE_DEPRECATED
/** @deprecated Use gtk_widget_class_set_template(), or don't use this API at all.
*/
void unset_composite_name();
#endif // GTKMM_DISABLE_DEPRECATED
#ifndef GTKMM_DISABLE_DEPRECATED
/** Obtains the composite name of a widget.
*
* Deprecated: 3.10: Use class_set_template(), or don’t use this API at all.
*
* @deprecated Use gtk_widget_class_set_template(), or don't use this API at all.
*
* @return The composite name of @a widget, or an empty string if @a widget is not
* a composite child.
*/
Glib::ustring get_composite_name() const;
#endif // GTKMM_DISABLE_DEPRECATED
#ifndef GTKMM_DISABLE_DEPRECATED
/** Makes all newly-created widgets as composite children until
* the corresponding pop_composite_child() call.
*
* A composite child is a child that’s an implementation detail of the
* container it’s inside and should not be visible to people using the
* container. Composite children aren’t treated differently by GTK+ (but
* see Gtk::Container::foreach() vs. Gtk::Container::forall()), but e.g. GUI
* builders might want to treat them in a different way.
*
* Deprecated: 3.10: This API never really worked well and was mostly unused, now
* we have a more complete mechanism for composite children, see class_set_template().
*
* @deprecated This API never really worked well and was mostly unused, now we have a more complete mechanism for composite children, see gtk_widget_class_set_template().
*/
static void push_composite_child();
#endif // GTKMM_DISABLE_DEPRECATED
#ifndef GTKMM_DISABLE_DEPRECATED
/** Cancels the effect of a previous call to push_composite_child().
*
* Deprecated: 3.10: Use class_set_template(), or don’t use this API at all.
*
* @deprecated Use gtk_widget_class_set_template(), or don't use this API at all.
*/
static void pop_composite_child();
#endif // GTKMM_DISABLE_DEPRECATED
/* Directionality of Text */
/** Sets the reading direction on a particular widget. This direction
* controls the primary direction for widgets containing text,
* and also the direction in which the children of a container are
* packed. The ability to set the direction is present in order
* so that correct localization into languages with right-to-left
* reading directions can be done. Generally, applications will
* let the default reading direction present, except for containers
* where the containers are arranged in an order that is explicitly
* visual rather than logical (such as buttons for text justification).
*
* If the direction is set to Gtk::TEXT_DIR_NONE, then the value
* set by set_default_direction() will be used.
*
* @param dir The new direction.
*/
void set_direction(TextDirection dir);
/** Gets the reading direction for a particular widget. See
* set_direction().
*
* @return The reading direction for the widget.
*/
TextDirection get_direction() const;
/** Sets the default reading direction for widgets where the
* direction has not been explicitly set by set_direction().
*
* @param dir The new default direction. This cannot be
* Gtk::TEXT_DIR_NONE.
*/
static void set_default_direction(TextDirection dir);
/** Obtains the current default reading direction. See
* set_default_direction().
*
* @return The current default direction.
*/
static TextDirection get_default_direction();
/** Sets a shape for this widget’s GDK window. This allows for
* transparent windows etc., see gdk_window_shape_combine_region()
* for more information.
*
* @newin{3,0}
*
* @param region Shape to be added, or <tt>nullptr</tt> to remove an existing shape.
*/
void shape_combine_region(const ::Cairo::RefPtr<const ::Cairo::Region>& region);
/** Sets an input shape for this widget’s GDK window. This allows for
* windows which react to mouse click in a nonrectangular region, see
* gdk_window_input_shape_combine_region() for more information.
*
* @newin{3,0}
*
* @param region Shape to be added, or <tt>nullptr</tt> to remove an existing shape.
*/
void input_shape_combine_region(const ::Cairo::RefPtr<const ::Cairo::Region>& region);
/** Returns the Gtk::WidgetPath representing @a widget, if the widget
* is not connected to a toplevel widget, a partial path will be
* created.
*
* @return The Gtk::WidgetPath representing @a widget.
*/
WidgetPath get_path() const;
//deprecated
/** Returns a newly allocated list of the widgets, normally labels, for
* which this widget is the target of a mnemonic (see for example,
* Gtk::Label::set_mnemonic_widget()).
*
* The widgets in the list are not individually referenced. If you
* want to iterate through the list and perform actions involving
* callbacks that might destroy the widgets, you
* must call `g_list_foreach (result,
* (GFunc)g_object_ref, <tt>nullptr</tt>)` first, and then unref all the
* widgets afterwards.
*
* @newin{2,4}
*
* @return The list of
* mnemonic labels; free this list
* with Glib::list_free() when you are done with it.
*/
std::vector<Widget*> list_mnemonic_labels();
/** Returns a newly allocated list of the widgets, normally labels, for
* which this widget is the target of a mnemonic (see for example,
* Gtk::Label::set_mnemonic_widget()).
*
* The widgets in the list are not individually referenced. If you
* want to iterate through the list and perform actions involving
* callbacks that might destroy the widgets, you
* must call `g_list_foreach (result,
* (GFunc)g_object_ref, <tt>nullptr</tt>)` first, and then unref all the
* widgets afterwards.
*
* @newin{2,4}
*
* @return The list of
* mnemonic labels; free this list
* with Glib::list_free() when you are done with it.
*/
std::vector<const Widget*> list_mnemonic_labels() const;
/** Adds a widget to the list of mnemonic labels for
* this widget. (See list_mnemonic_labels()). Note the
* list of mnemonic labels for the widget is cleared when the
* widget is destroyed, so the caller must make sure to update
* its internal state at this point as well.
*
* @newin{2,4}
*
* @param label A Gtk::Widget that acts as a mnemonic label for @a widget.
*/
void add_mnemonic_label(Widget& label);
/** Removes a widget from the list of mnemonic labels for
* this widget. (See list_mnemonic_labels()). The widget
* must have previously been added to the list with
* add_mnemonic_label().
*
* @newin{2,4}
*
* @param label A Gtk::Widget that was previously set as a mnemonic label for
* @a widget with add_mnemonic_label().
*/
void remove_mnemonic_label(Widget& label);
//TODO: Should drag_get_data() be const?
/** @param context The drag context.
* @param target The target (form of the data) to retrieve.
* @param time A timestamp for retrieving the data. This will
* generally be the time received in a Gtk::Widget::signal_drag_motion()"
* or Gtk::Widget::signal_drag_drop()" signal.
*/
void drag_get_data(const Glib::RefPtr<Gdk::DragContext>& context, const Glib::ustring& target, guint32 time);
/**
*/
void drag_highlight();
/**
*/
void drag_unhighlight();
//TODO: Change the defaults? Maybe we should use ALL for DestDefaults. See other drag_dest_set() methods here and in other widgets.
void drag_dest_set(DestDefaults flags = DestDefaults(0), Gdk::DragAction actions = Gdk::DragAction(0));
void drag_dest_set(const std::vector<TargetEntry>& targets, DestDefaults flags = DEST_DEFAULT_ALL, Gdk::DragAction actions = Gdk::ACTION_COPY);
/** @param proxy_window The window to which to forward drag events.
* @param protocol The drag protocol which the @a proxy_window accepts
* (You can use gdk_drag_get_protocol() to determine this).
* @param use_coordinates If <tt>true</tt>, send the same coordinates to the
* destination, because it is an embedded
* subwindow.
*/
void drag_dest_set_proxy(const Glib::RefPtr<Gdk::Window>& proxy_window, Gdk::DragProtocol protocol, bool use_coordinates);
/**
*/
void drag_dest_unset();
/** Looks for a match between @a context->targets and the
* @a dest_target_list, returning the first matching target, otherwise
* returning Gdk::NONE. @a dest_target_list should usually be the return
* value from gtk_drag_dest_get_target_list(), but some widgets may
* have different valid targets for different parts of the widget; in
* that case, they will have to implement a drag_motion handler that
* passes the correct target list to this function.
*
* @param context Drag context.
* @param target_list List of droppable targets.
* @return First target that the source offers and the dest can accept, or Gdk::NONE.
*/
Glib::ustring drag_dest_find_target(const Glib::RefPtr<Gdk::DragContext>& context, const Glib::RefPtr<TargetList>& target_list) const;
Glib::ustring drag_dest_find_target(const Glib::RefPtr<Gdk::DragContext>& context) const;
/**
*/
Glib::RefPtr<TargetList> drag_dest_get_target_list();
/**
*/
Glib::RefPtr<const TargetList> drag_dest_get_target_list() const;
/** @param target_list List of droppable targets, or <tt>nullptr</tt> for none.
*/
void drag_dest_set_target_list(const Glib::RefPtr<TargetList>& target_list);
/**
*/
void drag_dest_add_text_targets();
/**
*/
void drag_dest_add_image_targets();
/**
*/
void drag_dest_add_uri_targets();
void drag_source_set(const std::vector<TargetEntry>& targets, Gdk::ModifierType start_button_mask = Gdk::MODIFIER_MASK, Gdk::DragAction actions = Gdk::ACTION_COPY);
/** Undoes the effects of set().
*/
void drag_source_unset();
/** Sets the icon that will be used for drags from a particular widget
* from a Gdk::Pixbuf. GTK+ retains a reference for @a pixbuf and will
* release it when it is no longer needed.
*
* @param pixbuf The Gdk::Pixbuf for the drag icon.
*/
void drag_source_set_icon(const Glib::RefPtr<Gdk::Pixbuf>& pixbuf);
#ifndef GTKMM_DISABLE_DEPRECATED
/** Sets the icon that will be used for drags from a particular source
* to a stock icon.
*
* Deprecated: 3.10: Use set_icon_name() instead.
*
* @deprecated Use the drag_source_set_icon() that takes a Glib::ustring instead.
*
* @param stock_id The ID of the stock icon to use.
*/
void drag_source_set_icon(const StockID& stock_id);
#endif // GTKMM_DISABLE_DEPRECATED
/** Sets the icon that will be used for drags from a particular source
* to a themed icon. See the docs for Gtk::IconTheme for more details.
*
* @newin{2,8}
*
* @param icon_name Name of icon to use.
*/
void drag_source_set_icon(const Glib::ustring& icon_name);
/** Add the text targets supported by Gtk::SelectionData to
* the target list of the drag source. The targets
* are added with @a info = 0. If you need another value,
* use Gtk::TargetList::add_text_targets() and
* set_target_list().
*
* @newin{2,6}
*/
void drag_source_add_text_targets();
/** Add the URI targets supported by Gtk::SelectionData to
* the target list of the drag source. The targets
* are added with @a info = 0. If you need another value,
* use Gtk::TargetList::add_uri_targets() and
* set_target_list().
*
* @newin{2,6}
*/
void drag_source_add_uri_targets();
/** Add the writable image targets supported by Gtk::SelectionData to
* the target list of the drag source. The targets
* are added with @a info = 0. If you need another value,
* use Gtk::TargetList::add_image_targets() and
* set_target_list().
*
* @newin{2,6}
*/
void drag_source_add_image_targets();
#ifndef GTKMM_DISABLE_DEPRECATED
/** @deprecated Use the drag_begin() that takes x,y coordinates.
*
* @param targets The targets (data formats) in which the
* source can provide the data.
* @param actions A bitmask of the allowed drag actions for this drag.
* @param button The button the user clicked to start the drag.
* @param gdk_event The event that triggered the start of the drag.
*/
Glib::RefPtr<Gdk::DragContext> drag_begin(const Glib::RefPtr<TargetList>& targets, Gdk::DragAction actions, int button, GdkEvent* gdk_event);
#endif // GTKMM_DISABLE_DEPRECATED
/**
*/
Glib::RefPtr<Gdk::DragContext> drag_begin(const Glib::RefPtr<TargetList>& targets, Gdk::DragAction actions, int button, GdkEvent* gdk_event, int x, int y);
/** @param start_x X coordinate of start of drag.
* @param start_y Y coordinate of start of drag.
* @param current_x Current X coordinate.
* @param current_y Current Y coordinate.
*/
bool drag_check_threshold(int start_x, int start_y, int current_x, int current_y);
//These should be a method of Gdk::DragContext, but gdkmm can't depend on gtkmm.
static Widget* drag_get_source_widget(const Glib::RefPtr<Gdk::DragContext>& context);
void drag_set_as_icon(const Glib::RefPtr<Gdk::DragContext>& context, int hot_x, int hot_y);
/** This function works like queue_resize(),
* except that the widget is not invalidated.
*
* @newin{2,4}
*/
void queue_resize_no_redraw();
//TODO: _WRAP_METHOD(GdkFrameClock* get_frame_clock(), gtk_widget_get_frame_clock)
/** Returns the current value of the Gtk::Widget::property_no_show_all() property,
* which determines whether calls to show_all()
* will affect this widget.
*
* @newin{2,4}
*
* @return The current value of the “no-show-all” property.
*/
bool get_no_show_all() const;
/** Sets the Gtk::Widget::property_no_show_all() property, which determines whether
* calls to show_all() will affect this widget.
*
* This is mostly for use in constructing widget hierarchies with externally
* controlled visibility, see Gtk::UIManager.
*
* @newin{2,4}
*
* @param no_show_all The new value for the “no-show-all” property.
*/
void set_no_show_all(bool no_show_all = true);
//Used when implementing containers:
/** This function is useful only when implementing subclasses of
* Gtk::Container.
* Sets the container as the parent of @a widget, and takes care of
* some details such as updating the state and style of the child
* to reflect its new location. The opposite function is
* unparent().
*
* @param parent Parent container.
*/
void set_parent(Widget& parent);
/** This function is only for use in widget implementations.
* Should be called by implementations of the remove method
* on Gtk::Container, to dissociate a child from the container.
*/
void unparent();
//TODO: When exactly do we need to custom containers need to call map() on the child widgets?
//Most containers that derive from GtkContainer do not need to, but GtkNotebook does.
/** This function is only for use in widget implementations. Causes
* a widget to be mapped if it isn’t already.
*/
void map();
/** This function is only for use in widget implementations. Causes
* a widget to be unmapped if it’s currently mapped.
*/
void unmap();
#ifndef GTKMM_DISABLE_DEPRECATED
/** Draws a text caret on @a cr at @a location.
* This is not a style function but merely a convenience function for drawing
* the standard cursor shape.
*
* @deprecated Use StyleContext::render_insertion_cursor() instead.
*/
void draw_insertion_cursor(const ::Cairo::RefPtr< ::Cairo::Context>& cr, const Gdk::Rectangle& location, bool is_primary, TextDirection direction, bool draw_arrow = true);
#endif // GTKMM_DISABLE_DEPRECATED
// Gtk+ 2.12 tooltip API
/** Replaces the default, usually yellow, window used for displaying
* tooltips with @a custom_window. GTK+ will take care of showing and
* hiding @a custom_window at the right moment, to behave likewise as
* the default tooltip window. If @a custom_window is <tt>nullptr</tt>, the default
* tooltip window will be used.
*
* If the custom window should have the default theming it needs to
* have the name “gtk-tooltip”, see set_name().
*
* @newin{2,12}
*
* @param custom_window A Gtk::Window, or <tt>nullptr</tt>.
*/
void set_tooltip_window(Window& custom_window);
/** Returns the Gtk::Window of the current tooltip. This can be the
* GtkWindow created by default, or the custom tooltip window set
* using set_tooltip_window().
*
* @newin{2,12}
*
* @return The Gtk::Window of the current tooltip.
*/
Window* get_tooltip_window();
/** Triggers a tooltip query on the display where the toplevel of @a widget
* is located. See Gtk::Tooltip::trigger_tooltip_query() for more
* information.
*
* @newin{2,12}
*/
void trigger_tooltip_query();
/** Sets @a text as the contents of the tooltip. This function will take
* care of setting Gtk::Widget::property_has_tooltip() to <tt>true</tt> and of the default
* handler for the Gtk::Widget::signal_query_tooltip() signal.
*
* See also the Gtk::Widget::property_tooltip_text() property and Gtk::Tooltip::set_text().
*
* @newin{2,12}
*
* @param text The contents of the tooltip for @a widget.
*/
void set_tooltip_text(const Glib::ustring& text);
/** Gets the contents of the tooltip for @a widget.
*
* @newin{2,12}
*
* @return The tooltip text.
*/
Glib::ustring get_tooltip_text() const;
/** Sets @a markup as the contents of the tooltip, which is marked up with
* the Pango text markup language.
*
* This function will take care of setting GtkWidget:has-tooltip to <tt>true</tt>
* and of the default handler for the GtkWidget::query-tooltip signal.
*
* See also the GtkWidget:tooltip-markup property and
* Gtk::Tooltip::set_markup().
*
* @newin{2,12}
*
* @param markup The contents of the tooltip for @a widget.
*/
void set_tooltip_markup(const Glib::ustring& markup);
/** Gets the contents of the tooltip for @a widget.
*
* @newin{2,12}
*
* @return The tooltip text.
*/
Glib::ustring get_tooltip_markup() const;
/** Sets the has-tooltip property on @a widget to @a has_tooltip. See
* Gtk::Widget::property_has_tooltip() for more information.
*
* @newin{2,12}
*
* @param has_tooltip Whether or not @a widget has a tooltip.
*/
void set_has_tooltip(bool has_tooltip = TRUE);
/** Returns the current value of the has-tooltip property. See
* Gtk::Widget::property_has_tooltip() for more information.
*
* @newin{2,12}
*
* @return Current value of has-tooltip on @a widget.
*/
bool get_has_tooltip() const;
int get_width() const;
int get_height() const;
/** Whether @a widget can rely on having its alpha channel
* drawn correctly. On X11 this function returns whether a
* compositing manager is running for @a widget’s screen.
*
* Please note that the semantics of this call will change
* in the future if used on a widget that has a composited
* window in its hierarchy (as set by gdk_window_set_composited()).
*
* @newin{2,10}
*
* @return <tt>true</tt> if the widget can rely on its alpha
* channel being drawn correctly.
*/
bool is_composited() const;
/** Returns whether the widget is currently being destroyed.
* This information can sometimes be used to avoid doing
* unnecessary work.
*
* @return <tt>true</tt> if @a widget is being destroyed.
*/
bool in_destruction() const;
/** Returns the style context associated to @a widget.
*
* @return A Gtk::StyleContext. This memory is owned by @a widget and
* must not be freed.
*/
Glib::RefPtr<StyleContext> get_style_context();
/** Returns the style context associated to @a widget.
*
* @return A Gtk::StyleContext. This memory is owned by @a widget and
* must not be freed.
*/
Glib::RefPtr<Gtk::StyleContext> get_style_context() const;
/** Returns the modifier mask the @a widget’s windowing system backend
* uses for a particular purpose.
*
* See gdk_keymap_get_modifier_mask().
*
* @newin{3,4}
*
* @param intent The use case for the modifier mask.
* @return The modifier mask used for @a intent.
*/
Gdk::ModifierType get_modifier_mask(Gdk::ModifierIntent intent);
//TODO: guint gtk_widget_add_tick_callback (GtkWidget *widget, GtkTickCallback callback, gpointer user_data, GDestroyNotify notify);
//TODO: void gtk_widget_remove_tick_callback (GtkWidget *widget, guint id);
//This is mostly only needed by the class itself, so it could be protected,
//but it is sometimes helpful to call it from outside:
/** Inserts @a group into @a widget. Children of @a widget that implement
* Gtk::Actionable can then be associated with actions in @a group by
* setting their “action-name” to
* @a prefix.`action-name`.
*
* If @a group is <tt>nullptr</tt>, a previously inserted group for @a name is removed
* from @a widget.
*
* @newin{3,6}
*
* @param name The prefix for actions in @a group.
* @param group A ActionGroup, or <tt>nullptr</tt>.
*/
void insert_action_group(const Glib::ustring& name, const Glib::RefPtr<Gio::ActionGroup>& group);
/** Removes a group from the widget.
* See insert_action_group().
*
* @param name The prefix for actions.
*
* @newin{3,10}
*/
void remove_action_group(const Glib::ustring& name);
/** Retrieves the ActionGroup that was registered using @a prefix. The resulting
* ActionGroup may have been registered to @a widget or any Gtk::Widget in its
* ancestry.
*
* If no action group was found matching @a prefix, then <tt>nullptr</tt> is returned.
*
* @newin{3,16}
*
* @param prefix The “prefix” of the action group.
* @return A ActionGroup or <tt>nullptr</tt>.
*/
Glib::RefPtr<Gio::ActionGroup> get_action_group(const Glib::ustring& prefix);
/** Retrieves the ActionGroup that was registered using @a prefix. The resulting
* ActionGroup may have been registered to @a widget or any Gtk::Widget in its
* ancestry.
*
* If no action group was found matching @a prefix, then <tt>nullptr</tt> is returned.
*
* @newin{3,16}
*
* @param prefix The “prefix” of the action group.
* @return A ActionGroup or <tt>nullptr</tt>.
*/
Glib::RefPtr<const Gio::ActionGroup> get_action_group(const Glib::ustring& prefix) const;
/** Retrieves a <tt>nullptr</tt>-terminated array of strings containing the prefixes of
* ActionGroup's available to @a widget.
*
* @newin{3,16}
*
* @return A <tt>nullptr</tt>-terminated array of strings.
*/
std::vector<Glib::ustring> list_action_prefixes() const;
/** Sets the font map to use for Pango rendering. When not set, the widget
* will inherit the font map from its parent.
*
* @newin{3,18}
*
* @param font_map A Pango::FontMap, or <tt>nullptr</tt> to unset any previously
* set font map.
*/
void set_font_map(const Glib::RefPtr<Pango::FontMap>& font_map);
/** Gets the font map that has been set with set_font_map().
*
* @newin{3,18}
*
* @return A Pango::FontMap, or <tt>nullptr</tt>.
*/
Glib::RefPtr<Pango::FontMap> get_font_map();
/** Gets the font map that has been set with set_font_map().
*
* @newin{3,18}
*
* @return A Pango::FontMap, or <tt>nullptr</tt>.
*/
Glib::RefPtr<const Pango::FontMap> get_font_map() const;
/**
* @par Slot Prototype:
* <tt>void on_my_%show()</tt>
*
* The signal_show() signal is emitted when @a widget is shown, for example with
* Gtk::Widget::show().
*/
Glib::SignalProxy< void > signal_show();
/**
* @par Slot Prototype:
* <tt>void on_my_%hide()</tt>
*
* The signal_hide() signal is emitted when @a widget is hidden, for example with
* Gtk::Widget::hide().
*/
Glib::SignalProxy< void > signal_hide();
/// Emitted on mapping of a widget to the screen.
//- See {flags.mapped}.
/**
* @par Slot Prototype:
* <tt>void on_my_%map()</tt>
*
* The signal_map() signal is emitted when @a widget is going to be mapped, that is
* when the widget is visible (which is controlled with
* Gtk::Widget::set_visible()) and all its parents up to the toplevel widget
* are also visible. Once the map has occurred, Gtk::Widget::signal_map_event() will
* be emitted.
*
* The signal_map() signal can be used to determine whether a widget will be drawn,
* for instance it can resume an animation that was stopped during the
* emission of Gtk::Widget::signal_unmap().
*/
Glib::SignalProxy< void > signal_map();
//- See {flags.mapped}.
/**
* @par Slot Prototype:
* <tt>void on_my_%unmap()</tt>
*
* The signal_unmap() signal is emitted when @a widget is going to be unmapped, which
* means that either it or any of its parents up to the toplevel widget have
* been set as hidden.
*
* As signal_unmap() indicates that a widget will not be shown any longer, it can be
* used to, for example, stop an animation on the widget.
*/
Glib::SignalProxy< void > signal_unmap();
/// Emitted on realization of a widget.
//- See {flags.realized}. This is also responsible for
//- setting {flags.realized} when it is done. Therefore,
//- when overriding the impl method, you should call the
//- default realize method.
/**
* @par Slot Prototype:
* <tt>void on_my_%realize()</tt>
*
* The signal_realize() signal is emitted when @a widget is associated with a
* Gdk::Window, which means that Gtk::Widget::realize() has been called or the
* widget has been mapped (that is, it is going to be drawn).
*/
Glib::SignalProxy< void > signal_realize();
//- See {flags.realized}. This should not be called by the user.
//__WRAP(meth|sig|impl,void unrealize_(),gtk_widget_unrealize,"unrealize")
/**
* @par Slot Prototype:
* <tt>void on_my_%unrealize()</tt>
*
* The signal_unrealize() signal is emitted when the Gdk::Window associated with
* @a widget is destroyed, which means that Gtk::Widget::unrealize() has been
* called or the widget has been unmapped (that is, it is going to be
* hidden).
*/
Glib::SignalProxy< void > signal_unrealize();
/**
* @par Slot Prototype:
* <tt>void on_my_%size_allocate(Allocation& allocation)</tt>
*
* @param allocation The region which has been
* allocated to the widget.
*/
Glib::SignalProxy< void,Allocation& > signal_size_allocate();
// Changed signals -- inform widget of internal changes.
// We rename parent_set => parent_changed
// and style_set => style_changed
// to avoid confusion with set_parent and set_style.
#ifndef GTKMM_DISABLE_DEPRECATED
/**
* @par Slot Prototype:
* <tt>void on_my_%state_changed(Gtk::StateType previous_state)</tt>
*
* The signal_state_changed() signal is emitted when the widget state changes.
* See Gtk::Widget::get_state().
*
* Deprecated: 3.0: Use Gtk::Widget::signal_state_flags_changed() instead.
*
* @deprecated Use signal_state_flags_changed() instead.
*
* @param previous_state The previous state.
*/
Glib::SignalProxy< void,Gtk::StateType > signal_state_changed();
#endif // GTKMM_DISABLE_DEPRECATED
//TODO: Remove no_default_handler when we can break ABI:
/**
* @par Slot Prototype:
* <tt>void on_my_%state_flags_changed(Gtk::StateFlags previous_state_flags)</tt>
*
* The signal_state_flags_changed() signal is emitted when the widget state
* changes, see Gtk::Widget::get_state_flags().
*
* @newin{3,0}
*
* @param previous_state_flags The previous state flags.
*/
Glib::SignalProxy< void,Gtk::StateFlags > signal_state_flags_changed();
/// Informs objects that their parent changed.
//- The widget passed is the former parent, which may be 0 if
//- there was no parent. (was parent_set in GTK+)
/**
* @par Slot Prototype:
* <tt>void on_my_%parent_changed(Widget* previous_parent)</tt>
*
* The signal_parent_set() signal is emitted when a new parent
* has been set on a widget.
*
* @param previous_parent The previous parent, or <tt>nullptr</tt> if the widget
* just got its initial parent.
*/
Glib::SignalProxy< void,Widget* > signal_parent_changed();
/**
* @par Slot Prototype:
* <tt>void on_my_%hierarchy_changed(Widget* previous_toplevel)</tt>
*
* The signal_hierarchy_changed() signal is emitted when the
* anchored state of a widget changes. A widget is
* “anchored” when its toplevel
* ancestor is a Gtk::Window. This signal is emitted when
* a widget changes from un-anchored to anchored or vice-versa.
*
* @param previous_toplevel The previous toplevel ancestor, or <tt>nullptr</tt>
* if the widget was previously unanchored.
*/
Glib::SignalProxy< void,Widget* > signal_hierarchy_changed();
//uses deprecated GtkStyle.
/**
* @par Slot Prototype:
* <tt>void on_my_%style_updated()</tt>
*
* The signal_style_updated() signal is emitted when the Gtk::StyleContext
* of a widget is changed. Note that style-modifying functions like
* Gtk::Widget::override_color() also cause this signal to be emitted.
*
* @newin{3,0}
*/
Glib::SignalProxy< void > signal_style_updated();
/**
* @par Slot Prototype:
* <tt>void on_my_%direction_changed(TextDirection direction)</tt>
*
* The signal_direction_changed() signal is emitted when the text direction
* of a widget changes.
*
* @param direction The previous text direction of @a widget.
*/
Glib::SignalProxy< void,TextDirection > signal_direction_changed();
/**
* @par Slot Prototype:
* <tt>void on_my_%grab_notify(bool was_grabbed)</tt>
*
* The signal_grab_notify() signal is emitted when a widget becomes
* shadowed by a GTK+ grab (not a pointer or keyboard grab) on
* another widget, or when it becomes unshadowed due to a grab
* being removed.
*
* A widget is shadowed by a gtk_grab_add() when the topmost
* grab widget in the grab stack of its window group is not
* its ancestor.
*
* @param was_grabbed <tt>false</tt> if the widget becomes shadowed, <tt>true</tt>
* if it becomes unshadowed.
*/
Glib::SignalProxy< void,bool > signal_grab_notify();
/**
* @par Slot Prototype:
* <tt>void on_my_%child_notify(GParamSpec* pspec)</tt>
*
* The signal_child_notify() signal is emitted for each
* [child property][child-properties] that has
* changed on an object. The signal's detail holds the property name.
*
* @param pspec The ParamSpec of the changed child property.
*/
Glib::SignalProxy< void,GParamSpec* > signal_child_notify();
/**
* @par Slot Prototype:
* <tt>bool on_my_%mnemonic_activate(bool group_cycling)</tt>
*
* @return <tt>true</tt> to stop other handlers from being invoked for the event.
* <tt>false</tt> to propagate the event further.
*/
Glib::SignalProxy< bool,bool > signal_mnemonic_activate();
/**
* @par Slot Prototype:
* <tt>void on_my_%grab_focus()</tt>
*
*
*/
Glib::SignalProxy< void > signal_grab_focus();
/**
* @par Slot Prototype:
* <tt>bool on_my_%focus(DirectionType direction)</tt>
*
* @return <tt>true</tt> to stop other handlers from being invoked for the event. <tt>false</tt> to propagate the event further.
*/
Glib::SignalProxy< bool,DirectionType > signal_focus();
/**
* @par Slot Prototype:
* <tt>bool on_my_%event(GdkEvent* gdk_event)</tt>
*
* The GTK+ main loop will emit three signals for each GDK event delivered
* to a widget: one generic signal_event() signal, another, more specific,
* signal that matches the type of event delivered (e.g.\ Gtk::Widget::signal_key_press_event()) and finally a generic
* Gtk::Widget::signal_event_after() signal.
*
* @param gdk_event The Gdk::Event which triggered this signal.
* @return <tt>true</tt> to stop other handlers from being invoked for the event
* and to cancel the emission of the second specific signal_event() signal.
* <tt>false</tt> to propagate the event further and to allow the emission of
* the second signal. The signal_event_after() signal is emitted regardless of
* the return value.
*/
Glib::SignalProxy< bool,GdkEvent* > signal_event();
/**
* @par Slot Prototype:
* <tt>void on_my_%event_after(GdkEvent* gdk_event)</tt>
*
* After the emission of the Gtk::Widget::signal_event() signal and (optionally)
* the second more specific signal, signal_event_after() will be emitted
* regardless of the previous two signals handlers return values.
*
* @param gdk_event The Gdk::Event which triggered this signal.
*/
Glib::SignalProxy< void,GdkEvent* > signal_event_after();
/** Event triggered by user pressing button.
*
* @par Slot Prototype:
* <tt>bool on_my_%button_press_event(GdkEventButton* button_event)</tt>
*
* The signal_button_press_event() signal will be emitted when a button
* (typically from a mouse) is pressed.
*
* To receive this signal, the Gdk::Window associated to the
* widget needs to enable the Gdk::BUTTON_PRESS_MASK mask.
*
* This signal will be sent to the grab widget if there is one.
*
* @param button_event The Gdk::EventButton which triggered
* this signal.
* @return <tt>true</tt> to stop other handlers from being invoked for the event.
* <tt>false</tt> to propagate the event further.
*/
Glib::SignalProxy< bool,GdkEventButton* > signal_button_press_event();
/** Event triggered by user releasing button.
*
* @par Slot Prototype:
* <tt>bool on_my_%button_release_event(GdkEventButton* release_event)</tt>
*
* The signal_button_release_event() signal will be emitted when a button
* (typically from a mouse) is released.
*
* To receive this signal, the Gdk::Window associated to the
* widget needs to enable the Gdk::BUTTON_RELEASE_MASK mask.
*
* This signal will be sent to the grab widget if there is one.
*
* @param release_event The Gdk::EventButton which triggered
* this signal.
* @return <tt>true</tt> to stop other handlers from being invoked for the event.
* <tt>false</tt> to propagate the event further.
*/
Glib::SignalProxy< bool,GdkEventButton* > signal_button_release_event();
/**
* @par Slot Prototype:
* <tt>bool on_my_%scroll_event(GdkEventScroll* scroll_event)</tt>
*
* The signal_scroll_event() signal is emitted when a button in the 4 to 7
* range is pressed. Wheel mice are usually configured to generate
* button press events for buttons 4 and 5 when the wheel is turned.
*
* To receive this signal, the Gdk::Window associated to the widget needs
* to enable the Gdk::SCROLL_MASK mask.
*
* This signal will be sent to the grab widget if there is one.
*
* @param scroll_event The Gdk::EventScroll which triggered
* this signal.
* @return <tt>true</tt> to stop other handlers from being invoked for the event.
* <tt>false</tt> to propagate the event further.
*/
Glib::SignalProxy< bool,GdkEventScroll* > signal_scroll_event();
/** Event triggered by user moving pointer.
*
* @par Slot Prototype:
* <tt>bool on_my_%motion_notify_event(GdkEventMotion* motion_event)</tt>
*
* The signal_motion_notify_event() signal is emitted when the pointer moves
* over the widget's Gdk::Window.
*
* To receive this signal, the Gdk::Window associated to the widget
* needs to enable the Gdk::POINTER_MOTION_MASK mask.
*
* This signal will be sent to the grab widget if there is one.
*
* @param motion_event The Gdk::EventMotion which triggered
* this signal.
* @return <tt>true</tt> to stop other handlers from being invoked for the event.
* <tt>false</tt> to propagate the event further.
*/
Glib::SignalProxy< bool,GdkEventMotion* > signal_motion_notify_event();
/**
* @par Slot Prototype:
* <tt>bool on_my_%delete_event(GdkEventAny* any_event)</tt>
*
* The signal_delete_event() signal is emitted if a user requests that
* a toplevel window is closed. The default handler for this signal
* destroys the window. Connecting Gtk::Widget::hide_on_delete() to
* this signal will cause the window to be hidden instead, so that
* it can later be shown again without reconstructing it.
*
* @param any_event The event which triggered this signal.
* @return <tt>true</tt> to stop other handlers from being invoked for the event.
* <tt>false</tt> to propagate the event further.
*/
Glib::SignalProxy< bool,GdkEventAny* > signal_delete_event();
/**
* @par Slot Prototype:
* <tt>bool on_my_%draw(const ::Cairo::RefPtr< ::Cairo::Context>& cr)</tt>
*
* This signal is emitted when a widget is supposed to render itself.
* The @a widget's top left corner must be painted at the origin of
* the passed in context and be sized to the values returned by
* Gtk::Widget::get_allocated_width() and
* Gtk::Widget::get_allocated_height().
*
* Signal handlers connected to this signal can modify the cairo
* context passed as @a cr in any way they like and don't need to
* restore it. The signal emission takes care of calling cairo_save()
* before and cairo_restore() after invoking the handler.
*
* The signal handler will get a @a cr with a clip region already set to the
* widget's dirty region, i.e. to the area that needs repainting. Complicated
* widgets that want to avoid redrawing themselves completely can get the full
* extents of the clip region with gdk_cairo_get_clip_rectangle(), or they can
* get a finer-grained representation of the dirty region with
* cairo_copy_clip_rectangle_list().
*
* @newin{3,0}
*
* @param cr The cairo context to draw to.
* @return <tt>true</tt> to stop other handlers from being invoked for the event.
* % <tt>false</tt> to propagate the event further.
*/
Glib::SignalProxy< bool,const ::Cairo::RefPtr< ::Cairo::Context>& > signal_draw();
/** Event triggered by a key press will widget has focus.
*
* @par Slot Prototype:
* <tt>bool on_my_%key_press_event(GdkEventKey* key_event)</tt>
*
* The signal_key_press_event() signal is emitted when a key is pressed. The signal
* emission will reoccur at the key-repeat rate when the key is kept pressed.
*
* To receive this signal, the Gdk::Window associated to the widget needs
* to enable the Gdk::KEY_PRESS_MASK mask.
*
* This signal will be sent to the grab widget if there is one.
*
* @param key_event The Gdk::EventKey which triggered this signal.
* @return <tt>true</tt> to stop other handlers from being invoked for the event.
* <tt>false</tt> to propagate the event further.
*/
Glib::SignalProxy< bool,GdkEventKey* > signal_key_press_event();
/** Event triggered by a key release will widget has focus.
*
* @par Slot Prototype:
* <tt>bool on_my_%key_release_event(GdkEventKey* key_event)</tt>
*
* The signal_key_release_event() signal is emitted when a key is released.
*
* To receive this signal, the Gdk::Window associated to the widget needs
* to enable the Gdk::KEY_RELEASE_MASK mask.
*
* This signal will be sent to the grab widget if there is one.
*
* @param key_event The Gdk::EventKey which triggered this signal.
* @return <tt>true</tt> to stop other handlers from being invoked for the event.
* <tt>false</tt> to propagate the event further.
*/
Glib::SignalProxy< bool,GdkEventKey* > signal_key_release_event();
/** Event triggered by pointer entering widget area.
*
* @par Slot Prototype:
* <tt>bool on_my_%enter_notify_event(GdkEventCrossing* crossing_event)</tt>
*
* The signal_enter_notify_event() will be emitted when the pointer enters
* the @a widget's window.
*
* To receive this signal, the Gdk::Window associated to the widget needs
* to enable the Gdk::ENTER_NOTIFY_MASK mask.
*
* This signal will be sent to the grab widget if there is one.
*
* @param crossing_event The Gdk::EventCrossing which triggered
* this signal.
* @return <tt>true</tt> to stop other handlers from being invoked for the event.
* <tt>false</tt> to propagate the event further.
*/
Glib::SignalProxy< bool,GdkEventCrossing* > signal_enter_notify_event();
/** Event triggered by pointer leaving widget area.
*
* @par Slot Prototype:
* <tt>bool on_my_%leave_notify_event(GdkEventCrossing* crossing_event)</tt>
*
* The signal_leave_notify_event() will be emitted when the pointer leaves
* the @a widget's window.
*
* To receive this signal, the Gdk::Window associated to the widget needs
* to enable the Gdk::LEAVE_NOTIFY_MASK mask.
*
* This signal will be sent to the grab widget if there is one.
*
* @param crossing_event The Gdk::EventCrossing which triggered
* this signal.
* @return <tt>true</tt> to stop other handlers from being invoked for the event.
* <tt>false</tt> to propagate the event further.
*/
Glib::SignalProxy< bool,GdkEventCrossing* > signal_leave_notify_event();
/** Event triggered by a window resizing.
*
* @par Slot Prototype:
* <tt>bool on_my_%configure_event(GdkEventConfigure* configure_event)</tt>
*
* The signal_configure_event() signal will be emitted when the size, position or
* stacking of the @a widget's window has changed.
*
* To receive this signal, the Gdk::Window associated to the widget needs
* to enable the Gdk::STRUCTURE_MASK mask. GDK will enable this mask
* automatically for all new windows.
*
* @param configure_event The Gdk::EventConfigure which triggered
* this signal.
* @return <tt>true</tt> to stop other handlers from being invoked for the event.
* <tt>false</tt> to propagate the event further.
*/
Glib::SignalProxy< bool,GdkEventConfigure* > signal_configure_event();
/**
* @par Slot Prototype:
* <tt>bool on_my_%focus_in_event(GdkEventFocus* focus_event)</tt>
*
* The signal_focus_in_event() signal will be emitted when the keyboard focus
* enters the @a widget's window.
*
* To receive this signal, the Gdk::Window associated to the widget needs
* to enable the Gdk::FOCUS_CHANGE_MASK mask.
*
* @param focus_event The Gdk::EventFocus which triggered
* this signal.
* @return <tt>true</tt> to stop other handlers from being invoked for the event.
* <tt>false</tt> to propagate the event further.
*/
Glib::SignalProxy< bool,GdkEventFocus* > signal_focus_in_event();
/**
* @par Slot Prototype:
* <tt>bool on_my_%focus_out_event(GdkEventFocus* gdk_event)</tt>
*
* The signal_focus_out_event() signal will be emitted when the keyboard focus
* leaves the @a widget's window.
*
* To receive this signal, the Gdk::Window associated to the widget needs
* to enable the Gdk::FOCUS_CHANGE_MASK mask.
*
* @param gdk_event The Gdk::EventFocus which triggered this
* signal.
* @return <tt>true</tt> to stop other handlers from being invoked for the event.
* <tt>false</tt> to propagate the event further.
*/
Glib::SignalProxy< bool,GdkEventFocus* > signal_focus_out_event();
/**
* @par Slot Prototype:
* <tt>bool on_my_%map_event(GdkEventAny* any_event)</tt>
*
* The signal_map_event() signal will be emitted when the @a widget's window is
* mapped. A window is mapped when it becomes visible on the screen.
*
* To receive this signal, the Gdk::Window associated to the widget needs
* to enable the Gdk::STRUCTURE_MASK mask. GDK will enable this mask
* automatically for all new windows.
*
* @param any_event The Gdk::EventAny which triggered this signal.
* @return <tt>true</tt> to stop other handlers from being invoked for the event.
* <tt>false</tt> to propagate the event further.
*/
Glib::SignalProxy< bool,GdkEventAny* > signal_map_event();
/**
* @par Slot Prototype:
* <tt>bool on_my_%unmap_event(GdkEventAny* any_event)</tt>
*
* The signal_unmap_event() signal will be emitted when the @a widget's window is
* unmapped. A window is unmapped when it becomes invisible on the screen.
*
* To receive this signal, the Gdk::Window associated to the widget needs
* to enable the Gdk::STRUCTURE_MASK mask. GDK will enable this mask
* automatically for all new windows.
*
* @param any_event The Gdk::EventAny which triggered this signal.
* @return <tt>true</tt> to stop other handlers from being invoked for the event.
* <tt>false</tt> to propagate the event further.
*/
Glib::SignalProxy< bool,GdkEventAny* > signal_unmap_event();
/**
* @par Slot Prototype:
* <tt>bool on_my_%property_notify_event(GdkEventProperty* property_event)</tt>
*
* The signal_property_notify_event() signal will be emitted when a property on
* the @a widget's window has been changed or deleted.
*
* To receive this signal, the Gdk::Window associated to the widget needs
* to enable the Gdk::PROPERTY_CHANGE_MASK mask.
*
* @param property_event The Gdk::EventProperty which triggered
* this signal.
* @return <tt>true</tt> to stop other handlers from being invoked for the event.
* <tt>false</tt> to propagate the event further.
*/
Glib::SignalProxy< bool,GdkEventProperty* > signal_property_notify_event();
/**
* @par Slot Prototype:
* <tt>bool on_my_%selection_clear_event(GdkEventSelection* selection_event)</tt>
*
* The signal_selection_clear_event() signal will be emitted when the
* the @a widget's window has lost ownership of a selection.
*
* @param selection_event The Gdk::EventSelection which triggered
* this signal.
* @return <tt>true</tt> to stop other handlers from being invoked for the event.
* <tt>false</tt> to propagate the event further.
*/
Glib::SignalProxy< bool,GdkEventSelection* > signal_selection_clear_event();
/**
* @par Slot Prototype:
* <tt>bool on_my_%selection_request_event(GdkEventSelection* selection_event)</tt>
*
* The signal_selection_request_event() signal will be emitted when
* another client requests ownership of the selection owned by
* the @a widget's window.
*
* @param selection_event The Gdk::EventSelection which triggered
* this signal.
* @return <tt>true</tt> to stop other handlers from being invoked for the event.
* <tt>false</tt> to propagate the event further.
*/
Glib::SignalProxy< bool,GdkEventSelection* > signal_selection_request_event();
/**
* @par Slot Prototype:
* <tt>bool on_my_%selection_notify_event(GdkEventSelection* selection_event)</tt>
*
* @return <tt>true</tt> to stop other handlers from being invoked for the event. <tt>false</tt> to propagate the event further.
*/
Glib::SignalProxy< bool,GdkEventSelection* > signal_selection_notify_event();
/**
* @par Slot Prototype:
* <tt>bool on_my_%proximity_in_event(GdkEventProximity* proximity_event)</tt>
*
* To receive this signal the Gdk::Window associated to the widget needs
* to enable the Gdk::PROXIMITY_IN_MASK mask.
*
* This signal will be sent to the grab widget if there is one.
*
* @param proximity_event The Gdk::EventProximity which triggered
* this signal.
* @return <tt>true</tt> to stop other handlers from being invoked for the event.
* <tt>false</tt> to propagate the event further.
*/
Glib::SignalProxy< bool,GdkEventProximity* > signal_proximity_in_event();
/**
* @par Slot Prototype:
* <tt>bool on_my_%proximity_out_event(GdkEventProximity* proximity_event)</tt>
*
* To receive this signal the Gdk::Window associated to the widget needs
* to enable the Gdk::PROXIMITY_OUT_MASK mask.
*
* This signal will be sent to the grab widget if there is one.
*
* @param proximity_event The Gdk::EventProximity which triggered
* this signal.
* @return <tt>true</tt> to stop other handlers from being invoked for the event.
* <tt>false</tt> to propagate the event further.
*/
Glib::SignalProxy< bool,GdkEventProximity* > signal_proximity_out_event();
#ifndef GTKMM_DISABLE_DEPRECATED
/**
* @par Slot Prototype:
* <tt>bool on_my_%visibility_notify_event(GdkEventVisibility* visibility_event)</tt>
*
* The signal_visibility_notify_event() will be emitted when the @a widget's
* window is obscured or unobscured.
*
* To receive this signal the Gdk::Window associated to the widget needs
* to enable the Gdk::VISIBILITY_NOTIFY_MASK mask.
*
* Deprecated: 3.12: Modern composited windowing systems with pervasive
* transparency make it impossible to track the visibility of a window
* reliably, so this signal can not be guaranteed to provide useful
* information.
*
* @deprecated Modern composited windowing systems with pervasive transparency make it impossible to track the visibility of a window reliably, so this signal can not be guaranteed to provide useful information.
*
* @param visibility_event The Gdk::EventVisibility which
* triggered this signal.
* @return <tt>true</tt> to stop other handlers from being invoked for the event.
* <tt>false</tt> to propagate the event further.
*/
Glib::SignalProxy< bool,GdkEventVisibility* > signal_visibility_notify_event();
#endif // GTKMM_DISABLE_DEPRECATED
/**
* @par Slot Prototype:
* <tt>bool on_my_%window_state_event(GdkEventWindowState* window_state_event)</tt>
*
* The signal_window_state_event() will be emitted when the state of the
* toplevel window associated to the @a widget changes.
*
* To receive this signal the Gdk::Window associated to the widget
* needs to enable the Gdk::STRUCTURE_MASK mask. GDK will enable
* this mask automatically for all new windows.
*
* @param window_state_event The Gdk::EventWindowState which
* triggered this signal.
* @return <tt>true</tt> to stop other handlers from being invoked for the
* event. <tt>false</tt> to propagate the event further.
*/
Glib::SignalProxy< bool,GdkEventWindowState* > signal_window_state_event();
//We use the optional custom_c_callback parameter with _WRAP_SIGNAL() for some of these,
//so that we can write special code to wrap the non-const SelectionData& output parameters:
/**
* @par Slot Prototype:
* <tt>void on_my_%selection_get(SelectionData& selection_data, guint info, guint time)</tt>
*
*
*/
Glib::SignalProxy< void,SelectionData&,guint,guint > signal_selection_get();
/**
* @par Slot Prototype:
* <tt>void on_my_%selection_received(const SelectionData& selection_data, guint time)</tt>
*
*
*/
Glib::SignalProxy< void,const SelectionData&,guint > signal_selection_received();
/**
* @par Slot Prototype:
* <tt>void on_my_%drag_begin(const Glib::RefPtr<Gdk::DragContext>& context)</tt>
*
* The signal_drag_begin() signal is emitted on the drag source when a drag is
* started. A typical reason to connect to this signal is to set up a
* custom drag icon with e.g. Gtk::DragSource::set_icon_pixbuf().
*
* Note that some widgets set up a drag icon in the default handler of
* this signal, so you may have to use Glib::signal_connect_after() to
* override what the default handler did.
*
* @param context The drag context.
*/
Glib::SignalProxy< void,const Glib::RefPtr<Gdk::DragContext>& > signal_drag_begin();
/**
* @par Slot Prototype:
* <tt>void on_my_%drag_end(const Glib::RefPtr<Gdk::DragContext>& context)</tt>
*
* The signal_drag_end() signal is emitted on the drag source when a drag is
* finished. A typical reason to connect to this signal is to undo
* things done in Gtk::Widget::signal_drag_begin().
*
* @param context The drag context.
*/
Glib::SignalProxy< void,const Glib::RefPtr<Gdk::DragContext>& > signal_drag_end();
/**
* @par Slot Prototype:
* <tt>void on_my_%drag_data_get(const Glib::RefPtr<Gdk::DragContext>& context, SelectionData& selection_data, guint info, guint time)</tt>
*
* The signal_drag_data_get() signal is emitted on the drag source when the drop
* site requests the data which is dragged. It is the responsibility of
* the signal handler to fill @a selection_data with the data in the format which
* is indicated by @a info. See Gtk::SelectionData::set() and
* Gtk::SelectionData::set_text().
*
* @param context The drag context.
* @param selection_data The Gtk::SelectionData to be filled with the dragged data.
* @param info The info that has been registered with the target in the
* Gtk::TargetList.
* @param time The timestamp at which the data was requested.
*/
Glib::SignalProxy< void,const Glib::RefPtr<Gdk::DragContext>&,SelectionData&,guint,guint > signal_drag_data_get();
/**
* @par Slot Prototype:
* <tt>void on_my_%drag_data_delete(const Glib::RefPtr<Gdk::DragContext>& context)</tt>
*
* The signal_drag_data_delete() signal is emitted on the drag source when a drag
* with the action Gdk::ACTION_MOVE is successfully completed. The signal
* handler is responsible for deleting the data that has been dropped. What
* "delete" means depends on the context of the drag operation.
*
* @param context The drag context.
*/
Glib::SignalProxy< void,const Glib::RefPtr<Gdk::DragContext>& > signal_drag_data_delete();
/**
* @par Slot Prototype:
* <tt>bool on_my_%drag_failed(const Glib::RefPtr<Gdk::DragContext>& context, DragResult result)</tt>
*
* The signal_drag_failed() signal is emitted on the drag source when a drag has
* failed. The signal handler may hook custom code to handle a failed DnD
* operation based on the type of error, it returns <tt>true</tt> is the failure has
* been already handled (not showing the default "drag operation failed"
* animation), otherwise it returns <tt>false</tt>.
*
* @newin{2,12}
*
* @param context The drag context.
* @param result The result of the drag operation.
* @return <tt>true</tt> if the failed drag operation has been already handled.
*/
Glib::SignalProxy< bool,const Glib::RefPtr<Gdk::DragContext>&,DragResult > signal_drag_failed();
/**
* @par Slot Prototype:
* <tt>void on_my_%drag_leave(const Glib::RefPtr<Gdk::DragContext>& context, guint time)</tt>
*
* The signal_drag_leave() signal is emitted on the drop site when the cursor
* leaves the widget. A typical reason to connect to this signal is to
* undo things done in Gtk::Widget::signal_drag_motion(), e.g. undo highlighting
* with gtk_drag_unhighlight().
*
*
* Likewise, the Gtk::Widget::signal_drag_leave() signal is also emitted before the
* signal_drag_drop() signal, for instance to allow cleaning up of a preview item
* created in the Gtk::Widget::signal_drag_motion() signal handler.
*
* @param context The drag context.
* @param time The timestamp of the motion event.
*/
Glib::SignalProxy< void,const Glib::RefPtr<Gdk::DragContext>&,guint > signal_drag_leave();
/**
* @par Slot Prototype:
* <tt>bool on_my_%drag_motion(const Glib::RefPtr<Gdk::DragContext>& context, int x, int y, guint time)</tt>
*
* The signal_drag_motion() signal is emitted on the drop site when the user
* moves the cursor over the widget during a drag. The signal handler
* must determine whether the cursor position is in a drop zone or not.
* If it is not in a drop zone, it returns <tt>false</tt> and no further processing
* is necessary. Otherwise, the handler returns <tt>true</tt>. In this case, the
* handler is responsible for providing the necessary information for
* displaying feedback to the user, by calling gdk_drag_status().
*
* If the decision whether the drop will be accepted or rejected can't be
* made based solely on the cursor position and the type of the data, the
* handler may inspect the dragged data by calling gtk_drag_get_data() and
* defer the gdk_drag_status() call to the Gtk::Widget::signal_drag_data_received()
* handler. Note that you must pass Gtk::DEST_DEFAULT_DROP,
* Gtk::DEST_DEFAULT_MOTION or Gtk::DEST_DEFAULT_ALL to gtk_drag_dest_set()
* when using the drag-motion signal that way.
*
* Also note that there is no drag-enter signal. The drag receiver has to
* keep track of whether he has received any drag-motion signals since the
* last Gtk::Widget::signal_drag_leave() and if not, treat the drag-motion signal as
* an "enter" signal. Upon an "enter", the handler will typically highlight
* the drop site with gtk_drag_highlight().
*
* [C example ellipted]
*
* @param context The drag context.
* @param x The x coordinate of the current cursor position.
* @param y The y coordinate of the current cursor position.
* @param time The timestamp of the motion event.
* @return Whether the cursor position is in a drop zone.
*/
Glib::SignalProxy< bool,const Glib::RefPtr<Gdk::DragContext>&,int,int,guint > signal_drag_motion();
/**
* @par Slot Prototype:
* <tt>bool on_my_%drag_drop(const Glib::RefPtr<Gdk::DragContext>& context, int x, int y, guint time)</tt>
*
* The signal_drag_drop() signal is emitted on the drop site when the user drops
* the data onto the widget. The signal handler must determine whether
* the cursor position is in a drop zone or not. If it is not in a drop
* zone, it returns <tt>false</tt> and no further processing is necessary.
* Otherwise, the handler returns <tt>true</tt>. In this case, the handler must
* ensure that gtk_drag_finish() is called to let the source know that
* the drop is done. The call to gtk_drag_finish() can be done either
* directly or in a Gtk::Widget::signal_drag_data_received() handler which gets
* triggered by calling gtk_drag_get_data() to receive the data for one
* or more of the supported targets.
*
* @param context The drag context.
* @param x The x coordinate of the current cursor position.
* @param y The y coordinate of the current cursor position.
* @param time The timestamp of the motion event.
* @return Whether the cursor position is in a drop zone.
*/
Glib::SignalProxy< bool,const Glib::RefPtr<Gdk::DragContext>&,int,int,guint > signal_drag_drop();
/**
* @par Slot Prototype:
* <tt>void on_my_%drag_data_received(const Glib::RefPtr<Gdk::DragContext>& context, int x, int y, const SelectionData& selection_data, guint info, guint time)</tt>
*
* The signal_drag_data_received() signal is emitted on the drop site when the
* dragged data has been received. If the data was received in order to
* determine whether the drop will be accepted, the handler is expected
* to call gdk_drag_status() and not finish the drag.
* If the data was received in response to a Gtk::Widget::signal_drag_drop() signal
* (and this is the last target to be received), the handler for this
* signal is expected to process the received data and then call
* gtk_drag_finish(), setting the @a success parameter depending on
* whether the data was processed successfully.
*
* Applications must create some means to determine why the signal was emitted
* and therefore whether to call gdk_drag_status() or gtk_drag_finish().
*
* The handler may inspect the selected action with
* gdk_drag_context_get_selected_action() before calling
* gtk_drag_finish(), e.g. to implement Gdk::ACTION_ASK as
* shown in the following example:
*
* [C example ellipted]
*
* @param context The drag context.
* @param x Where the drop happened.
* @param y Where the drop happened.
* @param selection_data The received data.
* @param info The info that has been registered with the target in the
* Gtk::TargetList.
* @param time The timestamp at which the data was received.
*/
Glib::SignalProxy< void,const Glib::RefPtr<Gdk::DragContext>&,int,int,const SelectionData&,guint,guint > signal_drag_data_received();
/**
* @par Slot Prototype:
* <tt>void on_my_%screen_changed(const Glib::RefPtr<Gdk::Screen>& previous_screen)</tt>
*
* The signal_screen_changed() signal gets emitted when the
* screen of a widget has changed.
*
* @param previous_screen The previous screen, or <tt>nullptr</tt> if the
* widget was not associated with a screen before.
*/
Glib::SignalProxy< void,const Glib::RefPtr<Gdk::Screen>& > signal_screen_changed();
/**
* @par Slot Prototype:
* <tt>void on_my_%composited_changed()</tt>
*
* The signal_composited_changed() signal is emitted when the composited
* status of @a widgets screen changes.
* See gdk_screen_is_composited().
*/
Glib::SignalProxy< void > signal_composited_changed();
//TODO: The signal_id is very C-like here:
//_WRAP_SIGNAL(bool can_activate_accel(guint signal_id), "can_activate_accel")
// TODO: Remove no_default_handler when we can break ABI:
/**
* @par Slot Prototype:
* <tt>bool on_my_%popup_menu()</tt>
*
* This signal gets emitted whenever a widget should pop up a context
* menu. This usually happens through the standard key binding mechanism;
* by pressing a certain key while a widget is focused, the user can cause
* the widget to pop up a menu. For example, the Gtk::Entry widget creates
* a menu with clipboard commands. See the
* [Popup Menu Migration Checklist][checklist-popup-menu]
* for an example of how to use this signal.
*
* @return <tt>true</tt> if a menu was activated.
*/
Glib::SignalProxy< bool > signal_popup_menu();
//Note that popup-menu is a keybinding signal, but is really meant to be wrapped.
//Keybinding signals:
// TODO: Remove no_default_handler when we can break ABI:
/**
* @par Slot Prototype:
* <tt>bool on_my_%query_tooltip(int x, int y, bool keyboard_tooltip, const Glib::RefPtr<Tooltip>& tooltip)</tt>
*
* Emitted when Gtk::Widget::property_has_tooltip() is <tt>true</tt> and the hover timeout
* has expired with the cursor hovering "above" @a widget; or emitted when @a widget got
* focus in keyboard mode.
*
* Using the given coordinates, the signal handler should determine
* whether a tooltip should be shown for @a widget. If this is the case
* <tt>true</tt> should be returned, <tt>false</tt> otherwise. Note that if
* @a keyboard_tooltip is <tt>true</tt>, the values of @a x and @a y are undefined and
* should not be used.
*
* The signal handler is free to manipulate @a tooltip with the therefore
* destined function calls.
*
* @newin{2,12}
*
* @param x The x coordinate of the cursor position where the request has
* been emitted, relative to @a widget's left side.
* @param y The y coordinate of the cursor position where the request has
* been emitted, relative to @a widget's top.
* @param keyboard_tooltip <tt>true</tt> if the tooltip was trigged using the keyboard.
* @param tooltip A Gtk::Tooltip.
* @return <tt>true</tt> if @a tooltip should be shown right now, <tt>false</tt> otherwise.
*/
Glib::SignalProxy< bool,int,int,bool,const Glib::RefPtr<Tooltip>& > signal_query_tooltip();
//(This was added to GTK+ 2.8 but forgotten by us until gtkmm 2.13/14):
/**
* @par Slot Prototype:
* <tt>bool on_my_%grab_broken_event(GdkEventGrabBroken* grab_broken_event)</tt>
*
* Emitted when a pointer or keyboard grab on a window belonging
* to @a widget gets broken.
*
* On X11, this happens when the grab window becomes unviewable
* (i.e. it or one of its ancestors is unmapped), or if the same
* application grabs the pointer or keyboard again.
*
* @newin{2,8}
*
* @param grab_broken_event The Gdk::EventGrabBroken event.
* @return <tt>true</tt> to stop other handlers from being invoked for
* the event. <tt>false</tt> to propagate the event further.
*/
Glib::SignalProxy< bool,GdkEventGrabBroken* > signal_grab_broken_event();
// TODO: Remove no_default_handler when we can break ABI:
/**
* @par Slot Prototype:
* <tt>bool on_my_%damage_event(GdkEventExpose* expose_event)</tt>
*
* Emitted when a redirected window belonging to @a widget gets drawn into.
* The region/area members of the event shows what area of the redirected
* drawable was drawn into.
*
* @newin{2,14}
*
* @param expose_event The Gdk::EventExpose event.
* @return <tt>true</tt> to stop other handlers from being invoked for the event.
* <tt>false</tt> to propagate the event further.
*/
Glib::SignalProxy< bool,GdkEventExpose* > signal_damage_event();
// TODO: Remove no_default_handler when we can break ABI:
/**
* @par Slot Prototype:
* <tt>bool on_my_%touch_event(GdkEventTouch* touch_event)</tt>
*
*/
Glib::SignalProxy< bool,GdkEventTouch* > signal_touch_event();
/** The name of the widget.
*
* @return A PropertyProxy that allows you to get or set the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy< Glib::ustring > property_name() ;
/** The name of the widget.
*
* @return A PropertyProxy_ReadOnly that allows you to get the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy_ReadOnly< Glib::ustring > property_name() const;
/** The parent widget of this widget. Must be a Container widget.
*
* @return A PropertyProxy that allows you to get or set the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy< Container* > property_parent() ;
/** The parent widget of this widget. Must be a Container widget.
*
* @return A PropertyProxy_ReadOnly that allows you to get the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy_ReadOnly< Container* > property_parent() const;
/** Override for width request of the widget, or -1 if natural request should be used.
*
* @return A PropertyProxy that allows you to get or set the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy< int > property_width_request() ;
/** Override for width request of the widget, or -1 if natural request should be used.
*
* @return A PropertyProxy_ReadOnly that allows you to get the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy_ReadOnly< int > property_width_request() const;
/** Override for height request of the widget, or -1 if natural request should be used.
*
* @return A PropertyProxy that allows you to get or set the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy< int > property_height_request() ;
/** Override for height request of the widget, or -1 if natural request should be used.
*
* @return A PropertyProxy_ReadOnly that allows you to get the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy_ReadOnly< int > property_height_request() const;
/** Whether the widget is visible.
*
* @return A PropertyProxy that allows you to get or set the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy< bool > property_visible() ;
/** Whether the widget is visible.
*
* @return A PropertyProxy_ReadOnly that allows you to get the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy_ReadOnly< bool > property_visible() const;
/** Whether the widget responds to input.
*
* @return A PropertyProxy that allows you to get or set the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy< bool > property_sensitive() ;
/** Whether the widget responds to input.
*
* @return A PropertyProxy_ReadOnly that allows you to get the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy_ReadOnly< bool > property_sensitive() const;
/** Whether the application will paint directly on the widget.
*
* @return A PropertyProxy that allows you to get or set the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy< bool > property_app_paintable() ;
/** Whether the application will paint directly on the widget.
*
* @return A PropertyProxy_ReadOnly that allows you to get the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy_ReadOnly< bool > property_app_paintable() const;
/** Whether the widget can accept the input focus.
*
* @return A PropertyProxy that allows you to get or set the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy< bool > property_can_focus() ;
/** Whether the widget can accept the input focus.
*
* @return A PropertyProxy_ReadOnly that allows you to get the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy_ReadOnly< bool > property_can_focus() const;
/** Whether the widget has the input focus.
*
* @return A PropertyProxy that allows you to get or set the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy< bool > property_has_focus() ;
/** Whether the widget has the input focus.
*
* @return A PropertyProxy_ReadOnly that allows you to get the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy_ReadOnly< bool > property_has_focus() const;
/** Whether the widget is the focus widget within the toplevel.
*
* @return A PropertyProxy that allows you to get or set the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy< bool > property_is_focus() ;
/** Whether the widget is the focus widget within the toplevel.
*
* @return A PropertyProxy_ReadOnly that allows you to get the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy_ReadOnly< bool > property_is_focus() const;
/** Whether the widget should grab focus when it is clicked with the mouse.
*
* This property is only relevant for widgets that can take focus.
*
* Before 3.20, several widgets (GtkButton, GtkFileChooserButton,
* GtkComboBox) implemented this property individually.
*
* @newin{3,20}
*
* @return A PropertyProxy that allows you to get or set the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy< bool > property_focus_on_click() ;
/** Whether the widget should grab focus when it is clicked with the mouse.
*
* This property is only relevant for widgets that can take focus.
*
* Before 3.20, several widgets (GtkButton, GtkFileChooserButton,
* GtkComboBox) implemented this property individually.
*
* @newin{3,20}
*
* @return A PropertyProxy_ReadOnly that allows you to get the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy_ReadOnly< bool > property_focus_on_click() const;
/** Whether the widget can be the default widget.
*
* @return A PropertyProxy that allows you to get or set the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy< bool > property_can_default() ;
/** Whether the widget can be the default widget.
*
* @return A PropertyProxy_ReadOnly that allows you to get the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy_ReadOnly< bool > property_can_default() const;
/** Whether the widget is the default widget.
*
* @return A PropertyProxy that allows you to get or set the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy< bool > property_has_default() ;
/** Whether the widget is the default widget.
*
* @return A PropertyProxy_ReadOnly that allows you to get the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy_ReadOnly< bool > property_has_default() const;
/** If TRUE, the widget will receive the default action when it is focused.
*
* @return A PropertyProxy that allows you to get or set the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy< bool > property_receives_default() ;
/** If TRUE, the widget will receive the default action when it is focused.
*
* @return A PropertyProxy_ReadOnly that allows you to get the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy_ReadOnly< bool > property_receives_default() const;
/** Whether the widget is part of a composite widget.
*
* @return A PropertyProxy_ReadOnly that allows you to get the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy_ReadOnly< bool > property_composite_child() const;
#ifndef GTKMM_DISABLE_DEPRECATED
/** The style of the widget, which contains information about how it will look (colors etc).
* @deprecated Don't use this API. There is no Style class in gtkmm 3.
*
* @return A PropertyProxy that allows you to get or set the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy< Glib::RefPtr<Style> > property_style() ;
/** The style of the widget, which contains information about how it will look (colors etc).
* @deprecated Don't use this API. There is no Style class in gtkmm 3.
*
* @return A PropertyProxy_ReadOnly that allows you to get the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy_ReadOnly< Glib::RefPtr<Style> > property_style() const;
#endif // GTKMM_DISABLE_DEPRECATED
/** The event mask that decides what kind of GdkEvents this widget gets.
*
* @return A PropertyProxy that allows you to get or set the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy< Gdk::EventMask > property_events() ;
/** The event mask that decides what kind of GdkEvents this widget gets.
*
* @return A PropertyProxy_ReadOnly that allows you to get the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy_ReadOnly< Gdk::EventMask > property_events() const;
/** Enables or disables the emission of Gtk::Widget::signal_query_tooltip() on @a widget.
* A value of <tt>true</tt> indicates that @a widget can have a tooltip, in this case
* the widget will be queried using Gtk::Widget::signal_query_tooltip() to determine
* whether it will provide a tooltip or not.
*
* Note that setting this property to <tt>true</tt> for the first time will change
* the event masks of the GdkWindows of this widget to include leave-notify
* and motion-notify events. This cannot and will not be undone when the
* property is set to <tt>false</tt> again.
*
* @newin{2,12}
*
* @return A PropertyProxy that allows you to get or set the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy< bool > property_has_tooltip() ;
/** Enables or disables the emission of Gtk::Widget::signal_query_tooltip() on @a widget.
* A value of <tt>true</tt> indicates that @a widget can have a tooltip, in this case
* the widget will be queried using Gtk::Widget::signal_query_tooltip() to determine
* whether it will provide a tooltip or not.
*
* Note that setting this property to <tt>true</tt> for the first time will change
* the event masks of the GdkWindows of this widget to include leave-notify
* and motion-notify events. This cannot and will not be undone when the
* property is set to <tt>false</tt> again.
*
* @newin{2,12}
*
* @return A PropertyProxy_ReadOnly that allows you to get the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy_ReadOnly< bool > property_has_tooltip() const;
/** Sets the text of tooltip to be the given string, which is marked up
* with the [Pango text markup language][PangoMarkupFormat].
* Also see Gtk::Tooltip::set_markup().
*
* This is a convenience property which will take care of getting the
* tooltip shown if the given string is not <tt>nullptr</tt>: Gtk::Widget::property_has_tooltip()
* will automatically be set to <tt>true</tt> and there will be taken care of
* Gtk::Widget::signal_query_tooltip() in the default signal handler.
*
* Note that if both Gtk::Widget::property_tooltip_text() and Gtk::Widget::property_tooltip_markup()
* are set, the last one wins.
*
* @newin{2,12}
*
* @return A PropertyProxy that allows you to get or set the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy< Glib::ustring > property_tooltip_markup() ;
/** Sets the text of tooltip to be the given string, which is marked up
* with the [Pango text markup language][PangoMarkupFormat].
* Also see Gtk::Tooltip::set_markup().
*
* This is a convenience property which will take care of getting the
* tooltip shown if the given string is not <tt>nullptr</tt>: Gtk::Widget::property_has_tooltip()
* will automatically be set to <tt>true</tt> and there will be taken care of
* Gtk::Widget::signal_query_tooltip() in the default signal handler.
*
* Note that if both Gtk::Widget::property_tooltip_text() and Gtk::Widget::property_tooltip_markup()
* are set, the last one wins.
*
* @newin{2,12}
*
* @return A PropertyProxy_ReadOnly that allows you to get the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy_ReadOnly< Glib::ustring > property_tooltip_markup() const;
/** Sets the text of tooltip to be the given string.
*
* Also see Gtk::Tooltip::set_text().
*
* This is a convenience property which will take care of getting the
* tooltip shown if the given string is not <tt>nullptr</tt>: Gtk::Widget::property_has_tooltip()
* will automatically be set to <tt>true</tt> and there will be taken care of
* Gtk::Widget::signal_query_tooltip() in the default signal handler.
*
* Note that if both Gtk::Widget::property_tooltip_text() and Gtk::Widget::property_tooltip_markup()
* are set, the last one wins.
*
* @newin{2,12}
*
* @return A PropertyProxy that allows you to get or set the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy< Glib::ustring > property_tooltip_text() ;
/** Sets the text of tooltip to be the given string.
*
* Also see Gtk::Tooltip::set_text().
*
* This is a convenience property which will take care of getting the
* tooltip shown if the given string is not <tt>nullptr</tt>: Gtk::Widget::property_has_tooltip()
* will automatically be set to <tt>true</tt> and there will be taken care of
* Gtk::Widget::signal_query_tooltip() in the default signal handler.
*
* Note that if both Gtk::Widget::property_tooltip_text() and Gtk::Widget::property_tooltip_markup()
* are set, the last one wins.
*
* @newin{2,12}
*
* @return A PropertyProxy_ReadOnly that allows you to get the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy_ReadOnly< Glib::ustring > property_tooltip_text() const;
/** The widget's window if it is realized, <tt>nullptr</tt> otherwise.
*
* @newin{2,14}
*
* @return A PropertyProxy_ReadOnly that allows you to get the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy_ReadOnly< Glib::RefPtr<Gdk::Window> > property_window() const;
/** Whether gtk_widget_show_all() should not affect this widget.
*
* @return A PropertyProxy that allows you to get or set the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy< bool > property_no_show_all() ;
/** Whether gtk_widget_show_all() should not affect this widget.
*
* @return A PropertyProxy_ReadOnly that allows you to get the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy_ReadOnly< bool > property_no_show_all() const;
#ifndef GTKMM_DISABLE_DEPRECATED
/** Whether the widget is double buffered.
*
* @newin{2,18}
*
* Deprecated: 3.14: Widgets should not use this property.
*
* @deprecated Widgets should not use this property.
*
* @return A PropertyProxy that allows you to get or set the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy< bool > property_double_buffered() ;
/** Whether the widget is double buffered.
*
* @newin{2,18}
*
* Deprecated: 3.14: Widgets should not use this property.
*
* @deprecated Widgets should not use this property.
*
* @return A PropertyProxy_ReadOnly that allows you to get the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy_ReadOnly< bool > property_double_buffered() const;
#endif // GTKMM_DISABLE_DEPRECATED
/** How to distribute horizontal space if widget gets extra space, see Gtk::Align
*
* @newin{3,0}
*
* @return A PropertyProxy that allows you to get or set the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy< Align > property_halign() ;
/** How to distribute horizontal space if widget gets extra space, see Gtk::Align
*
* @newin{3,0}
*
* @return A PropertyProxy_ReadOnly that allows you to get the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy_ReadOnly< Align > property_halign() const;
/** How to distribute vertical space if widget gets extra space, see Gtk::Align
*
* @newin{3,0}
*
* @return A PropertyProxy that allows you to get or set the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy< Align > property_valign() ;
/** How to distribute vertical space if widget gets extra space, see Gtk::Align
*
* @newin{3,0}
*
* @return A PropertyProxy_ReadOnly that allows you to get the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy_ReadOnly< Align > property_valign() const;
#ifndef GTKMM_DISABLE_DEPRECATED
/** Margin on left side of widget.
*
* This property adds margin outside of the widget's normal size
* request, the margin will be added in addition to the size from
* Gtk::Widget::set_size_request() for example.
*
* Deprecated: 3.12: Use Gtk::Widget::property_margin_start() instead.
*
* @newin{3,0}
*
* @deprecated Use property_margin_start() instead.
*
* @return A PropertyProxy that allows you to get or set the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy< int > property_margin_left() ;
/** Margin on left side of widget.
*
* This property adds margin outside of the widget's normal size
* request, the margin will be added in addition to the size from
* Gtk::Widget::set_size_request() for example.
*
* Deprecated: 3.12: Use Gtk::Widget::property_margin_start() instead.
*
* @newin{3,0}
*
* @deprecated Use property_margin_start() instead.
*
* @return A PropertyProxy_ReadOnly that allows you to get the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy_ReadOnly< int > property_margin_left() const;
#endif // GTKMM_DISABLE_DEPRECATED
#ifndef GTKMM_DISABLE_DEPRECATED
/** Margin on right side of widget.
*
* This property adds margin outside of the widget's normal size
* request, the margin will be added in addition to the size from
* Gtk::Widget::set_size_request() for example.
*
* Deprecated: 3.12: Use Gtk::Widget::property_margin_end() instead.
*
* @newin{3,0}
*
* @deprecated Use property_margin_end() instead.
*
* @return A PropertyProxy that allows you to get or set the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy< int > property_margin_right() ;
/** Margin on right side of widget.
*
* This property adds margin outside of the widget's normal size
* request, the margin will be added in addition to the size from
* Gtk::Widget::set_size_request() for example.
*
* Deprecated: 3.12: Use Gtk::Widget::property_margin_end() instead.
*
* @newin{3,0}
*
* @deprecated Use property_margin_end() instead.
*
* @return A PropertyProxy_ReadOnly that allows you to get the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy_ReadOnly< int > property_margin_right() const;
#endif // GTKMM_DISABLE_DEPRECATED
/** Margin on start of widget, horizontally. This property supports
* left-to-right and right-to-left text directions.
*
* This property adds margin outside of the widget's normal size
* request, the margin will be added in addition to the size from
* Gtk::Widget::set_size_request() for example.
*
* @newin{3,12}
*
* @return A PropertyProxy that allows you to get or set the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy< int > property_margin_start() ;
/** Margin on start of widget, horizontally. This property supports
* left-to-right and right-to-left text directions.
*
* This property adds margin outside of the widget's normal size
* request, the margin will be added in addition to the size from
* Gtk::Widget::set_size_request() for example.
*
* @newin{3,12}
*
* @return A PropertyProxy_ReadOnly that allows you to get the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy_ReadOnly< int > property_margin_start() const;
/** Margin on end of widget, horizontally. This property supports
* left-to-right and right-to-left text directions.
*
* This property adds margin outside of the widget's normal size
* request, the margin will be added in addition to the size from
* Gtk::Widget::set_size_request() for example.
*
* @newin{3,12}
*
* @return A PropertyProxy that allows you to get or set the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy< int > property_margin_end() ;
/** Margin on end of widget, horizontally. This property supports
* left-to-right and right-to-left text directions.
*
* This property adds margin outside of the widget's normal size
* request, the margin will be added in addition to the size from
* Gtk::Widget::set_size_request() for example.
*
* @newin{3,12}
*
* @return A PropertyProxy_ReadOnly that allows you to get the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy_ReadOnly< int > property_margin_end() const;
/** Margin on top side of widget.
*
* This property adds margin outside of the widget's normal size
* request, the margin will be added in addition to the size from
* Gtk::Widget::set_size_request() for example.
*
* @newin{3,0}
*
* @return A PropertyProxy that allows you to get or set the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy< int > property_margin_top() ;
/** Margin on top side of widget.
*
* This property adds margin outside of the widget's normal size
* request, the margin will be added in addition to the size from
* Gtk::Widget::set_size_request() for example.
*
* @newin{3,0}
*
* @return A PropertyProxy_ReadOnly that allows you to get the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy_ReadOnly< int > property_margin_top() const;
/** Margin on bottom side of widget.
*
* This property adds margin outside of the widget's normal size
* request, the margin will be added in addition to the size from
* Gtk::Widget::set_size_request() for example.
*
* @newin{3,0}
*
* @return A PropertyProxy that allows you to get or set the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy< int > property_margin_bottom() ;
/** Margin on bottom side of widget.
*
* This property adds margin outside of the widget's normal size
* request, the margin will be added in addition to the size from
* Gtk::Widget::set_size_request() for example.
*
* @newin{3,0}
*
* @return A PropertyProxy_ReadOnly that allows you to get the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy_ReadOnly< int > property_margin_bottom() const;
/** Sets all four sides' margin at once. If read, returns max
* margin on any side.
*
* @newin{3,0}
*
* @return A PropertyProxy that allows you to get or set the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy< int > property_margin() ;
/** Sets all four sides' margin at once. If read, returns max
* margin on any side.
*
* @newin{3,0}
*
* @return A PropertyProxy_ReadOnly that allows you to get the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy_ReadOnly< int > property_margin() const;
/** Whether to expand horizontally. See Gtk::Widget::set_hexpand().
*
* @newin{3,0}
*
* @return A PropertyProxy that allows you to get or set the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy< bool > property_hexpand() ;
/** Whether to expand horizontally. See Gtk::Widget::set_hexpand().
*
* @newin{3,0}
*
* @return A PropertyProxy_ReadOnly that allows you to get the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy_ReadOnly< bool > property_hexpand() const;
/** Whether to use the Gtk::Widget::property_hexpand() property. See Gtk::Widget::get_hexpand_set().
*
* @newin{3,0}
*
* @return A PropertyProxy that allows you to get or set the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy< bool > property_hexpand_set() ;
/** Whether to use the Gtk::Widget::property_hexpand() property. See Gtk::Widget::get_hexpand_set().
*
* @newin{3,0}
*
* @return A PropertyProxy_ReadOnly that allows you to get the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy_ReadOnly< bool > property_hexpand_set() const;
/** Whether to expand vertically. See Gtk::Widget::set_vexpand().
*
* @newin{3,0}
*
* @return A PropertyProxy that allows you to get or set the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy< bool > property_vexpand() ;
/** Whether to expand vertically. See Gtk::Widget::set_vexpand().
*
* @newin{3,0}
*
* @return A PropertyProxy_ReadOnly that allows you to get the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy_ReadOnly< bool > property_vexpand() const;
/** Whether to use the Gtk::Widget::property_vexpand() property. See Gtk::Widget::get_vexpand_set().
*
* @newin{3,0}
*
* @return A PropertyProxy that allows you to get or set the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy< bool > property_vexpand_set() ;
/** Whether to use the Gtk::Widget::property_vexpand() property. See Gtk::Widget::get_vexpand_set().
*
* @newin{3,0}
*
* @return A PropertyProxy_ReadOnly that allows you to get the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy_ReadOnly< bool > property_vexpand_set() const;
/** Whether to expand in both directions. Setting this sets both Gtk::Widget::property_hexpand() and Gtk::Widget::property_vexpand()
*
* @newin{3,0}
*
* @return A PropertyProxy that allows you to get or set the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy< bool > property_expand() ;
/** Whether to expand in both directions. Setting this sets both Gtk::Widget::property_hexpand() and Gtk::Widget::property_vexpand()
*
* @newin{3,0}
*
* @return A PropertyProxy_ReadOnly that allows you to get the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy_ReadOnly< bool > property_expand() const;
/** The requested opacity of the widget. See Gtk::Widget::set_opacity() for
* more details about window opacity.
*
* Before 3.8 this was only available in GtkWindow
*
* @newin{3,8}
*
* @return A PropertyProxy that allows you to get or set the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy< double > property_opacity() ;
/** The requested opacity of the widget. See Gtk::Widget::set_opacity() for
* more details about window opacity.
*
* Before 3.8 this was only available in GtkWindow
*
* @newin{3,8}
*
* @return A PropertyProxy_ReadOnly that allows you to get the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy_ReadOnly< double > property_opacity() const;
/** The scale factor of the widget. See Gtk::Widget::get_scale_factor() for
* more details about widget scaling.
*
* @newin{3,10}
*
* @return A PropertyProxy_ReadOnly that allows you to get the value of the property,
* or receive notification when the value of the property changes.
*/
Glib::PropertyProxy_ReadOnly< int > property_scale_factor() const;
protected:
//comment in GTK+ header: "seldomly overidden"
virtual void dispatch_child_properties_changed_vfunc(guint p1, GParamSpec** p2);
virtual void show_all_vfunc();
#ifdef GTKMM_ATKMM_ENABLED
virtual Glib::RefPtr<Atk::Object> get_accessible_vfunc();
#endif // GTKMM_ATKMM_ENABLED
virtual SizeRequestMode get_request_mode_vfunc() const;
virtual void get_preferred_width_vfunc(int& minimum_width, int& natural_width) const;
virtual void get_preferred_height_for_width_vfunc(int width, int& minimum_height, int& natural_height) const;
virtual void get_preferred_height_vfunc(int& minimum_height, int& natural_height) const;
virtual void get_preferred_width_for_height_vfunc(int height, int& minimum_width, int& natural_width) const;
//TODO: Wrap all the new vfuncs when we can break ABI.
protected:
Widget();
/** Creates the GDK (windowing system) resources associated with a
* widget. For example, @a widget->window will be created when a widget
* is realized. Normally realization happens implicitly; if you show
* a widget and all its parent containers, then the widget will be
* realized and mapped automatically.
*
* Realizing a widget requires all
* the widget’s parent widgets to be realized; calling
* realize() realizes the widget’s parents in addition to
* @a widget itself. If a widget is not yet inside a toplevel window
* when you realize it, bad things will happen.
*
* This function is primarily used in widget implementations, and
* isn’t very useful otherwise. Many times when you think you might
* need it, a better approach is to connect to a signal that will be
* called after the widget is realized automatically, such as
* Gtk::Widget::signal_draw(). Or simply Glib::signal_connect() to the
* Gtk::Widget::signal_realize() signal.
*/
void realize();
/** This function is only useful in widget implementations.
* Causes a widget to be unrealized (frees all GDK resources
* associated with the widget, such as @a widget->window).
*/
void unrealize();
/** Draws @a widget to @a cr. The top left corner of the widget will be
* drawn to the currently set origin point of @a cr.
*
* You should pass a cairo context as @a cr argument that is in an
* original state. Otherwise the resulting drawing is undefined. For
* example changing the operator using cairo_set_operator() or the
* line width using cairo_set_line_width() might have unwanted side
* effects.
* You may however change the context’s transform matrix - like with
* cairo_scale(), cairo_translate() or cairo_set_matrix() and clip
* region with cairo_clip() prior to calling this function. Also, it
* is fine to modify the context with cairo_save() and
* cairo_push_group() prior to calling this function.
*
* Note that special-purpose widgets may contain special code for
* rendering to the screen and might appear differently on screen
* and when rendered using draw().
*
* @newin{3,0}
*
* @param cr A cairo context to draw to.
*/
void draw(const ::Cairo::RefPtr< ::Cairo::Context>& cr);
/** Marks the widget as being realized.
*
* This function should only ever be called in a derived widget's
* “map” or “unmap” implementation.
*
* @newin{2,20}
*
* @param mapped <tt>true</tt> to mark the widget as mapped.
*/
void set_mapped(bool mapped = true);
/** Marks the widget as being realized. This function must only be
* called after all Gdk::Windows for the @a widget have been created
* and registered.
*
* This function should only ever be called in a derived widget's
* “realize” or “unrealize” implementation.
*
* @newin{2,20}
*
* @param realized <tt>true</tt> to mark the widget as realized.
*/
void set_realized(bool realized = true);
/** Specifies whether @a widget has a Gdk::Window of its own. Note that
* all realized widgets have a non-<tt>nullptr</tt> “window” pointer
* (get_window() never returns a <tt>nullptr</tt> window when a widget
* is realized), but for many of them it’s actually the Gdk::Window of
* one of its parent widgets. Widgets that do not create a %window for
* themselves in Gtk::Widget::signal_realize() must announce this by
* calling this function with @a has_window = <tt>false</tt>.
*
* This function should only be called by widget implementations,
* and they should call it in their init() function.
*
* @newin{2,18}
*
* @param has_window Whether or not @a widget has a window.
*/
void set_has_window(bool has_window = true);
/** Sets a widget's window. This function should only be used in a
* widget's Gtk::Widget::on_realize() implementation. The %window passed is
* usually either a new window created with Gdk::Window::create(), or the
* window of its parent widget as returned by get_parent_window().
*
* Widgets must indicate whether they will create their own Gdk::Window
* by calling set_has_window(). This is usually done in the
* widget's constructor.
*
* This function should only be called by custom widget implementations,
* and they should call it in their on_realize() function.
*
* @newin{2,18}
*
* @param window A Gdk::Window.
*/
void set_window(const Glib::RefPtr<Gdk::Window>& window);
/** This function is supposed to be called in Gtk::Widget::signal_draw()
* implementations for widgets that support multiple windows.
* @a cr must be untransformed from invoking of the draw function.
* This function will return <tt>true</tt> if the contents of the given
* @a window are supposed to be drawn and <tt>false</tt> otherwise. Note
* that when the drawing was not initiated by the windowing
* system this function will return <tt>true</tt> for all windows, so
* you need to draw the bottommost window first. Also, do not
* use “else if” statements to check which window should be drawn.
*
* @newin{3,0}
*
* @param cr A cairo context.
* @param window The window to check. @a window may not be an input-only
* window.
* @return <tt>true</tt> if @a window should be drawn.
*/
static bool should_draw_window(const ::Cairo::RefPtr<const ::Cairo::Context>& cr, const Glib::RefPtr<const Gdk::Window>& window);
/** Transforms the given cairo context @a cr from widget-relative
* coordinates to window-relative coordinates.
* If the widget's window is not an ancestor of @a window, no
* modification will be applied.
*
* This is the inverse to the transformation GTK applies when
* preparing an expose event to be emitted with the Widget's draw
* signal. It is intended to help porting multiwindow widgets from
* GTK+ 2 to the rendering architecture of GTK+ 3.
*
* @param cr The cairo context to transform.
* @param window The window to transform the context to.
*
* @newin{3,0}
*/
void transform_cairo_context_to_window(const ::Cairo::RefPtr< ::Cairo::Context>& cr, const Glib::RefPtr<const Gdk::Window>& window);
#ifndef GTKMM_DISABLE_DEPRECATED
/** Retrieves the widget's requisition.
*
* This method should only be used by widget implementations in
* order to discover whether the widget's requisition has actually
* changed after some internal state change (so that they can call
* queue_resize() instead of queue_draw()).
*
* Normally, size_request() should be used.
*
* @result The widget's requisition.
*
* @newin{2,20}
* @deprecated Use get_preferred_size() instead.
*/
Requisition get_requisition() const;
#endif // GTKMM_DISABLE_DEPRECATED
//deprecated
//deprecated.
//The parameter name is "the_property_name" to avoid a warning because there is a method with the "property_name" name.
/** Gets the value of a style property of @a widget.
*
* It is usually easier to use get_style_property(), to avoid the use of
* Glib::Value.
*
* @param the_property_name The name of a style property.
* @param value Location to return the property value.
*/
void get_style_property_value(const Glib::ustring& the_property_name, Glib::ValueBase& value) const;
void realize_if_needed();
};
#ifndef DOXYGEN_SHOULD_SKIP_THIS
//The parameter name is "the_property_name" to avoid a warning because there is a method with the "property_name" name.
template <class PropertyType>
void Widget::get_style_property(const Glib::ustring& the_property_name, PropertyType& value) const
{
Glib::Value<PropertyType> property_value;
property_value.init(Glib::Value<PropertyType>::value_type());
this->get_style_property_value(the_property_name, property_value);
value = property_value.get();
}
#endif /* DOXYGEN_SHOULD_SKIP_THIS */
} // namespace Gtk
namespace Glib
{
/** A Glib::wrap() method for this object.
*
* @param object The C instance.
* @param take_copy False if the result should take ownership of the C instance. True if it should take a new copy or ref.
* @result A C++ instance that wraps this C instance.
*
* @relates Gtk::Widget
*/
Gtk::Widget* wrap(GtkWidget* object, bool take_copy = false);
} //namespace Glib
#endif /* _GTKMM_WIDGET_H */
| [
"[email protected]"
] | |
0c15a8df7b1dc973d34b7514c6ff98e7a873120b | f23c8df7d0e570b286764e3bf16d4da0981f995d | /source/CUDARaster/cuda/CoarseRaster.inl | 6616c4384c779321a900ceaf0039d204738a2d3d | [
"MIT"
] | permissive | mhourousha/cuRE | 7d48be4b282348c4e5200c511b7101028f897f85 | ccba6a29bba4445300cbb630befe57e31f0d80cb | refs/heads/master | 2022-01-26T13:05:31.782134 | 2018-10-04T21:56:06 | 2018-10-04T21:56:06 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 35,044 | inl | /*
* Copyright (c) 2009-2011, NVIDIA Corporation
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* * Neither the name of NVIDIA Corporation nor the
* names of its contributors may be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
//------------------------------------------------------------------------
__device__ __inline__ int globalTileIdx(int tileInBin)
{
int tileX = tileInBin & (CR_BIN_SIZE - 1);
int tileY = tileInBin >> CR_BIN_LOG2;
return tileX + tileY * c_crParams.widthTiles;
}
//------------------------------------------------------------------------
__device__ __inline__ void coarseRasterImpl(void)
{
// Common.
__shared__ volatile U32 s_workCounter;
__shared__ volatile U32 s_scanTemp [CR_COARSE_WARPS][48]; // 3KB
// Input.
__shared__ volatile U32 s_binOrder [CR_MAXBINS_SQR]; // 1KB
__shared__ volatile S32 s_binStreamCurrSeg [CR_BIN_STREAMS_SIZE]; // 0KB
__shared__ volatile S32 s_binStreamFirstTri [CR_BIN_STREAMS_SIZE]; // 0KB
__shared__ volatile S32 s_triQueue [CR_COARSE_QUEUE_SIZE]; // 4KB
__shared__ volatile S32 s_triQueueWritePos;
__shared__ volatile U32 s_binStreamSelectedOfs;
__shared__ volatile U32 s_binStreamSelectedSize;
// Output.
__shared__ volatile U32 s_warpEmitMask [CR_COARSE_WARPS][CR_BIN_SQR + 1]; // 16KB, +1 to avoid bank collisions
__shared__ volatile U32 s_warpEmitPrefixSum [CR_COARSE_WARPS][CR_BIN_SQR + 1]; // 16KB, +1 to avoid bank collisions
__shared__ volatile U32 s_tileEmitPrefixSum [CR_BIN_SQR + 1]; // 1KB, zero at the beginning
__shared__ volatile U32 s_tileAllocPrefixSum[CR_BIN_SQR + 1]; // 1KB, zero at the beginning
__shared__ volatile S32 s_tileStreamCurrOfs [CR_BIN_SQR]; // 1KB
__shared__ volatile U32 s_firstAllocSeg;
__shared__ volatile U32 s_firstActiveIdx;
// Pointers and constants.
const CRTriangleHeader* triHeader = (const CRTriangleHeader*)c_crParams.triHeader;
const S32* binFirstSeg = (const S32*)c_crParams.binFirstSeg;
const S32* binTotal = (const S32*)c_crParams.binTotal;
const S32* binSegData = (const S32*)c_crParams.binSegData;
const S32* binSegNext = (const S32*)c_crParams.binSegNext;
const S32* binSegCount = (const S32*)c_crParams.binSegCount;
S32* activeTiles = (S32*)c_crParams.activeTiles;
S32* tileFirstSeg = (S32*)c_crParams.tileFirstSeg;
S32* tileSegData = (S32*)c_crParams.tileSegData;
S32* tileSegNext = (S32*)c_crParams.tileSegNext;
S32* tileSegCount = (S32*)c_crParams.tileSegCount;
int tileLog = CR_TILE_LOG2 + CR_SUBPIXEL_LOG2;
int thrInBlock = threadIdx.x + threadIdx.y * 32;
int emitShift = CR_BIN_LOG2 * 2 + 5; // We scan ((numEmits << emitShift) | numAllocs) over tiles.
if (g_crAtomics.numSubtris > c_crParams.maxSubtris || g_crAtomics.numBinSegs > c_crParams.maxBinSegs)
return;
CR_TIMER_INIT();
CR_TIMER_IN(CoarseTotal);
// Initialize sharedmem arrays.
CR_TIMER_IN(CoarseSort);
s_tileEmitPrefixSum[0] = 0;
s_tileAllocPrefixSum[0] = 0;
s_scanTemp[threadIdx.y][threadIdx.x] = 0;
// Sort bins in descending order of triangle count.
for (int binIdx = thrInBlock; binIdx < c_crParams.numBins; binIdx += CR_COARSE_WARPS * 32)
{
int count = 0;
for (int i = 0; i < CR_BIN_STREAMS_SIZE; i++)
count += binTotal[(binIdx << CR_BIN_STREAMS_LOG2) + i];
s_binOrder[binIdx] = (~count << (CR_MAXBINS_LOG2 * 2)) | binIdx;
}
__syncthreads();
sortShared(s_binOrder, c_crParams.numBins);
CR_TIMER_SYNC();
CR_TIMER_OUT(CoarseSort);
// Process each bin by one block.
for (;;)
{
// Pick a bin for the block.
CR_TIMER_IN(CoarseBinInit);
if (thrInBlock == 0)
s_workCounter = atomicAdd(&g_crAtomics.coarseCounter, 1);
__syncthreads();
int workCounter = s_workCounter;
if (workCounter >= c_crParams.numBins)
{
CR_TIMER_OUT(CoarseBinInit);
break;
}
U32 binOrder = s_binOrder[workCounter];
bool binEmpty = ((~binOrder >> (CR_MAXBINS_LOG2 * 2)) == 0);
if (binEmpty && !c_crParams.deferredClear)
{
CR_TIMER_OUT(CoarseBinInit);
break;
}
int binIdx = binOrder & (CR_MAXBINS_SQR - 1);
// Initialize input/output streams.
int triQueueWritePos = 0;
int triQueueReadPos = 0;
if (thrInBlock < CR_BIN_STREAMS_SIZE)
{
int segIdx = binFirstSeg[(binIdx << CR_BIN_STREAMS_LOG2) + thrInBlock];
s_binStreamCurrSeg[thrInBlock] = segIdx;
s_binStreamFirstTri[thrInBlock] = (segIdx == -1) ? ~0u : binSegData[segIdx << CR_BIN_SEG_LOG2];
}
for (int tileInBin = CR_COARSE_WARPS * 32 - 1 - thrInBlock; tileInBin < CR_BIN_SQR; tileInBin += CR_COARSE_WARPS * 32)
s_tileStreamCurrOfs[tileInBin] = -CR_TILE_SEG_SIZE;
// Initialize per-bin state.
int binY = idiv_fast(binIdx, c_crParams.widthBins);
int binX = binIdx - binY * c_crParams.widthBins;
int originX = (binX << (CR_BIN_LOG2 + tileLog)) - (c_crParams.viewportWidth << (CR_SUBPIXEL_LOG2 - 1));
int originY = (binY << (CR_BIN_LOG2 + tileLog)) - (c_crParams.viewportHeight << (CR_SUBPIXEL_LOG2 - 1));
int maxTileXInBin = ::min(c_crParams.widthTiles - (binX << CR_BIN_LOG2), CR_BIN_SIZE) - 1;
int maxTileYInBin = ::min(c_crParams.heightTiles - (binY << CR_BIN_LOG2), CR_BIN_SIZE) - 1;
int binTileIdx = (binX + binY * c_crParams.widthTiles) << CR_BIN_LOG2;
CR_TIMER_SYNC();
CR_TIMER_OUT(CoarseBinInit);
CR_COUNT(CoarseBins, (thrInBlock == 0) ? 1 : 0, 0);
CR_COUNT(CoarseRoundsPerBin, 0, 1);
// Entire block: Merge input streams and process triangles.
if (!binEmpty)
do
{
//------------------------------------------------------------------------
// Merge.
//------------------------------------------------------------------------
CR_TIMER_IN(CoarseMerge);
CR_COUNT(CoarseRoundsPerBin, 1, 0);
CR_COUNT(CoarseMergePerRound, 0, 1);
// Entire block: Not enough triangles => merge and queue segments.
// NOTE: The bin exit criterion assumes that we queue more triangles than we actually need.
while (triQueueWritePos - triQueueReadPos <= CR_COARSE_WARPS * 32)
{
CR_COUNT(CoarseMergePerRound, 1, 0);
// First warp: Choose the segment with the lowest initial triangle index.
if (thrInBlock < CR_BIN_STREAMS_SIZE)
{
// Find the stream with the lowest triangle index.
U32 firstTri = s_binStreamFirstTri[thrInBlock];
U32 t = firstTri;
volatile U32* p = &s_scanTemp[0][thrInBlock + 16];
CR_TIMER_OUT(CoarseMerge);
CR_TIMER_IN(CoarseMergeSum);
#if (CR_BIN_STREAMS_SIZE > 1)
p[0] = t, t = ::min(t, p[-1]);
#endif
#if (CR_BIN_STREAMS_SIZE > 2)
p[0] = t, t = ::min(t, p[-2]);
#endif
#if (CR_BIN_STREAMS_SIZE > 4)
p[0] = t, t = ::min(t, p[-4]);
#endif
#if (CR_BIN_STREAMS_SIZE > 8)
p[0] = t, t = ::min(t, p[-8]);
#endif
#if (CR_BIN_STREAMS_SIZE > 16)
p[0] = t, t = ::min(t, p[-16]);
#endif
p[0] = t;
CR_TIMER_OUT_DEP(CoarseMergeSum, t);
CR_TIMER_IN(CoarseMerge);
// Consume and broadcast.
if (s_scanTemp[0][CR_BIN_STREAMS_SIZE - 1 + 16] == firstTri)
{
int segIdx = s_binStreamCurrSeg[thrInBlock];
s_binStreamSelectedOfs = segIdx << CR_BIN_SEG_LOG2;
if (segIdx != -1)
{
int segSize = binSegCount[segIdx];
int segNext = binSegNext[segIdx];
s_binStreamSelectedSize = segSize;
s_triQueueWritePos = triQueueWritePos + segSize;
s_binStreamCurrSeg[thrInBlock] = segNext;
s_binStreamFirstTri[thrInBlock] = (segNext == -1) ? ~0u : binSegData[segNext << CR_BIN_SEG_LOG2];
}
}
}
// No more segments => break.
__syncthreads();
triQueueWritePos = s_triQueueWritePos;
int segOfs = s_binStreamSelectedOfs;
if (segOfs < 0)
break;
int segSize = s_binStreamSelectedSize;
__syncthreads();
// Fetch triangles into the queue.
CR_TIMER_OUT(CoarseMerge);
CR_TIMER_IN(CoarseStreamRead);
for (int idxInSeg = CR_COARSE_WARPS * 32 - 1 - thrInBlock; idxInSeg < segSize; idxInSeg += CR_COARSE_WARPS * 32)
{
S32 triIdx = binSegData[segOfs + idxInSeg];
s_triQueue[(triQueueWritePos - segSize + idxInSeg) & (CR_COARSE_QUEUE_SIZE - 1)] = triIdx;
}
CR_TIMER_SYNC();
CR_TIMER_OUT(CoarseStreamRead);
CR_TIMER_IN(CoarseMerge);
}
// All threads: Clear emit masks.
for (int maskIdx = thrInBlock; maskIdx < CR_COARSE_WARPS * CR_BIN_SQR; maskIdx += CR_COARSE_WARPS * 32)
s_warpEmitMask[maskIdx >> (CR_BIN_LOG2 * 2)][maskIdx & (CR_BIN_SQR - 1)] = 0;
__syncthreads();
CR_TIMER_OUT(CoarseMerge);
//------------------------------------------------------------------------
// Raster.
//------------------------------------------------------------------------
// Triangle per thread: Read from the queue.
CR_TIMER_IN(CoarseTriRead);
int triIdx = -1;
if (triQueueReadPos + thrInBlock < triQueueWritePos)
triIdx = s_triQueue[(triQueueReadPos + thrInBlock) & (CR_COARSE_QUEUE_SIZE - 1)];
uint4 triData = make_uint4(0, 0, 0, 0);
if (triIdx != -1)
{
int dataIdx = triIdx >> 3;
int subtriIdx = triIdx & 7;
if (subtriIdx != 7)
dataIdx = triHeader[dataIdx].misc + subtriIdx;
triData = tex1Dfetch(t_triHeader, dataIdx);
}
CR_TIMER_SYNC();
CR_TIMER_OUT_DEP(CoarseTriRead, triData);
CR_COUNT(CoarseTrisPerRound, (triIdx == -1) ? 0 : 1, (thrInBlock == 0) ? 1 : 0);
// 32 triangles per warp: Record emits (= tile intersections).
CR_TIMER_IN(CoarseRasterize);
if (__any_sync(~0U, triIdx != -1))
{
S32 v0x = sub_s16lo_s16lo(triData.x, originX);
S32 v0y = sub_s16hi_s16lo(triData.x, originY);
S32 d01x = sub_s16lo_s16lo(triData.y, triData.x);
S32 d01y = sub_s16hi_s16hi(triData.y, triData.x);
S32 d02x = sub_s16lo_s16lo(triData.z, triData.x);
S32 d02y = sub_s16hi_s16hi(triData.z, triData.x);
// Compute tile-based AABB.
int lox = add_clamp_0_x((v0x + min_min(d01x, 0, d02x)) >> tileLog, 0, maxTileXInBin);
int loy = add_clamp_0_x((v0y + min_min(d01y, 0, d02y)) >> tileLog, 0, maxTileYInBin);
int hix = add_clamp_0_x((v0x + max_max(d01x, 0, d02x)) >> tileLog, 0, maxTileXInBin);
int hiy = add_clamp_0_x((v0y + max_max(d01y, 0, d02y)) >> tileLog, 0, maxTileYInBin);
int sizex = add_sub(hix, 1, lox);
int sizey = add_sub(hiy, 1, loy);
int area = sizex * sizey;
// Miscellaneous init.
U8* currPtr = (U8*)&s_warpEmitMask[threadIdx.y][lox + (loy << CR_BIN_LOG2)];
int ptrYInc = CR_BIN_SIZE * 4 - (sizex << 2);
U32 maskBit = 1 << threadIdx.x;
CR_COUNT(CoarseCaseA, 0, 1);
CR_COUNT(CoarseCaseB, 0, 1);
CR_COUNT(CoarseCaseC, 0, 1);
// Case A: All AABBs are small => record the full AABB using atomics.
if (__all_sync(~0U, sizex <= 2 && sizey <= 2))
{
CR_COUNT(CoarseCaseA, 100, 0);
CR_TIMER_OUT(CoarseRasterize);
CR_TIMER_IN(CoarseRasterAtomic);
if (triIdx != -1)
{
atomicOr((U32*)currPtr, maskBit);
if (sizex == 2) atomicOr((U32*)(currPtr + 4), maskBit);
if (sizey == 2) atomicOr((U32*)(currPtr + CR_BIN_SIZE * 4), maskBit);
if (sizex == 2 && sizey == 2) atomicOr((U32*)(currPtr + 4 + CR_BIN_SIZE * 4), maskBit);
}
CR_TIMER_OUT(CoarseRasterAtomic);
CR_TIMER_IN(CoarseRasterize);
}
else
{
// Compute warp-AABB (scan-32).
U32 aabbMask = add_sub(2 << hix, 0x20000 << hiy, 1 << lox) - (0x10000 << loy);
if (triIdx == -1)
aabbMask = 0;
volatile U32* p = &s_scanTemp[threadIdx.y][threadIdx.x + 16];
p[0] = aabbMask, aabbMask |= p[-1];
p[0] = aabbMask, aabbMask |= p[-2];
p[0] = aabbMask, aabbMask |= p[-4];
p[0] = aabbMask, aabbMask |= p[-8];
p[0] = aabbMask, aabbMask |= p[-16];
p[0] = aabbMask, aabbMask = s_scanTemp[threadIdx.y][47];
U32 maskX = aabbMask & 0xFFFF;
U32 maskY = aabbMask >> 16;
int wlox = findLeadingOne(maskX ^ (maskX - 1));
int wloy = findLeadingOne(maskY ^ (maskY - 1));
int whix = findLeadingOne(maskX);
int whiy = findLeadingOne(maskY);
int warea = (add_sub(whix, 1, wlox)) * (add_sub(whiy, 1, wloy));
// Initialize edge functions.
S32 d12x = d02x - d01x;
S32 d12y = d02y - d01y;
v0x -= lox << tileLog;
v0y -= loy << tileLog;
S32 t01 = v0x * d01y - v0y * d01x;
S32 t02 = v0y * d02x - v0x * d02y;
S32 t12 = d01x * d12y - d01y * d12x - t01 - t02;
S32 b01 = add_sub(t01 >> tileLog, ::max(d01x, 0), ::min(d01y, 0));
S32 b02 = add_sub(t02 >> tileLog, ::max(d02y, 0), ::min(d02x, 0));
S32 b12 = add_sub(t12 >> tileLog, ::max(d12x, 0), ::min(d12y, 0));
d01x += sizex * d01y;
d02x += sizex * d02y;
d12x += sizex * d12y;
// Case B: Warp-AABB is not much larger than largest AABB => Check tiles in warp-AABB, record using ballots.
if (__any_sync(~0U, warea * 4 <= area * 8))
{
CR_COUNT(CoarseCaseB, 100, 0);
if (triIdx != -1)
{
for (int y = wloy; y <= hiy; y++)
{
if (y < loy) continue;
for (int x = wlox; x <= hix; x++)
{
if (x < lox) continue;
*(U32*)currPtr = __ballot_sync(~0U, b01 >= 0 && b02 >= 0 && b12 >= 0);
currPtr += 4, b01 -= d01y, b02 += d02y, b12 -= d12y;
}
currPtr += ptrYInc, b01 += d01x, b02 -= d02x, b12 += d12x;
}
}
}
// Case C: General case => Check tiles in AABB, record using atomics.
else
{
CR_COUNT(CoarseCaseC, 100, 0);
CR_TIMER_OUT(CoarseRasterize);
CR_TIMER_IN(CoarseRasterAtomic);
if (triIdx != -1)
{
U8* skipPtr = currPtr + (sizex << 2);
U8* endPtr = currPtr + (sizey << (CR_BIN_LOG2 + 2));
do
{
if (b01 >= 0 && b02 >= 0 && b12 >= 0)
atomicOr((U32*)currPtr, maskBit);
currPtr += 4, b01 -= d01y, b02 += d02y, b12 -= d12y;
if (currPtr == skipPtr)
currPtr += ptrYInc, b01 += d01x, b02 -= d02x, b12 += d12x, skipPtr += CR_BIN_SIZE * 4;
}
while (currPtr != endPtr);
}
CR_TIMER_OUT(CoarseRasterAtomic);
CR_TIMER_IN(CoarseRasterize);
}
}
}
__syncthreads();
CR_TIMER_OUT(CoarseRasterize);
//------------------------------------------------------------------------
// Count.
//------------------------------------------------------------------------
CR_TIMER_IN(CoarseCount);
// Tile per thread: Initialize prefix sums.
for (int tileInBin = thrInBlock; tileInBin < CR_BIN_SQR; tileInBin += CR_COARSE_WARPS * 32)
{
// Compute prefix sum of emits over warps.
U8* srcPtr = (U8*)&s_warpEmitMask[0][tileInBin];
U8* dstPtr = (U8*)&s_warpEmitPrefixSum[0][tileInBin];
int tileEmits = 0;
for (int i = 0; i < CR_COARSE_WARPS; i++)
{
tileEmits += __popc(*(U32*)srcPtr);
*(U32*)dstPtr = tileEmits;
srcPtr += (CR_BIN_SQR + 1) * 4;
dstPtr += (CR_BIN_SQR + 1) * 4;
}
CR_COUNT(CoarseTilesPerRound, (tileEmits == 0) ? 0 : 1, (tileInBin == 0) ? 1 : 0);
// Determine the number of segments to allocate.
int spaceLeft = -s_tileStreamCurrOfs[tileInBin] & (CR_TILE_SEG_SIZE - 1);
int tileAllocs = (tileEmits - spaceLeft + CR_TILE_SEG_SIZE - 1) >> CR_TILE_SEG_LOG2;
volatile U32* p = &s_tileEmitPrefixSum[tileInBin + 1];
// All counters within the warp are small => compute prefix sum using ballot.
if (!__any_sync(~0U, tileEmits >= 2))
{
U32 m = getLaneMaskLe();
*p = (__popc(__ballot_sync(~0U, tileEmits & 1) & m) << emitShift) | __popc(__ballot_sync(~0U, tileAllocs & 1) & m);
}
// Otherwise => scan-32 within the warp.
else
{
CR_TIMER_OUT(CoarseCount);
CR_TIMER_IN(CoarseCountSum);
U32 sum = (tileEmits << emitShift) | tileAllocs;
*p = sum; if (threadIdx.x >= 1) sum += p[-1];
*p = sum; if (threadIdx.x >= 2) sum += p[-2];
*p = sum; if (threadIdx.x >= 4) sum += p[-4];
*p = sum; if (threadIdx.x >= 8) sum += p[-8];
*p = sum; if (threadIdx.x >= 16) sum += p[-16];
*p = sum;
CR_TIMER_OUT_DEP(CoarseCountSum, sum);
CR_TIMER_IN(CoarseCount);
}
}
// First warp: Scan-8.
__syncthreads();
CR_TIMER_OUT(CoarseCount);
CR_TIMER_IN(CoarseCountSum);
if (thrInBlock < CR_BIN_SQR / 32)
{
int sum = s_tileEmitPrefixSum[(thrInBlock << 5) + 32];
volatile U32* p = &s_scanTemp[0][thrInBlock + 16];
p[0] = sum;
#if (CR_BIN_SQR > 1 * 32)
sum += p[-1], p[0] = sum;
#endif
#if (CR_BIN_SQR > 2 * 32)
sum += p[-2], p[0] = sum;
#endif
#if (CR_BIN_SQR > 4 * 32)
sum += p[-4], p[0] = sum;
#endif
}
__syncthreads();
CR_TIMER_OUT(CoarseCountSum);
CR_TIMER_IN(CoarseCount);
// Tile per thread: Finalize prefix sums.
// Single thread: Allocate segments.
for (int tileInBin = thrInBlock; tileInBin < CR_BIN_SQR; tileInBin += CR_COARSE_WARPS * 32)
{
int sum = s_tileEmitPrefixSum[tileInBin + 1] + s_scanTemp[0][(tileInBin >> 5) + 15];
int numEmits = sum >> emitShift;
int numAllocs = sum & ((1 << emitShift) - 1);
s_tileEmitPrefixSum[tileInBin + 1] = numEmits;
s_tileAllocPrefixSum[tileInBin + 1] = numAllocs;
if (tileInBin == CR_BIN_SQR - 1 && numAllocs != 0)
{
int t = atomicAdd(&g_crAtomics.numTileSegs, numAllocs);
s_firstAllocSeg = (t + numAllocs <= c_crParams.maxTileSegs) ? t : 0;
}
}
__syncthreads();
int firstAllocSeg = s_firstAllocSeg;
int totalEmits = s_tileEmitPrefixSum[CR_BIN_SQR];
int totalAllocs = s_tileAllocPrefixSum[CR_BIN_SQR];
CR_COUNT(CoarseEmitsPerRound, totalEmits, 1);
CR_COUNT(CoarseAllocsPerRound, totalAllocs, 1);
CR_COUNT(CoarseEmitsPerTri, (thrInBlock == 0) ? totalEmits : 0, (triIdx == -1) ? 0 : 1);
CR_TIMER_OUT(CoarseCount);
//------------------------------------------------------------------------
// Emit.
//------------------------------------------------------------------------
CR_TIMER_IN(CoarseEmit);
// Emit per thread: Write triangle index to globalmem.
for (int emitInBin = thrInBlock; emitInBin < totalEmits; emitInBin += CR_COARSE_WARPS * 32)
{
// Find tile in bin.
U8* tileBase = (U8*)&s_tileEmitPrefixSum[0];
U8* tilePtr = tileBase;
U8* ptr;
#if (CR_BIN_SQR > 128)
ptr = tilePtr + 0x80 * 4; if (emitInBin >= *(U32*)ptr) tilePtr = ptr;
#endif
#if (CR_BIN_SQR > 64)
ptr = tilePtr + 0x40 * 4; if (emitInBin >= *(U32*)ptr) tilePtr = ptr;
#endif
#if (CR_BIN_SQR > 32)
ptr = tilePtr + 0x20 * 4; if (emitInBin >= *(U32*)ptr) tilePtr = ptr;
#endif
#if (CR_BIN_SQR > 16)
ptr = tilePtr + 0x10 * 4; if (emitInBin >= *(U32*)ptr) tilePtr = ptr;
#endif
#if (CR_BIN_SQR > 8)
ptr = tilePtr + 0x08 * 4; if (emitInBin >= *(U32*)ptr) tilePtr = ptr;
#endif
#if (CR_BIN_SQR > 4)
ptr = tilePtr + 0x04 * 4; if (emitInBin >= *(U32*)ptr) tilePtr = ptr;
#endif
#if (CR_BIN_SQR > 2)
ptr = tilePtr + 0x02 * 4; if (emitInBin >= *(U32*)ptr) tilePtr = ptr;
#endif
#if (CR_BIN_SQR > 1)
ptr = tilePtr + 0x01 * 4; if (emitInBin >= *(U32*)ptr) tilePtr = ptr;
#endif
int tileInBin = (tilePtr - tileBase) >> 2;
int emitInTile = emitInBin - *(U32*)tilePtr;
// Find warp in tile.
int warpStep = (CR_BIN_SQR + 1) * 4;
U8* warpBase = (U8*)&s_warpEmitPrefixSum[0][tileInBin] - warpStep;
U8* warpPtr = warpBase;
#if (CR_COARSE_WARPS > 8)
ptr = warpPtr + 0x08 * warpStep; if (emitInTile >= *(U32*)ptr) warpPtr = ptr;
#endif
#if (CR_COARSE_WARPS > 4)
ptr = warpPtr + 0x04 * warpStep; if (emitInTile >= *(U32*)ptr) warpPtr = ptr;
#endif
#if (CR_COARSE_WARPS > 2)
ptr = warpPtr + 0x02 * warpStep; if (emitInTile >= *(U32*)ptr) warpPtr = ptr;
#endif
#if (CR_COARSE_WARPS > 1)
ptr = warpPtr + 0x01 * warpStep; if (emitInTile >= *(U32*)ptr) warpPtr = ptr;
#endif
int warpInTile = (warpPtr - warpBase) >> (CR_BIN_LOG2 * 2 + 2);
U32 emitMask = *(U32*)(warpPtr + warpStep + ((U8*)s_warpEmitMask - (U8*)s_warpEmitPrefixSum));
int emitInWarp = emitInTile - *(U32*)(warpPtr + warpStep) + __popc(emitMask);
// Find thread in warp.
CR_TIMER_OUT_DEP(CoarseEmit, emitInWarp);
CR_TIMER_IN(CoarseEmitBitFind);
int threadInWarp = 0;
int pop = __popc(emitMask & 0xFFFF);
bool pred = (emitInWarp >= pop);
if (pred) emitInWarp -= pop;
if (pred) emitMask >>= 0x10;
if (pred) threadInWarp += 0x10;
pop = __popc(emitMask & 0xFF);
pred = (emitInWarp >= pop);
if (pred) emitInWarp -= pop;
if (pred) emitMask >>= 0x08;
if (pred) threadInWarp += 0x08;
pop = __popc(emitMask & 0xF);
pred = (emitInWarp >= pop);
if (pred) emitInWarp -= pop;
if (pred) emitMask >>= 0x04;
if (pred) threadInWarp += 0x04;
pop = __popc(emitMask & 0x3);
pred = (emitInWarp >= pop);
if (pred) emitInWarp -= pop;
if (pred) emitMask >>= 0x02;
if (pred) threadInWarp += 0x02;
if (emitInWarp >= (emitMask & 1))
threadInWarp++;
CR_TIMER_OUT_DEP(CoarseEmitBitFind, threadInWarp);
CR_TIMER_IN(CoarseEmit);
// Figure out where to write.
int currOfs = s_tileStreamCurrOfs[tileInBin];
int spaceLeft = -currOfs & (CR_TILE_SEG_SIZE - 1);
int outOfs = emitInTile;
if (outOfs < spaceLeft)
outOfs += currOfs;
else
{
int allocLo = firstAllocSeg + s_tileAllocPrefixSum[tileInBin];
outOfs += (allocLo << CR_TILE_SEG_LOG2) - spaceLeft;
}
// Write.
int queueIdx = warpInTile * 32 + threadInWarp;
int triIdx = s_triQueue[(triQueueReadPos + queueIdx) & (CR_COARSE_QUEUE_SIZE - 1)];
CR_TIMER_OUT_DEP(CoarseEmit, triIdx);
CR_TIMER_IN(CoarseStreamWrite);
tileSegData[outOfs] = triIdx;
CR_TIMER_OUT(CoarseStreamWrite);
CR_TIMER_IN(CoarseEmit);
}
CR_TIMER_SYNC();
CR_TIMER_OUT(CoarseEmit);
//------------------------------------------------------------------------
// Patch.
//------------------------------------------------------------------------
CR_TIMER_IN(CoarsePatch);
// Allocated segment per thread: Initialize next-pointer and count.
for (int i = CR_COARSE_WARPS * 32 - 1 - thrInBlock; i < totalAllocs; i += CR_COARSE_WARPS * 32)
{
int segIdx = firstAllocSeg + i;
tileSegNext[segIdx] = segIdx + 1;
tileSegCount[segIdx] = CR_TILE_SEG_SIZE;
}
// Tile per thread: Fix previous segment's next-pointer and update s_tileStreamCurrOfs.
__syncthreads();
for (int tileInBin = CR_COARSE_WARPS * 32 - 1 - thrInBlock; tileInBin < CR_BIN_SQR; tileInBin += CR_COARSE_WARPS * 32)
{
int oldOfs = s_tileStreamCurrOfs[tileInBin];
int newOfs = oldOfs + s_warpEmitPrefixSum[CR_COARSE_WARPS - 1][tileInBin];
int allocLo = s_tileAllocPrefixSum[tileInBin];
int allocHi = s_tileAllocPrefixSum[tileInBin + 1];
if (allocLo != allocHi)
{
S32* nextPtr = &tileSegNext[(oldOfs - 1) >> CR_TILE_SEG_LOG2];
if (oldOfs < 0)
nextPtr = &tileFirstSeg[binTileIdx + globalTileIdx(tileInBin)];
*nextPtr = firstAllocSeg + allocLo;
newOfs--;
newOfs &= CR_TILE_SEG_SIZE - 1;
newOfs |= (firstAllocSeg + allocHi - 1) << CR_TILE_SEG_LOG2;
newOfs++;
}
s_tileStreamCurrOfs[tileInBin] = newOfs;
}
CR_TIMER_SYNC();
CR_TIMER_OUT(CoarsePatch);
// Advance queue read pointer.
// Queue became empty => bin done.
triQueueReadPos += CR_COARSE_WARPS * 32;
}
while (triQueueReadPos < triQueueWritePos);
// Tile per thread: Fix next-pointer and count of the last segment.
// 32 tiles per warp: Count active tiles.
CR_TIMER_IN(CoarseBinDeinit);
__syncthreads();
for (int tileInBin = thrInBlock; tileInBin < CR_BIN_SQR; tileInBin += CR_COARSE_WARPS * 32)
{
int tileX = tileInBin & (CR_BIN_SIZE - 1);
int tileY = tileInBin >> CR_BIN_LOG2;
bool force = (c_crParams.deferredClear & tileX <= maxTileXInBin & tileY <= maxTileYInBin);
int ofs = s_tileStreamCurrOfs[tileInBin];
int segIdx = (ofs - 1) >> CR_TILE_SEG_LOG2;
int segCount = ofs & (CR_TILE_SEG_SIZE - 1);
if (ofs >= 0)
tileSegNext[segIdx] = -1;
else if (force)
{
s_tileStreamCurrOfs[tileInBin] = 0;
tileFirstSeg[binTileIdx + tileX + tileY * c_crParams.widthTiles] = -1;
}
if (segCount != 0)
tileSegCount[segIdx] = segCount;
s_scanTemp[0][(tileInBin >> 5) + 16] = __popc(__ballot_sync(~0U, ofs >= 0 | force));
}
// First warp: Scan-8.
// One thread: Allocate space for active tiles.
__syncthreads();
if (thrInBlock < CR_BIN_SQR / 32)
{
volatile U32* p = &s_scanTemp[0][thrInBlock + 16];
U32 sum = p[0];
#if (CR_BIN_SQR > 1 * 32)
sum += p[-1], p[0] = sum;
#endif
#if (CR_BIN_SQR > 2 * 32)
sum += p[-2], p[0] = sum;
#endif
#if (CR_BIN_SQR > 4 * 32)
sum += p[-4], p[0] = sum;
#endif
if (thrInBlock == CR_BIN_SQR / 32 - 1)
s_firstActiveIdx = atomicAdd(&g_crAtomics.numActiveTiles, sum);
}
// Tile per thread: Output active tiles.
__syncthreads();
for (int tileInBin = thrInBlock; tileInBin < CR_BIN_SQR; tileInBin += CR_COARSE_WARPS * 32)
{
if (s_tileStreamCurrOfs[tileInBin] < 0)
continue;
int activeIdx = s_firstActiveIdx;
activeIdx += s_scanTemp[0][(tileInBin >> 5) + 15];
activeIdx += __popc(__ballot_sync(~0U, true) & getLaneMaskLt());
activeTiles[activeIdx] = binTileIdx + globalTileIdx(tileInBin);
}
CR_TIMER_SYNC();
CR_TIMER_OUT(CoarseBinDeinit);
}
CR_TIMER_OUT(CoarseTotal);
CR_TIMER_DEINIT();
}
//------------------------------------------------------------------------
| [
"[email protected]"
] | |
effb0a81a93d06f0670d6db1fb732d12fecb6b80 | 383e7d7f7ef658896a76d89fa3a3d5fb215a0140 | /core/vsl/Templates/vsl_vector_io+vcl_vector+int--.cxx | 34d6d9cc4d6776cdbdc5c038543f57a9fe299acb | [] | no_license | aliosmanulusoy/Probabilistic-Volumetric-3D-Reconstruction | f9abd69f278a85c0133c3474eaee1c59e2d4f3e2 | cdb08ed893f88c245bd3c9cff1081182a4eaced9 | refs/heads/master | 2021-06-01T23:21:59.861182 | 2016-05-31T09:38:48 | 2016-05-31T09:38:48 | 58,373,814 | 60 | 26 | null | null | null | null | UTF-8 | C++ | false | false | 80 | cxx | #include <vsl/vsl_vector_io.hxx>
VSL_VECTOR_IO_INSTANTIATE( std::vector<int> );
| [
"[email protected]"
] | |
7238313f917830b2653e9fa360b58600da014e64 | 269e13a077d3ef90d4c352249fb6e32d2360a4ec | /leetcode/backtracking/039-Combination-Sum.cpp | 0154bc0d0444b6f346ee7934cbe4951bbb940cef | [] | no_license | luckyzahuo/Snorlax | d3df462ee484ecd338cde05869006f907e684153 | 51cf7e313fddee6fd00c2a276b43c48013375618 | refs/heads/master | 2023-08-21T11:02:01.975516 | 2021-10-10T08:50:40 | 2021-10-10T08:50:40 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,360 | cpp |
#include <vector>
#include <string>
#include <algorithm>
#include <iostream>
using namespace std;
/*
* 限制条件: candidates 中元素不重复，但可以重复选取， 目标 target 最多包含 150 个元素
* 下面采用纯粹的 回溯法 结果，无减枝
*/
class Solution {
private:
vector<vector<int>> result;
// 在 candidates[index...size()-1] 中选择和为 target 的一个或者多个数
void generateCombination(vector<int> &candidates, int target, int index, vector<int> &selected, int selected_target) {
if (selected_target > target)
return;
if (selected.size() > 150)
return;
if (selected_target == target) {
result.push_back(selected);
return;
}
for (int i = index; i < candidates.size(); i++) {
selected.push_back(candidates[i]);
selected_target += candidates[i];
generateCombination(candidates, target, i, selected, selected_target);
selected_target -= candidates[i];
selected.pop_back();
}
return;
}
public:
vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
vector<int> selected;
generateCombination(candidates, target, 0, selected, 0);
return result;
}
}; | [
"[email protected]"
] | |
80399ef6e80988ab3c9bf61d165ba914d02a2baf | fd1df64a192fad2595066a6822f5a1a69baea5d1 | /Lab1_qt/Lab/Output.cpp | 39b6b199a6abbdfc9823f5ad0198886347d148b1 | [] | no_license | k1-801/SOA | bf913f7fa47f7466d0b9d9b8e375e459469c1a3c | 3193bb4bf859ff12792d932aea4b9eb26a877c9a | refs/heads/master | 2020-07-27T02:51:47.981358 | 2019-09-18T15:36:49 | 2019-09-18T15:38:11 | 208,843,702 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,810 | cpp | #include "Output.hpp"
#include <QJsonDocument>
#include <QJsonObject>
#include <QJsonArray>
#include <QDomDocument>
#include <QVariant>
#include <QByteArray>
void Output::solve(const Input& i)
{
_sumResult = 0;
for(double t: i.sums()) _sumResult += t;
_sumResult *= i.k();
_mulResult = 1;
for(int t: i.muls()) _mulResult *= t;
_sorted = i.sums();
_sorted.reserve(i.sums().size() + i.muls().size());
for(int t: i.muls()) _sorted.push_back(t);
std::sort(_sorted.begin(), _sorted.end());
}
QByteArray Output::toXml()
{
QDomDocument doc;
QDomElement root = doc.createElement("Output");
doc.appendChild(root);
QDomElement xSumResult = doc.createElement("SumResult");
QDomElement xMulResult = doc.createElement("MulResult");
QDomElement xSorted = doc.createElement("SortedInputs");
root.appendChild(xSumResult);
root.appendChild(xMulResult);
root.appendChild(xSorted);
QDomText srt = doc.createTextNode(QVariant(_sumResult).toString());
QDomText mrt = doc.createTextNode(QVariant(_mulResult).toString());
xSumResult.appendChild(srt);
xMulResult.appendChild(mrt);
for(double t: _sorted)
{
QDomElement sel = doc.createElement("decimal");
xSorted.appendChild(sel);
QDomText selt = doc.createTextNode(QVariant(t).toString());
sel.appendChild(selt);
}
QByteArray result = doc.toByteArray();
// Remove all space symbols
result.replace(" ", "");
result.replace("\n", "");
return result;
}
QByteArray Output::toJson()
{
QJsonDocument doc;
QJsonObject root;
root["SumResult"] = _sumResult;
root["MulResult"] = _mulResult;
QJsonArray jsorted;
for(double t: _sorted) jsorted.push_back(t);
root["SortedInputs"] = jsorted;
doc.setObject(root);
QByteArray result = doc.toJson();
// Remove all space symbols
result.replace(" ", "");
result.replace("\n", "");
return result;
}
| [
"[email protected]"
] | |
1719ac5fb9bef052358599dbc336171989bb8080 | c0ce303049f732fd0219631a59a4b824316dffe8 | /Lab7/Lab7.ino | eb0ae0d1f75690e01830b67a7fe45404fdb4d50e | [] | no_license | DemonicKrace/Arduino | c02ef0c68940d4f326ca3007ef9c450890adfaba | 2cb65254526c4475e9ec9031bd893f5a95fb67c7 | refs/heads/master | 2021-01-18T23:01:08.011562 | 2016-06-18T10:03:28 | 2016-06-18T10:03:28 | 55,387,750 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,457 | ino | //Lab07-LCD 顯示器
/* Lab7 - 在 2x20 LCD 上顯示 "Hello World" 訊息
The circuit:
* LCD RS pin to digital pin 12
* LCD Enable pin to digital pin 11
* LCD D4 pin to digital pin 5
* LCD D5 pin to digital pin 4
* LCD D6 pin to digital pin 3
* LCD D7 pin to digital pin 2
* 10K Potentiometer:
* ends to +5V and ground
* wiper to LCD VO pin (pin 3)
This example code is in the public domain.
http://www.arduino.cc/en/Tutorial/LiquidCrystal
*/
// 引用 LiquidCrystal Library
#include <LiquidCrystal.h>
// 建立 LiquidCrystal 的變數 lcd
// LCD 接腳: rs, enable, d4, d5, d6, d7
// 對應到 Arduino 接腳: 12, 11, 5, 4, 3, 2
LiquidCrystal lcd(12, 11, 5, 4, 3, 2);
void setup() {
Serial.begin(9600);
// 設定 LCD 的行列數目 (2 x 16)
lcd.begin(16, 2);
// 列印 "Hello World" 訊息到 LCD 上
lcd.print("03050485");
// 將游標設到 column 0, line 1
// (注意: line 1 是第二行(row)，因為是從 0 開始數起):
lcd.setCursor(0, 1);
lcd.print("Hana Sun");
/*
// 列印 "Hello World" 訊息到 LCD 上
lcd.print("01160766");
// 將游標設到 column 0, line 1
// (注意: line 1 是第二行(row)，因為是從 0 開始數起):
lcd.setCursor(0, 1);
lcd.print("Krace");
*/
}
void loop() {
// // 列印 Arduino 重開之後經過的秒數
// lcd.print(millis()/1000);
while(Serial.available()){
lcd.write(Serial.read());
}
}
| [
"[email protected]"
] | |
4f395c6c3b9ccd3e66958f9b14cba5dadd11eb77 | 7e85a7f0dcb632e1575ae643ffdbb3fb8f0f8a18 | /Firmware/shared/Application/source/SensorController.cpp | 1b56829df29094e7ace0353e612f6ab090e9e098 | [
"MIT"
] | permissive | cemizm/AnySensePro | f63da3413df4ddc382bf06226f05dc607f595849 | 55d831e24f14c5c07c7c79b1bdf0412b8661cb89 | refs/heads/master | 2022-05-17T00:22:35.406444 | 2022-04-24T06:33:57 | 2022-04-24T06:33:57 | 41,855,329 | 4 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 662 | cpp | /*
* SensorController.cpp
*
* Created on: 11.03.2016
* Author: cem
*/
#include <SensorController.h>
#include <string.h>
#include "SensorFrSky.h"
#include <new>
namespace App
{
void SensorController::Init()
{
}
void SensorController::Run()
{
SensorAdapterBase::Procotol protocol = SensorAdapterBase::Procotol::FrSky;
for (;;)
{
m_active = nullptr;
memset(m_workspace, 0, SensorAdapterBase::Workspace);
switch (protocol)
{
case SensorAdapterBase::Procotol::FrSky:
m_active = new (m_workspace) SensorFrSky(m_usart);
break;
default:
return;
break;
}
m_active->Init();
m_active->Run();
}
}
} /* namespace App */
| [
"[email protected]"
] | |
326d82a7509de1f6c02ba2000ad91c1ca6ad5303 | 5674bf9a4efac928e83f74995d59dbf0a3738a02 | /Week-3/Day-17-numIslands.cpp | 1956b2ff1747511665d3f067adfc467c2e0e8d32 | [
"MIT"
] | permissive | utkarshavardhana/30-day-leetcoding-challenge | 3dff31c96a64e7baada6909c09408438309bacd3 | a47b14f74f28961a032d1f00ce710ea3dcb0d910 | refs/heads/master | 2022-04-26T07:37:33.716275 | 2020-05-02T04:10:12 | 2020-05-02T04:10:12 | 260,606,768 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,567 | cpp | class Solution {
public:
void traverse_island(int row_index, int column_index, vector<vector<char>>& grid) {
int rows = grid.size();
int columns = grid[0].size();
std::queue<int> indices;
grid[row_index][column_index] = -1;
if(row_index - 1 >= 0 && grid[row_index - 1][column_index] == '1') {
grid[row_index - 1][column_index] = -1;
indices.push((row_index - 1) * columns + column_index);
}
if(row_index + 1 < rows && grid[row_index + 1][column_index] == '1') {
grid[row_index + 1][column_index] = -1;
indices.push((row_index + 1) * columns + column_index);
}
if(column_index - 1 >= 0 && grid[row_index][column_index - 1] == '1') {
grid[row_index][column_index - 1] = -1;
indices.push(row_index * columns + column_index - 1);
}
if(column_index + 1 < columns && grid[row_index][column_index + 1] == '1') {
grid[row_index][column_index + 1] = -1;
indices.push(row_index * columns + column_index + 1);
}
while(!indices.empty()) {
int i = indices.front() / columns;
int j = indices.front() % columns;
indices.pop();
if(i - 1 >= 0 && grid[i - 1][j] == '1') {
grid[i - 1][j] = -1;
indices.push((i - 1) * columns + j);
}
if(i + 1 < rows && grid[i + 1][j] == '1') {
grid[i + 1][j] = -1;
indices.push((i + 1) * columns + j);
}
if(j - 1 >= 0 && grid[i][j - 1] == '1') {
grid[i][j - 1] = -1;
indices.push(i * columns + j - 1);
}
if(j + 1 < columns && grid[i][j + 1] == '1') {
grid[i][j + 1] = -1;
indices.push(i * columns + j + 1);
}
}
}
int numIslands(vector<vector<char>>& grid) {
if(grid.empty())
return 0;
int no_of_islands {0};
int rows = grid.size();
int columns = grid[0].size();
for(int i = 0; i < rows; ++i) {
for(int j = 0; j < columns; ++j) {
if(grid[i][j] == '1') {
traverse_island(i, j, grid);
++no_of_islands;
}
}
}
return no_of_islands;
}
};
| [
"[email protected]"
] | |
c0fb9182ff41f73e2b8ebdc0b17d6e21dc94cbbd | 53ccfcb1791374efb528e2248e05861f593ac76f | /Source/ImageIOLibrary/Private/Mac/ImageDialogManagerMac.cpp | ffb757d076348cde1c6d2ccf89e9ab2a3b0cf6f5 | [] | no_license | FunkyPizza/ImageIOLibrary | f9c2f7d64b5722c978f0899e404d2707385033df | e42a5f899469a9b7a1c5c5296bfb658eaf225fa8 | refs/heads/main | 2023-06-24T12:39:18.493349 | 2023-06-13T12:11:09 | 2023-06-13T12:11:09 | 378,493,125 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,128 | cpp | // Copyright 1998-2018 Epic Games, Inc. All Rights Reserved.
// Copyright Lambda Works, Samuel Metters 2020. All rights reserved.
// This class is responsible for Dialogs on the Windows platform.
#include "Mac/ImageDialogManagerMac.h"
#include "Mac/MacApplication.h"
#include "Misc/FeedbackContextMarkup.h"
#include "Mac/CocoaThread.h"
#include "Misc/Paths.h"
#include "Misc/ConfigCacheIni.h"
#include "Misc/Guid.h"
#include "HAL/FileManager.h"
class FCocoaScopeContext
{
public:
FCocoaScopeContext(void)
{
SCOPED_AUTORELEASE_POOL;
PreviousContext = [NSOpenGLContext currentContext];
}
~FCocoaScopeContext(void)
{
SCOPED_AUTORELEASE_POOL;
NSOpenGLContext *NewContext = [NSOpenGLContext currentContext];
if (PreviousContext != NewContext)
{
if (PreviousContext)
{
[PreviousContext makeCurrentContext];
}
else
{
[NSOpenGLContext clearCurrentContext];
}
}
}
private:
NSOpenGLContext *PreviousContext;
};
/**
* Custom accessory view class to allow choose kind of file extension
*/
@interface FileDialogAccessoryView : NSView
{
@private
NSPopUpButton *PopUpButton;
NSTextField *TextField;
NSSavePanel *DialogPanel;
NSMutableArray *AllowedFileTypes;
int32 SelectedExtension;
}
- (id)initWithFrame:(NSRect)frameRect dialogPanel:(NSSavePanel *)panel;
- (void)PopUpButtonAction:(id)sender;
- (void)AddAllowedFileTypes:(NSArray *)array;
- (void)SetExtensionsAtIndex:(int32)index;
- (int32)SelectedExtension;
@end
@implementation FileDialogAccessoryView
- (id)initWithFrame:(NSRect)frameRect dialogPanel:(NSSavePanel *)panel
{
self = [super initWithFrame:frameRect];
DialogPanel = panel;
FString FieldText = TEXT("File extension:");
CFStringRef FieldTextCFString = FPlatformString::TCHARToCFString(*FieldText);
TextField = [[NSTextField alloc] initWithFrame:NSMakeRect(0.0, 48.0, 90.0, 25.0)];
[TextField setStringValue:(NSString *)FieldTextCFString];
[TextField setEditable:NO];
[TextField setBordered:NO];
[TextField setBackgroundColor:[NSColor controlColor]];
PopUpButton = [[NSPopUpButton alloc] initWithFrame:NSMakeRect(88.0, 50.0, 160.0, 25.0)];
[PopUpButton setTarget:self];
[PopUpButton setAction:@selector(PopUpButtonAction:)];
[self addSubview:TextField];
[self addSubview:PopUpButton];
return self;
}
- (void)AddAllowedFileTypes:(NSMutableArray *)array
{
check(array);
AllowedFileTypes = array;
int32 ArrayCount = [AllowedFileTypes count];
if (ArrayCount)
{
[PopUpButton removeAllItems];
for (int32 Index = 0; Index < ArrayCount; Index += 2)
{
[PopUpButton addItemWithTitle:[AllowedFileTypes objectAtIndex:Index]];
}
// Set allowed extensions
[self SetExtensionsAtIndex:0];
}
else
{
// Allow all file types
[DialogPanel setAllowedFileTypes:nil];
}
}
- (void)PopUpButtonAction:(id)sender
{
NSInteger Index = [PopUpButton indexOfSelectedItem];
[self SetExtensionsAtIndex:Index];
}
- (void)SetExtensionsAtIndex:(int32)index
{
check([AllowedFileTypes count] >= index * 2);
SelectedExtension = index;
NSString *ExtsToParse = [AllowedFileTypes objectAtIndex:index * 2 + 1];
if ([ExtsToParse compare:@"*.*"] == NSOrderedSame)
{
[DialogPanel setAllowedFileTypes:nil];
}
else
{
NSArray *ExtensionsWildcards = [ExtsToParse componentsSeparatedByString:@";"];
NSMutableArray *Extensions = [NSMutableArray arrayWithCapacity:[ExtensionsWildcards count]];
for (int32 Index = 0; Index < [ExtensionsWildcards count]; ++Index)
{
NSString *Temp = [[ExtensionsWildcards objectAtIndex:Index] stringByTrimmingCharactersInSet:[NSCharacterSet characterSetWithCharactersInString:@"*."]];
[Extensions addObject:Temp];
}
[DialogPanel setAllowedFileTypes:Extensions];
}
}
- (int32)SelectedExtension
{
return SelectedExtension;
}
@end
bool ImageDialogManagerMac::OpenFileDial(const void *ParentWindowHandle, const FString &DialogTitle, const FString &DefaultPath, const FString &DefaultFile, const FString &FileTypes, bool MultipleFiles, TArray<FString> &OutFilenames)
{
int32 dummy = 0;
return FileDialShared(false, ParentWindowHandle, DialogTitle, DefaultPath, DefaultFile, FileTypes, MultipleFiles, OutFilenames, dummy);
}
bool ImageDialogManagerMac::SaveFileDial(const void *ParentWindowHandle, const FString &DialogTitle, const FString &DefaultPath, const FString &DefaultFile, const FString &FileTypes, bool MultipleFiles, TArray<FString> &OutFilenames)
{
int32 dummy = 0;
return FileDialShared(true, ParentWindowHandle, DialogTitle, DefaultPath, DefaultFile, FileTypes, MultipleFiles, OutFilenames, dummy);
}
bool ImageDialogManagerMac::FileDialShared(bool bSave, const void *ParentWindowHandle, const FString &DialogTitle, const FString &DefaultPath, const FString &DefaultFile, const FString &FileTypes, bool MultipleFiles, TArray<FString> &OutFilenames, int32 &OutFilterIndex)
{
bool bSuccess = false;
{
bSuccess = MainThreadReturn(^{
SCOPED_AUTORELEASE_POOL;
FCocoaScopeContext ContextGuard;
NSSavePanel *Panel = bSave ? [NSSavePanel savePanel] : [NSOpenPanel openPanel];
if (!bSave)
{
NSOpenPanel *OpenPanel = (NSOpenPanel *)Panel;
[OpenPanel setCanChooseFiles:true];
[OpenPanel setCanChooseDirectories:false];
[OpenPanel setAllowsMultipleSelection:MultipleFiles];
}
[Panel setCanCreateDirectories:bSave];
CFStringRef Title = FPlatformString::TCHARToCFString(*DialogTitle);
[Panel setTitle:(NSString *)Title];
CFRelease(Title);
CFStringRef DefaultPathCFString = FPlatformString::TCHARToCFString(*DefaultPath);
NSURL *DefaultPathURL = [NSURL fileURLWithPath:(NSString *)DefaultPathCFString];
[Panel setDirectoryURL:DefaultPathURL];
CFRelease(DefaultPathCFString);
CFStringRef FileNameCFString = FPlatformString::TCHARToCFString(*DefaultFile);
[Panel setNameFieldStringValue:(NSString *)FileNameCFString];
CFRelease(FileNameCFString);
FileDialogAccessoryView *AccessoryView = [[FileDialogAccessoryView alloc] initWithFrame:NSMakeRect(0.0, 0.0, 250.0, 85.0) dialogPanel:Panel];
[Panel setAccessoryView:AccessoryView];
TArray<FString> FileTypesArray;
int32 NumFileTypes = FileTypes.ParseIntoArray(FileTypesArray, TEXT("|"), true);
NSMutableArray *AllowedFileTypes = [NSMutableArray arrayWithCapacity:NumFileTypes];
if (NumFileTypes > 0)
{
for (int32 Index = 0; Index < NumFileTypes; ++Index)
{
CFStringRef Type = FPlatformString::TCHARToCFString(*FileTypesArray[Index]);
[AllowedFileTypes addObject:(NSString *)Type];
CFRelease(Type);
}
}
if ([AllowedFileTypes count] == 0)
{
[AllowedFileTypes addObject:@"All files"];
[AllowedFileTypes addObject:@""];
}
if ([AllowedFileTypes count] == 1)
{
[AllowedFileTypes addObject:@""];
}
[AccessoryView AddAllowedFileTypes:AllowedFileTypes];
bool bOkPressed = false;
NSWindow *FocusWindow = [[NSApplication sharedApplication] keyWindow];
NSInteger Result = [Panel runModal];
[AccessoryView release];
if (Result == NSModalResponseOK)
{
if (bSave)
{
TCHAR FilePath[MAC_MAX_PATH];
FPlatformString::CFStringToTCHAR((CFStringRef)[[Panel URL] path], FilePath);
new (OutFilenames) FString(FilePath);
}
else
{
NSOpenPanel *OpenPanel = (NSOpenPanel *)Panel;
for (NSURL *FileURL in [OpenPanel URLs])
{
TCHAR FilePath[MAC_MAX_PATH];
FPlatformString::CFStringToTCHAR((CFStringRef)[FileURL path], FilePath);
new (OutFilenames) FString(FilePath);
}
OutFilterIndex = [AccessoryView SelectedExtension];
}
// Make sure all filenames gathered have their paths normalized
for (auto OutFilenameIt = OutFilenames.CreateIterator(); OutFilenameIt; ++OutFilenameIt)
{
FString &OutFilename = *OutFilenameIt;
OutFilename = IFileManager::Get().ConvertToRelativePath(*OutFilename);
FPaths::NormalizeFilename(OutFilename);
}
bOkPressed = true;
}
[Panel close];
if (FocusWindow)
{
[FocusWindow makeKeyWindow];
}
return bOkPressed;
});
}
return bSuccess;
}
| [
"[email protected]"
] | |
41cf76762db7ce1207182be57df5caebb44bacc5 | f9d2d33e3ae3eeb95cdbb506ac0a5e668abf0d49 | /src/test/eurekacointests/eurekacointxconverter_tests.cpp | 020cc0e7b6d8ef6ca385b94ab666563653f0e0e4 | [
"MIT"
] | permissive | KeerthanaRamalingam/Coin18 | 8e1fc6122f63084f74d5e290d6475d139b5d4daa | 180dde33ee0b9998313cc20386e56e745619235d | refs/heads/master | 2023-04-04T06:21:09.568835 | 2021-04-14T09:05:09 | 2021-04-14T09:05:09 | 357,812,888 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,249 | cpp | #include <boost/test/unit_test.hpp>
#include <test/test_bitcoin.h>
#include <consensus/merkle.h>
#include <chainparams.h>
#include <miner.h>
#include <validation.h>
#include <util/convert.h>
//Tests data
CAmount value(5000000000LL - 1000);
dev::u256 gasPrice(3);
dev::u256 gasLimit(655535);
std::vector<unsigned char> address(ParseHex("abababababababababababababababababababab"));
std::vector<unsigned char> data(ParseHex("6060604052346000575b60398060166000396000f30060606040525b600b5b5b565b0000a165627a7a72305820a5e02d6fa08a384e067a4c1f749729c502e7597980b427d287386aa006e49d6d0029"));
CMutableTransaction createTX(std::vector<CTxOut> vout, uint256 hashprev = uint256()){
CMutableTransaction tx;
tx.vin.resize(1);
tx.vin[0].scriptSig = CScript() << OP_1;
tx.vin[0].prevout.hash = hashprev;
tx.vin[0].prevout.n = 0;
tx.vout.resize(1);
tx.vout = vout;
return tx;
}
void checkResult(bool isCreation, std::vector<EurekacoinTransaction> results, uint256 hash){
for(size_t i = 0; i < results.size(); i++){
if(isCreation){
BOOST_CHECK(results[i].isCreation());
BOOST_CHECK(results[i].receiveAddress() == dev::Address());
} else {
BOOST_CHECK(!results[i].isCreation());
BOOST_CHECK(results[i].receiveAddress() == dev::Address(address));
}
BOOST_CHECK(results[i].data() == data);
BOOST_CHECK(results[i].value() == value);
BOOST_CHECK(results[i].gasPrice() == gasPrice);
BOOST_CHECK(results[i].gas() == gasLimit);
BOOST_CHECK(results[i].sender() == dev::Address(address));
BOOST_CHECK(results[i].getNVout() == i);
BOOST_CHECK(results[i].getHashWith() == uintToh256(hash));
}
}
void runTest(bool isCreation, size_t n, CScript& script1, CScript script2 = CScript()){
mempool.clear();
TestMemPoolEntryHelper entry;
CMutableTransaction tx1, tx2;
std::vector<CTxOut> outs1 = {CTxOut(value, CScript() << OP_DUP << OP_HASH160 << address << OP_EQUALVERIFY << OP_CHECKSIG)};
tx1 = createTX(outs1);
uint256 hashParentTx = tx1.GetHash(); // save this txid for later use
mempool.addUnchecked(entry.Fee(1000).Time(GetTime()).SpendsCoinbase(true).FromTx(tx1));
std::vector<CTxOut> outs2;
for(size_t i = 0; i < n; i++){
if(script2 == CScript()){
outs2.push_back(CTxOut(value, script1));
} else {
if(i < n / 2){
outs2.push_back(CTxOut(value, script1));
} else {
outs2.push_back(CTxOut(value, script2));
}
}
}
tx2 = createTX(outs2, hashParentTx);
CTransaction transaction(tx2);
EurekacoinTxConverter converter(transaction, NULL);
ExtractEurekacoinTX eurekacoinTx;
BOOST_CHECK(converter.extractionEurekacoinTransactions(eurekacoinTx));
std::vector<EurekacoinTransaction> result = eurekacoinTx.first;
if(script2 == CScript()){
BOOST_CHECK(result.size() == n);
} else {
BOOST_CHECK(result.size() == n / 2);
}
checkResult(isCreation, result, tx2.GetHash());
}
void runFailingTest(bool isCreation, size_t n, CScript& script1, CScript script2 = CScript()){
mempool.clear();
TestMemPoolEntryHelper entry;
CMutableTransaction tx1, tx2;
std::vector<CTxOut> outs1 = {CTxOut(value, CScript() << OP_DUP << OP_HASH160 << address << OP_EQUALVERIFY << OP_CHECKSIG)};
tx1 = createTX(outs1);
uint256 hashParentTx = tx1.GetHash(); // save this txid for later use
mempool.addUnchecked(entry.Fee(1000).Time(GetTime()).SpendsCoinbase(true).FromTx(tx1));
std::vector<CTxOut> outs2;
for(size_t i = 0; i < n; i++){
if(script2 == CScript()){
outs2.push_back(CTxOut(value, script1));
} else {
if(i < n / 2){
outs2.push_back(CTxOut(value, script1));
} else {
outs2.push_back(CTxOut(value, script2));
}
}
}
tx2 = createTX(outs2, hashParentTx);
CTransaction transaction(tx2);
EurekacoinTxConverter converter(transaction, NULL);
ExtractEurekacoinTX eurekacoinTx;
BOOST_CHECK(!converter.extractionEurekacoinTransactions(eurekacoinTx));
}
BOOST_FIXTURE_TEST_SUITE(eurekacointxconverter_tests, TestingSetup)
BOOST_AUTO_TEST_CASE(parse_txcreate){
CScript script1 = CScript() << CScriptNum(VersionVM::GetEVMDefault().toRaw()) << CScriptNum(int64_t(gasLimit)) << CScriptNum(int64_t(gasPrice)) << data << OP_CREATE;
runTest(true, 1, script1);
}
BOOST_AUTO_TEST_CASE(parse_txcall){
CScript script1 = CScript() << CScriptNum(VersionVM::GetEVMDefault().toRaw()) << CScriptNum(int64_t(gasLimit)) << CScriptNum(int64_t(gasPrice)) << data << address << OP_CALL;
runTest(false, 1, script1);
}
BOOST_AUTO_TEST_CASE(parse_txcall_mixed){
CScript script1 = CScript() << CScriptNum(VersionVM::GetEVMDefault().toRaw()) << CScriptNum(int64_t(gasLimit)) << CScriptNum(int64_t(gasPrice)) << data << address << OP_CALL;
CScript script2 = CScript() << OP_TRUE;
runTest(false, 1, script1, script2);
}
BOOST_AUTO_TEST_CASE(parse_txcreate_many_vout){
CScript script1 = CScript() << CScriptNum(VersionVM::GetEVMDefault().toRaw()) << CScriptNum(int64_t(gasLimit)) << CScriptNum(int64_t(gasPrice)) << data << OP_CREATE;
runTest(true, 120, script1);
}
BOOST_AUTO_TEST_CASE(parse_txcreate_many_vout_mixed){
CScript script1 = CScript() << CScriptNum(VersionVM::GetEVMDefault().toRaw()) << CScriptNum(int64_t(gasLimit)) << CScriptNum(int64_t(gasPrice)) << data << OP_CREATE;
CScript script2 = CScript() << OP_TRUE;
runTest(true, 120, script1, script2);
}
BOOST_AUTO_TEST_CASE(parse_txcall_many_vout){
CScript script1 = CScript() << CScriptNum(VersionVM::GetEVMDefault().toRaw()) << CScriptNum(int64_t(gasLimit)) << CScriptNum(int64_t(gasPrice)) << data << address << OP_CALL;
runTest(false, 120, script1);
}
BOOST_AUTO_TEST_CASE(parse_incorrect_txcreate_many){
CScript script1 = CScript() << CScriptNum(VersionVM::GetEVMDefault().toRaw()) << CScriptNum(int64_t(gasLimit)) << CScriptNum(int64_t(gasPrice)) << data << OP_CREATE;
CScript script2 = CScript() << CScriptNum(VersionVM::GetEVMDefault().toRaw()) << CScriptNum(int64_t(gasLimit)) << CScriptNum(int64_t(gasPrice)) << data << address << OP_CREATE;
runFailingTest(true, 120, script1, script2);
}
BOOST_AUTO_TEST_CASE(parse_incorrect_txcreate_few){
CScript script1 = CScript() << CScriptNum(VersionVM::GetEVMDefault().toRaw()) << CScriptNum(int64_t(gasLimit)) << CScriptNum(int64_t(gasPrice)) << data << OP_CREATE;
CScript script2 = CScript() << CScriptNum(VersionVM::GetEVMDefault().toRaw()) << CScriptNum(int64_t(gasLimit)) << CScriptNum(int64_t(gasPrice)) << OP_CREATE;
runFailingTest(true, 120, script1, script2);
}
BOOST_AUTO_TEST_CASE(parse_incorrect_txcall_many){
CScript script1 = CScript() << CScriptNum(VersionVM::GetEVMDefault().toRaw()) << CScriptNum(int64_t(gasLimit)) << CScriptNum(int64_t(gasPrice)) << data << address << OP_CALL;
CScript script2 = CScript() << CScriptNum(VersionVM::GetEVMDefault().toRaw()) << CScriptNum(int64_t(gasLimit)) << CScriptNum(int64_t(gasPrice)) << data << address << address << OP_CALL;
runFailingTest(false, 120, script1, script2);
}
BOOST_AUTO_TEST_CASE(parse_incorrect_txcall_few){
CScript script1 = CScript() << CScriptNum(VersionVM::GetEVMDefault().toRaw()) << CScriptNum(int64_t(gasLimit)) << CScriptNum(int64_t(gasPrice)) << data << address << OP_CALL;
CScript script2 = CScript() << CScriptNum(VersionVM::GetEVMDefault().toRaw()) << CScriptNum(int64_t(gasLimit)) << CScriptNum(int64_t(gasPrice)) << data << OP_CALL;
runFailingTest(false, 120, script1, script2);
}
BOOST_AUTO_TEST_CASE(parse_incorrect_txcall_overflow){
CScript script1 = CScript() << CScriptNum(VersionVM::GetEVMDefault().toRaw()) << CScriptNum(int64_t(gasLimit)) << CScriptNum(int64_t(gasPrice)) << data << address << OP_CALL;
CScript script2 = CScript() << CScriptNum(VersionVM::GetEVMDefault().toRaw()) << CScriptNum(int64_t(0x80841e0000000000)) << CScriptNum(int64_t(0x0100000000000000)) << data << address << OP_CALL;
runFailingTest(false, 120, script1, script2);
}
BOOST_AUTO_TEST_SUITE_END()
| [
"[email protected]"
] | |
2b8ba2720c0415d05ca114b06f0c41495e3cf4dd | 6792b502f067667680a9c8b1431664b7aa135195 | /Practica2/ParpadeoDiferentesFrecuencias.ino | 961d7091b6624c6b23ea1e32d9354e85ab0ed4e6 | [] | no_license | josedavid980111/PM_Practica_1 | dd4b75276d742286f4cb29ab86eab6a1e65d3092 | f6606ed3dfb5e18e6998dd8cbe7eb13cdb885d7a | refs/heads/master | 2020-12-26T12:12:16.788870 | 2020-05-23T03:57:25 | 2020-05-23T03:57:25 | 237,505,305 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,290 | ino | void setup()
{
DDRB = DDRB | B00111100; // Data Direction Register B: Inputs 0-6, Output 7
}
void loop()
{
asm (
"inicio: \n\t"
"sbi 0x05,0x05 \n\t"
"sbi 0x05,0x04 \n\t"
"sbi 0x05,0x03 \n\t"
"sbi 0x05,0x02 \n\t"
"call tiempo \n\t"
"cbi 0x05,0x05 \n\t"
"call tiempo \n\t"
"sbi 0x05,0x05 \n\t"
"cbi 0x05,0x04 \n\t"
"call tiempo \n\t"
"cbi 0x05,0x05 \n\t"
"call tiempo \n\t"
"cbi 0x05,0x03 \n\t"
"sbi 0x05,0x05 \n\t"
"sbi 0x05,0x04 \n\t"
"call tiempo \n\t"
"cbi 0x05,0x05 \n\t"
"call tiempo \n\t"
"sbi 0x05,0x05 \n\t"
"cbi 0x05,0x04 \n\t"
"call tiempo \n\t"
"cbi 0x05,0x05 \n\t"
"call tiempo \n\t"
"cbi 0x05,0x02 \n\t"
"sbi 0x05,0x03 \n\t"
"sbi 0x05,0x05 \n\t"
"sbi 0x05,0x04 \n\t"
"call tiempo \n\t"
"cbi 0x05,0x05 \n\t"
"call tiempo \n\t"
"sbi 0x05,0x05 \n\t"
"cbi 0x05,0x04 \n\t"
"call tiempo \n\t"
"cbi 0x05,0x05 \n\t"
"call tiempo \n\t"
"cbi 0x05,0x03 \n\t"
"sbi 0x05,0x05 \n\t"
"sbi 0x05,0x04 \n\t"
"call tiempo \n\t"
"cbi 0x05,0x05 \n\t"
"call tiempo \n\t"
"sbi 0x05,0x05 \n\t"
"cbi 0x05,0x04 \n\t"
"call tiempo \n\t"
"cbi 0x05,0x05 \n\t"
"call tiempo \n\t"
"sbi 0x05,0x02 \n\t"
"sbi 0x05,0x05 \n\t"
"sbi 0x05,0x04 \n\t"
"sbi 0x05,0x03 \n\t"
"call tiempo \n\t"
"cbi 0x05,0x05 \n\t"
"call tiempo \n\t"
"sbi 0x05,0x05 \n\t"
"cbi 0x05,0x04 \n\t"
"call tiempo \n\t"
"cbi 0x05,0x05 \n\t"
"call tiempo \n\t"
"sbi 0x05,0x05 \n\t"
"sbi 0x05,0x04 \n\t"
"cbi 0x05,0x03 \n\t"
"call tiempo \n\t"
"cbi 0x05,0x05 \n\t"
"call tiempo \n\t"
"sbi 0x05,0x05 \n\t"
"cbi 0x05,0x04 \n\t"
"call tiempo \n\t"
"cbi 0x05,0x05 \n\t"
"call tiempo \n\t"
"cbi 0x05,0x02 \n\t"
"sbi 0x05,0x03 \n\t"
"sbi 0x05,0x05 \n\t"
"sbi 0x05,0x04 \n\t"
"call tiempo \n\t"
"cbi 0x05,0x05 \n\t"
"call tiempo \n\t"
"sbi 0x05,0x05 \n\t"
"cbi 0x05,0x04 \n\t"
"call tiempo \n\t"
"cbi 0x05,0x05 \n\t"
"call tiempo \n\t"
"cbi 0x05,0x03 \n\t"
"sbi 0x05,0x05 \n\t"
"sbi 0x05,0x04 \n\t"
"call tiempo \n\t"
"cbi 0x05,0x05 \n\t"
"call tiempo \n\t"
"sbi 0x05,0x05 \n\t"
"cbi 0x05,0x04 \n\t"
"call tiempo \n\t"
"cbi 0x05,0x05 \n\t"
"call tiempo \n\t"
"jmp main \n\t"
"tiempo: \n\t"
"LDI r22, 20 \n\t"
"LOOP_3: \n\t"
"LDI r21, 255 \n\t"
"LOOP_2: \n\t"
"LDI r20, 255 \n\t"
"LOOP_1: \n\t"
"DEC r20 \n\t"
"BRNE LOOP_1 \n\t"
"DEC r21 \n\t"
"BRNE LOOP_2 \n\t"
"DEC r22 \n\t"
"BRNE LOOP_3 \n\t"
"ret \n\t"
);
}
| [
"[email protected]"
] | |
17d1e53847ceae22fd33afd043613587af6bf765 | 4128d588f23212348527405372c86a6738248080 | /power_logger/power_logger.ino | 0b54393b126be29b8b9e6f6e336577b0229d3513 | [] | no_license | cosailer/arduino_tests | 71742e8fd04c54c3e49449957ddb0063a1288dc2 | 9340e4bf91fc5f623439771271da9863ff107029 | refs/heads/master | 2023-02-11T00:41:42.388068 | 2021-01-13T19:15:16 | 2021-01-13T19:15:16 | 329,407,321 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,980 | ino | #include <Wire.h>
#include <SPI.h>
//#include <Adafruit_GFX.h>
#include <Adafruit_PCD8544.h>
#include <Adafruit_INA219.h>
//#include "SdFat.h"
//SdFat SD;
//File file_log;
// Software SPI (slower updates, more flexible pin options):
// pin C3 - 19 - Serial clock out (SCLK)
// pin C2 - 18 - Serial data out (DIN)
// pin D7 - 15 - Data/Command select (D/C)
// pin D6 - 14 - LCD chip select (CS)
// pin D5 - 13 - LCD reset (RST)
Adafruit_PCD8544 display = Adafruit_PCD8544(19, 18, 15, 14, 13);
Adafruit_INA219 ina219;
unsigned long last_power = 0;
unsigned long last_sd = 0;
uint16_t interval_power = 100;
uint16_t interval_sd = 1000;
unsigned long time_current = 0;
float shuntvoltage = 0;
float busvoltage = 0;
float current_mA = 0;
float loadvoltage = 0;
float energy = 0;
//#define PWR_PIN 11
void setup()
{
//switch on relay
//pinMode(PWR_PIN, OUTPUT);
//digitalWrite(PWR_PIN, HIGH);
display.begin();
display.setContrast(55);
display.clearDisplay();
display.setTextColor(BLACK);
display.setTextSize(1);
display.setCursor(0, 0);
//display.println("flag 1");
//display.display();
delay(1000);
Serial.begin(115200);
Wire.begin();
ina219.begin();
//SD.begin(SS);
}
void loop()
{
time_current = millis();
if (time_current - last_power >= interval_power)
{
last_power = time_current;
ina219_get_values();
display_data();
Serial.print('[');
Serial.print(time_current);
Serial.print(", ");
Serial.print(loadvoltage);
Serial.print(", ");
Serial.print(current_mA);
Serial.print(", ");
Serial.print(energy);
Serial.println(']');
/*
if( busvoltage < 2850 )
{
digitalWrite(PWR_PIN, LOW);
display.clearDisplay();
display.setTextColor(BLACK);
display.setTextSize(1);
display.setCursor(0, 0);
display.println("discharge");
display.println("complete");
display.print(" E=");
display.print(energy);
display.println("mWh");
display.display();
//stuck here
while(1) { delay(1000); }
}
else
{
display_data();
}
*/
}
/*
if (time_current - last_sd >= interval_sd)
{
last_sd = time_current;
file_log = SD.open("power.txt", FILE_WRITE);
if (file_log)
{
file_log.print(time_current);
file_log.print(", ");
file_log.print(loadvoltage);
file_log.print(", ");
file_log.print(current_mA);
file_log.print(", ");
file_log.println(energy);
file_log.close();
}
}
*/
}
void display_data()
{
display.clearDisplay();
display.setTextColor(BLACK);
display.setTextSize(1);
display.setCursor(0, 0);
display.print("Ul=");
display.print(loadvoltage);
display.println("mV");
display.print("Us=");
display.print(shuntvoltage);
display.println("mV");
display.print("Ub=");
display.print(busvoltage);
display.println("mV");
display.print(" I=");
display.print(current_mA);
display.println("mA");
//display.print(" P=");
//display.print(loadvoltage * current_mA);
//display.println("mW");
display.print(" E=");
display.print(energy);
display.println("mWh");
display.display();
}
void ina219_get_values()
{
shuntvoltage = ina219.getShuntVoltage_mV(); //in mV
busvoltage = ina219.getBusVoltage_raw(); //in mV
current_mA = ina219.getCurrent_mA(); //in mA
loadvoltage = busvoltage + shuntvoltage; //in mV
// mWh = (mv)*(ma)*(0.1s)/1000 = mv*ma*1/36000/1000
energy = energy + loadvoltage * current_mA / 36000000;
}
| [
"[email protected]"
] | |
eadb87b0c1fbef9355cc3b1344e5a95496ab0915 | 38a4b7447af49a6d14fca3c38e6beda0b3f8564d | /src/Server.cpp | ae42b9b5ecfd41b80079622490b353d024f0faee | [
"MIT"
] | permissive | fancyqlx/socketx | 749f0b431e007ae947f8134208520d79e4da29f2 | 36099c329614516ba6d2790291a22033d5fd7ee7 | refs/heads/master | 2021-01-25T11:27:52.600392 | 2018-07-10T01:55:46 | 2018-07-10T01:55:46 | 93,928,218 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,345 | cpp | #include "Server.hpp"
namespace socketx{
Server::Server(EventLoop *loop, std::string port):
loop_(loop),
port_(port),
socket_(std::make_shared<ServerSocket>(loop, port)){
socket_->setNewConnctionFunc(std::bind(&Server::newConnection, this, std::placeholders::_1));
}
Server::~Server(){
for(auto it=connectionsMap.begin();it!=connectionsMap.end();++it){
it->second->handleClose();
}
}
void Server::start(){
socket_->listen();
}
void Server::newConnection(int fd){
currentConn = std::make_shared<Connection>(loop_, fd);
if(!connectionsMap.count(fd)){
connectionsMap[fd] = currentConn;
currentConn->setHandleCloseEvents(std::bind(&Server::removeConnection, this, std::placeholders::_1));
/* Run user defined function for new connection*/
handleConnectionFunc(currentConn);
}
else{
printf("Error: existing file descriptor for a new connection!\n");
}
}
void Server::removeConnection(std::shared_ptr<Connection> conn){
int fd = conn->getFD();
auto it = connectionsMap.find(fd);
connectionsMap.erase(it);
/*Run user defined function for closing connection*/
handleCloseEvents(conn);
}
} | [
"[email protected]"
] | |
e471218354b81d9a9ff75cfaecbf5e5816902009 | 527739ed800e3234136b3284838c81334b751b44 | /include/RED4ext/Types/generated/ink/PlatformSpecificVideoController.hpp | 4c4f16d4a8e1144fd0d3c6f8e0ae64d2e1393463 | [
"MIT"
] | permissive | 0xSombra/RED4ext.SDK | 79ed912e5b628ef28efbf92d5bb257b195bfc821 | 218b411991ed0b7cb7acd5efdddd784f31c66f20 | refs/heads/master | 2023-07-02T11:03:45.732337 | 2021-04-15T16:38:19 | 2021-04-15T16:38:19 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 877 | hpp | #pragma once
// This file is generated from the Game's Reflection data
#include <cstdint>
#include <RED4ext/Common.hpp>
#include <RED4ext/REDhash.hpp>
#include <RED4ext/Types/SimpleTypes.hpp>
#include <RED4ext/Types/generated/ink/WidgetLogicController.hpp>
namespace RED4ext
{
struct Bink;
namespace ink {
struct PlatformSpecificVideoController : ink::WidgetLogicController
{
static constexpr const char* NAME = "inkPlatformSpecificVideoController";
static constexpr const char* ALIAS = "PlatformSpecificVideoController";
RaRef<Bink> video; // 68
RaRef<Bink> video_PS4; // 70
RaRef<Bink> video_XB1; // 78
bool isLooped; // 80
uint8_t unk81[0x88 - 0x81]; // 81
};
RED4EXT_ASSERT_SIZE(PlatformSpecificVideoController, 0x88);
} // namespace ink
using PlatformSpecificVideoController = ink::PlatformSpecificVideoController;
} // namespace RED4ext
| [
"[email protected]"
] | |
d8702e4aae66ce3e586a61b5ff9375a9271b23ae | e28f6e8858453831f84b5c728f8bec120651d5dc | /include/pacman/Ghost.hpp | 06c654a4b6553780e22af0cd35fd9f299e2a33aa | [
"MIT"
] | permissive | 197708156EQUJ5/pac-man | 26d7e8b9d2dc39e4d91d3b18dff07e11d3350813 | 30501ac43b9bcdd94b3cbb848c597882fc268492 | refs/heads/main | 2023-01-20T02:37:31.129449 | 2020-11-23T01:19:30 | 2020-11-23T01:19:30 | 314,895,219 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 328 | hpp | #pragma once
#include "Character.hpp"
namespace pacman
{
class Ghost : Character
{
public:
Ghost() = default;
~Ghost() = default;
int getX();
int getY();
void setX(int x);
void setY(int y);
void setDirection(Direction &direction);
void move();
void respawn();
};
} // namespace pacman
| [
"[email protected]"
] | |
4311dc8f24441dfc85d5102a75d0ff98443944ad | 6f0ecf48bbf3adfa20cf54e1169c702ebf065ad0 | /tema_demo/main.cpp | 72edfbda49f719096a3539aa75aea528038ab752 | [] | no_license | OanaVasut/year1 | 47c551b3a7d2df8540c4fe38684e306bdb22fc2e | e3c1b916bcccee479177512525150b1725fcbaa6 | refs/heads/master | 2020-03-17T07:09:24.697450 | 2018-05-28T10:40:38 | 2018-05-28T10:40:38 | 133,386,294 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 197 | cpp | /*
* short, long int - intreg, 5
* double - real, 3.45
* float - real 3.65
* char - caracter 'g'
*
* 00 00 00 00 - 0
* 00 10 00 01 - !
*/
int main(int argc, char *argv[]){
return 0;
}
| [
"[email protected]"
] | |
bf3550b89ec34295db06c78b5110d91c727c1fe7 | 23017336d25e6ec49c4a51f11c1b3a3aa10acf22 | /csc3750/prog2/Scene.h | 21b801a8cef94c88d6eee2a82feeb8ab42865b44 | [] | no_license | tjshaffer21/School | 5e7681c96e0c10966fc7362931412c4244507911 | 4aa5fc3a8bbbbb8d46d045244e8a7f84e71c768f | refs/heads/master | 2020-05-27T19:05:06.422314 | 2011-05-17T19:55:40 | 2011-05-17T19:55:40 | 1,681,224 | 1 | 1 | null | 2017-07-29T13:35:54 | 2011-04-29T15:36:55 | C++ | UTF-8 | C++ | false | false | 397 | h | #if !defined (SCENE_H)
#define SCENE_H
/**
* Thomas Shaffer
* Scene
* 28 Septemeber 2009
*
*/
#include "InstanceObject.h"
class Scene
{
private:
List<InstanceObject>* scene;
Matrix* wnd;
public:
Scene( Matrix* wnd );
virtual ~Scene();
void addIO( InstanceObject* io );
void render( Pixel* pix );
};
#endif
| [
"[email protected]"
] | |
b22c3fb99706c9ccf974d231a10bf7d84b425104 | 30972996fe49561473ee697f76e20b3407a65d96 | /9_task/src/test/Where_test.cpp | b6b33cf3188defa0caeba45c2cc11100da201606 | [] | no_license | carpawell/system_programming | 6918fa360b5b1e236221ee10542220002ae2534f | a5f4a6f91eac8f14958195affa8499df1acf7a4a | refs/heads/master | 2022-03-30T09:52:34.125283 | 2020-01-23T07:50:40 | 2020-01-23T07:50:40 | 234,906,325 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 897 | cpp | #include <gtest/gtest.h>
#include "myproject/4_task/matrix.h"
using namespace std;
struct where_param {
Matrix<int> input1;
Matrix<int> input2;
Matrix<int> expected_output;
};
class where_test: public ::testing::TestWithParam<where_param> {};
TEST_P(where_test, _) {
const where_param& param = GetParam();
Matrix<int> a{param.input1}, b{param.input2};
Matrix<int> c = where(a < b, a, b);
EXPECT_EQ(param.expected_output, c);
}
INSTANTIATE_TEST_CASE_P(
_,
where_test,
::testing::Values(
where_param {
{{1, 2}, {3, 4}},
{{2, 1}, {4, 3}},
{{1, 1}, {3, 3}}
},
where_param {
{1, 2, 3, 4, 5},
{5, 4, 3, 2, 1},
{1, 2, 3, 2, 1}
},
where_param {
{{1, 2, 3}, {4, 5, 6}, {7, 8, 9}},
{{10, 9, 8}, {7, 6, 5}, {4, 3, 2}},
{{1, 2, 3}, {4, 5, 5}, {4, 3, 2}}
}
)
);
| [
"[email protected]"
] | |
d339e5840f017d1845216fbdb0738f8022927a39 | d2c3ceb8041d5355d173cd43192969784ac7e478 | /OPI/2023/Seleccion IOI/Contest 2/Códigos/D/solution.cpp | 18988fb5d241ae2020df7427b97af3f71a4fc108 | [
"MIT"
] | permissive | FOPInformatica/soluciones | cebaece2b42a3b8bfb1ae859fb266845bae57036 | d47dafbb1e8d81c8dac487c544ceedec21ef4e3d | refs/heads/master | 2023-07-05T23:56:50.725854 | 2023-06-26T00:36:05 | 2023-06-26T00:36:05 | 92,699,750 | 8 | 1 | MIT | 2022-06-06T19:44:48 | 2017-05-29T02:11:52 | C++ | UTF-8 | C++ | false | false | 1,173 | cpp | #include <bits/stdc++.h>
#define eb emplace_back
#define re(x, y, z) for (int x=y; x<z; ++x)
#define trav(v, x) for (auto v : x)
using namespace std;
using vi = vector<int>;
using ll = long long;
using vll = vector<ll>;
using iii = pair<pair<int, int>, int>;
const int maxn = 2e3 + 10;
struct Node {
int to, t, c;
Node() {}
Node(int to, int t, int c):
to(to), t(t), c(c) {}
};
vector<Node> g[maxn];
int n, m;
vll dikjstra(int s) {
priority_queue<iii, vector<iii>, greater<iii>> Q;
vll res(n+1, LLONG_MAX);
vi tim(n+1, INT_MAX);
Q.push({{0, 0}, s});
while (!Q.empty()) {
auto q = Q.top(); Q.pop();
int v = q.second;
int t = q.first.second, c = q.first.first;
res[v] = min(res[v], t*1ll*c);
if (tim[v] < t) continue;
else tim[v] = t;
trav(e, g[v]) {
Q.push({{c+e.c, t+e.t}, e.to});
}
}
for (int i = 1; i <= n; ++i) {
if (res[i] == LLONG_MAX) res[i] = -1;
}
return res;
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < m; ++i) {
int a, b, t, c;
scanf("%d%d%d%d", &a, &b, &t, &c);
g[a].eb(b, t, c);
g[b].eb(a, t, c);
}
vll res = dikjstra(1);
for (int i = 2; i <= n; ++i) {
printf("%lld\n", res[i]);
}
return 0;
}
| [
"[email protected]"
] | |
33c1f10fe15b57bce0cc9cae704eac4a34587ac2 | 6caee5b61fb3f94973992f499cd0541ea03e8a24 | /arduino/altar/reset.h | b14cf74aa784ca8f7db14f0a993017b7d1ec126c | [] | no_license | nsparisi/locurio | df40d06206434d5ac230732806f9c5afa1be870a | dc11cd00f2ede8dd725aa67b5895f0a8b5220f4f | refs/heads/master | 2021-10-24T12:15:01.646271 | 2019-03-26T02:43:06 | 2019-03-26T02:43:06 | 34,501,868 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 216 | h | #ifndef Reset_h
#define Reset_h
#include <inttypes.h>
class Reset
{
// Pointer to the beginning of program memory; this has the same effect as a reset.
public:
static void(*resetFunc) (void);
};
#endif
| [
"[email protected]"
] | |
1116d31cc2b0a82bb1b2259a15aee7e02af57ec0 | dd827f6656c520ca1fa27663b71f7e1449291307 | /DirectX11Framework/DirectX11Framework/src/GameFramework/framework/Resource/Mesh/Mesh.h | 0e26efc9e27de306fdf7182faede67e05f0cdfc7 | [
"MIT"
] | permissive | MSyun/DX11Study | 6c3965e8e0352efe7f169a7d456d0e2b0ec5575d | 9767c20b8142a088b5c86efd1dcb5ef39e7dbbb9 | refs/heads/master | 2021-01-19T16:17:36.347863 | 2017-10-18T08:43:38 | 2017-10-18T08:43:38 | 88,261,132 | 0 | 0 | null | null | null | null | SHIFT_JIS | C++ | false | false | 866 | h | // メッシュ
// 2017.05.12 : プログラム作成
// author : SyunMizuno
#pragma once
#include "../Base/IResource.h"
#include "Pmd/Pmd.h"
#include <vector>
namespace MSLib {
class Mesh : public IResource {
public:
typedef enum {
CHECK_ALL = 0,
CHECK_ALPHA,
CHECK_NOALPHA,
} _eAlphaCheck;
private:
struct SimpleVertex {
Point3 Pos;
Vector3 Normal;
Vector2 Tex;
};
Pmd* m_pMeshData;
SimpleVertex* m_pVertex;
ID3D11Buffer* m_pVertexBuffer;
std::vector<ID3D11Buffer*> m_vecIndexBuffer;
public:
Mesh();
virtual ~Mesh();
bool Create(const std::string& name) override;
void Delete() override;
void Draw(Matrix* mat, _eAlphaCheck type = CHECK_ALL);
private:
void LoadTexture(const std::string& fileName);
bool CreateVertex();
bool CreateIndex();
bool CheckAlpha(_eAlphaCheck type, float alpha);
};
} | [
"[email protected]"
] | |
b09ed26c6bad2e2248b628b51a626b5b83123040 | 951b69aae583da24134fac00e8ca39fb684fc577 | /arduino/opencr_develop/opencr_fw_template/opencr_fw_arduino/src/sketch/turtlebot3/examples/friends/turtlebot3_bike/turtlebot3_bike_motor_driver.cpp | 68f88f1542d2cc4ae6ca519042d5c80d695143fd | [
"Apache-2.0"
] | permissive | ROBOTIS-Will/OpenCR | 6bb9281030c389fc40669ab8d2ea921ac8a4545e | 0787393e189fd790eca6402c9c72574024123450 | refs/heads/master | 2021-06-06T04:33:29.635094 | 2021-05-17T09:32:55 | 2021-05-17T09:32:55 | 138,265,877 | 2 | 0 | Apache-2.0 | 2018-06-22T06:51:25 | 2018-06-22T06:49:31 | C | UTF-8 | C++ | false | false | 4,914 | cpp | /*******************************************************************************
* Copyright 2016 ROBOTIS CO., LTD.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*******************************************************************************/
/* Authors: Yoonseok Pyo, Leon Jung, Darby Lim, HanCheol Cho */
#include "turtlebot3_bike_motor_driver.h"
Turtlebot3MotorDriver::Turtlebot3MotorDriver()
: baudrate_(BAUDRATE),
protocol_version_(PROTOCOL_VERSION),
left_rear_wheel_id_(DXL_LEFT_REAR_ID), right_rear_wheel_id_(DXL_RIGHT_REAR_ID),
front_joint_id_(DXL_FRONT_ID)
{
}
Turtlebot3MotorDriver::~Turtlebot3MotorDriver()
{
closeDynamixel();
}
bool Turtlebot3MotorDriver::init(void)
{
portHandler_ = dynamixel::PortHandler::getPortHandler(DEVICENAME);
packetHandler_ = dynamixel::PacketHandler::getPacketHandler(PROTOCOL_VERSION);
// Open port
if (portHandler_->openPort())
{
ERROR_PRINT("Port is opened");
}
else
{
ERROR_PRINT("Port couldn't be opened");
return false;
}
// Set port baudrate
if (portHandler_->setBaudRate(baudrate_))
{
ERROR_PRINT("Baudrate is set");
}
else
{
ERROR_PRINT("Baudrate couldn't be set");
return false;
}
// Enable Dynamixel Torque
setTorque(left_rear_wheel_id_, true);
setTorque(right_rear_wheel_id_, true);
setTorque(front_joint_id_, true);
setProfileVelocity(front_joint_id_, 120); //TODO : precise calculation
groupSyncWriteVelocity_ = new dynamixel::GroupSyncWrite(portHandler_, packetHandler_, ADDR_X_GOAL_VELOCITY, LEN_X_GOAL_VELOCITY);
groupBulkWrite_ = new dynamixel::GroupBulkWrite(portHandler_, packetHandler_);
return true;
}
bool Turtlebot3MotorDriver::setTorque(uint8_t id, bool onoff)
{
uint8_t dxl_error = 0;
int dxl_comm_result = COMM_TX_FAIL;
dxl_comm_result = packetHandler_->write1ByteTxRx(portHandler_, id, ADDR_X_TORQUE_ENABLE, onoff, &dxl_error);
if(dxl_comm_result != COMM_SUCCESS)
{
packetHandler_->printTxRxResult(dxl_comm_result);
}
else if(dxl_error != 0)
{
packetHandler_->printRxPacketError(dxl_error);
}
}
bool Turtlebot3MotorDriver::setProfileAcceleration(uint8_t id, uint32_t value)
{
uint8_t dxl_error = 0;
int dxl_comm_result = COMM_TX_FAIL;
dxl_comm_result = packetHandler_->write4ByteTxRx(portHandler_, id, ADDR_X_PROFILE_ACCELERATION, value, &dxl_error);
if (dxl_comm_result != COMM_SUCCESS)
{
packetHandler_->printTxRxResult(dxl_comm_result);
}
else if(dxl_error != 0)
{
packetHandler_->printRxPacketError(dxl_error);
}
}
bool Turtlebot3MotorDriver::setProfileVelocity(uint8_t id, uint32_t value)
{
uint8_t dxl_error = 0;
int dxl_comm_result = COMM_TX_FAIL;
dxl_comm_result = packetHandler_->write4ByteTxRx(portHandler_, id, ADDR_X_PROFILE_VELOCITY, value, &dxl_error);
if(dxl_comm_result != COMM_SUCCESS)
{
packetHandler_->printTxRxResult(dxl_comm_result);
}
else if(dxl_error != 0)
{
packetHandler_->printRxPacketError(dxl_error);
}
}
void Turtlebot3MotorDriver::closeDynamixel(void)
{
// Disable Dynamixel Torque
setTorque(left_rear_wheel_id_, false);
setTorque(right_rear_wheel_id_, false);
setTorque(front_joint_id_, false);
// Close port
portHandler_->closePort();
}
bool Turtlebot3MotorDriver::controlMotor(int64_t left_rear_wheel_value, int64_t right_rear_wheel_value, int64_t front_joint_value)
{
bool dxl_addparam_result_;
int8_t dxl_comm_result_;
dxl_addparam_result_ = groupBulkWrite_->addParam(left_rear_wheel_id_, ADDR_X_GOAL_VELOCITY, LEN_X_GOAL_VELOCITY, (uint8_t*)&left_rear_wheel_value);
if (dxl_addparam_result_ != true)
return false;
dxl_addparam_result_ = groupBulkWrite_->addParam(right_rear_wheel_id_, ADDR_X_GOAL_VELOCITY, LEN_X_GOAL_VELOCITY, (uint8_t*)&right_rear_wheel_value);
if (dxl_addparam_result_ != true)
return false;
dxl_addparam_result_ = groupBulkWrite_->addParam(front_joint_id_, ADDR_X_GOAL_POSITION, LEN_X_GOAL_POSITION, (uint8_t*)&front_joint_value);
if (dxl_addparam_result_ != true)
return false;
dxl_comm_result_ = groupBulkWrite_->txPacket();
if (dxl_comm_result_ != COMM_SUCCESS)
{
packetHandler_->printTxRxResult(dxl_comm_result_);
return false;
}
groupBulkWrite_->clearParam();
return true;
}
| [
"[email protected]"
] | |
17ff6309a627bea8a66c9cd8c61cda0e793873f7 | 7df7a07c07db41e4e8867f645aa3386ed75d9e3b | /Utilities/Utilities/event/Event.h | f70d0312fec994267bf30f2aaebcf12063139b39 | [] | no_license | janie177/Utilities | 9284a3d19e13ce61a28744346c26dbe11a22d902 | 5c270c54dc40e762d57c35d95fda5dfb9c73e898 | refs/heads/master | 2021-06-18T06:20:08.323873 | 2021-05-03T18:21:58 | 2021-05-03T18:21:58 | 202,134,074 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 148 | h | #pragma once
namespace utilities
{
/*
Event is a base class that can be extended to contain other cool functionality.
*/
class Event
{
};
} | [
"[email protected]"
] | |
4bf571b39606fdfe54e43fe384a1e9bf34f6aa65 | 0c0c4d14b6bf9a181c859db119433e97ce76edc9 | /include/complex | 07d3754658fbf15ff65dae1f58393fe88914dd3d | [
"MIT",
"NCSA"
] | permissive | marcinz/libcxx-ranges | d0e748574798ba4926ffad353ac0f254d0294648 | ee4ebf99147da4bbb5356b6ab0e7a79a1bfa0704 | refs/heads/master | 2020-05-19T07:17:43.541160 | 2013-03-01T18:35:48 | 2013-03-01T18:35:48 | 8,189,114 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 42,637 | // -*- C++ -*-
//===--------------------------- complex ----------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is dual licensed under the MIT and the University of Illinois Open
// Source Licenses. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
#ifndef _LIBCPP_COMPLEX
#define _LIBCPP_COMPLEX
/*
complex synopsis
namespace std
{
template<class T>
class complex
{
public:
typedef T value_type;
complex(const T& re = T(), const T& im = T());
complex(const complex&);
template<class X> complex(const complex<X>&);
T real() const;
T imag() const;
void real(T);
void imag(T);
complex<T>& operator= (const T&);
complex<T>& operator+=(const T&);
complex<T>& operator-=(const T&);
complex<T>& operator*=(const T&);
complex<T>& operator/=(const T&);
complex& operator=(const complex&);
template<class X> complex<T>& operator= (const complex<X>&);
template<class X> complex<T>& operator+=(const complex<X>&);
template<class X> complex<T>& operator-=(const complex<X>&);
template<class X> complex<T>& operator*=(const complex<X>&);
template<class X> complex<T>& operator/=(const complex<X>&);
};
template<>
class complex<float>
{
public:
typedef float value_type;
constexpr complex(float re = 0.0f, float im = 0.0f);
explicit constexpr complex(const complex<double>&);
explicit constexpr complex(const complex<long double>&);
constexpr float real() const;
void real(float);
constexpr float imag() const;
void imag(float);
complex<float>& operator= (float);
complex<float>& operator+=(float);
complex<float>& operator-=(float);
complex<float>& operator*=(float);
complex<float>& operator/=(float);
complex<float>& operator=(const complex<float>&);
template<class X> complex<float>& operator= (const complex<X>&);
template<class X> complex<float>& operator+=(const complex<X>&);
template<class X> complex<float>& operator-=(const complex<X>&);
template<class X> complex<float>& operator*=(const complex<X>&);
template<class X> complex<float>& operator/=(const complex<X>&);
};
template<>
class complex<double>
{
public:
typedef double value_type;
constexpr complex(double re = 0.0, double im = 0.0);
constexpr complex(const complex<float>&);
explicit constexpr complex(const complex<long double>&);
constexpr double real() const;
void real(double);
constexpr double imag() const;
void imag(double);
complex<double>& operator= (double);
complex<double>& operator+=(double);
complex<double>& operator-=(double);
complex<double>& operator*=(double);
complex<double>& operator/=(double);
complex<double>& operator=(const complex<double>&);
template<class X> complex<double>& operator= (const complex<X>&);
template<class X> complex<double>& operator+=(const complex<X>&);
template<class X> complex<double>& operator-=(const complex<X>&);
template<class X> complex<double>& operator*=(const complex<X>&);
template<class X> complex<double>& operator/=(const complex<X>&);
};
template<>
class complex<long double>
{
public:
typedef long double value_type;
constexpr complex(long double re = 0.0L, long double im = 0.0L);
constexpr complex(const complex<float>&);
constexpr complex(const complex<double>&);
constexpr long double real() const;
void real(long double);
constexpr long double imag() const;
void imag(long double);
complex<long double>& operator=(const complex<long double>&);
complex<long double>& operator= (long double);
complex<long double>& operator+=(long double);
complex<long double>& operator-=(long double);
complex<long double>& operator*=(long double);
complex<long double>& operator/=(long double);
template<class X> complex<long double>& operator= (const complex<X>&);
template<class X> complex<long double>& operator+=(const complex<X>&);
template<class X> complex<long double>& operator-=(const complex<X>&);
template<class X> complex<long double>& operator*=(const complex<X>&);
template<class X> complex<long double>& operator/=(const complex<X>&);
};
// 26.3.6 operators:
template<class T> complex<T> operator+(const complex<T>&, const complex<T>&);
template<class T> complex<T> operator+(const complex<T>&, const T&);
template<class T> complex<T> operator+(const T&, const complex<T>&);
template<class T> complex<T> operator-(const complex<T>&, const complex<T>&);
template<class T> complex<T> operator-(const complex<T>&, const T&);
template<class T> complex<T> operator-(const T&, const complex<T>&);
template<class T> complex<T> operator*(const complex<T>&, const complex<T>&);
template<class T> complex<T> operator*(const complex<T>&, const T&);
template<class T> complex<T> operator*(const T&, const complex<T>&);
template<class T> complex<T> operator/(const complex<T>&, const complex<T>&);
template<class T> complex<T> operator/(const complex<T>&, const T&);
template<class T> complex<T> operator/(const T&, const complex<T>&);
template<class T> complex<T> operator+(const complex<T>&);
template<class T> complex<T> operator-(const complex<T>&);
template<class T> bool operator==(const complex<T>&, const complex<T>&);
template<class T> bool operator==(const complex<T>&, const T&);
template<class T> bool operator==(const T&, const complex<T>&);
template<class T> bool operator!=(const complex<T>&, const complex<T>&);
template<class T> bool operator!=(const complex<T>&, const T&);
template<class T> bool operator!=(const T&, const complex<T>&);
template<class T, class charT, class traits>
basic_istream<charT, traits>&
operator>>(basic_istream<charT, traits>&, complex<T>&);
template<class T, class charT, class traits>
basic_ostream<charT, traits>&
operator<<(basic_ostream<charT, traits>&, const complex<T>&);
// 26.3.7 values:
template<class T> T real(const complex<T>&);
long double real(long double);
double real(double);
template<Integral T> double real(T);
float real(float);
template<class T> T imag(const complex<T>&);
long double imag(long double);
double imag(double);
template<Integral T> double imag(T);
float imag(float);
template<class T> T abs(const complex<T>&);
template<class T> T arg(const complex<T>&);
long double arg(long double);
double arg(double);
template<Integral T> double arg(T);
float arg(float);
template<class T> T norm(const complex<T>&);
long double norm(long double);
double norm(double);
template<Integral T> double norm(T);
float norm(float);
template<class T> complex<T> conj(const complex<T>&);
complex<long double> conj(long double);
complex<double> conj(double);
template<Integral T> complex<double> conj(T);
complex<float> conj(float);
template<class T> complex<T> proj(const complex<T>&);
complex<long double> proj(long double);
complex<double> proj(double);
template<Integral T> complex<double> proj(T);
complex<float> proj(float);
template<class T> complex<T> polar(const T&, const T& = 0);
// 26.3.8 transcendentals:
template<class T> complex<T> acos(const complex<T>&);
template<class T> complex<T> asin(const complex<T>&);
template<class T> complex<T> atan(const complex<T>&);
template<class T> complex<T> acosh(const complex<T>&);
template<class T> complex<T> asinh(const complex<T>&);
template<class T> complex<T> atanh(const complex<T>&);
template<class T> complex<T> cos (const complex<T>&);
template<class T> complex<T> cosh (const complex<T>&);
template<class T> complex<T> exp (const complex<T>&);
template<class T> complex<T> log (const complex<T>&);
template<class T> complex<T> log10(const complex<T>&);
template<class T> complex<T> pow(const complex<T>&, const T&);
template<class T> complex<T> pow(const complex<T>&, const complex<T>&);
template<class T> complex<T> pow(const T&, const complex<T>&);
template<class T> complex<T> sin (const complex<T>&);
template<class T> complex<T> sinh (const complex<T>&);
template<class T> complex<T> sqrt (const complex<T>&);
template<class T> complex<T> tan (const complex<T>&);
template<class T> complex<T> tanh (const complex<T>&);
template<class T, class charT, class traits>
basic_istream<charT, traits>&
operator>>(basic_istream<charT, traits>& is, complex<T>& x);
template<class T, class charT, class traits>
basic_ostream<charT, traits>&
operator<<(basic_ostream<charT, traits>& o, const complex<T>& x);
} // std
*/
#include <__config>
#include <type_traits>
#include <stdexcept>
#include <cmath>
#include <sstream>
#if defined(_LIBCPP_NO_EXCEPTIONS)
#include <cassert>
#endif
#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
#pragma GCC system_header
#endif
_LIBCPP_BEGIN_NAMESPACE_STD
template<class _Tp> class _LIBCPP_VISIBLE complex;
template<class _Tp> complex<_Tp> operator*(const complex<_Tp>& __z, const complex<_Tp>& __w);
template<class _Tp> complex<_Tp> operator/(const complex<_Tp>& __x, const complex<_Tp>& __y);
template<class _Tp>
class _LIBCPP_VISIBLE complex
{
public:
typedef _Tp value_type;
private:
value_type __re_;
value_type __im_;
public:
_LIBCPP_INLINE_VISIBILITY
complex(const value_type& __re = value_type(), const value_type& __im = value_type())
: __re_(__re), __im_(__im) {}
template<class _Xp> _LIBCPP_INLINE_VISIBILITY
complex(const complex<_Xp>& __c)
: __re_(__c.real()), __im_(__c.imag()) {}
_LIBCPP_INLINE_VISIBILITY value_type real() const {return __re_;}
_LIBCPP_INLINE_VISIBILITY value_type imag() const {return __im_;}
_LIBCPP_INLINE_VISIBILITY void real(value_type __re) {__re_ = __re;}
_LIBCPP_INLINE_VISIBILITY void imag(value_type __im) {__im_ = __im;}
_LIBCPP_INLINE_VISIBILITY complex& operator= (const value_type& __re)
{__re_ = __re; __im_ = value_type(); return *this;}
_LIBCPP_INLINE_VISIBILITY complex& operator+=(const value_type& __re) {__re_ += __re; return *this;}
_LIBCPP_INLINE_VISIBILITY complex& operator-=(const value_type& __re) {__re_ -= __re; return *this;}
_LIBCPP_INLINE_VISIBILITY complex& operator*=(const value_type& __re) {__re_ *= __re; __im_ *= __re; return *this;}
_LIBCPP_INLINE_VISIBILITY complex& operator/=(const value_type& __re) {__re_ /= __re; __im_ /= __re; return *this;}
template<class _Xp> _LIBCPP_INLINE_VISIBILITY complex& operator= (const complex<_Xp>& __c)
{
__re_ = __c.real();
__im_ = __c.imag();
return *this;
}
template<class _Xp> _LIBCPP_INLINE_VISIBILITY complex& operator+=(const complex<_Xp>& __c)
{
__re_ += __c.real();
__im_ += __c.imag();
return *this;
}
template<class _Xp> _LIBCPP_INLINE_VISIBILITY complex& operator-=(const complex<_Xp>& __c)
{
__re_ -= __c.real();
__im_ -= __c.imag();
return *this;
}
template<class _Xp> _LIBCPP_INLINE_VISIBILITY complex& operator*=(const complex<_Xp>& __c)
{
*this = *this * __c;
return *this;
}
template<class _Xp> _LIBCPP_INLINE_VISIBILITY complex& operator/=(const complex<_Xp>& __c)
{
*this = *this / __c;
return *this;
}
};
template<> class _LIBCPP_VISIBLE complex<double>;
template<> class _LIBCPP_VISIBLE complex<long double>;
template<>
class _LIBCPP_VISIBLE complex<float>
{
float __re_;
float __im_;
public:
typedef float value_type;
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR complex(float __re = 0.0f, float __im = 0.0f)
: __re_(__re), __im_(__im) {}
explicit _LIBCPP_CONSTEXPR complex(const complex<double>& __c);
explicit _LIBCPP_CONSTEXPR complex(const complex<long double>& __c);
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR float real() const {return __re_;}
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR float imag() const {return __im_;}
_LIBCPP_INLINE_VISIBILITY void real(value_type __re) {__re_ = __re;}
_LIBCPP_INLINE_VISIBILITY void imag(value_type __im) {__im_ = __im;}
_LIBCPP_INLINE_VISIBILITY complex& operator= (float __re)
{__re_ = __re; __im_ = value_type(); return *this;}
_LIBCPP_INLINE_VISIBILITY complex& operator+=(float __re) {__re_ += __re; return *this;}
_LIBCPP_INLINE_VISIBILITY complex& operator-=(float __re) {__re_ -= __re; return *this;}
_LIBCPP_INLINE_VISIBILITY complex& operator*=(float __re) {__re_ *= __re; __im_ *= __re; return *this;}
_LIBCPP_INLINE_VISIBILITY complex& operator/=(float __re) {__re_ /= __re; __im_ /= __re; return *this;}
template<class _Xp> _LIBCPP_INLINE_VISIBILITY complex& operator= (const complex<_Xp>& __c)
{
__re_ = __c.real();
__im_ = __c.imag();
return *this;
}
template<class _Xp> _LIBCPP_INLINE_VISIBILITY complex& operator+=(const complex<_Xp>& __c)
{
__re_ += __c.real();
__im_ += __c.imag();
return *this;
}
template<class _Xp> _LIBCPP_INLINE_VISIBILITY complex& operator-=(const complex<_Xp>& __c)
{
__re_ -= __c.real();
__im_ -= __c.imag();
return *this;
}
template<class _Xp> _LIBCPP_INLINE_VISIBILITY complex& operator*=(const complex<_Xp>& __c)
{
*this = *this * __c;
return *this;
}
template<class _Xp> _LIBCPP_INLINE_VISIBILITY complex& operator/=(const complex<_Xp>& __c)
{
*this = *this / __c;
return *this;
}
};
template<>
class _LIBCPP_VISIBLE complex<double>
{
double __re_;
double __im_;
public:
typedef double value_type;
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR complex(double __re = 0.0, double __im = 0.0)
: __re_(__re), __im_(__im) {}
_LIBCPP_CONSTEXPR complex(const complex<float>& __c);
explicit _LIBCPP_CONSTEXPR complex(const complex<long double>& __c);
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR double real() const {return __re_;}
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR double imag() const {return __im_;}
_LIBCPP_INLINE_VISIBILITY void real(value_type __re) {__re_ = __re;}
_LIBCPP_INLINE_VISIBILITY void imag(value_type __im) {__im_ = __im;}
_LIBCPP_INLINE_VISIBILITY complex& operator= (double __re)
{__re_ = __re; __im_ = value_type(); return *this;}
_LIBCPP_INLINE_VISIBILITY complex& operator+=(double __re) {__re_ += __re; return *this;}
_LIBCPP_INLINE_VISIBILITY complex& operator-=(double __re) {__re_ -= __re; return *this;}
_LIBCPP_INLINE_VISIBILITY complex& operator*=(double __re) {__re_ *= __re; __im_ *= __re; return *this;}
_LIBCPP_INLINE_VISIBILITY complex& operator/=(double __re) {__re_ /= __re; __im_ /= __re; return *this;}
template<class _Xp> _LIBCPP_INLINE_VISIBILITY complex& operator= (const complex<_Xp>& __c)
{
__re_ = __c.real();
__im_ = __c.imag();
return *this;
}
template<class _Xp> _LIBCPP_INLINE_VISIBILITY complex& operator+=(const complex<_Xp>& __c)
{
__re_ += __c.real();
__im_ += __c.imag();
return *this;
}
template<class _Xp> _LIBCPP_INLINE_VISIBILITY complex& operator-=(const complex<_Xp>& __c)
{
__re_ -= __c.real();
__im_ -= __c.imag();
return *this;
}
template<class _Xp> _LIBCPP_INLINE_VISIBILITY complex& operator*=(const complex<_Xp>& __c)
{
*this = *this * __c;
return *this;
}
template<class _Xp> _LIBCPP_INLINE_VISIBILITY complex& operator/=(const complex<_Xp>& __c)
{
*this = *this / __c;
return *this;
}
};
template<>
class _LIBCPP_VISIBLE complex<long double>
{
long double __re_;
long double __im_;
public:
typedef long double value_type;
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR complex(long double __re = 0.0L, long double __im = 0.0L)
: __re_(__re), __im_(__im) {}
_LIBCPP_CONSTEXPR complex(const complex<float>& __c);
_LIBCPP_CONSTEXPR complex(const complex<double>& __c);
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR long double real() const {return __re_;}
_LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR long double imag() const {return __im_;}
_LIBCPP_INLINE_VISIBILITY void real(value_type __re) {__re_ = __re;}
_LIBCPP_INLINE_VISIBILITY void imag(value_type __im) {__im_ = __im;}
_LIBCPP_INLINE_VISIBILITY complex& operator= (long double __re)
{__re_ = __re; __im_ = value_type(); return *this;}
_LIBCPP_INLINE_VISIBILITY complex& operator+=(long double __re) {__re_ += __re; return *this;}
_LIBCPP_INLINE_VISIBILITY complex& operator-=(long double __re) {__re_ -= __re; return *this;}
_LIBCPP_INLINE_VISIBILITY complex& operator*=(long double __re) {__re_ *= __re; __im_ *= __re; return *this;}
_LIBCPP_INLINE_VISIBILITY complex& operator/=(long double __re) {__re_ /= __re; __im_ /= __re; return *this;}
template<class _Xp> _LIBCPP_INLINE_VISIBILITY complex& operator= (const complex<_Xp>& __c)
{
__re_ = __c.real();
__im_ = __c.imag();
return *this;
}
template<class _Xp> _LIBCPP_INLINE_VISIBILITY complex& operator+=(const complex<_Xp>& __c)
{
__re_ += __c.real();
__im_ += __c.imag();
return *this;
}
template<class _Xp> _LIBCPP_INLINE_VISIBILITY complex& operator-=(const complex<_Xp>& __c)
{
__re_ -= __c.real();
__im_ -= __c.imag();
return *this;
}
template<class _Xp> _LIBCPP_INLINE_VISIBILITY complex& operator*=(const complex<_Xp>& __c)
{
*this = *this * __c;
return *this;
}
template<class _Xp> _LIBCPP_INLINE_VISIBILITY complex& operator/=(const complex<_Xp>& __c)
{
*this = *this / __c;
return *this;
}
};
inline _LIBCPP_INLINE_VISIBILITY
_LIBCPP_CONSTEXPR
complex<float>::complex(const complex<double>& __c)
: __re_(__c.real()), __im_(__c.imag()) {}
inline _LIBCPP_INLINE_VISIBILITY
_LIBCPP_CONSTEXPR
complex<float>::complex(const complex<long double>& __c)
: __re_(__c.real()), __im_(__c.imag()) {}
inline _LIBCPP_INLINE_VISIBILITY
_LIBCPP_CONSTEXPR
complex<double>::complex(const complex<float>& __c)
: __re_(__c.real()), __im_(__c.imag()) {}
inline _LIBCPP_INLINE_VISIBILITY
_LIBCPP_CONSTEXPR
complex<double>::complex(const complex<long double>& __c)
: __re_(__c.real()), __im_(__c.imag()) {}
inline _LIBCPP_INLINE_VISIBILITY
_LIBCPP_CONSTEXPR
complex<long double>::complex(const complex<float>& __c)
: __re_(__c.real()), __im_(__c.imag()) {}
inline _LIBCPP_INLINE_VISIBILITY
_LIBCPP_CONSTEXPR
complex<long double>::complex(const complex<double>& __c)
: __re_(__c.real()), __im_(__c.imag()) {}
// 26.3.6 operators:
template<class _Tp>
inline _LIBCPP_INLINE_VISIBILITY
complex<_Tp>
operator+(const complex<_Tp>& __x, const complex<_Tp>& __y)
{
complex<_Tp> __t(__x);
__t += __y;
return __t;
}
template<class _Tp>
inline _LIBCPP_INLINE_VISIBILITY
complex<_Tp>
operator+(const complex<_Tp>& __x, const _Tp& __y)
{
complex<_Tp> __t(__x);
__t += __y;
return __t;
}
template<class _Tp>
inline _LIBCPP_INLINE_VISIBILITY
complex<_Tp>
operator+(const _Tp& __x, const complex<_Tp>& __y)
{
complex<_Tp> __t(__y);
__t += __x;
return __t;
}
template<class _Tp>
inline _LIBCPP_INLINE_VISIBILITY
complex<_Tp>
operator-(const complex<_Tp>& __x, const complex<_Tp>& __y)
{
complex<_Tp> __t(__x);
__t -= __y;
return __t;
}
template<class _Tp>
inline _LIBCPP_INLINE_VISIBILITY
complex<_Tp>
operator-(const complex<_Tp>& __x, const _Tp& __y)
{
complex<_Tp> __t(__x);
__t -= __y;
return __t;
}
template<class _Tp>
inline _LIBCPP_INLINE_VISIBILITY
complex<_Tp>
operator-(const _Tp& __x, const complex<_Tp>& __y)
{
complex<_Tp> __t(-__y);
__t += __x;
return __t;
}
template<class _Tp>
complex<_Tp>
operator*(const complex<_Tp>& __z, const complex<_Tp>& __w)
{
_Tp __a = __z.real();
_Tp __b = __z.imag();
_Tp __c = __w.real();
_Tp __d = __w.imag();
_Tp __ac = __a * __c;
_Tp __bd = __b * __d;
_Tp __ad = __a * __d;
_Tp __bc = __b * __c;
_Tp __x = __ac - __bd;
_Tp __y = __ad + __bc;
if (isnan(__x) && isnan(__y))
{
bool __recalc = false;
if (isinf(__a) || isinf(__b))
{
__a = copysign(isinf(__a) ? _Tp(1) : _Tp(0), __a);
__b = copysign(isinf(__b) ? _Tp(1) : _Tp(0), __b);
if (isnan(__c))
__c = copysign(_Tp(0), __c);
if (isnan(__d))
__d = copysign(_Tp(0), __d);
__recalc = true;
}
if (isinf(__c) || isinf(__d))
{
__c = copysign(isinf(__c) ? _Tp(1) : _Tp(0), __c);
__d = copysign(isinf(__d) ? _Tp(1) : _Tp(0), __d);
if (isnan(__a))
__a = copysign(_Tp(0), __a);
if (isnan(__b))
__b = copysign(_Tp(0), __b);
__recalc = true;
}
if (!__recalc && (isinf(__ac) || isinf(__bd) ||
isinf(__ad) || isinf(__bc)))
{
if (isnan(__a))
__a = copysign(_Tp(0), __a);
if (isnan(__b))
__b = copysign(_Tp(0), __b);
if (isnan(__c))
__c = copysign(_Tp(0), __c);
if (isnan(__d))
__d = copysign(_Tp(0), __d);
__recalc = true;
}
if (__recalc)
{
__x = _Tp(INFINITY) * (__a * __c - __b * __d);
__y = _Tp(INFINITY) * (__a * __d + __b * __c);
}
}
return complex<_Tp>(__x, __y);
}
template<class _Tp>
inline _LIBCPP_INLINE_VISIBILITY
complex<_Tp>
operator*(const complex<_Tp>& __x, const _Tp& __y)
{
complex<_Tp> __t(__x);
__t *= __y;
return __t;
}
template<class _Tp>
inline _LIBCPP_INLINE_VISIBILITY
complex<_Tp>
operator*(const _Tp& __x, const complex<_Tp>& __y)
{
complex<_Tp> __t(__y);
__t *= __x;
return __t;
}
template<class _Tp>
complex<_Tp>
operator/(const complex<_Tp>& __z, const complex<_Tp>& __w)
{
int __ilogbw = 0;
_Tp __a = __z.real();
_Tp __b = __z.imag();
_Tp __c = __w.real();
_Tp __d = __w.imag();
_Tp __logbw = logb(fmax(fabs(__c), fabs(__d)));
if (isfinite(__logbw))
{
__ilogbw = static_cast<int>(__logbw);
__c = scalbn(__c, -__ilogbw);
__d = scalbn(__d, -__ilogbw);
}
_Tp __denom = __c * __c + __d * __d;
_Tp __x = scalbn((__a * __c + __b * __d) / __denom, -__ilogbw);
_Tp __y = scalbn((__b * __c - __a * __d) / __denom, -__ilogbw);
if (isnan(__x) && isnan(__y))
{
if ((__denom == _Tp(0)) && (!isnan(__a) || !isnan(__b)))
{
__x = copysign(_Tp(INFINITY), __c) * __a;
__y = copysign(_Tp(INFINITY), __c) * __b;
}
else if ((isinf(__a) || isinf(__b)) && isfinite(__c) && isfinite(__d))
{
__a = copysign(isinf(__a) ? _Tp(1) : _Tp(0), __a);
__b = copysign(isinf(__b) ? _Tp(1) : _Tp(0), __b);
__x = _Tp(INFINITY) * (__a * __c + __b * __d);
__y = _Tp(INFINITY) * (__b * __c - __a * __d);
}
else if (isinf(__logbw) && __logbw > _Tp(0) && isfinite(__a) && isfinite(__b))
{
__c = copysign(isinf(__c) ? _Tp(1) : _Tp(0), __c);
__d = copysign(isinf(__d) ? _Tp(1) : _Tp(0), __d);
__x = _Tp(0) * (__a * __c + __b * __d);
__y = _Tp(0) * (__b * __c - __a * __d);
}
}
return complex<_Tp>(__x, __y);
}
template<class _Tp>
inline _LIBCPP_INLINE_VISIBILITY
complex<_Tp>
operator/(const complex<_Tp>& __x, const _Tp& __y)
{
return complex<_Tp>(__x.real() / __y, __x.imag() / __y);
}
template<class _Tp>
inline _LIBCPP_INLINE_VISIBILITY
complex<_Tp>
operator/(const _Tp& __x, const complex<_Tp>& __y)
{
complex<_Tp> __t(__x);
__t /= __y;
return __t;
}
template<class _Tp>
inline _LIBCPP_INLINE_VISIBILITY
complex<_Tp>
operator+(const complex<_Tp>& __x)
{
return __x;
}
template<class _Tp>
inline _LIBCPP_INLINE_VISIBILITY
complex<_Tp>
operator-(const complex<_Tp>& __x)
{
return complex<_Tp>(-__x.real(), -__x.imag());
}
template<class _Tp>
inline _LIBCPP_INLINE_VISIBILITY
bool
operator==(const complex<_Tp>& __x, const complex<_Tp>& __y)
{
return __x.real() == __y.real() && __x.imag() == __y.imag();
}
template<class _Tp>
inline _LIBCPP_INLINE_VISIBILITY
bool
operator==(const complex<_Tp>& __x, const _Tp& __y)
{
return __x.real() == __y && __x.imag() == 0;
}
template<class _Tp>
inline _LIBCPP_INLINE_VISIBILITY
bool
operator==(const _Tp& __x, const complex<_Tp>& __y)
{
return __x == __y.real() && 0 == __y.imag();
}
template<class _Tp>
inline _LIBCPP_INLINE_VISIBILITY
bool
operator!=(const complex<_Tp>& __x, const complex<_Tp>& __y)
{
return !(__x == __y);
}
template<class _Tp>
inline _LIBCPP_INLINE_VISIBILITY
bool
operator!=(const complex<_Tp>& __x, const _Tp& __y)
{
return !(__x == __y);
}
template<class _Tp>
inline _LIBCPP_INLINE_VISIBILITY
bool
operator!=(const _Tp& __x, const complex<_Tp>& __y)
{
return !(__x == __y);
}
// 26.3.7 values:
// real
template<class _Tp>
inline _LIBCPP_INLINE_VISIBILITY
_Tp
real(const complex<_Tp>& __c)
{
return __c.real();
}
inline _LIBCPP_INLINE_VISIBILITY
long double
real(long double __re)
{
return __re;
}
inline _LIBCPP_INLINE_VISIBILITY
double
real(double __re)
{
return __re;
}
template<class _Tp>
inline _LIBCPP_INLINE_VISIBILITY
typename enable_if
<
is_integral<_Tp>::value,
double
>::type
real(_Tp __re)
{
return __re;
}
inline _LIBCPP_INLINE_VISIBILITY
float
real(float __re)
{
return __re;
}
// imag
template<class _Tp>
inline _LIBCPP_INLINE_VISIBILITY
_Tp
imag(const complex<_Tp>& __c)
{
return __c.imag();
}
inline _LIBCPP_INLINE_VISIBILITY
long double
imag(long double __re)
{
return 0;
}
inline _LIBCPP_INLINE_VISIBILITY
double
imag(double __re)
{
return 0;
}
template<class _Tp>
inline _LIBCPP_INLINE_VISIBILITY
typename enable_if
<
is_integral<_Tp>::value,
double
>::type
imag(_Tp __re)
{
return 0;
}
inline _LIBCPP_INLINE_VISIBILITY
float
imag(float __re)
{
return 0;
}
// abs
template<class _Tp>
inline _LIBCPP_INLINE_VISIBILITY
_Tp
abs(const complex<_Tp>& __c)
{
return hypot(__c.real(), __c.imag());
}
// arg
template<class _Tp>
inline _LIBCPP_INLINE_VISIBILITY
_Tp
arg(const complex<_Tp>& __c)
{
return atan2(__c.imag(), __c.real());
}
inline _LIBCPP_INLINE_VISIBILITY
long double
arg(long double __re)
{
return atan2l(0.L, __re);
}
inline _LIBCPP_INLINE_VISIBILITY
double
arg(double __re)
{
return atan2(0., __re);
}
template<class _Tp>
inline _LIBCPP_INLINE_VISIBILITY
typename enable_if
<
is_integral<_Tp>::value,
double
>::type
arg(_Tp __re)
{
return atan2(0., __re);
}
inline _LIBCPP_INLINE_VISIBILITY
float
arg(float __re)
{
return atan2f(0.F, __re);
}
// norm
template<class _Tp>
inline _LIBCPP_INLINE_VISIBILITY
_Tp
norm(const complex<_Tp>& __c)
{
if (isinf(__c.real()))
return abs(__c.real());
if (isinf(__c.imag()))
return abs(__c.imag());
return __c.real() * __c.real() + __c.imag() * __c.imag();
}
inline _LIBCPP_INLINE_VISIBILITY
long double
norm(long double __re)
{
return __re * __re;
}
inline _LIBCPP_INLINE_VISIBILITY
double
norm(double __re)
{
return __re * __re;
}
template<class _Tp>
inline _LIBCPP_INLINE_VISIBILITY
typename enable_if
<
is_integral<_Tp>::value,
double
>::type
norm(_Tp __re)
{
return (double)__re * __re;
}
inline _LIBCPP_INLINE_VISIBILITY
float
norm(float __re)
{
return __re * __re;
}
// conj
template<class _Tp>
inline _LIBCPP_INLINE_VISIBILITY
complex<_Tp>
conj(const complex<_Tp>& __c)
{
return complex<_Tp>(__c.real(), -__c.imag());
}
inline _LIBCPP_INLINE_VISIBILITY
complex<long double>
conj(long double __re)
{
return complex<long double>(__re);
}
inline _LIBCPP_INLINE_VISIBILITY
complex<double>
conj(double __re)
{
return complex<double>(__re);
}
template<class _Tp>
inline _LIBCPP_INLINE_VISIBILITY
typename enable_if
<
is_integral<_Tp>::value,
complex<double>
>::type
conj(_Tp __re)
{
return complex<double>(__re);
}
inline _LIBCPP_INLINE_VISIBILITY
complex<float>
conj(float __re)
{
return complex<float>(__re);
}
// proj
template<class _Tp>
inline _LIBCPP_INLINE_VISIBILITY
complex<_Tp>
proj(const complex<_Tp>& __c)
{
std::complex<_Tp> __r = __c;
if (isinf(__c.real()) || isinf(__c.imag()))
__r = complex<_Tp>(INFINITY, copysign(_Tp(0), __c.imag()));
return __r;
}
inline _LIBCPP_INLINE_VISIBILITY
complex<long double>
proj(long double __re)
{
if (isinf(__re))
__re = abs(__re);
return complex<long double>(__re);
}
inline _LIBCPP_INLINE_VISIBILITY
complex<double>
proj(double __re)
{
if (isinf(__re))
__re = abs(__re);
return complex<double>(__re);
}
template<class _Tp>
inline _LIBCPP_INLINE_VISIBILITY
typename enable_if
<
is_integral<_Tp>::value,
complex<double>
>::type
proj(_Tp __re)
{
return complex<double>(__re);
}
inline _LIBCPP_INLINE_VISIBILITY
complex<float>
proj(float __re)
{
if (isinf(__re))
__re = abs(__re);
return complex<float>(__re);
}
// polar
template<class _Tp>
complex<_Tp>
polar(const _Tp& __rho, const _Tp& __theta = _Tp(0))
{
if (isnan(__rho) || signbit(__rho))
return complex<_Tp>(_Tp(NAN), _Tp(NAN));
if (isnan(__theta))
{
if (isinf(__rho))
return complex<_Tp>(__rho, __theta);
return complex<_Tp>(__theta, __theta);
}
if (isinf(__theta))
{
if (isinf(__rho))
return complex<_Tp>(__rho, _Tp(NAN));
return complex<_Tp>(_Tp(NAN), _Tp(NAN));
}
_Tp __x = __rho * cos(__theta);
if (isnan(__x))
__x = 0;
_Tp __y = __rho * sin(__theta);
if (isnan(__y))
__y = 0;
return complex<_Tp>(__x, __y);
}
// log
template<class _Tp>
inline _LIBCPP_INLINE_VISIBILITY
complex<_Tp>
log(const complex<_Tp>& __x)
{
return complex<_Tp>(log(abs(__x)), arg(__x));
}
// log10
template<class _Tp>
inline _LIBCPP_INLINE_VISIBILITY
complex<_Tp>
log10(const complex<_Tp>& __x)
{
return log(__x) / log(_Tp(10));
}
// sqrt
template<class _Tp>
complex<_Tp>
sqrt(const complex<_Tp>& __x)
{
if (isinf(__x.imag()))
return complex<_Tp>(_Tp(INFINITY), __x.imag());
if (isinf(__x.real()))
{
if (__x.real() > _Tp(0))
return complex<_Tp>(__x.real(), isnan(__x.imag()) ? __x.imag() : copysign(_Tp(0), __x.imag()));
return complex<_Tp>(isnan(__x.imag()) ? __x.imag() : _Tp(0), copysign(__x.real(), __x.imag()));
}
return polar(sqrt(abs(__x)), arg(__x) / _Tp(2));
}
// exp
template<class _Tp>
complex<_Tp>
exp(const complex<_Tp>& __x)
{
_Tp __i = __x.imag();
if (isinf(__x.real()))
{
if (__x.real() < _Tp(0))
{
if (!isfinite(__i))
__i = _Tp(1);
}
else if (__i == 0 || !isfinite(__i))
{
if (isinf(__i))
__i = _Tp(NAN);
return complex<_Tp>(__x.real(), __i);
}
}
else if (isnan(__x.real()) && __x.imag() == 0)
return __x;
_Tp __e = exp(__x.real());
return complex<_Tp>(__e * cos(__i), __e * sin(__i));
}
// pow
template<class _Tp>
inline _LIBCPP_INLINE_VISIBILITY
complex<_Tp>
pow(const complex<_Tp>& __x, const complex<_Tp>& __y)
{
return exp(__y * log(__x));
}
template<class _Tp, class _Up>
inline _LIBCPP_INLINE_VISIBILITY
complex<typename __promote<_Tp, _Up>::type>
pow(const complex<_Tp>& __x, const complex<_Up>& __y)
{
typedef complex<typename __promote<_Tp, _Up>::type> result_type;
return _VSTD::pow(result_type(__x), result_type(__y));
}
template<class _Tp, class _Up>
inline _LIBCPP_INLINE_VISIBILITY
typename enable_if
<
is_arithmetic<_Up>::value,
complex<typename __promote<_Tp, _Up>::type>
>::type
pow(const complex<_Tp>& __x, const _Up& __y)
{
typedef complex<typename __promote<_Tp, _Up>::type> result_type;
return _VSTD::pow(result_type(__x), result_type(__y));
}
template<class _Tp, class _Up>
inline _LIBCPP_INLINE_VISIBILITY
typename enable_if
<
is_arithmetic<_Tp>::value,
complex<typename __promote<_Tp, _Up>::type>
>::type
pow(const _Tp& __x, const complex<_Up>& __y)
{
typedef complex<typename __promote<_Tp, _Up>::type> result_type;
return _VSTD::pow(result_type(__x), result_type(__y));
}
// asinh
template<class _Tp>
complex<_Tp>
asinh(const complex<_Tp>& __x)
{
const _Tp __pi(atan2(+0., -0.));
if (isinf(__x.real()))
{
if (isnan(__x.imag()))
return __x;
if (isinf(__x.imag()))
return complex<_Tp>(__x.real(), copysign(__pi * _Tp(0.25), __x.imag()));
return complex<_Tp>(__x.real(), copysign(_Tp(0), __x.imag()));
}
if (isnan(__x.real()))
{
if (isinf(__x.imag()))
return complex<_Tp>(__x.imag(), __x.real());
if (__x.imag() == 0)
return __x;
return complex<_Tp>(__x.real(), __x.real());
}
if (isinf(__x.imag()))
return complex<_Tp>(copysign(__x.imag(), __x.real()), copysign(__pi/_Tp(2), __x.imag()));
complex<_Tp> __z = log(__x + sqrt(pow(__x, _Tp(2)) + _Tp(1)));
return complex<_Tp>(copysign(__z.real(), __x.real()), copysign(__z.imag(), __x.imag()));
}
// acosh
template<class _Tp>
complex<_Tp>
acosh(const complex<_Tp>& __x)
{
const _Tp __pi(atan2(+0., -0.));
if (isinf(__x.real()))
{
if (isnan(__x.imag()))
return complex<_Tp>(abs(__x.real()), __x.imag());
if (isinf(__x.imag()))
{
if (__x.real() > 0)
return complex<_Tp>(__x.real(), copysign(__pi * _Tp(0.25), __x.imag()));
else
return complex<_Tp>(-__x.real(), copysign(__pi * _Tp(0.75), __x.imag()));
}
if (__x.real() < 0)
return complex<_Tp>(-__x.real(), copysign(__pi, __x.imag()));
return complex<_Tp>(__x.real(), copysign(_Tp(0), __x.imag()));
}
if (isnan(__x.real()))
{
if (isinf(__x.imag()))
return complex<_Tp>(abs(__x.imag()), __x.real());
return complex<_Tp>(__x.real(), __x.real());
}
if (isinf(__x.imag()))
return complex<_Tp>(abs(__x.imag()), copysign(__pi/_Tp(2), __x.imag()));
complex<_Tp> __z = log(__x + sqrt(pow(__x, _Tp(2)) - _Tp(1)));
return complex<_Tp>(copysign(__z.real(), _Tp(0)), copysign(__z.imag(), __x.imag()));
}
// atanh
template<class _Tp>
complex<_Tp>
atanh(const complex<_Tp>& __x)
{
const _Tp __pi(atan2(+0., -0.));
if (isinf(__x.imag()))
{
return complex<_Tp>(copysign(_Tp(0), __x.real()), copysign(__pi/_Tp(2), __x.imag()));
}
if (isnan(__x.imag()))
{
if (isinf(__x.real()) || __x.real() == 0)
return complex<_Tp>(copysign(_Tp(0), __x.real()), __x.imag());
return complex<_Tp>(__x.imag(), __x.imag());
}
if (isnan(__x.real()))
{
return complex<_Tp>(__x.real(), __x.real());
}
if (isinf(__x.real()))
{
return complex<_Tp>(copysign(_Tp(0), __x.real()), copysign(__pi/_Tp(2), __x.imag()));
}
if (abs(__x.real()) == _Tp(1) && __x.imag() == _Tp(0))
{
return complex<_Tp>(copysign(_Tp(INFINITY), __x.real()), copysign(_Tp(0), __x.imag()));
}
complex<_Tp> __z = log((_Tp(1) + __x) / (_Tp(1) - __x)) / _Tp(2);
return complex<_Tp>(copysign(__z.real(), __x.real()), copysign(__z.imag(), __x.imag()));
}
// sinh
template<class _Tp>
complex<_Tp>
sinh(const complex<_Tp>& __x)
{
if (isinf(__x.real()) && !isfinite(__x.imag()))
return complex<_Tp>(__x.real(), _Tp(NAN));
if (__x.real() == 0 && !isfinite(__x.imag()))
return complex<_Tp>(__x.real(), _Tp(NAN));
if (__x.imag() == 0 && !isfinite(__x.real()))
return __x;
return complex<_Tp>(sinh(__x.real()) * cos(__x.imag()), cosh(__x.real()) * sin(__x.imag()));
}
// cosh
template<class _Tp>
complex<_Tp>
cosh(const complex<_Tp>& __x)
{
if (isinf(__x.real()) && !isfinite(__x.imag()))
return complex<_Tp>(abs(__x.real()), _Tp(NAN));
if (__x.real() == 0 && !isfinite(__x.imag()))
return complex<_Tp>(_Tp(NAN), __x.real());
if (__x.real() == 0 && __x.imag() == 0)
return complex<_Tp>(_Tp(1), __x.imag());
if (__x.imag() == 0 && !isfinite(__x.real()))
return complex<_Tp>(abs(__x.real()), __x.imag());
return complex<_Tp>(cosh(__x.real()) * cos(__x.imag()), sinh(__x.real()) * sin(__x.imag()));
}
// tanh
template<class _Tp>
complex<_Tp>
tanh(const complex<_Tp>& __x)
{
if (isinf(__x.real()))
{
if (!isfinite(__x.imag()))
return complex<_Tp>(_Tp(1), _Tp(0));
return complex<_Tp>(_Tp(1), copysign(_Tp(0), sin(_Tp(2) * __x.imag())));
}
if (isnan(__x.real()) && __x.imag() == 0)
return __x;
_Tp __2r(_Tp(2) * __x.real());
_Tp __2i(_Tp(2) * __x.imag());
_Tp __d(cosh(__2r) + cos(__2i));
_Tp __2rsh(sinh(__2r));
if (isinf(__2rsh) && isinf(__d))
return complex<_Tp>(__2rsh > _Tp(0) ? _Tp(1) : _Tp(-1),
__2i > _Tp(0) ? _Tp(0) : _Tp(-0.));
return complex<_Tp>(__2rsh/__d, sin(__2i)/__d);
}
// asin
template<class _Tp>
complex<_Tp>
asin(const complex<_Tp>& __x)
{
complex<_Tp> __z = asinh(complex<_Tp>(-__x.imag(), __x.real()));
return complex<_Tp>(__z.imag(), -__z.real());
}
// acos
template<class _Tp>
complex<_Tp>
acos(const complex<_Tp>& __x)
{
const _Tp __pi(atan2(+0., -0.));
if (isinf(__x.real()))
{
if (isnan(__x.imag()))
return complex<_Tp>(__x.imag(), __x.real());
if (isinf(__x.imag()))
{
if (__x.real() < _Tp(0))
return complex<_Tp>(_Tp(0.75) * __pi, -__x.imag());
return complex<_Tp>(_Tp(0.25) * __pi, -__x.imag());
}
if (__x.real() < _Tp(0))
return complex<_Tp>(__pi, signbit(__x.imag()) ? -__x.real() : __x.real());
return complex<_Tp>(_Tp(0), signbit(__x.imag()) ? __x.real() : -__x.real());
}
if (isnan(__x.real()))
{
if (isinf(__x.imag()))
return complex<_Tp>(__x.real(), -__x.imag());
return complex<_Tp>(__x.real(), __x.real());
}
if (isinf(__x.imag()))
return complex<_Tp>(__pi/_Tp(2), -__x.imag());
if (__x.real() == 0)
return complex<_Tp>(__pi/_Tp(2), -__x.imag());
complex<_Tp> __z = log(__x + sqrt(pow(__x, _Tp(2)) - _Tp(1)));
if (signbit(__x.imag()))
return complex<_Tp>(abs(__z.imag()), abs(__z.real()));
return complex<_Tp>(abs(__z.imag()), -abs(__z.real()));
}
// atan
template<class _Tp>
complex<_Tp>
atan(const complex<_Tp>& __x)
{
complex<_Tp> __z = atanh(complex<_Tp>(-__x.imag(), __x.real()));
return complex<_Tp>(__z.imag(), -__z.real());
}
// sin
template<class _Tp>
complex<_Tp>
sin(const complex<_Tp>& __x)
{
complex<_Tp> __z = sinh(complex<_Tp>(-__x.imag(), __x.real()));
return complex<_Tp>(__z.imag(), -__z.real());
}
// cos
template<class _Tp>
inline _LIBCPP_INLINE_VISIBILITY
complex<_Tp>
cos(const complex<_Tp>& __x)
{
return cosh(complex<_Tp>(-__x.imag(), __x.real()));
}
// tan
template<class _Tp>
complex<_Tp>
tan(const complex<_Tp>& __x)
{
complex<_Tp> __z = tanh(complex<_Tp>(-__x.imag(), __x.real()));
return complex<_Tp>(__z.imag(), -__z.real());
}
template<class _Tp, class _CharT, class _Traits>
basic_istream<_CharT, _Traits>&
operator>>(basic_istream<_CharT, _Traits>& __is, complex<_Tp>& __x)
{
if (__is.good())
{
ws(__is);
if (__is.peek() == _CharT('('))
{
__is.get();
_Tp __r;
__is >> __r;
if (!__is.fail())
{
ws(__is);
_CharT __c = __is.peek();
if (__c == _CharT(','))
{
__is.get();
_Tp __i;
__is >> __i;
if (!__is.fail())
{
ws(__is);
__c = __is.peek();
if (__c == _CharT(')'))
{
__is.get();
__x = complex<_Tp>(__r, __i);
}
else
__is.setstate(ios_base::failbit);
}
else
__is.setstate(ios_base::failbit);
}
else if (__c == _CharT(')'))
{
__is.get();
__x = complex<_Tp>(__r, _Tp(0));
}
else
__is.setstate(ios_base::failbit);
}
else
__is.setstate(ios_base::failbit);
}
else
{
_Tp __r;
__is >> __r;
if (!__is.fail())
__x = complex<_Tp>(__r, _Tp(0));
else
__is.setstate(ios_base::failbit);
}
}
else
__is.setstate(ios_base::failbit);
return __is;
}
template<class _Tp, class _CharT, class _Traits>
basic_ostream<_CharT, _Traits>&
operator<<(basic_ostream<_CharT, _Traits>& __os, const complex<_Tp>& __x)
{
basic_ostringstream<_CharT, _Traits> __s;
__s.flags(__os.flags());
__s.imbue(__os.getloc());
__s.precision(__os.precision());
__s << '(' << __x.real() << ',' << __x.imag() << ')';
return __os << __s.str();
}
_LIBCPP_END_NAMESPACE_STD
#endif // _LIBCPP_COMPLEX
| [
"hhinnant@91177308-0d34-0410-b5e6-96231b3b80d8"
] | hhinnant@91177308-0d34-0410-b5e6-96231b3b80d8 |
|
f3daccbdaac7c0a8a571d4eef059a1476c645f8b | d305e9667f18127e4a1d4d65e5370cf60df30102 | /mindspore/lite/test/ut/src/runtime/kernel/arm/int8/power_int8_tests.cc | 264e54d46732b29874251b91cbc0401538d9d5e6 | [
"Apache-2.0",
"MIT",
"Libpng",
"LicenseRef-scancode-proprietary-license",
"LGPL-2.1-only",
"AGPL-3.0-only",
"MPL-2.0-no-copyleft-exception",
"IJG",
"Zlib",
"MPL-1.1",
"BSD-3-Clause",
"BSD-3-Clause-Open-MPI",
"MPL-1.0",
"GPL-2.0-only",
"MPL-2.0",
"BSL-1.0",
"LicenseRef-scancode-unknown-license-reference",
"Unlicense",
"LicenseRef-scancode-public-domain",
"BSD-2-Clause"
] | permissive | imyzx2017/mindspore_pcl | d8e5bd1f80458538d07ef0a8fc447b552bd87420 | f548c9dae106879d1a83377dd06b10d96427fd2d | refs/heads/master | 2023-01-13T22:28:42.064535 | 2020-11-18T11:15:41 | 2020-11-18T11:15:41 | 313,906,414 | 6 | 1 | Apache-2.0 | 2020-11-18T11:25:08 | 2020-11-18T10:57:26 | null | UTF-8 | C++ | false | false | 5,311 | cc | /**
* Copyright 2020 Huawei Technologies Co., Ltd
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include <iostream>
#include <memory>
#include "schema/inner/model_generated.h"
#include "common/common_test.h"
#include "mindspore/lite/src/runtime/kernel/arm/int8/power_int8.h"
#include "mindspore/lite/nnacl/power_parameter.h"
#include "mindspore/lite/src/kernel_registry.h"
namespace mindspore {
class TestPowerInt8 : public mindspore::CommonTest {
public:
TestPowerInt8() {}
};
TEST_F(TestPowerInt8, PowerInt8) {
std::vector<lite::Tensor *> inputs_tensor;
std::vector<lite::Tensor *> outputs_tensor;
PowerParameter op_param;
op_param.op_parameter_.type_ = schema::PrimitiveType_Power;
op_param.power_ = 2;
op_param.scale_ = 1;
op_param.shift_ = 0;
lite::QuantArg input_quant_arg;
input_quant_arg.scale = 0.0156863;
input_quant_arg.zeroPoint = -128;
lite::QuantArg output_quant_arg;
output_quant_arg.scale = 0.0627451;
output_quant_arg.zeroPoint = -128;
std::vector<int8_t> input = {-64, -1, 63, 127};
std::vector<int> in_shape = {1, 1, 1, 4};
lite::Tensor input0_tensor;
TypeId tid_int8 = kNumberTypeInt8;
inputs_tensor.push_back(&input0_tensor);
input0_tensor.set_data(input.data());
input0_tensor.set_shape(in_shape);
input0_tensor.AddQuantParam(input_quant_arg);
input0_tensor.set_data_type(tid_int8);
std::vector<int8_t> output(4);
std::vector<int> output_shape = {1, 1, 1, 4};
lite::Tensor output0_tensor;
outputs_tensor.push_back(&output0_tensor);
output0_tensor.set_data(output.data());
output0_tensor.AddQuantParam(output_quant_arg);
output0_tensor.set_data_type(tid_int8);
auto ctx = std::make_shared<lite::InnerContext>();
ASSERT_EQ(lite::RET_OK, ctx->Init());
kernel::KernelKey desc = {kernel::KERNEL_ARCH::kCPU, kNumberTypeInt8, schema::PrimitiveType_Power};
auto creator = lite::KernelRegistry::GetInstance()->GetCreator(desc);
ASSERT_NE(creator, nullptr);
kernel::LiteKernel *kernel =
creator(inputs_tensor, outputs_tensor, reinterpret_cast<OpParameter *>(&op_param), ctx.get(), desc, nullptr);
ASSERT_NE(kernel, nullptr);
auto output_tensor_shape = output0_tensor.shape();
kernel->Run();
std::vector<int8_t> except_result = {-112, -65, 15, 127};
ASSERT_EQ(0, CompareOutputData(output.data(), except_result.data(), input.size(), 0.000001));
input0_tensor.set_data(nullptr);
output0_tensor.set_data(nullptr);
}
TEST_F(TestPowerInt8, normal) {
std::vector<lite::Tensor *> inputs_tensor;
std::vector<lite::Tensor *> outputs_tensor;
PowerParameter op_param;
op_param.op_parameter_.type_ = schema::PrimitiveType_Power;
op_param.scale_ = 1;
op_param.shift_ = 0;
lite::QuantArg input_quant_arg;
input_quant_arg.scale = 0.0156863;
input_quant_arg.zeroPoint = -128;
lite::QuantArg exp_quant_arg;
exp_quant_arg.scale = 0.0156863;
exp_quant_arg.zeroPoint = -128;
lite::QuantArg output_quant_arg;
output_quant_arg.scale = 0.0352941;
output_quant_arg.zeroPoint = -128;
std::vector<int8_t> input = {-64, -1, 63, 127};
std::vector<int> in_shape = {1, 1, 1, 4};
std::vector<int8_t> input1 = {127, 63, -1, -64};
std::vector<int> in_shape1 = {1, 1, 1, 4};
lite::Tensor input0_tensor, input1_tensor;
TypeId tid_int8 = kNumberTypeInt8;
inputs_tensor.push_back(&input0_tensor);
inputs_tensor.push_back(&input1_tensor);
input0_tensor.set_data(input.data());
input0_tensor.set_shape(in_shape);
input0_tensor.AddQuantParam(input_quant_arg);
input0_tensor.set_data_type(tid_int8);
input1_tensor.set_data(input1.data());
input1_tensor.set_shape(in_shape1);
input1_tensor.AddQuantParam(exp_quant_arg);
input1_tensor.set_data_type(tid_int8);
std::vector<int8_t> output(4);
std::vector<int> output_shape = {1, 1, 1, 4};
lite::Tensor output0_tensor;
outputs_tensor.push_back(&output0_tensor);
output0_tensor.set_data(output.data());
output0_tensor.AddQuantParam(output_quant_arg);
output0_tensor.set_data_type(tid_int8);
auto ctx = std::make_shared<lite::InnerContext>();
ASSERT_EQ(lite::RET_OK, ctx->Init());
kernel::KernelKey desc = {kernel::KERNEL_ARCH::kCPU, kNumberTypeInt8, schema::PrimitiveType_Power};
auto creator = lite::KernelRegistry::GetInstance()->GetCreator(desc);
ASSERT_NE(creator, nullptr);
kernel::LiteKernel *kernel =
creator(inputs_tensor, outputs_tensor, reinterpret_cast<OpParameter *>(&op_param), ctx.get(), desc, nullptr);
ASSERT_NE(kernel, nullptr);
auto output_tensor_shape = output0_tensor.shape();
kernel->Run();
std::vector<int8_t> except_result = {-99, 95, 124, -14};
ASSERT_EQ(0, CompareOutputData(output.data(), except_result.data(), input.size(), 0.000001));
input0_tensor.set_data(nullptr);
output0_tensor.set_data(nullptr);
}
} // namespace mindspore
| [
"[email protected]"
] | |
8cdb8df95e420168e417d650549ee53a3f78fd95 | 6b59885c4a69f2d40f0148e9793636a45428f23b | /DungeonCrawler/FBX/FBXParserLibrary.h | c4405b34ac2773c238e8cc8e9de72a9d2221e2bf | [] | no_license | StevenCederrand/Dungeon-Crawler | cbc8e215e8e7756a9a931be47a7fa3203383dd9e | 5340a5843d38356cb00064c5e2a5f1f246977b48 | refs/heads/master | 2022-01-08T17:23:20.429813 | 2019-05-28T11:47:50 | 2019-05-28T11:47:50 | 178,849,264 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,158 | h | #pragma once
#include <vector>
#include <string>
#include <bitset>
#include <fstream>
#include <iostream>
#include <string>
#include "FBXParserData.h"
namespace FBXParserLibrary
{
void readAndWriteBinaryData(std::string pathToMesh, FBXParserData* fileData);
void saveMainHeader(std::ifstream& binaryFile, FBXParserData* filedata);
void saveMeshHeader(std::ifstream& binaryFile, FBXParserData* fileData);
void saveBoundingBoxHeader(std::ifstream& binaryFile, FBXParserData* fileData);
void saveMaterialHeader(std::ifstream& binaryFile, FBXParserData* fileData);
void saveVertexHeader(std::ifstream& binaryFile, FBXParserData* fileData, int vectorNr);
void saveBoundingBoxVertexHeader(std::ifstream& binaryFile, FBXParserData* fileData, int vectorNr);
//reading datatypes
int binaryToInt(std::ifstream& binaryFile);
float binaryToFloat(std::ifstream& binaryFile);
bool binaryToBool(std::ifstream& binaryFile);
char binaryToChar(std::ifstream& binaryFile);
void calculateMinMaxValueMesh(std::ifstream& binaryFile, FBXParserData* fileData, int vectorNr);
void calculateMinMaxValueHitbox(std::ifstream& binaryFile, FBXParserData* fileData);
} | [
"[email protected]"
] | |
d4e7eb57f33bb3caf882ca0b45da8501f60c9c1a | 2b1964103bd0a98ff501b4888426b91f35a5f4c4 | /cdblock.cpp | b389069e5793e12399be9d1d6fd909e607d7e34c | [
"MIT"
] | permissive | razor85/libyaul_cdblock_demo | 2a4ba01ac36c06c2287a6c408db570a6fbcb4e74 | 133e93c9fe67193e433dfcf69a59d21e3304dc6f | refs/heads/master | 2022-04-13T17:00:51.875006 | 2020-04-11T20:40:36 | 2020-04-11T20:40:36 | 254,902,160 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 10,148 | cpp | /*
* Copyright (c) 2020 - Romulo Fernandes Machado Leitao
* See LICENSE for details.
*
* Romulo Fernandes Machado Leitao <[email protected]>
*/
#include "cdblock.h"
#include <cd-block.h>
#include <ctype.h>
// Debugging Functions
// #define DEBUG_CDBLOCK
namespace CdBlock {
namespace {
template <typename T>
void binarySearch(T *entries, uint32_t entriesLength,
T searchElement, T **foundEntry) {
const uint32_t pivotIndex = entriesLength / 2;
T *pivot = &entries[pivotIndex];
if (*pivot == searchElement) {
*foundEntry = pivot;
} else if (entriesLength > 1) {
if (*pivot > searchElement) {
binarySearch(entries, pivotIndex, searchElement, foundEntry);
} else {
binarySearch(&entries[pivotIndex],
entriesLength - pivotIndex, searchElement, foundEntry);
}
}
}
template <typename T>
void quickSort(T *entries, int32_t left, int32_t right) {
// Already sorted.
if (right <= left)
return;
int32_t pivotIndex = left + (right - left) / 2;
int32_t l = left - 1;
int32_t r = right + 1;
const T pivot = entries[pivotIndex];
for (;;) {
do {
l++;
} while (entries[l] < pivot);
do {
r--;
} while (entries[r] > pivot);
if (l >= r) {
pivotIndex = r;
break;
}
// Swap
const T tmp = entries[r];
entries[r] = entries[l];
entries[l] = tmp;
}
quickSort(entries, left, pivotIndex);
quickSort(entries, pivotIndex + 1, right);
}
/**
* Just print every file / folder found (for debugging purposes).
*/
void printDirectoryRecord(DirectoryRecord *record, int level, void*) {
for (int i = 0; i < level; ++i)
dbgio_buffer(" ");
char tmpBuffer[1024];
// -2 takes into account ';1'
uint8_t identifierSize = record->identifierLength;
if (record->isDirectory() == 0 && identifierSize > 2)
identifierSize -= 2;
char identifierName[256];
memcpy(identifierName, record->identifierPtr(), identifierSize);
identifierName[identifierSize] = 0;
if (record->isDirectory()) {
sprintf(tmpBuffer, "- [%s] @ %lud\n", identifierName, record->extentLocation());
} else {
sprintf(tmpBuffer, "- %s @ %lud\n", identifierName, record->extentLocation());
}
dbgio_buffer(tmpBuffer);
}
void navigateDirectory(DirectoryRecord *record,
int level, RecordFunction recordFunction, void *userData,
bool continueReading = false) {
assert(record != nullptr);
// Skip empty entries.
if (record->length == 0)
return;
// Skip '.'
DirectoryRecord *dir = record;
if (!continueReading) {
dir = record->nextDir();
assert(dir->length != 0);
// Skip '..'
dir = dir->nextDir();
}
// Visit every entry on the directory.
while (dir->length != 0) {
if (recordFunction != nullptr)
recordFunction(dir, level, userData);
// Visit sub-directory recursively.
if (dir->isDirectory()) {
uint32_t extraLevels = dir->extentLength() / 2048;
if (dir->extentLength() % 2048)
extraLevels++;
for (uint32_t level = 0; level < extraLevels; ++level) {
Sector sector;
const int stat = cd_block_read_data(LBA2FAD(dir->extentLocation()) +
level, 2048, sector.data);
assert(stat == 0);
DirectoryRecord *newRecord = (DirectoryRecord*) sector.data;
navigateDirectory(newRecord, level + 1, recordFunction, userData,
level > 0);
}
}
dir = dir->nextDir();
}
}
/**
* Fill a filesystem entry and then jump to the next entry. In case of a
* child, the parent hash will be passed to generate the child hash.
*/
void fillHeaderTableEntry(DirectoryRecord *record, uint32_t parentHash,
uint32_t parentPrime, FilesystemEntry **entry,
FilesystemHeaderTable *headerTable, bool continueReading = false) {
assert(record != nullptr);
assert(headerTable != nullptr);
// Skip empty entries.
if (record->length == 0)
return;
DirectoryRecord *dir = record;
if (!continueReading) {
// Skip '.'
dir = record->nextDir();
assert( dir->length != 0 );
// Skip '..'
dir = dir->nextDir();
}
// Visit every entry on the directory.
while (dir->length != 0) {
// -2 takes into account ';1'
uint32_t identifierSize = dir->identifierLength;
if (dir->isDirectory() == 0 && identifierSize > 2)
identifierSize -= 2;
uint32_t lastPrime = 0;
uint32_t hash = generateHash(dir->identifierPtr(), identifierSize,
parentHash, parentPrime, HASH_PRIME, &lastPrime);
#ifdef DEBUG_CDBLOCK
char identifierName[256];
memcpy(identifierName, dir->identifierPtr(), identifierSize);
identifierName[identifierSize] = 0;
char tmpBuffer[1024];
sprintf(tmpBuffer, "Added %s (%lu) to header table\n", identifierName, hash);
dbgio_buffer(tmpBuffer);
dbgio_flush();
#endif
if (dir->isDirectory()) {
// Add '/'
hash += HASH_CHAR('/') * lastPrime;
hash %= HASH_CUT_NUMBER;
lastPrime *= HASH_PRIME;
// Visit children.
uint32_t extraLevels = dir->extentLength() / 2048;
if (dir->extentLength() % 2048)
extraLevels++;
for (uint32_t level = 0; level < extraLevels; ++level) {
Sector sector;
const int stat = cd_block_read_data(LBA2FAD(dir->extentLocation()) +
level, 2048, sector.data);
assert(stat == 0);
DirectoryRecord *newRecord = (DirectoryRecord*) sector.data;
fillHeaderTableEntry(newRecord, hash, lastPrime, entry,
headerTable, level > 0);
}
} else {
// Add file entry.
(*entry)->filenameHash = hash;
(*entry)->lba = dir->extentLocation();
(*entry)->size = dir->extentLength();
if (dir->extentLength() == 0) {
char identifierName[256];
memcpy(identifierName, dir->identifierPtr(), identifierSize);
identifierName[identifierSize] = 0;
char tmpBuffer[1024];
sprintf(tmpBuffer, "Invalid 0 byte file detected: %s\n", identifierName);
dbgio_buffer(tmpBuffer);
dbgio_flush();
assert(false);
}
headerTable->numEntries += 1;
(*entry) += 1;
}
dir = dir->nextDir();
}
}
} // namespace ''
int initialize() {
static_assert(sizeof(VolumeDescriptorSet) == 2048,
"VolumeDescriptorSet size mismatch.");
static_assert(sizeof(PrimaryVolumeDescriptor) == 2048,
"PrimaryVolumeDescriptor size mismatch.");
int returnCode;
if ((returnCode = cd_block_init(0x0002)) != 0)
return returnCode;
if (cd_block_cmd_is_auth(nullptr) == 0) {
if ((returnCode = cd_block_bypass_copy_protection()) != 0)
return returnCode;
}
return 0;
}
int readFilesystem(FilesystemData *fsData) {
assert(fsData != nullptr);
// Skip the first 16 sectors dedicated to IP.BIN
uint8_t startFAD = LBA2FAD(16);
CdBlock::VolumeDescriptorSet tempSet;
// Find Primary Volume Descriptor.
int cdBlockRet = 0;
do {
cdBlockRet = cd_block_read_data(startFAD, 2048, (uint8_t*) &tempSet);
if (cdBlockRet != 0)
return cdBlockRet;
else if (tempSet.type != CdBlock::VD_PRIMARY)
startFAD++;
} while (tempSet.type != CdBlock::VD_PRIMARY);
CdBlock::PrimaryVolumeDescriptor *primaryDescriptor =
(CdBlock::PrimaryVolumeDescriptor*) &tempSet;
// Jump to root sector and retrieve it.
const int stat = cd_block_read_data(
LBA2FAD(primaryDescriptor->rootDirectoryRecord.extentLocation()),
2048, (uint8_t*) &fsData->rootSector);
assert(stat == 0);
return 0;
}
void navigateFilesystem(FilesystemData *fsData,
RecordFunction recordFunction, void *userData) {
assert(fsData != nullptr);
navigateDirectory(fsData->root(), 0, recordFunction, userData);
}
void printCdStructure(FilesystemData *fsData) {
assert(fsData != nullptr);
navigateDirectory(fsData->root(), 0, printDirectoryRecord, nullptr);
}
uint32_t getHeaderTableSize(FilesystemData *fsData) {
assert(fsData != nullptr);
uint32_t numEntries = 0;
navigateDirectory(fsData->root(), 0,
[](DirectoryRecord *dir, int, void *length) {
uint32_t *lengthData = (uint32_t*) length;
if (!dir->isDirectory())
(*lengthData)++;
}, &numEntries
);
return (numEntries * sizeof(FilesystemEntry));
}
void fillHeaderTable(FilesystemData *fsData,
FilesystemHeaderTable *headerTable) {
assert(fsData != nullptr);
assert(headerTable != nullptr);
assert(headerTable->entries != nullptr);
headerTable->numEntries = 0;
FilesystemEntry *iterEntry = headerTable->entries;
fillHeaderTableEntry(fsData->root(), 0, HASH_PRIME,
&iterEntry, headerTable);
quickSort(headerTable->entries, 0, headerTable->numEntries - 1);
}
void getFileEntry(FilesystemHeaderTable *headerTable,
uint32_t filenameHash, FilesystemEntry **resultingEntry) {
assert(headerTable != nullptr);
assert(resultingEntry != nullptr);
binarySearch(headerTable->entries, headerTable->numEntries,
{ filenameHash, 0, 0 }, resultingEntry);
}
int getFileContents(FilesystemEntry *entry, void *buffer) {
assert(entry != nullptr);
assert(buffer != nullptr);
uint8_t tmpBuffer[2048];
uint8_t *dstBuffer = (uint8_t*) buffer;
uint32_t missingBytes = entry->size;
uint32_t readingLBA = entry->lba;
while (missingBytes > 0) {
int ret = cd_block_read_data(LBA2FAD(readingLBA), 2048, tmpBuffer);
if (ret != 0)
return ret;
if (missingBytes > 2048) {
memcpy(dstBuffer, tmpBuffer, 2048);
dstBuffer += 2048;
missingBytes -= 2048;
// Jump to next LBA.
readingLBA++;
} else {
memcpy(dstBuffer, tmpBuffer, missingBytes);
missingBytes = 0;
}
}
return 0;
}
} // namespace CdBlock
| [
"[email protected]"
] | |
9556a6dddf513fb4a15d94a6170e43ad207ddf24 | f2f250eaddaed6899362e44d99e0910bb522e758 | /src/qe/qe.cc | 65f3a11c7a93102f01cf7f3c913484ffb9cb7268 | [] | no_license | pramitchoudhary/MiniDatabaseProject | 986333d338ec03d73584fc252e482308bc8b8519 | b6c49ae99fbf72aafd8c5b7d357021234b15059f | refs/heads/master | 2021-01-25T07:35:19.081765 | 2014-02-26T20:15:54 | 2014-02-26T20:15:54 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 39,226 | cc |
#include "qe.h"
#include <iostream>
#include <sstream>
#include <math.h>
#include <sys/stat.h>
#include <time.h>
Filter::Filter(Iterator *input, // Iterator of input R
const Condition &condition // Selection condition
)
{
m_input = input;
// Maintain a copy of the condition used i the constructor
m_condition.bRhsIsAttr = condition.bRhsIsAttr;
m_condition.lhsAttr = condition.lhsAttr;
m_condition.op = condition.op;
m_condition.rhsAttr = condition.rhsAttr;
if (m_condition.bRhsIsAttr)
{
cout << "ERROR - Filter Condition cannot take a condition comparing two Attribute objects." << endl;
}
if (m_condition.rhsValue.type == TypeVarChar)
{
int len = *(int *)((char *)m_condition.rhsValue.data);
m_condition.rhsValue.data = malloc(sizeof(int) + len);
memcpy(m_condition.rhsValue.data, (char *)condition.rhsValue.data, sizeof(int)+len);
m_condition.rhsValue.type = condition.rhsValue.type;
}
else if (m_condition.rhsValue.type == TypeReal) //(m_condition.rhsValue.type == TypeReal)
{
m_condition.rhsValue.type = condition.rhsValue.type;
m_condition.rhsValue.data = malloc(sizeof(float));
memcpy(m_condition.rhsValue.data, (float *)condition.rhsValue.data, 4); // Note that sizeof(int) and float is assumed to be 4.
}
else // (m_condition.rhsValue.type == TypeInt)
{
m_condition.rhsValue.type = condition.rhsValue.type;
m_condition.rhsValue.data = malloc(sizeof(int));
memcpy(m_condition.rhsValue.data, (int *)condition.rhsValue.data, 4); // Note that sizeof(int) and float is assumed to be 4.
}
m_filterAttrNumber = -1;
// Call the getAttributes method on the Iterator to get the attributes inside input
input->getAttributes(m_inputAttrs);
for (unsigned i=0; i<m_inputAttrs.size(); i++)
{
if (m_inputAttrs.at(i).name.compare(m_condition.lhsAttr) == 0)
{
m_filterAttrNumber = i;
break;
}
}
if (m_filterAttrNumber == -1)
{
cout << "ERROR - Filter condition did not match any attribute in the Attribute List" << endl;
}
}
Filter::~Filter()
{
free(m_condition.rhsValue.data);
}
RC Filter::getNextTuple(void *data)
{
cout << "Inside Filter... getNextTuple :" << endl;
if (m_filterAttrNumber == -1)
{
cout << "ERROR - Filter condition did not match any attribute in the Attribute List" << endl;
return QE_EOF;
}
while(m_input->getNextTuple(data) != RM_EOF)
{
vector<Value> attrValues;
// Break up data into constituent items
_parseDataBuffer(data, m_inputAttrs, attrValues);
// Check if the condition matches the attribute value at the corresponding location in the record
if (_isFilterCondTrue(m_condition, attrValues.at(m_filterAttrNumber) ))
{
cout << "Record found in Filter... " << endl;
return 0;
}
}
cout << "Leaving Filter... getNextTuple :" << endl;
return QE_EOF;
}
void Filter::getAttributes(vector<Attribute> &attrs) const
{
// Filter does not alter the attribute list.
attrs = this->m_inputAttrs;
}
// Project
Project::Project(Iterator *input, const vector<string> &attrNames)
{
m_input = input;
m_input->getAttributes(m_originalSetAttrs);
m_inputAttrName.clear();
m_inputAttrName = attrNames;
vector<Attribute> temp;
getAttributes(temp);
}
Project::~Project()
{
m_inputAttrName.clear();
m_originalSetAttrs.clear();
}
RC Project::getNextTuple(void *data)
{
// open up the data and remove the unwanted attributes.
void * returnedData = malloc(PF_PAGE_SIZE);
//initialize
memset(returnedData, 0, PF_PAGE_SIZE);
int offset = 0;
int offsetReturn = 0;
int count =0;
int noOfAttributes = m_inputAttrName.size();
if(m_input->getNextTuple(returnedData)!= QE_EOF)
{
for(int k =0; k<noOfAttributes; k++)
{
offsetReturn = 0;
for(unsigned i =0; i< m_originalSetAttrs.size(); i++)
{
if(m_originalSetAttrs[i].name == m_inputAttrName[k])
{
if(m_originalSetAttrs[i].type == TypeVarChar)
{
int sizeVarChar =0; // size of the varchar
memcpy(&sizeVarChar , (char*)returnedData + offsetReturn , sizeof(int));
memcpy((char *)data + offset, &sizeVarChar , sizeof(int)); // copied to return Data
offset += sizeof(int);
offsetReturn+=sizeof(int);
memcpy((char *)data + offset, (char*)returnedData + offsetReturn, sizeVarChar);
offset += sizeVarChar;
count+=1;
break;
}
else if(m_originalSetAttrs[i].type == TypeInt || m_originalSetAttrs[i].type == TypeReal)
{
memcpy((char*)data+ offset, (char *)returnedData+ offsetReturn, sizeof(int));
offset+= sizeof(int);
offsetReturn += sizeof(int);
count+=1;
break;
}
}
else
{
if(m_originalSetAttrs[i].type == TypeVarChar)
{
int sizeVarChar =0; // size of the varchar
memcpy(&sizeVarChar , (char*)returnedData + offsetReturn , sizeof(int));
offsetReturn +=sizeof(int) + sizeVarChar;
}
else if(m_originalSetAttrs[i].type == TypeInt || m_originalSetAttrs[i].type == TypeReal)
{
offsetReturn+=sizeof(int);
}
}
}
}
if(count == noOfAttributes)
{
free(returnedData);
return 0;
}
}
return QE_EOF;
}
void Project::getAttributes(vector<Attribute> &attrs) const
{
attrs.clear();
vector<Attribute>::const_iterator itr;
for(unsigned k =0; k<m_inputAttrName.size(); k++)
{
for(itr = m_originalSetAttrs.begin(); itr!=m_originalSetAttrs.end(); itr++)
{
if(itr->name == m_inputAttrName[k])
{
attrs.push_back(*itr);
}
}
}
}
// We implement a tuple-based NL Join here.
NLJoin::NLJoin(Iterator *leftIn, // Iterator of input R
TableScan *rightIn, // TableScan Iterator of input S
const Condition &condition, // Join condition
const unsigned numPages // Number of pages can be used to do join (decided by the optimizer)
)
{
m_leftIn = leftIn;
m_rightIn = rightIn;
m_numPages = numPages;
// Maintain a copy of the condition used in the constructor
m_condition = condition; // <-- Check if this works
m_condition.bRhsIsAttr = condition.bRhsIsAttr;
m_condition.lhsAttr = condition.lhsAttr;
m_condition.op = condition.op;
m_condition.rhsAttr = condition.rhsAttr;
m_lAttrIndex = -1;
leftIn->getAttributes(m_lAttrs);
for (unsigned i=0; i<m_lAttrs.size(); i++)
{
if (m_lAttrs.at(i).name.compare(m_condition.lhsAttr) == 0)
{
m_lAttrIndex = i;
}
}
if (m_lAttrIndex == -1)
{
cout << "ERROR - Condition LHS Attribute did not match any attribute in the LHS Attribute List" << endl;
}
m_rAttrIndex = -1;
rightIn->getAttributes(m_rAttrs);
for (unsigned i=0; i<m_rAttrs.size(); i++)
{
if (m_rAttrs.at(i).name.compare(m_condition.rhsAttr) == 0)
{
m_rAttrIndex = i;
}
}
if (m_rAttrIndex == -1)
{
cout << "ERROR - Condition RHS Attribute did not match any attribute in the RHS Attribute List" << endl;
}
}
NLJoin::~NLJoin()
{
m_lAttrs.clear();
m_rAttrs.clear();
}
RC NLJoin::getNextTuple(void *data)
{
cout << "Inside NLJoin... getNextTuple :" << endl;
if (m_lAttrIndex == -1)
{
cout << "ERROR - Condition LHS Attribute did not match any attribute in the LHS Attribute List" << endl;
return QE_EOF;
}
if (m_rAttrIndex == -1)
{
cout << "ERROR - Condition RHS Attribute did not match any attribute in the RHS Attribute List" << endl;
return QE_EOF;
}
/*
* In NL Join, we iterate on the left Relation as the outer.
* Get a tuple.
* Iterate on the right Relation as the inner.
* Check if the Join condition is satisfied.
* If so, return the combined set of columns in the *data buffer
* If not, Loop through the inner relation.
* If the inner relation runs out (ie. EOF) then reset the Inner and start from the beginning.
* At the same time, do a getNextTupe on the outer.
* If the Outer relation runs out then return EOF.
*/
void *dataLeft = malloc(QE_MAX_DATA);
void *dataRight = malloc(QE_MAX_DATA);
vector<Value> attrLValues;
vector<Value> attrRValues;
vector<Value>::iterator itAV;
while(m_leftIn->getNextTuple(dataLeft) != QE_EOF)
{
while(m_rightIn->getNextTuple(dataRight) != RM_EOF)
{
attrLValues.clear();
attrRValues.clear();
// Break up dataLeft into constituent items
_parseDataBuffer(dataLeft, m_lAttrs, attrLValues);
_parseDataBuffer(dataRight, m_rAttrs, attrRValues);
// Check if the condition matches the attribute value at the corresponding location in the record
bool bRecordMatch = _bCompareValues(attrLValues.at(m_lAttrIndex), m_condition.op, attrRValues.at(m_rAttrIndex));
if (bRecordMatch)
{
cout << "Record found in NLJoin... " << endl;
//Combine attrLValues and attrRValues
//Convert combined vector to dataBuffer
//Populate *data
itAV = attrLValues.end();
attrLValues.insert(itAV, attrRValues.begin(), attrRValues.end());
_formatDataBuffer(attrLValues, data);
free(dataLeft);
free(dataRight);
return 0;
}
else
{
//cout << "Skipping to next record in Inner NL" << endl;
}
}
// Reset the inner relation
m_rightIn->setIterator();
}
free(dataLeft);
free(dataRight);
cout << "Leaving NLJoin... getNextTuple :" << endl;
return QE_EOF;
}
// For attribute in vector<Attribute>, name it as rel.attr
void NLJoin::getAttributes(vector<Attribute> &attrs) const
{
attrs.clear();
vector<Attribute>::iterator it;
it = attrs.begin();
attrs.insert(it, m_lAttrs.begin(), m_lAttrs.end());
it = attrs.end();
attrs.insert(it, m_rAttrs.begin(), m_rAttrs.end());
}
INLJoin::INLJoin(Iterator *leftIn, // Iterator of input R
IndexScan *rightIn, // IndexScan Iterator of input S
const Condition &condition, // Join condition
const unsigned numPages // Number of pages can be used to do join (decided by the optimizer)
)
{
m_leftIn = leftIn;
m_rightIn = rightIn;
m_numPages = numPages;
// Maintain a copy of the condition used in the constructor
m_condition = condition; // <-- Check if this works
m_condition.bRhsIsAttr = condition.bRhsIsAttr;
m_condition.lhsAttr = condition.lhsAttr;
m_condition.op = condition.op;
m_condition.rhsAttr = condition.rhsAttr;
m_lAttrIndex = -1;
leftIn->getAttributes(m_lAttrs);
for (unsigned i=0; i<m_lAttrs.size(); i++)
{
if (m_lAttrs.at(i).name.compare(m_condition.lhsAttr) == 0)
{
m_lAttrIndex = i;
}
}
if (m_lAttrIndex == -1)
{
cout << "ERROR - Condition LHS Attribute did not match any attribute in the LHS Attribute List" << endl;
}
m_rAttrIndex = -1;
rightIn->getAttributes(m_rAttrs);
for (unsigned i=0; i<m_rAttrs.size(); i++)
{
if (m_rAttrs.at(i).name.compare(m_condition.rhsAttr) == 0)
{
m_rAttrIndex = i;
}
}
if (m_rAttrIndex == -1)
{
cout << "ERROR - Condition RHS Attribute did not match any attribute in the RHS Attribute List" << endl;
}
}
INLJoin::~INLJoin()
{
m_lAttrs.clear();
m_rAttrs.clear();
}
RC INLJoin::getNextTuple(void *data)
{
cout << "Inside INLJoin... getNextTuple :" << endl;
if (m_lAttrIndex == -1)
{
cout << "ERROR - Condition LHS Attribute did not match any attribute in the LHS Attribute List" << endl;
return QE_EOF;
}
if (m_rAttrIndex == -1)
{
cout << "ERROR - Condition RHS Attribute did not match any attribute in the RHS Attribute List" << endl;
return QE_EOF;
}
/*
* In INL Join, we iterate on the left Relation as the outer.
* Get a tuple.
* Iterate on the right Relation as the inner.
* Check if the Join condition is satisfied.
* If so, return the combined set of columns in the *data buffer
* If not, Loop through the inner relation.
* If the inner relation runs out (ie. EOF) then reset the Inner and start from the beginning.
* At the same time, do a getNextTupe on the outer.
* If the Outer relation runs out then return EOF.
*/
void *dataLeft = malloc(QE_MAX_DATA);
void *dataRight = malloc(QE_MAX_DATA);
vector<Value> attrLValues;
vector<Value> attrRValues;
vector<Value>::iterator itAV;
while(m_leftIn->getNextTuple(dataLeft) != QE_EOF)
{
m_rightIn->setIterator(NO_OP, NULL);
while(m_rightIn->getNextTuple(dataRight) != RM_EOF)
{
attrLValues.clear();
attrRValues.clear();
// Break up dataLeft into constituent items
_parseDataBuffer(dataLeft, m_lAttrs, attrLValues);
_parseDataBuffer(dataRight, m_rAttrs, attrRValues);
// Check if the condition matches the attribute value at the corresponding location in the record
bool bRecordMatch = _bCompareValues(attrLValues.at(m_lAttrIndex), m_condition.op, attrRValues.at(m_rAttrIndex));
if (bRecordMatch)
{
cout << "Record found in INLJoin... " << endl;
//Combine attrLValues and attrRValues
//Convert combined vector to dataBuffer
//Populate *data
itAV = attrLValues.end();
attrLValues.insert(itAV, attrRValues.begin(), attrRValues.end());
_formatDataBuffer(attrLValues, data);
free(dataLeft);
free(dataRight);
return 0;
}
else
{
//cout << "Skipping to next record in Inner INL" << endl;
}
}
// Reset the inner relation - We are doing this before the while anyway.
// m_rightIn->setIterator(NO_OP, NULL);
}
free(dataLeft);
free(dataRight);
cout << "Leaving INLJoin... getNextTuple :" << endl;
return QE_EOF;
}
void INLJoin::getAttributes(vector<Attribute> &attrs) const
{
attrs.clear();
vector<Attribute>::iterator it;
it = attrs.begin();
attrs.insert(it, m_lAttrs.begin(), m_lAttrs.end());
it = attrs.end();
attrs.insert(it, m_rAttrs.begin(), m_rAttrs.end());
}
HashJoin::HashJoin(Iterator *leftIn, // Iterator of input R
Iterator *rightIn, // Iterator of input S
const Condition &condition, // Join condition
const unsigned numPages // Number of pages can be used to do join (decided by the optimizer)
)
{
/*
* - Determine the Left and Right attributes in the condition
* - Check if they are of the same type.
* - Determine the hash function to use
* - Create as many page files as provided in the numPages... (or determine how to translate to partitions)
* - each paged file corresponds to a bucket.
* - Read Each tuple from LeftIn (outer relation R)
* - Apply Hash function on join attribute, determine the hash bucket
* - Write data into the corresponding bucket file
* - Read Each tuple from RightIn (inner relation S)
* - Apply Hash function on join attribute, determine the hash bucket
* - Write data into the corresponding bucket file
* - Create a TEMP_HJ_RESULT PagedFile
* - For Each partition i, do...
* - Read all records from the Si partition
* - Make hashtable, hashing on the join attribute using a different hash function
* For each record in the Ri partition do
* - Hash the join attribute
* - Locate the bucket in the hash table
* - Join the records and insert into the TEMP_HJ_RESULT paged file (if the record matches)
* end for
* end for
*
*
*
*/
m_leftIn = leftIn;
m_rightIn = rightIn;
m_numPages = numPages;
// Maintain a copy of the condition used in the constructor
m_condition.bRhsIsAttr = condition.bRhsIsAttr;
m_condition.lhsAttr = condition.lhsAttr;
m_condition.op = condition.op;
m_condition.rhsAttr = condition.rhsAttr;
m_lAttrIndex = -1;
leftIn->getAttributes(m_lAttrs);
for (unsigned i=0; i<m_lAttrs.size(); i++)
{
if (m_lAttrs.at(i).name.compare(m_condition.lhsAttr) == 0)
{
m_lAttrIndex = i;
}
}
if (m_lAttrIndex == -1)
{
cout << "ERROR - Condition LHS Attribute did not match any attribute in the LHS Attribute List" << endl;
}
m_rAttrIndex = -1;
rightIn->getAttributes(m_rAttrs);
for (unsigned i=0; i<m_rAttrs.size(); i++)
{
if (m_rAttrs.at(i).name.compare(m_condition.rhsAttr) == 0)
{
m_rAttrIndex = i;
}
}
if (m_rAttrIndex == -1)
{
cout << "ERROR - Condition RHS Attribute did not match any attribute in the RHS Attribute List" << endl;
}
// TODO: Based on numPages, compute the numParts - number of partitions.
m_numPartitions = numPages; // Used to be: 5;
m_numKeyBuckets = m_numPartitions * 10; // Used to be: 50;
unsigned currPart = 0;
for (unsigned i=0; i<m_numPartitions; i++)
{
ostringstream ostr;
ostr << "LEFT_IN_P" << i;
PF_FileHandle pf;
_openTempTable(ostr.str(),pf);
m_lIn_PartName.push_back(ostr.str());
m_leftIn_PF.push_back(pf);
}
for (unsigned i=0; i<m_numPartitions; i++)
{
ostringstream ostr;
ostr << "RIGHT_IN_P" << i;
PF_FileHandle pf;
_openTempTable(ostr.str(),pf);
m_rIn_PartName.push_back(ostr.str());
m_rightIn_PF.push_back(pf);
}
// Allocate enough room for a record.
void *dataLeft = malloc(QE_MAX_DATA);
while(leftIn->getNextTuple(dataLeft) != QE_EOF)
{
vector<Value> attrValues;
// Break up data into constituent items
unsigned recLen;
recLen = _parseDataBuffer(dataLeft, m_lAttrs, attrValues);
// Determine the partition to send to
currPart = _generatePartitionKey(attrValues.at(m_lAttrIndex), m_numPartitions);
ostringstream ostr;
ostr << "LEFT_IN_P" << currPart;
RID rid;
// Write to corresponding partition
_insertTupleIntoTempTableBucket(ostr.str(), m_leftIn_PF.at(currPart), dataLeft, recLen, rid);
cout << "Record added to Temp Table: " << ostr.str() << " Length=" << recLen << " bytes at RID: " << rid.pageNum << "|" << rid.slotNum << endl;
}
free(dataLeft);
void *dataRight = malloc(QE_MAX_DATA);
while(rightIn->getNextTuple(dataRight) != QE_EOF)
{
vector<Value> attrValues;
// Break up data into constituent items
unsigned recLen;
recLen = _parseDataBuffer(dataRight, m_rAttrs, attrValues);
// Determine the partition to send to
currPart = _generatePartitionKey(attrValues.at(m_rAttrIndex), m_numPartitions);
ostringstream ostr;
ostr << "RIGHT_IN_P" << currPart;
RID rid;
// Write to corresponding partition
_insertTupleIntoTempTableBucket(ostr.str(), m_rightIn_PF.at(currPart), dataRight, recLen, rid);
cout << "Record added to Temp Table: " << ostr.str() << " Length=" << recLen << " bytes at RID: " << rid.pageNum << "|" << rid.slotNum << endl;
}
free(dataRight);
// Create a HashJoinResult File
srand ( time(NULL) );
unsigned rn = rand();
ostringstream ostr;
ostr << "TEMP_HJ_RESULT_" << rn;
m_hjResultFilename = ostr.str();
_openTempTable(m_hjResultFilename, m_hjResultPF);
for (unsigned i=0; i<m_numPartitions; i++)
{
multimap<unsigned,RecordInfo> partitionMap;
multimap<unsigned,RecordInfo>::iterator mapIt;
_createMapFromPartition(m_rIn_PartName.at(i), m_rightIn_PF.at(i), m_rAttrs, m_rAttrIndex, m_numKeyBuckets, partitionMap);
cout << "Hash Table has " << partitionMap.size() << " entries." << endl;
dataLeft = malloc(QE_MAX_DATA);
// dataRight = malloc(QE_MAX_DATA);
vector<Value> attrLValues;
vector<Value> attrRValues;
vector<Value>::iterator itAV;
// This is so that we get all records in sequence. Needs to be reset for each partition.
m_lastRid.pageNum = 0;
m_lastRid.slotNum = 0;
while(_getNextTupleFromTempTable(m_lIn_PartName.at(i), m_leftIn_PF.at(i), dataLeft, m_lastRid) != QE_EOF)
{
// Match the record from the hash table
attrLValues.clear();
// Break up dataLeft into constituent items
_parseDataBuffer(dataLeft, m_lAttrs, attrLValues);
// Determine the key value to hash the record to
unsigned recKey = _generatePartitionKey(attrLValues.at(m_lAttrIndex), m_numKeyBuckets);
mapIt = partitionMap.find(recKey);
if (mapIt!=partitionMap.end())
{
// Key found. Now check for the values as there can be more than one hit due to key collision
do
{
dataRight = mapIt->second.recData;
attrRValues.clear();
_parseDataBuffer(dataRight, m_rAttrs, attrRValues);
// Check
// Check if the condition matches the attribute value at the corresponding location in the record
bool bRecordMatch = _bCompareValues(attrLValues.at(m_lAttrIndex), m_condition.op, attrRValues.at(m_rAttrIndex));
if (bRecordMatch)
{
//cout << "Record found in HashJoin... " << endl;
//Combine attrLValues and attrRValues
//Convert combined vector to dataBuffer
//Populate *data
itAV = attrLValues.end();
attrLValues.insert(itAV, attrRValues.begin(), attrRValues.end());
// Join
void *data = malloc(QE_MAX_DATA);
int newRecSize = _formatDataBuffer(attrLValues, data);
// DO NOT FREE dataRight free(dataRight);
//Write
RID rid;
RC rc = _insertTupleIntoTempTableBucket(m_hjResultFilename, m_hjResultPF, data, newRecSize, rid);
if (rc!=0)
{
cout << "ERROR - Insert Record into Hash table Results file has failed." << endl;
}
}
else
{
//cout << "Skipping to next record on Hash table" << endl;
}
mapIt++;
} while (mapIt != partitionMap.upper_bound(recKey));
}
}
free(dataLeft);
partitionMap.clear();
}
for (unsigned i=0; i<m_numPartitions; i++)
{
_closeTempTable(m_leftIn_PF.at(i));
_removeTempTable(m_lIn_PartName.at(i));
_closeTempTable(m_rightIn_PF.at(i));
_removeTempTable(m_rIn_PartName.at(i));
}
m_lIn_PartName.clear();
m_leftIn_PF.clear();
m_rIn_PartName.clear();
m_rightIn_PF.clear();
// At this point only the Hash Join Result Table must be on the disk.
// Set the Last Rid for getNextTuple to return from the beginning
m_lastRid.pageNum = 0;
m_lastRid.slotNum = 0;
}
HashJoin::~HashJoin()
{
/*
* - Remove the Paged Files from disk
* - Delete all vectors
* - Free memory allocs
*/
m_lAttrs.clear();
m_rAttrs.clear();
_closeTempTable(m_hjResultPF);
_removeTempTable(m_hjResultFilename);
}
RC HashJoin::getNextTuple(void *data)
{
/*
* - While GetNextTupleFromTEMP_HS_JOIN Paged File != EOF
* Return the next row
* End While
* Return QE_EOF
*/
while(_getNextTupleFromTempTable(m_hjResultFilename, m_hjResultPF, data, m_lastRid) != QE_EOF)
{
cout << "Record found in HashJoin... " << endl;
return 0;
}
return QE_EOF;
}
// For attribute in vector<Attribute>, name it as rel.attr
void HashJoin::getAttributes(vector<Attribute> &attrs) const
{
attrs.clear();
vector<Attribute>::iterator it;
it = attrs.begin();
attrs.insert(it, m_lAttrs.begin(), m_lAttrs.end());
it = attrs.end();
attrs.insert(it, m_rAttrs.begin(), m_rAttrs.end());
}
unsigned _generatePartitionKey(Value attrVal, unsigned uParts)
{
PF_Interface *_pfi = PF_Interface::Instance();
if (attrVal.type == TypeInt)
{
int iVal = 0;
iVal = _pfi->getIntFromBuffer(attrVal.data, 0);
return (abs(iVal) % uParts);
}
else if (attrVal.type == TypeReal)
{
float fVal = 0;
fVal = _pfi->getFloatFromBuffer(attrVal.data, 0);
unsigned temp = (unsigned)ceil(fabs(fVal));
return (temp % uParts);
}
else
{
// This is Jenkins one-at-a-time Hash function
// http://en.wikipedia.org/wiki/Jenkins_hash_function
unsigned iLen = 0;
iLen = _pfi->getIntFromBuffer(attrVal.data, 0);
char *key = (char *)attrVal.data+4;
unsigned hash=0;
unsigned i;
for(i=0;(i < iLen); ++i)
{
hash += key[i];
hash += (hash << 10);
hash ^= (hash >> 6);
}
hash += (hash << 3);
hash ^= (hash >> 11);
hash += (hash << 15);
return (hash % uParts);
}
return 0;
}
unsigned _formatDataBuffer(vector<Value> &attrValues, void *data)
{
PF_Interface *_pfi = PF_Interface::Instance();
unsigned offset = 0;
for (unsigned i=0; i<attrValues.size(); i++)
{
if (attrValues.at(i).type == TypeInt)
{
memcpy((char *)data+offset, (char *)attrValues.at(i).data, sizeof(int));
offset += sizeof(int);
}
else if (attrValues.at(i).type == TypeReal)
{
memcpy((char *)data+offset, (char *)attrValues.at(i).data, sizeof(float));
offset += sizeof(float);
}
else // (attrValues.at(i).type == TypeVarChar)
{
int vLen = _pfi->getIntFromBuffer(attrValues.at(i).data, 0);
memcpy((char *)data+offset, (char *)attrValues.at(i).data, sizeof(int) + vLen);
offset += sizeof(int) + vLen;
}
}
return offset;
}
unsigned _parseDataBuffer(void *data, vector<Attribute> &attrs, vector<Value> &attrValues)
{
unsigned offset = 0;
for (unsigned i=0; i<attrs.size(); i++)
{
Value tempVal;
tempVal.type = attrs.at(i).type;
if (attrs.at(i).type == TypeInt)
{
tempVal.data = malloc(sizeof(int));
memcpy(tempVal.data, (char *)data + offset, sizeof(int));
offset += sizeof(int);
}
else if (attrs.at(i).type == TypeReal)
{
tempVal.data = malloc(sizeof(float));
memcpy(tempVal.data, (char *)data + offset, sizeof(float));
offset += sizeof(float);
}
else // type == TypeVarChar
{
int length = *(int *)((char *)data + offset);
tempVal.data = malloc(sizeof(int) + length);
memcpy(tempVal.data, (char *)data + offset, sizeof(int) + length);
offset += sizeof(int) + length;
}
attrValues.push_back(tempVal);
}
return offset;
}
// This checks if the attribute value matches the condition
bool _isFilterCondTrue(Condition condition, Value attrValue)
{
if (condition.bRhsIsAttr)
{
cout << "ERROR - Filter Condition cannot handle Attribute on RHS. " << endl;
return false;
}
bool b = _bCompareValues(attrValue, condition.op, condition.rhsValue);
return b;
}
bool _bCompareValues(Value lValue, CompOp op, Value rValue)
{
PF_Interface *_pfi = PF_Interface::Instance();
if (lValue.type == rValue.type)
{
if (lValue.type == TypeInt)
{
int iL = 0;
int iR = 0;
iL = _pfi->getIntFromBuffer(lValue.data, 0);
iR = _pfi->getIntFromBuffer(rValue.data, 0);
switch (op)
{
case EQ_OP:
{
if (iL == iR)
return true;
else
return false;
}
case LT_OP:
{
if (iL < iR)
return true;
else
return false;
}
case GT_OP:
{
if (iL > iR)
return true;
else
return false;
}
case LE_OP:
{
if (iL <= iR)
return true;
else
return false;
}
case GE_OP:
{
if (iL >= iR)
return true;
else
return false;
}
case NE_OP:
{
if (iL != iR)
return true;
else
return false;
}
default:
{
return false;
}
}
}
else if (lValue.type == TypeReal)
{
float fL = 0;
float fR = 0;
fL = _pfi->getFloatFromBuffer(lValue.data, 0);
fR = _pfi->getFloatFromBuffer(rValue.data, 0);
//cout << "Comparing " << fL << " with " << fR << " fabs Value = " << fabs(fL-fR) << " ." << endl;
switch (op)
{
case EQ_OP:
{
if (fabs(fL-fR) <= IX_TINY)
return true;
else
return false;
}
case LT_OP:
{
if (fL < fR)
return true;
else
return false;
}
case GT_OP:
{
if (fL > fR)
return true;
else
return false;
}
case LE_OP:
{
if (fL <= fR)
return true;
else
return false;
}
case GE_OP:
{
if (fL >= fR)
return true;
else
return false;
}
case NE_OP:
{
if (fabs(fL-fR) > IX_TINY)
return true;
else
return false;
}
default:
{
return false;
}
}
}
else // type == TypeVarChar
{
int vLen = 0;
string sL = "";
string sR = "";
vLen = _pfi->getIntFromBuffer(lValue.data, 0);
sL = _pfi->getVarcharFromBuffer(lValue.data, sizeof(int), vLen);
vLen = _pfi->getIntFromBuffer(rValue.data, 0);
sR = _pfi->getVarcharFromBuffer(rValue.data, sizeof(int), vLen);
switch (op)
{
case EQ_OP:
{
if (sL.compare(sR) == 0)
return true;
else
return false;
}
case LT_OP:
{
if (sL.compare(sR) < 0)
return true;
else
return false;
}
case GT_OP:
{
if (sL.compare(sR) > 0)
return true;
else
return false;
}
case LE_OP:
{
if (sL.compare(sR) <= 0)
return true;
else
return false;
}
case GE_OP:
{
if (sL.compare(sR) >= 0)
return true;
else
return false;
}
case NE_OP:
{
if (sL.compare(sR) != 0)
return true;
else
return false;
}
default:
{
return false;
}
}
}
}
else
{
cout << "ERROR - Compare Values will only be possible with values of the same Type. " << endl;
return false;
}
}
RC _insertTupleIntoTempTableBucket(const string tableName, PF_FileHandle pfh, const void *data, const int newRecSize, RID &rid)
{
PF_Interface *m_pfi = PF_Interface::Instance();
string upperTableName = _strToUpper(tableName);
// Variable Initialization
int freePtr=0;
int newSlotPtr=0;
int noOfSlots=0;
int newSlotSize=0;
int pgNum=0;
int result=0;
RC rc;
void *buffer = malloc(PF_PAGE_SIZE);
// Locate the next free page
pgNum = m_pfi->locateNextFreePage( pfh, newRecSize);
if (pgNum < 0)
{
cout << "ERROR - Unable to locate next free page from Table." << endl;
result =-1;
}
// Read the Page and update the buffer
rc = m_pfi->getPage(pfh, pgNum, buffer);
if (rc != 0)
{
cout << "ERROR - Unable to read Page from Table. RC=" << rc << endl;
result = -1;
}
//------------------------------------- Reading Slot directory-----------------------------
// Locate the Free Pointer from the slot directory
freePtr = m_pfi->getIntFromBuffer(buffer, PF_PAGE_SIZE-4);
// Find the number of slots in the slot directory
noOfSlots = m_pfi->getIntFromBuffer(buffer, PF_PAGE_SIZE-8);
//------------------------------------------------------------------------------------------
// Write the tuple into the buffer at freePtr
memcpy((char *)buffer + freePtr, data, newRecSize);
//--------------------------------------- Update the slot directory-----------------------------------------
//1. Find the position of the new Slot
//2. compute the value of newSlotPtr
newSlotPtr = PF_PAGE_SIZE - 8 // accounting for the free space pointer & no of slots
- 8 * noOfSlots // each slot occupies 4 bytes for offset and 4 more for size
- 8; // start position for the new slot
//cout<< "NewSlotPointer=" << newSlotPtr << endl;
newSlotSize = newRecSize;
// copy current freePtr at location: newSlotPtr
m_pfi->addIntToBuffer(buffer, newSlotPtr, freePtr);
// copy newSlotSize at location: newSlotPtr+4
m_pfi->addIntToBuffer(buffer, newSlotPtr+4, newSlotSize);
noOfSlots += 1;
freePtr += newRecSize;
// Write freePtr at location: PF_PAGE_SIZE-4
m_pfi->addIntToBuffer(buffer, PF_PAGE_SIZE-4, freePtr);
// Write noOfSlots at location: PF_PAGE_SIZE-8
m_pfi->addIntToBuffer(buffer, PF_PAGE_SIZE-8, noOfSlots);
rid.slotNum = noOfSlots;
rid.pageNum = pgNum;
rc = m_pfi->putPage(pfh, pgNum, buffer);
if (rc != 0)
{
cout << "ERROR - Unable to write Page to Table. RC=" << rc << endl;
result = -1;
}
free(buffer);
return result;
}
RC _readTupleFromTempTableBucket(const string tableName, PF_FileHandle pfh, const RID &rid, void *data)
{
string upperTableName = _strToUpper(tableName);
RC rc;
PF_Interface *_pfi = PF_Interface::Instance();
unsigned uTemp = 0;
if (pfh.GetNumberOfPages()<rid.pageNum)
{
if(rid.pageNum!=IX_NOVALUE)
cout << "ERROR - RID contains a Page that does not exist. Aborting. Page#:" << rid.pageNum << "." << endl;
return -4;
}
// You need to allocate for the page being read and clean it up at the end.
void *buffer = malloc(PF_PAGE_SIZE);
rc = _pfi->getPage(pfh, rid.pageNum, buffer);
if (rc !=0)
{
cout << "ERROR - Read Page#" << rid.pageNum << " from PagedFile " << upperTableName << " errored out. RC=" << rc << "." << endl;
free(buffer);
return -3;
}
//Since the table has atleast Page 0. Let us make sure that we do not proceed if there are no rows.
uTemp = _pfi->getIntFromBuffer(buffer, PF_PAGE_SIZE-8);
if (uTemp < rid.slotNum) // The Slot# you are looking for does not exist.
{
cout << "ERROR - Page#" << rid.pageNum << " Slot#" << rid.slotNum << " from PagedFile " << upperTableName << " does not exist." << endl;
free(buffer);
return -2;
}
// On this page locate the slot pointer of Slot# in RID
uTemp = PF_PAGE_SIZE - 8 - 8*rid.slotNum;
int tuplePtr = _pfi->getIntFromBuffer(buffer, uTemp);
int tupleSize = _pfi->getIntFromBuffer(buffer, uTemp+4);
memcpy((char *)data, (char *)buffer+tuplePtr, tupleSize);
free(buffer);
return 0;
}
RC _openTempTable(const string tableName, PF_FileHandle &fh)
{
PF_Manager *pfM = PF_Manager::Instance();
RC rc = 0;
PF_Interface *pfi = PF_Interface::Instance();
string upperTableName = _strToUpper(tableName);
struct stat stFileInfo;
if (stat(upperTableName.c_str(), &stFileInfo) == 0)
{
cout << upperTableName << "File located on disk. Reusing." << endl;
}
else
{
// No catalog file found. Create one.
rc = pfM->CreateFile(upperTableName.c_str());
if(rc!=0)
{
cout << "File " << upperTableName << " could not be created. Cannot proceed without a catalog." << endl;
return rc;
}
}
// At this point a file called upperTableName should exist on the disk.
rc = pfM->OpenFile(upperTableName.c_str(), fh);
if(rc!=0)
{
cout << "File " << upperTableName << " could not be opened." << endl;
return rc;
}
// Get the number of pages
unsigned count = fh.GetNumberOfPages();
if (count>0)
{
// Good so that the Pagedfile has already been setup on the disk and you should go ahead with it.
}
else
{
// You need to add atleast one page so that we can start writing or modifying content in here.
// Append the first page
// Write blank ASCII characters
void *data = malloc(PF_PAGE_SIZE);
// Initialize the page data with blanks
for(unsigned i = 0; i < PF_PAGE_SIZE-8; i++)
{
*((char *)data+i) = ' ';
}
pfi->addIntToBuffer(data, PF_PAGE_SIZE-8, 0);
pfi->addIntToBuffer(data, PF_PAGE_SIZE-4, 0);
rc = fh.AppendPage(data);
free(data);
}
// Hopefully all should have worked right and a success should be returned.
return rc;
}
// This call may be required only as a cleanup. We can release a TableRef object if one exists.
RC _closeTempTable(PF_FileHandle pf)
{
PF_Manager *pfM = PF_Manager::Instance();
RC rc = 0;
rc = pfM->CloseFile(pf);
if (rc!=0)
{
cout << "File could not be closed properly." << endl;
return rc;
}
return rc;
}
RC _removeTempTable(const string tableName)
{
PF_Manager *pfM = PF_Manager::Instance();
RC rc;
string upperTableName = _strToUpper(tableName);
rc = pfM->DestroyFile(upperTableName.c_str());
struct stat stFileInfo;
if (stat(upperTableName.c_str(), &stFileInfo) == 0)
{
cout << "Failed to destroy file! RetCode=" << rc << "." << endl;
return -1;
}
else
{
cout << "File " << upperTableName << " has been destroyed." << endl;
return rc;
}
return rc;
}
void _createMapFromPartition(string tableName, PF_FileHandle pfh,
vector<Attribute> attrs, int attIndex, unsigned numBuckets,
multimap<unsigned,RecordInfo> &partitionMap)
{
int numPages = pfh.GetNumberOfPages();
PF_Interface *_pfi = PF_Interface::Instance();
RC rc=0;
// You need to allocate for the page being read and clean it up at the end.
void *buffer = malloc(PF_PAGE_SIZE);
// Loop through each page
for (int i=0; i<numPages; i++)
{
rc = _pfi->getPage(pfh, i, buffer);
if (rc !=0)
{
cout << "ERROR - Read Page#" << i << " from PagedFile " << tableName << " errored out. RC=" << rc << "." << endl;
}
int noOfTuples = _pfi->getIntFromBuffer(buffer, PF_PAGE_SIZE-8);
// Loop through each tuple in the page
for (int j=0; j<noOfTuples; j++)
{
RID rid;
rid.pageNum = i;
rid.slotNum = j+1;
unsigned uSlotPtr = PF_PAGE_SIZE - 8 - 8*rid.slotNum;
unsigned recKey;
RecordInfo recInfo;
recInfo.recLen = _pfi->getIntFromBuffer(buffer, uSlotPtr+4);
recInfo.recData = malloc(recInfo.recLen);
rc = _readTupleFromTempTableBucket(tableName, pfh, rid, recInfo.recData);
if (rc!=0)
{
cout << "ERROR - Page#" << rid.pageNum << " Slot#" << rid.slotNum << " from PagedFile " << tableName << " does not exist." << endl;
free(recInfo.recData);
}
// Generate a key for the record based on join attribute
vector<Value> attrValues;
// Break up data into constituent items
_parseDataBuffer(recInfo.recData, attrs, attrValues);
// Determine the key value to hash the record to
recKey = _generatePartitionKey(attrValues.at(attIndex), numBuckets);
// Add recInfo to map
partitionMap.insert(pair<unsigned,RecordInfo>(recKey,recInfo));
//cout << "Record added at Hash Key=" << recKey << endl;
}
}
free(buffer);
}
RC _getNextTupleFromTempTable(string tableName, PF_FileHandle pfh, void *data, RID &lastRid)
{
// lastRid has the last Rid that was returned. This will position on the next Tuple to display.
unsigned numPages = pfh.GetNumberOfPages();
if (lastRid.pageNum >= numPages)
{
cout << "ERROR - Last record position: Page#" << lastRid.pageNum << " from PagedFile " << tableName << " seems incorrect. Aborting." << endl;
}
PF_Interface *_pfi = PF_Interface::Instance();
RC rc=0;
// You need to allocate for the page being read and clean it up at the end.
void *buffer = malloc(PF_PAGE_SIZE);
// Loop through each page in the partition, starting from the lastRid's PageNum
for (unsigned i=lastRid.pageNum; i<numPages; i++)
{
rc = _pfi->getPage(pfh, i, buffer);
if (rc !=0)
{
cout << "ERROR - Read Page#" << i << " from PagedFile " << tableName << " errored out. RC=" << rc << "." << endl;
}
unsigned noOfTuples = _pfi->getIntFromBuffer(buffer, PF_PAGE_SIZE-8);
if (lastRid.slotNum > noOfTuples)
{
cout << "ERROR - Last record position: Page#" << lastRid.pageNum << " Slot# " << lastRid.slotNum << " from PagedFile " << tableName << " seems incorrect. Aborting." << endl;
}
// Loop through each tuple in the page...
for (unsigned j=lastRid.slotNum; j<noOfTuples; j++)
{
//RID rid;
lastRid.pageNum = i;
lastRid.slotNum = j+1;
rc = _readTupleFromTempTableBucket(tableName, pfh, lastRid, data);
if (rc!=0)
{
cout << "ERROR - Page#" << lastRid.pageNum << " Slot#" << lastRid.slotNum << " from PagedFile " << tableName << " does not exist." << endl;
}
// Need to return just one record at a time.
return 0;
}
lastRid.slotNum = 0; // Reset this as you are about to switch to the next page.
}
lastRid.pageNum = 0; // Reset this as you are done scrolling through the entire table.
free(buffer);
return QE_EOF;
}
| [
"[email protected]"
] | |
992e7669d1829ddae46a3f4c0bcd80214599ef6f | 0b070626740788d5af23fcd1cd095e56033308de | /210.cpp | 17e8647927104789fe2824e06ba70c4ae6bc59ab | [] | no_license | xis19/leetcode | 71cb76c5764f8082155d31abcb024b25fd90bc75 | fb35fd050d69d5d8abf6794ae4bed174aaafb001 | refs/heads/master | 2021-03-24T12:53:34.379480 | 2020-02-24T04:25:36 | 2020-02-24T04:25:36 | 76,006,015 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,482 | cpp | #include <list>
#include <unordered_map>
#include <unordered_set>
#include <vector>
std::vector<int> findOrder(int numCourses, const std::vector<std::vector<int>>& prerequisites) {
// Toplogical sort approach
// See https://en.wikipedia.org/wiki/Topological_sorting
// Use Kahn's algorithm
// graph[i] = {j} --> i has edge to j
// graphRev[i] = {j} --> j has edge to i
// Noticing prerequesites is in j <- i format
std::unordered_map<int, std::unordered_set<int>> graph;
std::unordered_map<int, std::unordered_set<int>> graphRev;
std::vector<int> toplogicalSorted;
toplogicalSorted.reserve(numCourses);
for (const auto& v: prerequisites) {
graph[v[0]].insert(v[1]);
graphRev[v[1]].insert(v[0]);
}
// Find all nodes that has no incoming edges -- first round
std::list<int> queue;
for (int i = 0; i < numCourses; ++i) {
if (graphRev[i].size() == 0) {
queue.push_back(i);
}
}
while(!queue.empty()) {
auto n = queue.front();
queue.pop_front();
toplogicalSorted.push_back(n);
for(auto t: graph[n]) {
graphRev[t].erase(n);
if (graphRev[t].size() == 0) {
graphRev.erase(t);
queue.push_back(t);
}
}
graph.erase(n);
}
if (static_cast<int>(toplogicalSorted.size()) != numCourses)
return std::vector<int>();
return toplogicalSorted;
}
| [
"[email protected]"
] | |
2d3f10184cc7a566e2e3fbe42843ff5cbf5daa75 | a4853fde22e956533776cd7c6db8e8c4bd8643a6 | /tools/clang/tools/extra/clang-rename/tool/ClangRename.cpp | 74752116ec05360bf8cee264e88150409e7f7a14 | [
"NCSA"
] | permissive | sawenzel/clang | 0ea6cdd2d8df8cb7b7fac552b1ee6d84fe82f3b7 | 5012a87efe37a8635776f554edb28d8864b0ffa7 | refs/heads/master | 2020-04-05T07:25:00.132973 | 2017-01-11T14:43:44 | 2017-01-12T08:23:59 | 156,674,510 | 0 | 0 | NOASSERTION | 2018-11-08T08:29:37 | 2018-11-08T08:29:37 | null | UTF-8 | C++ | false | false | 5,815 | cpp | //===--- tools/extra/clang-rename/ClangRename.cpp - Clang rename tool -----===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
///
/// \file
/// \brief This file implements a clang-rename tool that automatically finds and
/// renames symbols in C++ code.
///
//===----------------------------------------------------------------------===//
#include "../USRFindingAction.h"
#include "../RenamingAction.h"
#include "clang/AST/ASTConsumer.h"
#include "clang/AST/ASTContext.h"
#include "clang/Basic/FileManager.h"
#include "clang/Basic/LangOptions.h"
#include "clang/Basic/TargetInfo.h"
#include "clang/Basic/TargetOptions.h"
#include "clang/Frontend/CommandLineSourceLoc.h"
#include "clang/Frontend/CompilerInstance.h"
#include "clang/Frontend/FrontendAction.h"
#include "clang/Frontend/TextDiagnosticPrinter.h"
#include "clang/Lex/Lexer.h"
#include "clang/Lex/Preprocessor.h"
#include "clang/Parse/ParseAST.h"
#include "clang/Parse/Parser.h"
#include "clang/Rewrite/Core/Rewriter.h"
#include "clang/Tooling/CommonOptionsParser.h"
#include "clang/Tooling/Refactoring.h"
#include "clang/Tooling/ReplacementsYaml.h"
#include "clang/Tooling/Tooling.h"
#include "llvm/ADT/IntrusiveRefCntPtr.h"
#include "llvm/Support/Host.h"
#include <string>
using namespace llvm;
cl::OptionCategory ClangRenameCategory("Clang-rename options");
static cl::opt<std::string>
NewName(
"new-name",
cl::desc("The new name to change the symbol to."),
cl::cat(ClangRenameCategory));
static cl::opt<unsigned>
SymbolOffset(
"offset",
cl::desc("Locates the symbol by offset as opposed to <line>:<column>."),
cl::cat(ClangRenameCategory));
static cl::opt<std::string>
OldName(
"old-name",
cl::desc("The fully qualified name of the symbol, if -offset is not used."),
cl::cat(ClangRenameCategory));
static cl::opt<bool>
Inplace(
"i",
cl::desc("Overwrite edited <file>s."),
cl::cat(ClangRenameCategory));
static cl::opt<bool>
PrintName(
"pn",
cl::desc("Print the found symbol's name prior to renaming to stderr."),
cl::cat(ClangRenameCategory));
static cl::opt<bool>
PrintLocations(
"pl",
cl::desc("Print the locations affected by renaming to stderr."),
cl::cat(ClangRenameCategory));
static cl::opt<std::string>
ExportFixes(
"export-fixes",
cl::desc("YAML file to store suggested fixes in."),
cl::value_desc("filename"),
cl::cat(ClangRenameCategory));
#define CLANG_RENAME_VERSION "0.0.1"
static void PrintVersion() {
outs() << "clang-rename version " << CLANG_RENAME_VERSION << '\n';
}
using namespace clang;
const char RenameUsage[] = "A tool to rename symbols in C/C++ code.\n\
clang-rename renames every occurrence of a symbol found at <offset> in\n\
<source0>. If -i is specified, the edited files are overwritten to disk.\n\
Otherwise, the results are written to stdout.\n";
int main(int argc, const char **argv) {
cl::SetVersionPrinter(PrintVersion);
tooling::CommonOptionsParser OP(argc, argv, ClangRenameCategory, RenameUsage);
// Check the arguments for correctness.
if (NewName.empty()) {
errs() << "clang-rename: no new name provided.\n\n";
exit(1);
}
// Get the USRs.
auto Files = OP.getSourcePathList();
tooling::RefactoringTool Tool(OP.getCompilations(), Files);
rename::USRFindingAction USRAction(SymbolOffset, OldName);
// Find the USRs.
Tool.run(tooling::newFrontendActionFactory(&USRAction).get());
const auto &USRs = USRAction.getUSRs();
const auto &PrevName = USRAction.getUSRSpelling();
if (PrevName.empty()) {
// An error should have already been printed.
exit(1);
}
if (PrintName) {
errs() << "clang-rename: found name: " << PrevName << '\n';
}
// Perform the renaming.
rename::RenamingAction RenameAction(NewName, PrevName, USRs,
Tool.getReplacements(), PrintLocations);
auto Factory = tooling::newFrontendActionFactory(&RenameAction);
int ExitCode;
if (Inplace) {
ExitCode = Tool.runAndSave(Factory.get());
} else {
ExitCode = Tool.run(Factory.get());
if (!ExportFixes.empty()) {
std::error_code EC;
llvm::raw_fd_ostream OS(ExportFixes, EC, llvm::sys::fs::F_None);
if (EC) {
llvm::errs() << "Error opening output file: " << EC.message() << '\n';
exit(1);
}
// Export replacements.
tooling::TranslationUnitReplacements TUR;
const tooling::Replacements &Replacements = Tool.getReplacements();
TUR.Replacements.insert(TUR.Replacements.end(), Replacements.begin(),
Replacements.end());
yaml::Output YAML(OS);
YAML << TUR;
OS.close();
exit(0);
}
// Write every file to stdout. Right now we just barf the files without any
// indication of which files start where, other than that we print the files
// in the same order we see them.
LangOptions DefaultLangOptions;
IntrusiveRefCntPtr<DiagnosticOptions> DiagOpts =
new DiagnosticOptions();
TextDiagnosticPrinter DiagnosticPrinter(errs(), &*DiagOpts);
DiagnosticsEngine Diagnostics(
IntrusiveRefCntPtr<DiagnosticIDs>(new DiagnosticIDs()),
&*DiagOpts, &DiagnosticPrinter, false);
auto &FileMgr = Tool.getFiles();
SourceManager Sources(Diagnostics, FileMgr);
Rewriter Rewrite(Sources, DefaultLangOptions);
Tool.applyAllReplacements(Rewrite);
for (const auto &File : Files) {
const auto *Entry = FileMgr.getFile(File);
auto ID = Sources.translateFile(Entry);
Rewrite.getEditBuffer(ID).write(outs());
}
}
exit(ExitCode);
}
| [
"[email protected]"
] | |
cfac4513cd478555cd4ca839833158c8ae89fee6 | 3fe692c3ebf0b16c0a6ae9d8633799abc93bd3bb | /Practices/Codeforces/CF587E.cpp | 6284d374c2505e972df66606cbbe08dd6cd436ee | [] | no_license | kaloronahuang/KaloronaCodebase | f9d297461446e752bdab09ede36584aacd0b3aeb | 4fa071d720e06100f9b577e87a435765ea89f838 | refs/heads/master | 2023-06-01T04:24:11.403154 | 2023-05-23T00:38:07 | 2023-05-23T00:38:07 | 155,797,801 | 14 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 3,731 | cpp | // CF587E.cpp
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 2e5 + 200;
int n, q, ai[MAX_N], bi[MAX_N];
struct Basis
{
int base[40];
void clear() { memset(base, 0, sizeof(base)); }
void update(int x)
{
for (int i = 31; i >= 0; i--)
if ((x & (1 << i)))
if (base[i])
x ^= base[i];
else
return (void)(base[i] = x);
}
int query()
{
int ret = 0;
for (int i = 31; i >= 0; i--)
if (base[i])
ret++;
return (1 << ret);
}
void merge(Basis src)
{
for (int i = 31; i >= 0; i--)
if (src.base[i])
update(src.base[i]);
}
};
#define lson (p << 1)
#define rson ((p << 1) | 1)
#define mid ((l + r) >> 1)
namespace BasisSGT
{
Basis nodes[MAX_N << 2];
void pushup(int p) { nodes[p].clear(), nodes[p].merge(nodes[lson]), nodes[p].merge(nodes[rson]); }
void build(int l, int r, int p)
{
if (l == r)
return (void)(nodes[p].clear(), nodes[p].update(bi[l]));
build(l, mid, lson), build(mid + 1, r, rson), pushup(p);
}
void update(int qx, int l, int r, int p, int val)
{
if (l == r)
return (void)(nodes[p].clear(), nodes[p].update(val));
if (qx <= mid)
update(qx, l, mid, lson, val);
else
update(qx, mid + 1, r, rson, val);
pushup(p);
}
Basis query(int ql, int qr, int l, int r, int p)
{
if (ql <= l && r <= qr)
return nodes[p];
Basis ret;
ret.clear();
if (ql <= mid)
ret.merge(query(ql, qr, l, mid, lson));
if (mid < qr)
ret.merge(query(ql, qr, mid + 1, r, rson));
return ret;
}
} // namespace BasisSGT
namespace XorSGT
{
int nodes[MAX_N << 2], tag[MAX_N << 2];
void modify(int p, int val) { nodes[p] ^= val, tag[p] ^= val; }
void pushdown(int p)
{
if (tag[p] != 0)
modify(lson, tag[p]), modify(rson, tag[p]), tag[p] = 0;
}
void build(int l, int r, int p)
{
if (l == r)
return (void)(nodes[p] = ai[l]);
build(l, mid, lson), build(mid + 1, r, rson);
}
void update(int ql, int qr, int l, int r, int p, int val)
{
if (ql <= l && r <= qr)
return (void)(modify(p, val));
pushdown(p);
if (ql <= mid)
update(ql, qr, l, mid, lson, val);
if (mid < qr)
update(ql, qr, mid + 1, r, rson, val);
}
int query(int qx, int l, int r, int p)
{
if (l == r)
return nodes[p];
pushdown(p);
if (qx <= mid)
return query(qx, l, mid, lson);
else
return query(qx, mid + 1, r, rson);
}
} // namespace XorSGT
#undef mid
#undef rson
#undef lson
int main()
{
scanf("%d%d", &n, &q);
for (int i = 1; i <= n; i++)
scanf("%d", &ai[i]), bi[i] = ai[i - 1] ^ ai[i];
BasisSGT::build(1, n, 1), XorSGT::build(1, n, 1);
while (q--)
{
int opt, l, r, val;
scanf("%d%d%d", &opt, &l, &r);
if (opt == 1)
{
scanf("%d", &val);
XorSGT::update(l, r, 1, n, 1, val);
if (r != n)
BasisSGT::update(r + 1, 1, n, 1, bi[r + 1] ^= val);
BasisSGT::update(l, 1, n, 1, bi[l] ^= val);
}
else
{
Basis curt;
curt.clear(), curt.update(XorSGT::query(l, 1, n, 1));
if (l != r)
curt.merge(BasisSGT::query(l + 1, r, 1, n, 1));
printf("%d\n", curt.query());
}
}
return 0;
} | [
"[email protected]"
] | |
d666ce79dbc64f2a7a3fa755a61b3f332f431023 | 16990986aa24d36d480e551821ab2fa0d145eff8 | /src/Fault.cpp | 0ad0ecd571d560dcec50052fbd6768d3f805bf18 | [] | no_license | izissise/abstract-vm | e5db0cfcca0c1e93cfc9d7e0e8be80f2570e0b60 | 669ce27210b1ee9ce8c32da1511c3be4f2ce5cd2 | refs/heads/master | 2021-01-19T11:26:41.849480 | 2014-03-02T14:34:19 | 2014-03-02T14:34:19 | 30,887,310 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 526 | cpp | /*
** FILE for FILE in /home/moriss_h/projet
**
** Made by hugues morisset
** Login <[email protected]>
**
** Started on Mon Oct 8 09:34:29 2012 hugues morisset
** Last update Mon Oct 8 16:20:21 2012 hugues morisset
*/
#include "Fault.hpp"
Fault::Fault(std::string const& err, std::string const& file, std::string const& func) throw()
: m_err(err + std::string(" (in file ") + file + std::string(" ,in function: ") + func + std::string(")"))
{
}
const char* Fault::what() const throw()
{
return m_err.c_str();
}
| [
"[email protected]"
] | |
64c489e2e4ec6fb309f3bb29a1f696fcea8f2d36 | f0b5f8b7ef9d88fdb71bcd97b504808d43b17836 | /main.cpp | 46cb9c2fbf35f46f8f0c15b196d0dd1a31d20e4c | [] | no_license | ferassalous/Tree-Data-Structure | f4a1bce11e8379c946698ff5558ce354d189c90b | 72474d3020e7495a797f7815f1305111d749d2d2 | refs/heads/master | 2020-05-03T16:14:04.388621 | 2019-04-02T14:32:44 | 2019-04-02T14:32:44 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 10,168 | cpp | //
// main.cpp
// Project4DataStructures
//
// Created by Feras Salous on 3/14/19.
// Copyright © 2019 Feras Salous . All rights reserved.
//
#include <iostream>
using namespace std;
class Tree
{
protected:
int* myParent; //my tree array
int* data;// pointer to data in my tree.
int root;
int count;
int height;
public:
Tree();
Tree(int numberOfNodes);
virtual ~Tree();
void setParent(int node, int parent);
void setRoot(int root);
void display();
int Root();
int size;
int& getMyParent();
void children(int index);
void parent(int index);
void siblings(int index);
int rootNug(int index);
bool isEmpty();
int Height();
void nodesAtLevel(int level);
void LCM(int choice1, int choice2);
int Level(int index);
Tree(const Tree& t);
int& childrenArray(int Node);
friend ostream& operator << (ostream& s, const Tree& tree);
void PrintPreOrder(int root);
void PreOrder();
};
//default constructor
Tree::Tree()
{
data = NULL;
myParent = new int[size];
}
// Construcrtor which takes in number of nodes and allocates my array to that size.
Tree::Tree(int numberOfNodes)
{
data = NULL;
myParent = new int[numberOfNodes];
size = 0;
count = 1;
height = 0;
}
// destructor which deletes my tree.
Tree::~Tree()
{
cout << "Tree Deleted"<<endl;
delete [] myParent;
}
//copy constructor
Tree::Tree(const Tree& t)
{
size = t.size;
myParent = new int[size];
for(int i=0; i < size; ++i)
{
myParent[i] = t.myParent[i];
}
}
// given a node value and its parent, set the myParent[node] = to the corrresponding parent.
void Tree:: setParent(int node, int parent)
{
myParent[node] = parent;
++ size;
}
//sets my root node.
void Tree:: setRoot(int val)
{
root = val;
}
// return the root.
int Tree:: Root()
{
//cout << "Reached Here"<< endl;
return root;
}
// gets the child of a specfic Node.
void Tree::children(int index)
{
for(int i = 0; i < size; ++i) // loop thru the array.
{
if(index == myParent[i]) // if the index passed in, is the parent of a of a node in the array., then print that index it was equal at.
{
cout<< i << " ";
}
}
}
// gets the parent of a node.
void Tree::parent(int index)
{
bool found = false;
for(int i = 0; i < size; ++i) // loop thru the array.
{
if(index == i) // if the index passed in == Node
{
cout<< myParent[i]; // then print its parent.
found = true;
}
}
if(!found)
{
cout << "This Parent Does Not Exisit";
}
}
void Tree::siblings(int index)
{
int* temp = myParent; // temp array which holds my parents arrays values
for(int i = 0; i < size; i++)
{
// make sure index is not equal to i and then comapare which elements contain the same parent and print that index
if(i!= index && myParent[i] == temp[index])
{
cout << i << " ";
}
}
}
int& Tree::getMyParent()
{
return *myParent;
}
void Tree::LCM(int choice1,int choice2)
{
int val1 = choice1;
int val2 = choice2;
int sizeOftemp = 1;
int sizeOftemp2 = 1;
int* tempParent1 = new int[sizeOftemp];
int* tempParent2 = new int[sizeOftemp2];
if(val1 == val2) // if the vals passed in are equal, then print out that val.
{
cout << val1;
}
else
{
int parents = rootNug(choice1); // gets the parent of choice 1
int parents2 = rootNug(choice2); // gets the parent of choice 2
// a loop for parent array 1
for (int i = 0; i < sizeOftemp; ++i) {
if(parents != -1) // if the values are not equal to the root then keep going.
{
tempParent1[i] = parents; // store the parent of choice 1 in the array.
parents = rootNug(parents); // call root nug to get the next parent val.
++sizeOftemp; // incremnt the size of the array.
}
}
// a loop for parent array 2
for(int j = 0; j < sizeOftemp2; ++j)
{
if(parents2 != -1) // if the value of parent2 is not equal to the root then keep going
{
tempParent2[j] = parents2; // store those values into the array of parent 2.
parents2 = rootNug(parents2); // update parents 2 to equal the next parent.
++sizeOftemp2; // increment the size of parent array 2.
}
}
bool found = false; // to know if my elements equaled each other.
while(!found)
{
// a loop for the first array.
for (int i = 0; i < sizeOftemp -1; ++i) {
if(found == true) // if found == true in the nested for loop, then stop searching.
{
break; //STOP.
}
// loop for second array.
for (int j = 0; j < sizeOftemp2 -1 ; ++j) {
if(tempParent1[i] == tempParent2[j]) // if my parent at parent1[i] array == parent2 array[j]
{
cout << tempParent1[i]; // print that equal value.
found = true; // set found equal to true.
}
}
}
}
}
}
int Tree::rootNug(int index)
{
bool found = false;
int rootNug = 0;
for(int i = 0; i < size; ++i)
{
if(index == i)
{
found = true;
rootNug = myParent[i];
//cout << "I came here" << rootNug << endl;
//return rootNug;
}
}
if(!found)
{
rootNug = -2;
}
return rootNug;
}
//returns what level a specified node is at.
int Tree:: Level(int index)
{
int temp = 1;
count = temp;
int parent = rootNug(index); // gets the parent of the index passed in
if(parent == -1) // if it equals -1 then the level is 1 as that is the root
{
return count;
}
//keep going until you climb up to the root, incrementing a count variable to keep track of the number of attempts it took to climb to that roor.
else{
Level(parent);
count++;
}
return count;
}
int Tree:: Height()
{
int maxOfNodes =0;
for(int i = 0; i < size; ++i)
{
int pos = i; // postion of index in my array to access the next node.
int counter = 1; // counter to keep track of deep a specfic node is.
while(myParent[pos] != -1)
{
counter++; // increment count every time you go thru a node and reach -1
pos = myParent[pos]; // then move to the next parent of that node.
}
maxOfNodes = max(maxOfNodes, counter); // take the max of the value if it 0 then there is no elements.
}
return maxOfNodes;
}
void Tree::nodesAtLevel(int level)
{
for(int i = 0; i < size; ++i) // loop thru parent array.
{
if(level == Level(i)) // if level == the Level(i) as this will return the level a certain node is at.
{
cout << i << " "; // print out that index.
}
}
}
void Tree::PrintPreOrder(int root)
{
cout << root << " ";
for (int i = 0; i < size; ++i) {
if(root == myParent[i])
{
PrintPreOrder(i);
}
}
}
void Tree::PreOrder()
{
PrintPreOrder(Root());
}
//display my tree.
void Tree::display()
{
for (int i =0; i < size; ++ i)
{
// cout << i << endl;
cout << i << ":" << myParent[i] << "\t";
}
}
//ostream operator to display the tree.
ostream& operator <<(ostream& s, const Tree& tree)
{
for (int i =0; i < tree.size; ++ i)
{
s << i << ":" << tree.myParent[i] << "\t";
}
return s;
}
bool Tree::isEmpty()
{
if(myParent == NULL)
{
return true;
}
else
{
return false;
}
}
int main()
{
int numNodes;
int node;
int parent;
cin >> numNodes;
Tree* myTree = new Tree(numNodes);
for (int i = 0; i < numNodes; ++i) {
cin >> node >> parent;
myTree -> setParent(node, parent);
if(parent == -1)
{
myTree -> setRoot(node);
}
}
cout<< "This Is The Original Tree:"<<endl;
cout << *myTree << endl;
Tree* newTree = new Tree(*myTree);
cout << "The Tree we just copied:" <<endl;
cout << *newTree << endl;
cout << "The Root Of The Tree is:" << endl << myTree -> Root() <<endl;
cout << "This is the Least Common Ancestor of Node 3 and Node 8:" << endl; myTree -> LCM(3, 8); cout << endl;
cout << "This is the Least Common Ancestor of Node 13 and Node 11:" << endl; myTree -> LCM(13, 11); cout << endl;
cout << "This is the Least Common Ancestor of Node 13 and Node 8:" << endl; myTree -> LCM(13, 8); cout << endl;
cout << "These are the children of Node 10 is/are:"<< endl;myTree -> children(10);cout << endl;
cout << "These are the children of Node 12 is/are:"<< endl;myTree -> children(12);cout << endl;
cout << "These are the siblings of Node 3 is/are:"<<endl; myTree -> siblings(3);cout<< endl;
cout << "These are the siblings of Node 12:"<<endl; myTree -> siblings(12);cout<< endl;
cout << "These are the Nodes at Level 3:" << endl; myTree -> nodesAtLevel(3); cout << endl;
cout << "This is the Height of the tree:" << endl << myTree -> Height() << endl;
cout << "The Level of node 3 in the tree is: " << endl; cout << myTree -> Level(3);cout<<endl;
cout << "The Level of node 12 in the tree is" << endl;cout << myTree -> Level(12);cout<<endl;
cout << "This is the parent of Node 5: "<< endl; myTree -> parent(5); cout << endl;
cout << "This is the LCM OF Node 1 and Node 1:" << endl; myTree -> LCM(1,1); cout << endl;
cout << "This is my Tree in PreOrder:" << endl; myTree -> PreOrder(); cout << endl;
// cout << "These are the Nodes at Level 3:"; myTree -> nodesAtLevel(3);
delete myTree;
delete newTree;
return 0;
}
| [
"[email protected] config --global user.email [email protected] config --global user.email [email protected]"
] | [email protected] config --global user.email [email protected] config --global user.email [email protected] |
128ac57142546e5f12417c60cb7c8966fec0a856 | bf325d30bfc855b6a23ae9874c5bb801f2f57d6d | /acm test/春/1/B.cpp | 982392cab05ec8365f7064fc4d115f6e428fb1e4 | [] | no_license | sudekidesu/my-programes | 6d606d2af19da3e6ab60c4e192571698256c0109 | 622cbef10dd46ec82f7d9b3f27e1ab6893f08bf5 | refs/heads/master | 2020-04-09T07:20:32.732517 | 2019-04-24T10:17:30 | 2019-04-24T10:17:30 | 160,151,449 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 389 | cpp | #include<cstdio>
#include<cstring>
char W[10000],T[1000000];
int main()
{
int o,t,i,j,m,n,num;
scanf("%d",&t);
for(o=0;o<t;o++)
{
num=0;
scanf("%s",W);
scanf("%s",T);
m=strlen(W);
n=strlen(T);
for(i=0;i<=n-m;i++)
{
if(T[i]==W[0])
{
for(j=0;j<m;j++)
{
if(T[i+j]!=W[j])
break;
if(j==m-1)
num++;
}
}
}
printf("%d\n",num);
}
}
| [
"[email protected]"
] | |
17953c6a6fb355441311f46f5928b72a79dabf08 | 07ee17f9fb57c0ccc9e4fe2c18410bd3f3eeec34 | /program/inc/FearPlayerPSC.h | f7e0cfa71a2aa358004905659b0323d309c3a255 | [] | no_license | AlexHuck/TribesRebirth | 1ea6ba27bc2af10527259d4d6cd4561a1793bccd | cf52c2e8c63f3da79e38cb3c153288d12003b123 | refs/heads/master | 2021-09-11T00:35:45.407177 | 2021-08-29T14:36:56 | 2021-08-29T14:36:56 | 226,741,338 | 0 | 0 | null | 2019-12-08T22:30:13 | 2019-12-08T22:30:12 | null | UTF-8 | C++ | false | false | 4,835 | h | #pragma once
#include "netPacketStream.h"
#include "Console.h"
#include "SimMovement.h"
#include "Player.h"
#include "PlayerManager.h"
#include "simAction.h"
#include "Item.h"
class PlayerPSC : public Net::PacketStreamClient
{
typedef PacketStreamClient Parent;
friend class FearGame;
friend class FearCSDelegate;
friend class Player;
static float playerFov;
static float sniperFov;
static float zoomSpeed;
public:
// TODO: Size
static const size_t ItemShoppingListWords = 4;
public: //private:
struct InvUpdate
{
InvUpdate* link;
int item;
int delta;
};
struct PacketHead
{
bool resetItems;
DWORD xorShoppingList[ItemShoppingListWords];
DWORD xorBuyList[ItemShoppingListWords];
int xorVisibleList[8];
InvUpdate* invUpdates;
};
struct
{
PacketHead* alloc()
{
//throw std::exception("NYI");
return (PacketHead*)malloc(sizeof(PacketHead));
}
void free(PacketHead* mem)
{
//throw std::exception("NYI");
return ::free(mem);
}
} phLL;
struct
{
InvUpdate* alloc()
{
return (InvUpdate*)malloc(sizeof(InvUpdate));
//throw std::exception("NYI");
}
void free(InvUpdate* mem)
{
return ::free(mem);
//throw std::exception("NYI");
}
} invLL;
DWORD shoppingList[ItemShoppingListWords];
DWORD buyList[ItemShoppingListWords];
DWORD clientShoppingList[ItemShoppingListWords];
DWORD clientBuyList[ItemShoppingListWords];
int triggerCount;
int prevTriggerCount;
bool limitCommandBandwidth;
bool firstPerson;
float camDist;
float yawSpeed;
float pitchSpeed;
float turnLeftSpeed;
float turnRightSpeed;
float lookUpSpeed;
float lookDownSpeed;
int lastSensorSeq;
int lastSent;
GameBase* controlObject;
Player* controlPlayer;
bool isServer;
bool resetItems;
PlayerManager* playerManager;
int lastPlayerMove;
int firstMoveSeq;
float targetFov;
float fovStartTime;
float fovTargetTime;
float viewPitch;
bool fInObserverMode;
bool fInEditMode;
float damageFlash;
public:
// TODO: Enum order
enum
{
InitialGuiMode,
PlayGuiMode,
CommandGuiMode,
VictoryGuiMode,
InventoryGuiMode,
ObjectiveGuiMode,
LobbyGuiMode,
NumGuiModes
};
public: //private:
int curGuiMode;
int itemTypeCount[Player::MaxItemTypes];
int visibleList[8];
const char* targetNames[128];
// Previous moves vector?
Vector<PlayerMove> pmvec;
Vector<PlayerMove> moves;
PlayerMove curMove;
float startFov;
Resource<SimActionMap> eventMap;
static const char* validateFov(CMDConsole *, int id, int argc, const char * argv[]);
explicit PlayerPSC(bool in_isServer);
virtual ~PlayerPSC();
virtual void getFovVars(float* pFov, float* pZoomFov, float* pTargetFov, DWORD* pStartTime, DWORD* pFovTime);
virtual void clientCollectInput(DWORD startTime, DWORD endTime);
bool onSimTimerEvent(const SimTimerEvent*);
virtual PlayerMove* getCurrentMove();
virtual const char* getTargetName(int sensorKey);
virtual bool processAction(int action, float eventValue, int iDevice);
bool onSimGainFocusEvent(const SimGainFocusEvent*);
bool onSimLoseFocusEvent(const SimLoseFocusEvent*);
virtual void toggleObserverCamera();
virtual void toggleEditCamera();
virtual float getFarPlane();
virtual bool isFirstPerson() const
{
return this->firstPerson;
}
public://protected:
void onDeleteNotify(SimObject* obj) override;
bool onAdd() override;
bool processEvent(const SimEvent* event) override;
void processRecorderStream(StreamIO* sio, DWORD) override;
void notifyPlaybackOver() override;
bool processQuery(SimQuery* query) override;
bool writePacket(BitStream* bstream, DWORD& key) override;
void readPacket(BitStream* bstream, DWORD currentTime) override;
void packetDropped(DWORD key) override;
void packetReceived(DWORD key) override;
public:
bool onSimActionEvent(const SimActionEvent* event);
virtual bool isItemBuyOn(int type);
// TODO: Default -1?
virtual void clearItemBuyList(int type = -1);
// TODO: Default -1?
virtual void setItemBuyList(int type = -1);
virtual bool isItemShoppingOn(int type);
// TODO: Default -1?
virtual void clearItemShoppingList(int type = -1);
// TODO: Default -1?
virtual void setItemShoppingList(int type = -1);
virtual void useItem(int typeId);
virtual int itemCount(int item);
virtual PlayerMove* getClientMove(DWORD time);
virtual float getDamageLevel();
virtual float getEnergyLevel();
virtual GameBase* getControlObject() const
{
return this->controlObject;
}
virtual int getCurrentGuiMode() const
{
return this->curGuiMode;
}
virtual void setCurrentGuiMode(const int value)
{
this->curGuiMode = value;
}
virtual void setControlObject(GameBase* obj);
virtual void setCommandBandLimit(const bool value)
{
this->limitCommandBandwidth = value;
}
// TODO:
virtual bool playerVisible(const int id)
{
return true;
}
};
| [
"[email protected]"
] | |
ff6de001b734e62c48cb11a534cacf07d6e25ae6 | 9fcf23cfd101379172fd70f736540e51488e9abb | /lancer_arduino_prog/lancer_pid_cascade/lancer_pid_test_cascade_latest_ROS/lancer_pid_test_cascade_latest_ROS.ino | e7115edc81ccb415cf5670e85086809a8bb08c1d | [] | no_license | KobayashiRui/Lancer_robot | ad3f8e0c98ec103254ababa8459065fea1fcef13 | 2c0995d155905c0fe87a0fcefed07441364b13ba | refs/heads/master | 2020-03-16T07:21:22.404154 | 2018-07-25T07:32:01 | 2018-07-25T07:32:01 | 132,574,168 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 14,428 | ino | #include "I2Cdev.h"
#define USE_USBCON
#include <ros.h>
#include <std_msgs/Int16MultiArray.h>
#include "MPU6050_6Axis_MotionApps20.h"
#if I2CDEV_IMPLEMENTATION == I2CDEV_ARDUINO_WIRE
#include "Wire.h"
#endif
#include<TimerThree.h>
#include<TimerOne.h>
//pin設定-----------------
const int Dir_pin1 = 5;
const int Dir_pin2 = 8;
const int Step_pin1 = 6;
const int Step_pin2 = 9;
//-------------------------
int output1 = 1;
int output2 = 1;
volatile int Timer1_start;
volatile int Timer2_start;
// class default I2C address is 0x68
// specific I2C addresses may be passed as a parameter here
// AD0 low = 0x68 (default for SparkFun breakout and InvenSense evaluation board)
// AD0 high = 0x69
MPU6050 mpu;
//MPU6050 mpu(0x69); // <-- use for AD0 high
#define OUTPUT_READABLE_YAWPITCHROLL
#define INTERRUPT_PIN 7 // use pin 2 on Arduino Uno & most boards
bool blinkState = false;
// MPU control/status vars
bool dmpReady = false; // set true if DMP init was successful
uint8_t mpuIntStatus; // holds actual interrupt status byte from MPU
uint8_t devStatus; // return status after each device operation (0 = success, !0 = error)
uint16_t packetSize; // expected DMP packet size (default is 42 bytes)
uint16_t fifoCount; // count of all bytes currently in FIFO
uint8_t fifoBuffer[64]; // FIFO storage buffer
// orientation/motion vars
Quaternion q; // [w, x, y, z] quaternion container
VectorInt16 aa; // [x, y, z] accel sensor measurements
VectorInt16 aaReal; // [x, y, z] gravity-free accel sensor measurements
VectorInt16 aaWorld; // [x, y, z] world-frame accel sensor measurements
VectorFloat gravity; // [x, y, z] gravity vector
float euler[3]; // [psi, theta, phi] Euler angle container
float ypr[3]; // [yaw, pitch, roll] yaw/pitch/roll container and gravity vector
// packet structure for InvenSense teapot demo
uint8_t teapotPacket[14] = { '$', 0x02, 0,0, 0,0, 0,0, 0,0, 0x00, 0x00, '\r', '\n' };
// ================================================================
// === INTERRUPT DETECTION ROUTINE ===
// ================================================================
volatile bool mpuInterrupt = false; // indicates whether MPU interrupt pin has gone high
void dmpDataReady() {
mpuInterrupt = true;
}
void delay_microsec(){
__asm__ __volatile__(
"nop" "\n\t"
"nop" "\n\t"
"nop" "\n\t"
"nop" "\n\t"
"nop" "\n\t"
"nop" "\n\t"
"nop" "\n\t"
"nop" "\n\t"
"nop" "\n\t"
"nop" "\n\t"
"nop" "\n\t"
"nop" "\n\t"
"nop" "\n\t"
"nop" "\n\t"
"nop" "\n\t"
"nop");
}
//タイマー割り込み----------------------------
void flash_timer2(){
if(Timer2_start == -1){return ;}
if(Timer2_start == 1){
Timer2_start = 0;
}else{
output2 = !output2;
digitalWrite(Step_pin2, output2);
//delayMicroseconds(1);
delay_microsec();
output2 = !output2;
digitalWrite(Step_pin2, output2);
}
}
void flash_timer1(){
if(Timer1_start == -1){return ;}
if(Timer1_start == 1){
Timer1_start = 0;
}else{
output1 = !output1;
digitalWrite(Step_pin1, output1);
//delayMicroseconds(1);
delay_microsec();
output1 = !output1;
digitalWrite(Step_pin1, output1);
}
}
//-----------------------------------------
// ================================================================
// === INITIAL SETUP ===
// ================================================================
int dir1 = 1;//方向1
int dir2 = 1;//方向2
volatile float contl_L_pps = 0.0; //左車輪の追加速度pps
volatile float contl_R_pps = 0.0; //右車輪の追加速度pps
volatile float contl_pps = 0.0;
//=== ROS setting===
ros:: NodeHandle_<ArduinoHardware,2,2,256,256> nh;
void messageCb(const std_msgs::Int16MultiArray& data_msg){
contl_pps = float(data_msg.data[0] * 0.00001);
contl_L_pps = float(data_msg.data[1] * 0.00001);
contl_R_pps = float(data_msg.data[2] * 0.00001);
//float datalist[2];
//datalist = data_msg;
//Serial.println(data_msg.data[0]); //left
//Serial.println(data_msg.data[1]); //right
}
ros::Subscriber<std_msgs::Int16MultiArray> sub("contl_data", &messageCb);
void setup() {
// join I2C bus (I2Cdev library doesn't do this automatically)
#if I2CDEV_IMPLEMENTATION == I2CDEV_ARDUINO_WIRE
Wire.begin();
Wire.setClock(400000L); // 400kHz I2C clock. Comment this line if having compilation difficulties
// #elif I2CDEV_IMPLEMENTATION == I2CDEV_BUILTIN_FASTWIRE
// Fastwire::setup(400, true);
#endif
// initialize serial communication
// (115200 chosen because it is required for Teapot Demo output, but it's
// really up to you depending on your project)
//Serial.begin(115200);
//while (!Serial); // wait for Leonardo enumeration, others continue immediately
// NOTE: 8MHz or slower host processors, like the Teensy @ 3.3V or Arduino
// Pro Mini running at 3.3V, cannot handle this baud rate reliably due to
// the baud timing being too misaligned with processor ticks. You must use
// 38400 or slower in these cases, or use some kind of external separate
// crystal solution for the UART timer.
// initialize device
//Serial.println(F("Initializing I2C devices..."));
mpu.initialize();
pinMode(INTERRUPT_PIN, INPUT);
// verify connection
//Serial.println(F("Testing device connections..."));
//Serial.println(mpu.testConnection() ? F("MPU6050 connection successful") : F("MPU6050 connection failed"));
// wait for ready => 何か送られてくるまでスタートしない=============================================
//Serial.println(F("\nSend any character to begin DMP programming and demo: "));
//while (Serial.available() && Serial.read()); // empty buffer
//while (!Serial.available()); // wait for data
//while (Serial.available() && Serial.read()); // empty buffer again
//===============================================================================================
// load and configure the DMP
//Serial.println(F("Initializing DMP..."));
devStatus = mpu.dmpInitialize();
// supply your own gyro offsets here, scaled for min sensitivity
mpu.setXGyroOffset(220);
mpu.setYGyroOffset(76);
mpu.setZGyroOffset(-85);
mpu.setZAccelOffset(1788); // 1688 factory default for my test chip
// make sure it worked (returns 0 if so)
if (devStatus == 0) {
// turn on the DMP, now that it's ready
//Serial.println(F("Enabling DMP..."));
mpu.setDMPEnabled(true);
// enable Arduino interrupt detection
//Serial.println(F("Enabling interrupt detection (Arduino external interrupt 0)..."));
attachInterrupt(digitalPinToInterrupt(INTERRUPT_PIN), dmpDataReady, RISING);
mpuIntStatus = mpu.getIntStatus();
// set our DMP Ready flag so the main loop() function knows it's okay to use it
//Serial.println(F("DMP ready! Waiting for first interrupt..."));
dmpReady = true;
// get expected DMP packet size for later comparison
packetSize = mpu.dmpGetFIFOPacketSize();
} else {
// ERROR!
// 1 = initial memory load failed
// 2 = DMP configuration updates failed
// (if it's going to break, usually the code will be 1)
//Serial.print(F("DMP Initialization failed (code "));
//Serial.print(devStatus);
//Serial.println(F(")"));
}
pinMode(Dir_pin1,OUTPUT);
pinMode(Dir_pin2,OUTPUT);
pinMode(Step_pin1,OUTPUT);
pinMode(Step_pin2,OUTPUT);
digitalWrite(Dir_pin1,dir1);
digitalWrite(Dir_pin2,dir2);
digitalWrite(Step_pin1,output1);
digitalWrite(Step_pin2,output2);
Timer1.initialize();
Timer1_start = -1;
Timer1.attachInterrupt(flash_timer1);
Timer3.initialize();
Timer2_start = -1;
Timer3.attachInterrupt(flash_timer2);
nh.getHardware() -> setBaud(9600);
nh.initNode();
nh.subscribe(sub);
}
// ================================================================
// === MAIN PROGRAM LOOP ===
// ================================================================
//速度制御pid
float e = 0;//偏差(p成分)
float old_e = 0; //前回の偏差
float e_speed = 0; //偏差の微分(d成分)
float e_integ = 0; //偏差の蓄積(i成分)
//傾きの制御
float e2=0;
float old_e2 = 0;
float e2_speed = 0;
float e2_integ = 0;
float k_pps = 0.0019635; //ppsから速度[rad/s]に変換する
float parpas_velo = 0; //速度の目標値
float parpas_angle = 0;
float velo = 0; //左右の平均値
float wheel_r = 0.045; //車輪半径[m]
float velo_L = 0; //左車輪の目標値
float velo_R = 0; //右車輪の目標値
float pps=0;
float dt = 0.002;//周期
//PIDゲイン値=======================================================
//速度制御pid
float kp1 = -2900;
float ki1 = -100000;
float kd1 = 0.0;
//傾き制御pid
float kp2 = 0.00025;
float ki2 = 0.0;
float kd2 = 0.0000002;
/*
float kp1 = -3;
float ki1 = -0.15;
float kd1 = 0.0;
//傾き制御pid
float kp2 = 0.00000228;
float ki2 = 0.0;
float kd2 = 0.0000000056;
*/
//==================================================================
int time_set1 = 0;
int time_set2 = 0;
float initial_angle = 3;
void timer_set1(float res1){
//int data=10;
res1 = res1-contl_L_pps;
if(res1 < 0){
dir1 = 1;
}else{
dir1 = 0;
}
/*
if(counter <=100){
counter +=1;
}else{
contl_L_pps=0;
}
*/
/*
if(res1 <= 0.0153 && res1 >= -0.0153){
res1 = 0;
}
*/
velo_L = res1;
/*
if(res1 < 0){
res1 = res1 * -1;
}
*/
/*
if(res1 >= 0.03){
time_set1 = int(40);
}else if(res1 == 0){
time_set1 = int(10000);
}else{
time_set1 = int(1/res1);
}
*/
if(res1 != 0){
time_set1 = int(1/res1);
/*
if(counter <=100){
counter +=1;
}else{
data=0;
}*/
if(time_set1 < 0){
time_set1 *= -1;
}
if(time_set1 <= 200) {time_set1 = 200;}//40~50
if(time_set1 >= 100000){time_set1 = 100000;}
digitalWrite(Dir_pin1,dir1);
Timer1_start = 1;
Timer1.initialize(time_set1);
Timer1.restart();
Timer1.attachInterrupt(flash_timer1);
}
}
void timer_set2(float res2){
//int data2=10;
//int res2_abs=0;
res2 = res2 - contl_R_pps;
if(res2 < 0){
dir2 =0;
}else{
dir2 = 1;
}
/*
if(counter2 <=1000){
counter2 +=1;
}else{
contl_R_pps=0; }
*/
/*
if(res2 <= 0.0153 && res2 >= -0.0153){
res2 = 0;
}
*/
//Serial.println(counter2);
velo_R = res2;
//res2 = abs(res2);
if(res2 != 0){
time_set2 = int(1/res2);
if(time_set2 < 0){
time_set2 *= -1;
}
if(time_set2 <= 200) {time_set2 = 200;}//40~50
if(time_set2 >= 100000){time_set2 = 100000;}
digitalWrite(Dir_pin2,dir2);
Timer2_start = 1;
Timer3.initialize(time_set2);//ms
Timer3.restart();
Timer3.attachInterrupt(flash_timer2);
}
}
void pid_controler(float pitch_data){
velo = (velo_L + velo_R)/2;
//parpas_velo = (+contl_R_pps +contl_L_pps)/2;
parpas_velo = contl_pps;
e = velo - parpas_velo;
e_speed = (e-old_e)/dt;
e_integ += (e-old_e)/2 * dt;
old_e = e;
parpas_angle = kp1 * e + kd1 * e_speed + ki1 * e_integ;
//Serial.print("parpas_angle : ");
//Serial.println(parpas_angle);
e2 = pitch_data - parpas_angle - initial_angle;
e2_speed = (e2-old_e2)/dt;
e2_integ += (e2-old_e2)/2 * dt;
old_e2 = e2;
pps = kp2 * e2 + kd2 * e2_speed + ki2 * e2_integ;
//Serial.println(pps);
timer_set2(pps);
timer_set1(pps);
}
float deg = 180/M_PI;
int counter = 0;
void loop() {
// if programming failed, don't try to do anything
if (!dmpReady) return;
// wait for MPU interrupt or extra packet(s) available
while (!mpuInterrupt && fifoCount < packetSize) {
// other program behavior stuff here
// .
// .
// .
// if you are really paranoid you can frequently test in between other
// stuff to see if mpuInterrupt is true, and if so, "break;" from the
// while() loop to immediately process the MPU data
// .
// .
// .
}
// reset interrupt flag and get INT_STATUS byte
mpuInterrupt = false;
mpuIntStatus = mpu.getIntStatus();
//mpuIntStatus = false;
//Serial.println(mpuIntStatus);
// get current FIFO count
fifoCount = mpu.getFIFOCount();
//mpuInterrupt = true;
// check for overflow (this should never happen unless our code is too inefficient)
if ((mpuIntStatus & 0x10) || fifoCount == 1024) {
// reset so we can continue cleanly
mpu.resetFIFO();
//Serial.println(F("FIFO overflow!"));
// otherwise, check for DMP data ready interrupt (this should happen frequently)
} else if (mpuIntStatus & 0x02) {
// wait for correct available data length, should be a VERY short wait
while (fifoCount < packetSize) fifoCount = mpu.getFIFOCount();
// read a packet from FIFO
mpu.getFIFOBytes(fifoBuffer, packetSize);
// track FIFO count here in case there is > 1 packet available
// (this lets us immediately read more without waiting for an interrupt)
fifoCount -= packetSize;
#ifdef OUTPUT_READABLE_YAWPITCHROLL
// display Euler angles in degrees
mpu.dmpGetQuaternion(&q, fifoBuffer);
mpu.dmpGetGravity(&gravity, &q);
mpu.dmpGetYawPitchRoll(ypr, &q, &gravity);
//Serial.print("ypr\t");
//Serial.print(ypr[0] * 180/M_PI);
//Serial.print("\t");
//Serial.print(ypr[1] * 180/M_PI);
//Serial.print("\t");
// Serial.println(ypr[2] * 180/M_PI);
#endif
if(counter > 400){
//contl_L_pps = 0;
//contl_R_pps = 0;
pid_controler(ypr[2]* 180/M_PI);
nh.spinOnce();
}else{
counter += 1;
}
mpu.resetFIFO();
delay(2);
}
}
| [
"[email protected]"
] | |
a9a9120973848063ec8a56a7618bfeaf275be45a | 47cd4e2be27c39a9242dd0bc57b195c293cd93d5 | /Contest6/14.cpp | d5525187a8ab799d12b828985045ce6312585334 | [] | no_license | ntung1005/Algo | 18b403eb636333aa318b99fa37238403a21eef71 | 3e0942dc471ba03bb2da3736ebcc43f786834aec | refs/heads/master | 2022-11-30T22:34:58.865637 | 2020-08-08T10:35:12 | 2020-08-08T10:35:12 | 264,919,990 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 582 | cpp | #include<bits/stdc++.h>
using namespace std;
bool checkNguyenTo(int i){
if(i<2) return false;
for(int j=2;j<i;j++){
if(i%j==0) return false;
}
return true;
}
int main(){
int t;
cin>>t;
while(t--){
int n;
cin>>n;
vector<int> a;
vector<int> result;
a.clear();
result.clear();
for(int i=0;i<n;i++){
if(checkNguyenTo(i)) a.push_back(i);
}
int n1=0;int n2=0;
for(int i=0;i<a.size();i++){
if(a[i]+a[a.size()-1-i]==n){
n1=a[i];
n2=a[a.size()-1-i];
break;
}
}
cout<<n1<<" "<<n2;
cout<<endl;
}
return 0;
}
| [
"[email protected]"
] | |
8f6a1847cb97de204dffb5650dcb07e21f4bc69a | 948f4e13af6b3014582909cc6d762606f2a43365 | /testcases/juliet_test_suite/testcases/CWE78_OS_Command_Injection/s03/CWE78_OS_Command_Injection__char_environment_w32_spawnv_84a.cpp | 3b2af06ace409ead5ca49ac0d25c8093397a5ae1 | [] | no_license | junxzm1990/ASAN-- | 0056a341b8537142e10373c8417f27d7825ad89b | ca96e46422407a55bed4aa551a6ad28ec1eeef4e | refs/heads/master | 2022-08-02T15:38:56.286555 | 2022-06-16T22:19:54 | 2022-06-16T22:19:54 | 408,238,453 | 74 | 13 | null | 2022-06-16T22:19:55 | 2021-09-19T21:14:59 | null | UTF-8 | C++ | false | false | 2,377 | cpp | /* TEMPLATE GENERATED TESTCASE FILE
Filename: CWE78_OS_Command_Injection__char_environment_w32_spawnv_84a.cpp
Label Definition File: CWE78_OS_Command_Injection.strings.label.xml
Template File: sources-sink-84a.tmpl.cpp
*/
/*
* @description
* CWE: 78 OS Command Injection
* BadSource: environment Read input from an environment variable
* GoodSource: Fixed string
* Sinks: w32_spawnv
* BadSink : execute command with spawnv
* Flow Variant: 84 Data flow: data passed to class constructor and destructor by declaring the class object on the heap and deleting it after use
*
* */
#include "std_testcase.h"
#include "CWE78_OS_Command_Injection__char_environment_w32_spawnv_84.h"
namespace CWE78_OS_Command_Injection__char_environment_w32_spawnv_84
{
#ifndef OMITBAD
void bad()
{
char * data;
char dataBuffer[100] = "";
data = dataBuffer;
CWE78_OS_Command_Injection__char_environment_w32_spawnv_84_bad * badObject = new CWE78_OS_Command_Injection__char_environment_w32_spawnv_84_bad(data);
delete badObject;
}
#endif /* OMITBAD */
#ifndef OMITGOOD
/* goodG2B uses the GoodSource with the BadSink */
static void goodG2B()
{
char * data;
char dataBuffer[100] = "";
data = dataBuffer;
CWE78_OS_Command_Injection__char_environment_w32_spawnv_84_goodG2B * goodG2BObject = new CWE78_OS_Command_Injection__char_environment_w32_spawnv_84_goodG2B(data);
delete goodG2BObject;
}
void good()
{
goodG2B();
}
#endif /* OMITGOOD */
} /* close namespace */
/* Below is the main(). It is only used when building this testcase on
its own for testing or for building a binary to use in testing binary
analysis tools. It is not used when compiling all the testcases as one
application, which is how source code analysis tools are tested. */
#ifdef INCLUDEMAIN
using namespace CWE78_OS_Command_Injection__char_environment_w32_spawnv_84; /* so that we can use good and bad easily */
int main(int argc, char * argv[])
{
/* seed randomness */
srand( (unsigned)time(NULL) );
#ifndef OMITGOOD
printLine("Calling good()...");
good();
printLine("Finished good()");
#endif /* OMITGOOD */
#ifndef OMITBAD
printLine("Calling bad()...");
bad();
printLine("Finished bad()");
#endif /* OMITBAD */
return 0;
}
#endif
| [
"[email protected]"
] | |
0bf3232f653e6a8ae6064175a944c2c80db82ef2 | 238bd2de16d774fa144fdfb2f14c92a78f0c77c0 | /chapter09/main.cpp | 42df77284f0c6aeacc7185ea7de3521dbd944541 | [] | no_license | Mipmap/glslcookbook | a18474c24af22ba139311642d8291f6225e5f119 | cde0d49a014fe3cecc9fce77221d9e02162c580c | refs/heads/master | 2021-01-17T07:44:46.075180 | 2013-05-23T18:36:01 | 2013-05-23T18:36:01 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,112 | cpp | #include "cookbookogl.h"
#include <GL/glfw.h>
#include "glutils.h"
#include "scenefire.h"
#include "sceneparticles.h"
#include "sceneparticlesfeedback.h"
#include "sceneparticlesinstanced.h"
#include "scenesmoke.h"
#include "scenewave.h"
#define WIN_WIDTH 800
#define WIN_HEIGHT 600
Scene *scene;
string parseCLArgs(int argc, char ** argv);
void printHelpInfo(const char *);
void initializeGL() {
glClearColor(0.5f,0.5f,0.5f,1.0f);
scene->initScene();
}
void mainLoop() {
while( glfwGetWindowParam(GLFW_OPENED) && !glfwGetKey(GLFW_KEY_ESC) ) {
GLUtils::checkForOpenGLError(__FILE__,__LINE__);
scene->update(glfwGetTime());
scene->render();
glfwSwapBuffers();
}
}
void resizeGL(int w, int h ) {
scene->resize(w,h);
}
int main(int argc, char *argv[])
{
string recipe = parseCLArgs(argc, argv);
// Initialize GLFW
if( !glfwInit() ) exit( EXIT_FAILURE );
// Select OpenGL 3.2 with a forward compatible core profile.
glfwOpenWindowHint( GLFW_OPENGL_VERSION_MAJOR, 4 );
glfwOpenWindowHint( GLFW_OPENGL_VERSION_MINOR, 3 );
glfwOpenWindowHint(GLFW_OPENGL_FORWARD_COMPAT, GL_TRUE);
glfwOpenWindowHint(GLFW_OPENGL_PROFILE, GLFW_OPENGL_CORE_PROFILE);
glfwOpenWindowHint(GLFW_WINDOW_NO_RESIZE, GL_TRUE);
glfwOpenWindowHint(GLFW_FSAA_SAMPLES, 8);
// Open the window
if( !glfwOpenWindow( WIN_WIDTH, WIN_HEIGHT, 8,8,8,8,24,0, GLFW_WINDOW ) ) {
glfwTerminate();
exit( EXIT_FAILURE );
}
string title = "Chapter 9 -- " + recipe;
glfwSetWindowTitle(title.c_str());
// Load the OpenGL functions.
if( ogl_LoadFunctions() == ogl_LOAD_FAILED ) {
glfwTerminate();
exit(EXIT_FAILURE);
}
GLUtils::dumpGLInfo();
// Initialization
initializeGL();
resizeGL(WIN_WIDTH,WIN_HEIGHT);
// Enter the main loop
mainLoop();
// Close window and terminate GLFW
glfwTerminate();
// Exit program
exit( EXIT_SUCCESS );
}
string parseCLArgs(int argc, char ** argv) {
if( argc < 2 ) {
printHelpInfo(argv[0]);
exit(EXIT_FAILURE);
}
string recipe = argv[1];
if( recipe == "fire" ) {
scene = new SceneFire();
} else if( recipe == "particles") {
scene = new SceneParticles();
} else if( recipe == "particles-feedback") {
scene = new SceneParticlesFeedback();
} else if( recipe == "particles-instanced" ) {
scene = new SceneParticlesInstanced();
} else if( recipe == "smoke" ) {
scene = new SceneSmoke();
} else if( recipe == "wave" ) {
scene = new SceneWave();
} else {
printf("Unknown recipe: %s\n", recipe.c_str());
printHelpInfo(argv[0]);
exit(EXIT_FAILURE);
}
return recipe;
}
void printHelpInfo(const char * exeFile) {
printf("Usage: %s recipe-name\n\n", exeFile);
printf("Recipe names: \n");
printf(" fire : description...\n");
printf(" particles : description...\n");
printf(" particles-feedback : description...\n");
printf(" particles-instanced : description...\n");
printf(" smoke : description...\n");
printf(" wave : description...\n");
}
| [
"[email protected]"
] | |
04bec7c02f31947378e3de15390829364422c453 | 8d30ffc4c36d0c7ce5c8df49132fe8f8930902cb | /C++/phonePayMatrixBfs.cpp | 79b79040fd55822b79a3b330834352d4552a97f5 | [] | no_license | abhi-repos/c-CodingSolutions | dafc068108280fa87162f84978fb289582e65c34 | 28edad2b5c3c95ef8dd5eaa47b9a3a8a9095da84 | refs/heads/master | 2021-07-11T01:49:37.957054 | 2020-07-13T13:08:10 | 2020-07-13T13:08:10 | 172,229,596 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,271 | cpp | /*
Input Sample
4 5
YNNYN
YYYNN
NNNYY
NNNYN
*/
#include<bits/stdc++.h>
using namespace std;
int dx[]={0,1,-1,0},dy[]={1,0,0,-1},n,m,a[1000][1000],fact[100000];
bool visited[1000][1000];
void bfs(int i,int j)
{
int x,y,k;
visited[i][j]=true;
queue <int> qx,qy;
qx.push(i),qy.push(j);
while(!qx.empty())
{
x=qx.front(),y=qy.front();
qx.pop(),qy.pop();
for(k=0;k<4;k++)
{
i=x+dx[k];
j=y+dy[k];
if(i<n&&j<m)
{
if(visited[i][j]==false&&a[i][j]==1)
{
qx.push(i);
qy.push(j);
visited[i][j]=true;
}
}
}
}
}
int modInverse(int x)
{
int y,result=1;
y=p-2;
while(y>0)
{
if(y%2!=0)
result*=x;
y=y>>1;
result*=(x*x);
}
return result;
}
int main()
{
int i,j,count;
string str;
cin>>n>>m;
for(i=0;i<n;i++)
{
cin>>str;
for(j=0;j<m;j++)
{
if(str[j]=='Y')
a[i][j]=1;
else
a[i][j]=0;
visited[i][j]=false;
}
}
count=0;
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
{
if(visited[i][j]==false&&a[i][j]==1)
{
bfs(i,j);
count++;
}
}
}
fact[0]=0;
for(i=1;i<=count;i++)
fact[i]=fact[i-1]*i%p;
for(i=0;i<=count;i+=2)
{
value=fact[count]*modInverse(count-i)*modInverse(i);
result+=value;
result%=p;
}
cout<<result<<endl;
}
| [
"[email protected]"
] | |
4f88907454ddc9f2b2ab7959550e0a7f838703aa | 3f012afcb5e2087300bffd726c0d8317afbf8ce2 | /models/book.cpp | dad8ce4adf9e537320e5bc22fa0353c472f808ab | [] | no_license | zhangtianxiang/library_management_system | 3501e44111831e35e167c3f42e29efc1c45ce20e | 167e0ddd4de2d06e794f4b10b3b795a459662e3d | refs/heads/master | 2020-05-25T13:14:38.598965 | 2019-05-21T10:43:54 | 2019-05-21T10:43:54 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 4,290 | cpp | #ifndef __BOOK_MODEL__
#define __BOOK_MODEL__ 1
/**
* 定义图书存储结构及相关操作
*/
#include "../tools/basetool.cpp"
#include "../tools/datatool.cpp"
#include "../configs/config.h"
#include "hash.cpp"
/// 单本图书
class Book {
public:
int id; // unique primary key
ll ISBN; // 书号 13位 可检索 已检索
string bookname; // 题名 可搜索
string press; // 出版社 可搜索
string author; // 作者 可搜索
string about_author;// 关于作者
string intro; // 简介
string catalog; // 目录
int page; // 页数
int total; // 库存 库存为0表示删除
int lent; // 借出
bool allow_lend; // 是否可借 库存不为0，但是禁止借出，例如小说等不许外借。
Book(){id=-1;page=total=lent=ISBN=0;allow_lend=true;bookname=press=author=intro=catalog=about_author="";}
Book(const int&id,const ll&ISBN,const string&bookname,const string&press,const string&author,const string&about_author,const string&intro,const string&catalog,const int&page,const int&total,const int&lent,const bool&allow_lend):
id(id),ISBN(ISBN),bookname(bookname),press(press),author(author),about_author(about_author),intro(intro),catalog(catalog),page(page),total(total),lent(lent),allow_lend(allow_lend){}
void show_detail() {
/// 展示图书细节
printf("《%s》\n", bookname.c_str());
printf("【系统号】 ：%d\n", id);
printf("【ISBN】 ：%lld\n", ISBN);
printf("【作者】 ：%s\n", author.c_str());
printf("【出版社】 ：%s\n",press.c_str());
printf("【页数】 ：%d\n",page);
printf("【关于作者】：\n\n%s\n\n",about_author.c_str());
printf("【简介】 ：\n\n%s\n\n", intro.c_str());
printf("【目录】 ：\n\n%s\n\n",catalog.c_str());
printf("【馆藏】 ：%d本，已借出%d本\n",total,lent);
if (!allow_lend) puts("【当前本书禁止借出图书馆！】");
}
};
/// 所有图书
class Books {
public:
int idx;
vector<Book*> allbook;
Hash<Book*> isbn;
Books(){idx=0;allbook.clear();}
void insert_to_hash(Book* now) {
/// 存储入哈希表
isbn.insert(now->ISBN,now);
}
Book* insert(const ll&ISBN,const string&bookname,const string&press,const string&author,const string&about_author,const string&intro,const string&catalog,const int&page,const int&total,const int&lent,const bool&allow_lend) {
Book* newbook = new Book(idx++,ISBN,bookname,press,author,about_author,intro,catalog,page,total,lent,allow_lend);
allbook.pb(newbook);
insert_to_hash(newbook);
return newbook;
}
Book* hash_find_ISBN(const ll&ISBN) {
/// 用哈希表查找ISBN对应的图书
Book* ret = NULL;
isbn.search(ISBN,ret);
return ret;
}
vector<Book*> select(const int&id=-1,const ll&ISBN=-1,const string&bookname="",const string&press="",const string&author="",const int&allow_lend=-1) {
vector<Book*> item;
vector<Book*>::iterator i;
Each(i,allbook) {
if ((*i)->total < 1) continue;
if (id!=-1 && (*i)->id!=id) continue;
if (ISBN!=-1 && (*i)->ISBN!=ISBN) continue;
if (bookname!="" && (*i)->bookname!=bookname) continue;
if (press!="" && (*i)->press!=press) continue;
if (author!="" && (*i)->author!=author) continue;
if (allow_lend!=-1 && (*i)->allow_lend!=allow_lend) continue;
item.pb(*i);
}
return item;
}
vector<Book*> fuzzy_search_bookname(string bookname) {
// 模糊搜索
/***
* 这里求最长公共子序列长度占模式串百分比为第一关键字，
* 子序列占被搜索串百分比为第二关键字对结果排序。
* 取第一关键字 50% 以上，且第二关键字 10% 以上。
*/
vector<Book*> item;
vector<Book*>::iterator i;
vector<pair<pff,int> > bks;
Each(i,allbook) {
if ((*i)->total < 1) continue;// 不考虑删掉的书
pff a = LCS(bookname,(*i)->bookname);
if (a.first<=0.5 && a.second<=0.9) bks.pb(mp(a,(*i)->id));
}
if (bks.size() == 0) return item;
sort(bks.begin(),bks.end());
_rep(j,0,bks.size()) item.pb(allbook[bks[j].second]);
return item;
}
};
#endif
| [
"[email protected]"
] | |
0fd4f195cb7787dacebb97b4ff0db840ce9c84f2 | 0e5ba747f249cbcba193e300a0b7ff9f486daa32 | /SDL_1.2/wayang_sandbox/01_test.cpp | df9cced43bb29e064f419a179d0638b34b9e62e6 | [] | no_license | f-fathurrahman/ffr-cpp-stuffs | f3574dad3db0d1acd28cf776c5c77503b3be14c0 | bd1b4b6f2e5a0aac179a9dbcda27be0d3d244ffd | refs/heads/master | 2021-12-01T00:30:33.123609 | 2021-11-01T12:21:58 | 2021-11-01T12:21:58 | 99,059,840 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 489 | cpp | #include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <SDL.h>
#include <SDL_image.h>
#include <SDL_ttf.h>
#include "sprig/sprig.h"
#include "wayang/wayang.h"
int main()
{
printf("LATIHAN SDL 2017\n");
kOpen(800, 600, "images/layar/infantis_146.jpg");
kSetCaption("Test");
kSetCaption("ffr caption");
dPause(5000);
//program berhenti selama 10000 ms
dPause(100000); //program berhenti selama 100000 ms
kClose();
//tutup layar
return 0;
}
| [
"[email protected]"
] | |
dc76622073db9251eec8155d7a03ee6e3b90bc09 | f2c9f9bd763c94fb440aa929320de8c5d0f9da71 | /draw1c/draw_engine.h | 2db4ef93b963cda6b8847267eea019e3bf7223cf | [] | no_license | Dimadze/NativeAPI | af7e285967219e6f5325e79639adce38e65c2548 | ef7c50aa26cb93d9c80f0c63c128835daefa1185 | refs/heads/master | 2021-01-10T18:04:02.233331 | 2015-11-08T21:17:47 | 2015-11-08T21:17:47 | 45,799,285 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,095 | h | #ifndef __DRAW1C_H__
#include "windows.h"
#include "draw_out.h"
#include <GdiPlus.h>
using namespace Gdiplus;
typedef struct {
unsigned char a;
unsigned char r;
unsigned char g;
unsigned char b;
} DrawColor;
class Draw1C
{
private:
DrawOut1C *v_out;
public:
Image *canvas;
wchar_t canvas_id[64];
UINT_PTR timer_id;
static const wchar_t CANVAS[64];
Draw1C(unsigned short w, unsigned short h, char out);
~Draw1C();
void DrawPoint(short x, short y, DrawColor color);
void DrawLine(short x1, short y1, short x2, short y2, int thickness, DrawColor color);
void DrawEllipse(short x, short y, short w, short h, int thickness, DrawColor color);
void DrawFillEllipse(short x, short y, short w, short h, DrawColor color);
void DrawRectangle(short x, short y, short w, short h, int thickness, DrawColor color);
void DrawFillRectangle(short x, short y, short w, short h, DrawColor color);
void DrawTriangle(short x1, short y1, short x2, short y2, short x3, short y3, int thickness, DrawColor color);
void DrawFillTriangle(short x1, short y1, short x2, short y2, short x3, short y3, DrawColor color);
void DrawString(wchar_t *string, short x, short y, short w, short h, int h_align, int v_align, wchar_t *font, int font_size, int font_style, DrawColor color);
void DrawImage(wchar_t *image_path, short x, short y, short w, short h, int angle, bool flip_x, bool flip_y);
void DrawImage(Image *image, short x, short y, short w, short h, int angle, bool flip_x, bool flip_y);
void GetPicture(void **ptr, int *size);
void GetPicture(void **ptr, int *size, int x, int y, int w, int h);
};
class Draw1C_List
{
typedef struct Draw1C_ListStruct {
Draw1C *draw1c;
Draw1C_ListStruct *next;
} Draw1C_ListStruct;
private:
Draw1C_ListStruct *list;
Draw1C_ListStruct *list_enum_start;
public:
int count;
Draw1C_List()
{
list = NULL;
count = 0;
}
~Draw1C_List()
{
RemoveAll();
count = 0;
}
Draw1C *Add(unsigned short w, unsigned short h, char out)
{
Draw1C *drw1c;
try { drw1c = new Draw1C(w, h, out); }
catch (wchar_t *e) { throw e; }
if (!list)
{
list = new Draw1C_ListStruct;
list->draw1c = drw1c;
list->next = NULL;
count++;
return list->draw1c;
}
else
{
Draw1C_ListStruct *list_last = list;
while (list_last->next)
list_last = list_last->next;
list_last->next = new Draw1C_ListStruct;
list_last->next->draw1c = drw1c;
list_last->next->next = NULL;
count++;
return list_last->next->draw1c;
}
}
void Remove(Draw1C *draw1c)
{
Draw1C_ListStruct *list_cur = list;
Draw1C_ListStruct *list_prev = NULL;
if (list_cur)
{
while (list_cur)
{
if (list_cur->draw1c == draw1c)
{
if (list_cur == list && !list_cur->next)
{
delete list_cur->draw1c;
delete list_cur;
list = NULL;
count--;
break;
}
else
{
if (list_prev)
{
list_prev->next = list_cur->next;
delete list_cur->draw1c;
delete list_cur;
list_cur = list_prev;
count--;
}
else
{
list = list_cur->next;
delete list_cur->draw1c;
delete list_cur;
count--;
if (!(list && list->next))
break;
list_cur = list;
}
}
}
list_prev = list_cur;
list_cur = list_cur->next;
}
}
}
void RemoveAll()
{
Draw1C_ListStruct *list_cur = list;
Draw1C_ListStruct *list_next = NULL;
if (list_cur)
{
while (list_cur)
{
list_next = list_cur->next;
delete list_cur->draw1c;
delete list_cur;
list_cur = list_next;
}
list = NULL;
}
}
void EnumStart()
{
list_enum_start = list;
}
Draw1C *EnumNext()
{
if (!list_enum_start)
return NULL;
Draw1C *ret = list_enum_start->draw1c;
list_enum_start = list_enum_start->next;
return ret;
}
};
#endif //__DRAW1C_H__
| [
"[email protected]"
] | |
856799409f83461c31a2740ef191ba3a49a53f8e | 8f680f6a7f1bf550ad39bcfa37f613dd57062f55 | /src/dynamic_programming/23_longest_common_subsequence/tworow.cpp | ebc5804c4b0021fda32e8ebe6c4ee58174a1a83d | [] | no_license | Hdbcoding/cpp_scratchpad | 6cd85a816f7f1251b3ac6cd66479785cc8cf9151 | 230cdcbf544c68c392be51abd8e12112be6bd292 | refs/heads/master | 2023-03-07T03:34:45.012358 | 2021-02-21T17:34:06 | 2021-02-21T17:34:06 | 277,338,529 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 550 | cpp | #include <string>
#include <vector>
#include "tworow.hpp"
using namespace std;
int tworow::lcs(const string &w1, const string &w2)
{
vector<vector<int>> dp(2 + 1, vector<int>(w2.size() + 1));
for (int i = 0; i < w1.size(); ++i)
{
for (int j = 0; j < w2.size(); ++j)
{
if (w1[i] == w2[j])
dp[(i + 1) % 2][j + 1] = dp[i % 2][j] + 1;
else
dp[(i + 1) % 2][j + 1] = max(dp[i % 2][j + 1], dp[(i + 1) % 2][j]);
}
}
return dp[w1.size() % 2][w2.size()];
} | [
"[email protected]"
] | |
40258bd3e8e8f9024fe7b8294ad73113a1c5e1c6 | edb50c09783d2c20927ecebc628e3c784983b2ad | /Practice/CollisionManager.h | bfc7be3f036898b9d50fbb863f7abe5dfd035c14 | [] | no_license | NguyenThanhTung1310/FrameWork | e9da739652168f71ee6328c8c5560f004dd04d72 | 23985d99e08c7ed7dc77b6b1fdd065212c114f61 | refs/heads/main | 2023-06-16T09:10:59.378668 | 2021-07-12T09:32:25 | 2021-07-12T09:32:25 | 385,190,643 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 725 | h | #pragma once
#include "Object.h"
#include "Rectangle.h"
#include "Circle.h"
#include <vector>
using namespace std;
class CollisionManager : public Object
{
public:
CollisionManager();
~CollisionManager();
float GetWidth();
float GetHeight();
float GetRadius();
void Render();
void Update(float deltaTime);
void Move(float, float);
void checkAllCollision(vector<Object*> listObj);
bool rectToRect(Object* rect1, Object* rect2);
bool rectToCircle(Object* rect, Object* circle);
bool rectToPlane(Object* rect);
bool circleToCircle(Object* circle1, Object* circle2);
bool circleToPlane(Object* circle);
bool checkOverlap(int R, int Xc, int Yc, int X1, int Y1, int X2, int Y2);
}; | [
"[email protected]"
] | |
b68ddc466fc0013274db68a823442b8358a4dba5 | c4bd1c4ef5e13d545e9f9e70c9f73991bf9653a4 | /data-structures/linked-list/linked-list.h | 24b4cac11daa4d81fbc8f639ad60c7e005494150 | [] | no_license | john-echelon/cpp-dsa | e01d824e32db05371f03934c5b1a24a2b79f24d5 | ac052355f3ec2e929c034e874273d1c212ebe919 | refs/heads/master | 2022-12-23T22:43:29.797144 | 2022-12-12T21:24:44 | 2022-12-12T21:24:44 | 182,900,704 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,512 | h | #ifndef LINKED_LIST_H_
#define LINKED_LIST_H_
#include <iostream>
template <class T>
struct Node {
T data;
Node * prev, *next;
Node(){
prev = next = 0;
}
Node(const T & el, Node * p =0, Node * n = 0)
{
data = el; prev = p; next = n;
}
};
template <class T>
class LinkedList
{
private:
int x;
Node<T> * head, * tail;
public:
class iterator {
public:
typedef T value_type;
typedef std::forward_iterator_tag iterator_category;
typedef int difference_type;
typedef T* pointer;
typedef T& reference;
iterator(Node<T> * ptr): _ptr(ptr) { }
//Pre-increment
iterator operator++(){ _ptr = _ptr->next; return *this; }
//Post-increment
iterator operator++(int){ iterator tmp = *this; _ptr = _ptr->next; return tmp; }
reference operator*() { return _ptr->data; }
pointer operator->() { return _ptr->data;}
bool operator==(const iterator& rhs) const { return _ptr == rhs._ptr; }
bool operator!=(const iterator& rhs) const { return _ptr != rhs._ptr; }
Node<T> * current() { return _ptr; }
private:
Node<T> * _ptr;
};
class riterator{
public:
typedef T value_type;
typedef std::forward_iterator_tag iterator_category;
typedef int difference_type;
typedef T* pointer;
typedef T& reference;
riterator(Node<T> * ptr): _ptr(ptr) { }
//Pre-increment
riterator operator++(){ _ptr = _ptr->prev; return *this; }
riterator operator++(int){ riterator tmp = *this; _ptr = _ptr->prev; return tmp; }
reference operator*() { return _ptr->data; }
pointer operator->() { return _ptr->data;}
bool operator==(const riterator& rhs) const { return _ptr == rhs._ptr; }
bool operator!=(const riterator& rhs) const { return _ptr != rhs._ptr; }
Node<T> * current() { return _ptr; }
private:
Node<T> * _ptr;
};
LinkedList(int x =0){
head = tail = 0;
}
bool empty(){
return head == 0;
}
void push_front(const T & data){
if(empty())
{
Node<T> * n = new Node<T>(data);
head = tail = n;
return;
}
Node<T> * n = new Node<T>(data);
head->prev =n;
n->next = head;
head = n;
}
void push_back(const T & data){
if(empty()){
Node<T> * n = new Node<T>(data);
head = tail = n;
return;
}
Node<T> * n = new Node<T>(data);
tail->next = n;
n->prev = tail;
tail = n;
}
void pop_front(){
if(empty())
return;
if(head == tail){
delete head;
head = tail = 0;
}
else {
head = head->next;
delete head->prev;
head->prev = 0;
}
}
void pop_back(){
if(empty())
return;
if(head == tail){
delete tail;
head = tail = 0;
}
else {
tail = tail->prev;
delete tail->next;
tail->next = 0;
}
}
iterator insert(iterator position, const T& val){
Node<T> * n = new Node<T>(val);
Node<T> * current = position.current();
if(current->prev != 0){
current->prev->next = n;
n->prev = current->prev;
}
n->next = current;
current->prev = n;
}
iterator begin(){
iterator begin = head;
return begin;
}
riterator rend(){
riterator end = head->prev;
return end;
}
riterator rbegin(){
riterator begin = tail;
return begin;
}
iterator end(){
if(tail == 0)
return 0;
iterator end = tail->next;
return end;
}
T & front() { return head->el; }
const T & front()const { return head->el; }
T & back() { return tail->el; }
const T & back()const { return tail->el; }
~LinkedList(){
for(Node<T> * ptr; !empty();){
ptr = head->next;
delete head;
head = ptr;
}
}
};
#endif | [
"[email protected]"
] | |
230c7eb7339669d1faee639474dea0c042d8e411 | 085af71cbbdfa3cf5602c344d1f3788d2595bb94 | /src_synthetic/src_Adaptivity/PatternMatcher.cpp | 961ae9add5d061f7ddaee0c241e5e1c3c45a9eb5 | [] | no_license | zbjob/AthenaCEP | ba0406af3f4bb1c79a700da6e30034f171ccdf68 | b04d8b093b60445d6e9dacba22bd84abb56e9a14 | refs/heads/master | 2021-06-30T00:42:01.258214 | 2020-10-06T10:23:31 | 2020-10-06T10:23:31 | 168,676,787 | 3 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 39,540 | cpp | #include "_shared/GlobalClock.h"
#include "PatternMatcher.h"
#include <assert.h>
#include <emmintrin.h>
#include <algorithm>
#include <iostream>
#include <chrono>
#include <ctime>
#include <cstdlib>
#include <string>
#include "Query.h"
#include <time.h>
#include <random>
using namespace std;
using namespace std::chrono;
bool PatternMatcher::loadMonitoringFlag = true;
default_random_engine _m_generator;
uniform_int_distribution<int> _m_distribution(1,100);
PatternMatcher::PatternMatcher()
{
addState(0, 0);
m_States[0].setCount(1);
latencyFlag = false;
Rflag = true;
assert(OP_MAX == 6 && "update s_TestFunc1");
}
PatternMatcher::~PatternMatcher()
{
}
void PatternMatcher::print(){
cout << "print states: =====================" << endl;
for(auto &&s : m_States)
{
if(s.type == ST_ACCEPT)
break;
if(s.ID!=0 )
{
cout << "state ID : " << s.ID << endl;
cout << "KeyAttrIdx siez:" << s.KeyAttrIdx.size() << endl;
cout << "index_attribute : " << s.index_attribute << endl;
cout << "attribute Cnt: " << s.buffers[0][0].size() << endl;
int timesliceIt = 0;
for(auto && T : s.buffers)
{
int clusterIt = 0;
for(auto && C : T)
cout << "------time slice : " << timesliceIt++ << " cluster : " << clusterIt++ << " #PMs : " << C.front().size() << endl;
}
cout << endl;
}
}
cout << "print trasitions ====================== " << endl;
for(auto && t : m_Transitions)
{
cout << "from state : " << t.from << "--- to state: " << t.to << " condditions : ------------" << endl;
for(auto && c : t.conditions)
cout << "------------------------ 1st operandi idx: " << c.param[0] << "--- 2nd operand idx: " << c.param[1] << "--- operator: " << c.op << endl;
cout << endl;
}
cout << "============================================== " << endl;
cout << "============================================== " << endl;
}
void PatternMatcher::printContributions(){
cout << "printContributions " << endl;
for(auto &&s : m_States)
{
if(s.type == ST_ACCEPT)
break;
if(s.ID!=0 )
{
for(auto it : s.contributions)
cout << "State: " << s.ID << it.first << "---" << it.second << endl;
}
}
}
void PatternMatcher::addState(uint32_t _idx, uint32_t _numAttributes, PatternMatcher::StateType _type, uint32_t _kleenePlusAttrIdx)
{
if (_idx >= m_States.size())
m_States.resize(_idx + 1);
State& s = m_States[_idx];
s.ID = _idx;
s.setAttributeCount(_numAttributes);
s.type = _type;
s.kleenePlusAttrIdx = _kleenePlusAttrIdx;
}
void PatternMatcher::addState(uint32_t _idx, int _numTimeSlice, int _numCluser, uint32_t _numAttributes, PatternMatcher::StateType _type, uint32_t _kleenePlusAttrIdx)
{
if (_idx >= m_States.size())
m_States.resize(_idx + 1);
State& s = m_States[_idx];
s.ID = _idx;
s.setTimesliceClusterAttributeCount(_numTimeSlice, _numCluser, _numAttributes);
s.type = _type;
s.kleenePlusAttrIdx = _kleenePlusAttrIdx;
}
void PatternMatcher::setCallback(uint32_t _state, CallbackType _type, const std::function<void(const attr_t*)>& _function)
{
if (_type == CT_INSERT)
{
m_States[_state].callback_insert = _function;
}
else
{
m_States[_state].callback_timeout = _function;
}
}
void PatternMatcher::addAggregation(uint32_t _state, AggregationFunction * _function, uint32_t _srcAttr, uint32_t _dstAttr)
{
Aggregation a;
a.function = _function;
a.srcAttr = _srcAttr;
a.dstAttr = _dstAttr;
m_States[_state].aggregation.push_back(a);
}
void PatternMatcher::addTransition(uint32_t _fromState, uint32_t _toState, uint32_t _eventType)
{
assert(_fromState < m_States.size() && _toState < m_States.size());
Transition t;
t.eventType = _eventType;
t.from = _fromState;
t.to = _toState;
t.updateHandler(m_States[_fromState], m_States[_toState]);
m_Transitions.push_back(t);
}
void PatternMatcher::addPrecondition(uint32_t _param1, attr_t _constant, Operator _op)
{
Condition c;
c.param[0] = _param1;
c.op = _op;
c.constant = _constant;
m_Transitions.back().preconditions.push_back(c);
}
void PatternMatcher::addCondition(uint32_t _op1, uint32_t _op2, Operator _operator, attr_t _constant, bool _postAggregationCheck)
{
Condition c;
c.param[0] = _op1;
c.param[1] = _op2;
c.op = _operator;
c.constant = _constant;
Transition& t = m_Transitions.back();
if (_postAggregationCheck)
t.postconditions.push_back(c);
else
{
if (t.conditions.empty())
{
m_States[t.from].setIndexAttribute(_op1);
}
t.conditions.push_back(c);
}
t.updateHandler(m_States[t.from], m_States[t.to]);
}
void PatternMatcher::addActionCopy(uint32_t _src, uint32_t _dst)
{
CopyAction a;
a.src = _src;
a.dst = _dst;
m_Transitions.back().actions.push_back(a);
}
void PatternMatcher::Transition::testCondition(const Condition& _condition, const State& _state, size_t _runOffset, const attr_t* _attr, std::function<void(int, int, uint32_t)> _callback)
{
const attr_t eventParam = _attr[_condition.param[1]] + _condition.constant;
int timesliceIt = 0;
for(auto&& timeslice: _state.buffers)
{
int clusterIt = 0;
for(auto&& cluster: timeslice)
{
if(_condition.param[2] == 0)
{
const auto* index = _state.indexMap(timesliceIt,clusterIt,_condition.param[0]);
if (index && _condition.op == OP_EQUAL)
{
auto range = index->equal_range(eventParam);
for (auto&& it = range.first; it != range.second; ++it)
{
uint32_t runIdx = (uint32_t)(it->second - _state.firstMatchId[timesliceIt][clusterIt]);
if (runIdx < _state.count[timesliceIt][clusterIt] && runIdx >= _runOffset && _state.runValid(timesliceIt,clusterIt,runIdx))
{
_callback(timesliceIt,clusterIt,runIdx);
}
}
}
else
{
const auto& list = cluster[_condition.param[0]];
for (uint32_t idx = (uint32_t)_runOffset; idx < _state.count[timesliceIt][clusterIt]; ++idx)
{
if (checkCondition(list[idx], eventParam, _condition.op) && _state.runValid(timesliceIt,clusterIt,idx))
{
_callback(timesliceIt,clusterIt,idx);
}
}
}
}
else
{
cout << "[checkCondition] in the three attr, two operator case" << endl;
assert (_condition.op == PatternMatcher::OP_ADD);
const attr_t eventParam3 = _attr[_condition.param[2]] + _condition.constant;
cout << " eventParam3 : " << eventParam3 << endl;
const auto& list = cluster[_condition.param[0]];
const auto& list2 = cluster[_condition.param[1]];
for (uint32_t idx = (uint32_t)_runOffset; idx < _state.count[timesliceIt][clusterIt]; ++idx)
{
if (checkCondition(list[idx]+list2[idx], eventParam3, _condition.op2) && _state.runValid(timesliceIt,clusterIt,idx))
{
_callback(timesliceIt,clusterIt,idx);
}
}
}
clusterIt++;
}
timesliceIt++;
}
}
uint64_t PatternMatcher::clustering_classification_PM_shedding(int _stateID, int _timeSliceID, int _clusterID, double _quota)
{
uint64_t sheddingCnt = m_States[_stateID].buffers[_timeSliceID][_clusterID].front().size();
for(auto && C : m_States[_stateID].buffers[_timeSliceID][_clusterID])
{
C.clear();
}
m_States[_stateID].count[_timeSliceID][_clusterID] = 0;
m_States[_stateID].firstMatchId[_timeSliceID][_clusterID] = 0;
return sheddingCnt;
}
void PatternMatcher::clustering_classification_PM_shedding_4_typeC(int _state, int lowerBound, int upperBound)
{
m_States[_state].TypeClowerBound = lowerBound;
m_States[_state].TypeCupperBound = upperBound;
}
void PatternMatcher::clustering_classification_PM_shedding_selectivity(double ratio)
{
int r = ratio*100;
if(r < 10 && r>3)
{
m_States[1].SelectivityPMDiceUB = r-3;
m_States[2].SelectivityPMDiceUB = r+1;
}
else if(r >= 10)
{
m_States[1].SelectivityPMDiceUB = r-5;
m_States[2].SelectivityPMDiceUB = r+1;
}
}
void PatternMatcher::clustering_classification_PM_shedding_random(int _state, double ratio)
{
m_States[_state].PMDiceUB = ratio*100;
}
void PatternMatcher::clustering_classification_PM_shedding_semantic(double _ratio)
{
m_States[2].PMSmDropRatio = int(_ratio*100);
m_States[1].PMSmDropRatio = int(_ratio*100);
}
void PatternMatcher::clustering_classification_PM_shedding_semantic_setPMSheddingCombo(int _combo)
{
m_States[1].PMSheddingCombo = _combo;
m_States[2].PMSheddingCombo = _combo;
}
uint64_t PatternMatcher::clustering_classification_PM_random_shedding(uint64_t _quota)
{
cout << "[clustering_classification_PM_random_shedding] " << endl;
int clusterCnt = 0;
for(auto && S : m_States)
{
if(S.ID == 0)
continue;
if(S.type == ST_ACCEPT)
break;
for(auto && T : S.buffers)
clusterCnt += T.size();
}
cout << "[clustering_classification_PM_random_shedding] clusterCnt" << clusterCnt << endl;
uint64_t perQuota = _quota/clusterCnt;
cout << "[clustering_classification_PM_random_shedding] perQuota" << perQuota << endl;
int64_t sheddingGapCnt = 0;
uint64_t sheddingCnt = 0;
for(int stateIt = 1; stateIt < m_States.size(); ++stateIt)
{
if(m_States[stateIt].type == ST_ACCEPT)
break;
for(int timesliceIt = 0; timesliceIt < m_States[stateIt].buffers.size(); ++timesliceIt)
for(int clusterIt = 0; clusterIt < m_States[stateIt].buffers[timesliceIt].size(); ++clusterIt)
{
uint64_t cnt = clustering_classification_PM_random_shedding(stateIt, timesliceIt, clusterIt, perQuota+sheddingGapCnt);
sheddingGapCnt = perQuota - cnt;
sheddingCnt += cnt;
}
}
return sheddingCnt;
}
uint64_t PatternMatcher::clustering_classification_PM_random_shedding(int _stateID, int _timeSliceID, int _clusterID, uint64_t _quota)
{
uint64_t sheddingCnt = 0;
srand(time(NULL));
uint64_t sheddingEnd = m_States[_stateID].buffers[_timeSliceID][_clusterID].front().size();
for(int cnt=0; cnt < sheddingEnd; ++cnt)
{
uint64_t ran = rand() % (sheddingEnd -1);
if(m_States[_stateID].buffers[_timeSliceID][_clusterID].front()[ran] > 0)
{
m_States[_stateID].buffers[_timeSliceID][_clusterID].front()[ran] = 0;
sheddingCnt++;
}
if(sheddingCnt > _quota)
break;
}
return sheddingCnt;
}
void PatternMatcher::computeScores4LoadShedding()
{
double a = 1;
double b = 0.5;
double c = 3;
for(auto && it : this->m_States)
{
if(it.type == ST_ACCEPT)
break;
if(it.ID == 0)
continue;
it.scoreTable.clear();
it.scoreTable.reserve(1024);
for(auto && iterConsumption : it.consumptions)
{
auto iter = it.contributions.find(iterConsumption.first);
if(iter != it.contributions.end())
{
it.scoreTable.push_back(make_pair(iterConsumption.first, 2048*iter->second - iterConsumption.second));
}
else
{
it.scoreTable.push_back(make_pair(iterConsumption.first, 0 - iterConsumption.second));
}
sort(it.scoreTable.begin(), it.scoreTable.end(), [](const pair<attr_t,double> & lhs, const pair<attr_t, double> &rhs) {
return lhs.second < rhs.second;
});
}
}
}
void PatternMatcher::computeScores4LoadShedding_VLDB16()
{
for(auto && it : this->m_States)
{
if(it.type == ST_ACCEPT)
break;
if(it.ID == 0)
continue;
it.scoreTable_VLDB16.clear();
it.scoreTable_VLDB16.reserve(1024);
for(auto && iter : it.contributions)
{
it.scoreTable_VLDB16.push_back(make_pair(iter.first, iter.second));
}
sort(it.scoreTable_VLDB16.begin(), it.scoreTable_VLDB16.end(), [](const pair<attr_t,uint64_t> & lhs, const pair<attr_t, uint64_t> &rhs) {
return lhs.second < rhs.second;
});
}
}
uint64_t PatternMatcher::loadShedding_VLDB16(uint64_t quota, int _state1, int _state2)
{
long long sheddingCnt = quota;
long long sheddingTargetCnt = sheddingCnt;
computeScores4LoadShedding_VLDB16();
auto iter1 = m_States[_state1].scoreTable_VLDB16.begin();
auto iter2 = m_States[_state2].scoreTable_VLDB16.begin();
for(; iter1 != m_States[_state1].scoreTable_VLDB16.end() && iter2 != m_States[_state2].scoreTable_VLDB16.end() && sheddingCnt > 0; ++iter1, ++iter2)
{
uint64_t sheddingKey = iter1->first;
if(iter1->second > iter2->second)
{
sheddingKey = iter2->first;
for(int timesliceIt=0; timesliceIt < m_States[_state2].buffers.size(); ++timesliceIt)
for(int clusterIt =0; clusterIt < m_States[_state2].buffers.front().size(); ++clusterIt)
{
auto range = m_States[_state2].KeyAttributeIndex[timesliceIt][clusterIt].equal_range(sheddingKey);
for (auto it = range.first; it != range.second; ++it)
{
uint64_t _firstMatchID = m_States[_state2].firstMatchId[timesliceIt][clusterIt];
uint64_t _size = m_States[_state2].buffers[timesliceIt][clusterIt].front().size();
if (it->second > _firstMatchID && it->second - _firstMatchID < _size)
{
uint64_t _idx = it->second - _firstMatchID;
if(m_States[_state2].buffers[timesliceIt][clusterIt].front()[_idx])
{
m_States[_state2].buffers[timesliceIt][clusterIt].front()[_idx] = 0;
--sheddingCnt;
}
}
}
}
}
else if(iter1->second < iter2->second)
{
sheddingKey = iter1->first;
for(int timesliceIt=0; timesliceIt < m_States[_state1].buffers.size(); ++timesliceIt)
for(int clusterIt =0; clusterIt < m_States[_state1].buffers.front().size(); ++clusterIt)
{
auto range = m_States[_state1].KeyAttributeIndex[timesliceIt][clusterIt].equal_range(sheddingKey);
for (auto it = range.first; it != range.second; ++it)
{
uint64_t _firstMatchID = m_States[_state1].firstMatchId[timesliceIt][clusterIt];
uint64_t _size = m_States[_state1].buffers[timesliceIt][clusterIt].front().size();
if (it->second >= _firstMatchID && it->second - _firstMatchID < _size)
{
uint64_t _idx = it->second - _firstMatchID;
if(m_States[_state1].buffers[timesliceIt][clusterIt].front()[_idx])
{
m_States[_state1].buffers[timesliceIt][clusterIt].front()[_idx] = 0;
--sheddingCnt;
}
}
}
}
}
}
int _sheddingState = _state1;
auto iter = iter1;
if(iter1 == m_States[_state1].scoreTable_VLDB16.end())
{
iter = iter2;
_sheddingState = _state2;
}
for(; iter != m_States[_sheddingState].scoreTable_VLDB16.end() && sheddingCnt > 0; ++iter)
{
uint64_t sheddingKey = iter->first;
for(int timesliceIt=0; timesliceIt < m_States[_sheddingState].buffers.size(); ++timesliceIt)
for(int clusterIt =0; clusterIt < m_States[_sheddingState].buffers.front().size(); ++clusterIt)
{
auto range = m_States[_sheddingState].KeyAttributeIndex[timesliceIt][clusterIt].equal_range(sheddingKey);
for (auto it = range.first; it != range.second; ++it)
{
uint64_t _firstMatchID = m_States[_sheddingState].firstMatchId[timesliceIt][clusterIt];
uint64_t _size = m_States[_sheddingState].buffers[timesliceIt][clusterIt].front().size();
if (it->second >= _firstMatchID && it->second - _firstMatchID < _size)
{
uint64_t _idx = it->second - _firstMatchID;
if(m_States[_sheddingState].buffers[timesliceIt][clusterIt].front()[_idx])
{
m_States[_sheddingState].buffers[timesliceIt][clusterIt].front()[_idx] = 0;
--sheddingCnt;
}
}
}
}
}
return sheddingTargetCnt - sheddingCnt;
}
uint32_t PatternMatcher::event(uint32_t _typeId, const attr_t* _attributes)
{
uint32_t matchCount = 0;
if(_attributes[0] >= m_Timeout)
for (State& state : m_States)
{
state.removeTimeouts(_attributes[0] - m_Timeout);
}
for (Transition& t : m_Transitions)
{
if (t.eventType != _typeId)
continue;
matchCount += t.checkEvent(m_States[t.from], m_States[t.to], 0, _attributes);
}
for (State& state : m_States)
state.endTransaction();
return matchCount;
}
void PatternMatcher::clearState(uint32_t _stateId)
{
m_States[_stateId].setCount(_stateId == 0 ? 1 : 0);
}
const PatternMatcher::OperatorInfo & PatternMatcher::operatorInfo(PatternMatcher::Operator _op)
{
static OperatorInfo info[OP_MAX] = {
{ "less", "<" },
{ "lessequal", "<=" },
{ "greater", ">" },
{ "greaterequal", ">=" },
{ "equal", "==" },
{ "notequal", "!=" }
};
return info[_op];
}
void PatternMatcher::addClusterTag(int stateID, int tsID, int clusterID, long double contribution, long double consumption)
{
m_ClusterTags.push_back(ClusterTag(stateID, tsID, clusterID, contribution, consumption));
}
void PatternMatcher::resetRuns()
{
for (uint32_t i = 0; i < m_States.size(); ++i)
{
clearState(i);
}
}
PatternMatcher::State::State() :
type(ST_NORMAL), kleenePlusAttrIdx(0), index_attribute(0), /*firstMatchId(0), KeyAttrIdx(0),*/ accNum(0), transNum(0),stateBufferCount(0)
{
for(int i=0; i<21; ++i)
PMKeepingBook[i] = false;
}
PatternMatcher::State::~State()
{
}
void PatternMatcher::State::setCount(uint32_t _count)
{
for(auto&& itTime:buffers)
for(auto&& itCluster:itTime)
for(auto&& itAttr: itCluster)
itAttr.resize(_count);
}
void PatternMatcher::State::setAttributeCount(uint32_t _count)
{
for(auto&& itTime:buffers)
for(auto&& itCluster:itTime)
for(auto&& itAttr: itCluster)
itAttr.resize(_count);
}
uint64_t PatternMatcher::approximate_BKP_PMshedding(double LOF)
{
cout << "[PatternMatcher::approximate_BKP_PMshedding] called" << endl;
++m_CntCall_AppKNP_solver;
uint64_t sheddingCnt = 0;
uint64_t totalConsumption = 0;
uint64_t sheddingConsumption = 0;
bool sheddingFlag = true;
if(!m_ClusterTags_sorted)
sortClusterTag();
for(auto && tag: m_ClusterTags)
{
tag.size = m_States[tag.stateID].buffers[tag.timeSliceID][tag.clusterID].front().size();
tag.TotalConsumption = tag.consumption*tag.size;
totalConsumption += tag.TotalConsumption;
}
sheddingConsumption = totalConsumption * LOF ;
for(auto && tag: m_ClusterTags)
{
if(!sheddingFlag)
break;
if(sheddingConsumption > tag.TotalConsumption)
{
cout << "[PatternMatcher::approximate_BKP_PMshedding] flag 1" << endl;
sheddingCnt += clustering_classification_PM_shedding(tag.stateID, tag.timeSliceID, tag.clusterID);
sheddingConsumption -= tag.TotalConsumption;
}
else
{
sheddingFlag = false;
uint64_t sheddingQuota = sheddingConsumption / tag.consumption + 1;
if(sheddingQuota > m_States[tag.stateID].buffers[tag.timeSliceID][tag.clusterID].front().size())
sheddingQuota = m_States[tag.stateID].buffers[tag.timeSliceID][tag.clusterID].front().size();
for(auto && attrDeque : m_States[tag.stateID].buffers[tag.timeSliceID][tag.clusterID])
attrDeque.erase(attrDeque.begin(), attrDeque.begin()+sheddingQuota);
sheddingCnt += sheddingQuota;
}
}
return sheddingCnt;
}
void PatternMatcher::sortClusterTag()
{
std::sort(m_ClusterTags.begin(), m_ClusterTags.end(), [](const ClusterTag & lhs, const ClusterTag & rhs){
return lhs.ccRatio < rhs.ccRatio;
});
}
void PatternMatcher::State::setTimesliceClusterAttributeCount(int t, int c, int _count)
{
assert(stateBufferCount== 0);
numTimeSlice = t;
buffers.resize(t);
for(int i=0; i<t;++i)
{
buffers[i].resize(c);
for(int j=0; j<c; ++j)
buffers[i][j].resize(_count);
}
count.resize(t);
for(int i=0; i<t; ++i)
count[i].resize(c);
index.resize(t);
for(int i=0; i<t; ++i)
index[i].resize(c);
KeyAttributeIndex.resize(t);
for(int i=0; i<t; ++i)
KeyAttributeIndex[i].resize(c);
firstMatchId.resize(t);
for(int i=0; i<t; ++i)
firstMatchId[i].resize(c);
}
void PatternMatcher::State::setIndexAttribute(uint32_t _idx)
{
index_attribute = _idx;
}
void PatternMatcher::State::insert(const attr_t * _attributes)
{
auto start = std::chrono::high_resolution_clock::now();
if(callback_insert)
callback_insert(_attributes);
if(type==ST_ACCEPT)
{
return;
}
int _timeslice = 0;
int clusterID = 0;
if(TypeClowerBound != 0)
{
if(ID == 2)
{
if(_attributes[1]+_attributes[4] >= TypeClowerBound && _attributes[1]+_attributes[4] <= TypeCupperBound )
clusterID = 0;
else
{
return;
}
}
else if(ID == 1)
{
if(_attributes[1] >= TypeClowerBound && _attributes[1] <= TypeCupperBound)
clusterID = 0;
else
{
return;
}
}
}
if(ID ==2 &&( PMSheddingCombo ==2 || PMSheddingCombo==3))
{
int PMAB = _attributes[1] + _attributes[4];
if(PMSheddingCombo ==2 &&PMKeepingBook[PMAB] == false)
{
++NumShedPartialMatch;
return;
}
else if(PMSheddingCombo ==3 && PMKeepingBook2[PMAB] == false)
{
++NumShedPartialMatch;
return;
}
}
int PMDice_roll = _m_distribution(_m_generator);
if(PMDice_roll < PMDiceUB)
{
++NumShedPartialMatch;
return;
}
if(PMDice_roll < SelectivityPMDiceUB)
{
++NumShedPartialMatch;
return;
}
const attr_t* src_it = _attributes;
for (auto& it : buffers[_timeslice][clusterID])
it.push_back(*src_it++);
if (index_attribute)
{
const uint64_t matchId = firstMatchId[_timeslice][clusterID] + buffers[_timeslice][clusterID][0].size() - 1;
index[_timeslice][clusterID].insert(make_pair(_attributes[index_attribute], matchId));
}
if (!buffers[_timeslice][clusterID].empty())
count[_timeslice][clusterID]++;
++NumPartialMatch;
}
void PatternMatcher::State::endTransaction()
{
static_assert(std::numeric_limits<attr_t>::min() < 0, "invalid attr_t type");
if (!buffers.empty())
{
for(auto idx : remove_list)
buffers[idx.timesliceID][idx.clusterID].front()[idx.bufferID] = std::numeric_limits<attr_t>::min();
}
else
{
}
remove_list.clear();
}
template<typename T> auto begin(const std::pair<T, T>& _obj) { return _obj.first; }
template<typename T> auto end(const std::pair<T, T>& _obj) { return _obj.second; }
void PatternMatcher::State::removeTimeouts(attr_t _value)
{
if(buffers.empty())
return ;
int timesliceIt = 0;
for( auto&& timeslice:buffers){
int clusterIt = 0;
for (auto&& attr: timeslice){
if (attr.empty())
return;
while (!attr.front().empty() && attr.front().front() < _value)
{
if (index_attribute)
{
auto range = index[timesliceIt][clusterIt].equal_range(attr[index_attribute].front());
for (auto it = range.first; it != range.second; ++it)
{
if (it->second >= firstMatchId[timesliceIt][clusterIt])
{
index[timesliceIt][clusterIt].erase(it);
break;
}
}
}
if (!KeyAttrIdx.empty())
{
assert(KeyAttrIdx.size() <= 2);
if(KeyAttrIdx.size() == 1)
{
auto range = KeyAttributeIndex[timesliceIt][clusterIt].equal_range(attr[KeyAttrIdx[0]].front());
for (auto it = range.first; it != range.second; ++it)
{
if (it->second >= firstMatchId[timesliceIt][clusterIt])
{
KeyAttributeIndex[timesliceIt][clusterIt].erase(it);
break;
}
}
}
else if(KeyAttrIdx.size() == 2)
{
auto range = KeyAttributeIndex[timesliceIt][clusterIt].equal_range( pack(attr[KeyAttrIdx[0]].front(), attr[KeyAttrIdx[1]].front()) );
for (auto it = range.first; it != range.second; ++it)
{
if (it->second >= firstMatchId[timesliceIt][clusterIt])
{
KeyAttributeIndex[timesliceIt][clusterIt].erase(it);
break;
}
}
}
}
if(PatternMatcher::MonitoringLoad() == true)
{
for(auto&& it : *states)
{
if(it.ID > this->ID || it.KeyAttrIdx.empty())
{
continue;
}
if(KeyAttrIdx.size() == 1)
it.consumptions[attr[it.KeyAttrIdx[0]].front()] += 1;
else if(KeyAttrIdx.size() == 2)
it.consumptions[ pack(attr[it.KeyAttrIdx[0]].front(), attr[it.KeyAttrIdx[1]].front() ) ] += 1;
}
}
for (auto&& it : attr)
{
it.pop_front();
}
firstMatchId[timesliceIt][clusterIt]++;
count[timesliceIt][clusterIt]--;
}
++clusterIt;
}
++timesliceIt;
}
timeout = _value;
}
void PatternMatcher::State::attributes(int _timeslice, int _cluster, uint32_t _idx, attr_t * _out) const
{
for (const auto& it : buffers[_timeslice][_cluster])
*_out++ = it[_idx];
}
void PatternMatcher::Transition::updateHandler(const State& _from, const State& _to)
{
switch (conditions.size())
{
case 0:
checkForMatch = &Transition::checkNoCondition;
break;
case 1:
checkForMatch = &Transition::checkSingleCondition;
break;
default:
checkForMatch = &Transition::checkMultipleCondotions;
break;
}
if (_to.type == ST_REJECT)
{
executeMatch = &Transition::executeReject;
}
else
{
executeMatch = &Transition::executeTransition;
}
if (_from.kleenePlusAttrIdx && _to.type != ST_REJECT)
{
executeMatchOrg = executeMatch;
checkForMatchOrg = checkForMatch;
executeMatch = &Transition::executeKleene;
checkForMatch = &Transition::checkKleene;
}
}
void PatternMatcher::Transition::setCustomExecuteHandler(std::function<void(State&, State&, int, int, uint32_t, const attr_t*)> _handler)
{
m_CustomExecuteHandler = move(_handler);
executeMatch = &Transition::executeCustom;
}
uint32_t PatternMatcher::Transition::checkEvent(State & _from, State & _to, size_t _runOffset, const attr_t * _attr)
{
for (auto pc : preconditions)
{
if (!checkCondition(_attr[pc.param[0]], pc.constant, pc.op))
return 0;
}
return (this->*checkForMatch)(_from, _to, _runOffset, _attr);
}
void PatternMatcher::Transition::updateContribution(State& _from, State& _to, uint32_t idx, attr_t valFrom, attr_t valTo, attr_t* _attributes)
{
if (_from.ID == 0)
return;
_from.transNum++;
if(_to.type == ST_ACCEPT)
{
if(!this->states)
{
cout << "states == " << this->states << endl;
return;
}
for(auto&& it : *states )
{
if(it.type == ST_ACCEPT)
break;
if(!it.KeyAttrIdx.empty() )
{
if(it.KeyAttrIdx.size() == 1)
it.contributions[_attributes[it.KeyAttrIdx[0]]] += 1;
else if(it.KeyAttrIdx.size() == 2)
it.contributions[ pack(_attributes[it.KeyAttrIdx[0]], _attributes[it.KeyAttrIdx[1]]) ] += 1;
}
}
}
}
void PatternMatcher::setStates2Transitions()
{
for(auto && it: m_Transitions)
{
it.states = &m_States;
}
}
void PatternMatcher::setStates2States()
{
for(auto && it : m_States)
{
it.states = &m_States;
}
}
void PatternMatcher::setTimeSliceSpan(uint64_t _timewindow)
{
for(auto&& s : m_States)
s.setTimeSliceSpan(_timewindow);
}
void PatternMatcher::Transition::executeTransition(State & _from, State & _to, int timeslice, int cluster, uint32_t _idx, const attr_t* _attributes)
{
attr_t attributes[MAX_ATTRIBUTES];
for (uint32_t a = 0; a < _from.buffers[timeslice][cluster].size(); ++a)
{
attributes[a] = _from.buffers[timeslice][cluster][a][_idx];
}
for (auto it : actions)
{
attributes[it.dst] = _attributes[(int32_t)it.src];
}
if(_to.type == ST_ACCEPT)
{
++NumFullMatch;
attributes[Query::DA_FULL_MATCH_TIME] = (uint64_t)duration_cast<microseconds>(high_resolution_clock::now() - g_BeginClock).count();
attributes[Query::DA_CURRENT_TIME] = _attributes[Query::DA_CURRENT_TIME];
}
_to.insert(attributes);
if(PatternMatcher::MonitoringLoad() == true && _from.ID!=0 && _to.type == ST_ACCEPT)
{
updateContribution(_from, _to, _idx, attributes[_from.KeyAttrIdx[0]], attributes[_from.KeyAttrIdx[0]], attributes);
}
}
void PatternMatcher::Transition::executeReject(State & _from, State & _to, int timesliceId, int clusterId, uint32_t _idx, const attr_t * _attributes)
{
_from.remove(timesliceId, clusterId, _idx);
}
void PatternMatcher::Transition::executeCustom(State & _from, State & _to, int timesliceId, int clusterId, uint32_t _idx, const attr_t * _attributes)
{
m_CustomExecuteHandler(_from, _to, timesliceId, clusterId, _idx, _attributes);
}
uint32_t PatternMatcher::Transition::checkNoCondition(State & _from, State & _to, size_t _runOffset, const attr_t * _eventAttr)
{
uint32_t counter = 0;
int timesliceId = 0;
for(auto timesliceIt:_from.buffers)
{
int clusterId = 0;
for(auto clusterIt:timesliceIt)
{
for (uint32_t i = (uint32_t)_runOffset; i < _from.count[timesliceId][clusterId]; ++i)
{
if (_from.runValid(timesliceId,clusterId,i))
{
(this->*executeMatch)(_from, _to, timesliceId, clusterId, i, _eventAttr);
counter++;
}
}
++clusterId;
}
++timesliceId;
}
return counter;
}
uint32_t PatternMatcher::Transition::checkSingleCondition(State & _from, State & _to, size_t _runOffset, const attr_t * _eventAttr)
{
uint32_t counter = 0;
const Condition& c = conditions.front();
testCondition(c, _from, _runOffset, _eventAttr, [&](int _timeslice, int _cluster, uint32_t _idx) {
(this->*executeMatch)(_from, _to, _timeslice, _cluster, _idx, _eventAttr);
counter++;
});
return counter;
}
uint32_t PatternMatcher::Transition::checkMultipleCondotions(State & _from, State & _to, size_t _runOffset, const attr_t * _eventAttr)
{
uint32_t counter = 0;
const Condition& c = conditions.front();
testCondition(c, _from, _runOffset, _eventAttr, [&](int _timeslice, int _cluster, uint32_t _idx) {
bool valid = true;
for (size_t i = 1; i < conditions.size(); ++i)
{
const Condition& c = conditions[i];
const attr_t runParam = _from.buffers[_timeslice][_cluster][c.param[0]][_idx];
const attr_t eventParam = _eventAttr[c.param[1]] + c.constant;
if(c.param[2] != 0)
{
assert(c.op == PatternMatcher::OP_ADD);
const attr_t runParam1 = _from.buffers[_timeslice][_cluster][c.param[1]][_idx] + runParam;
const attr_t eventParam1 = _eventAttr[c.param[2]] + c.constant;
if(!checkCondition(runParam1, eventParam1, c.op2))
{
valid = false;
break;
}
}
else
{
if(!checkCondition(runParam, eventParam, c.op))
{
valid = false;
break;
}
}
}
if(valid)
{
(this->*executeMatch)(_from, _to, _timeslice, _cluster, _idx, _eventAttr);
counter++;
}
});
return counter;
}
static attr_t aggregat_avg(const vector<attr_t>& _attr)
{
attr_t sum = 0;
for (attr_t i : _attr)
sum += i;
return sum / _attr.size();
}
uint32_t PatternMatcher::Transition::checkKleene(State & _from, State & _to, size_t _runOffset, const attr_t * _eventAttr)
{
(this->*checkForMatchOrg)(_from, _to, _runOffset, _eventAttr);
uint32_t counter = 0;
const function<void(runs_t::const_iterator, runs_t::const_iterator)> func = [&](runs_t::const_iterator _top, runs_t::const_iterator _topend)
{
for (auto& a : _from.aggregation)
{
attr_t runAttr = _from.buffers[_top->_timeslice][_top->_cluster][a.srcAttr][_top->_idx];
(attr_t&)_eventAttr[a.dstAttr] = a.function->push(runAttr);
}
bool predicateOk = true;
for (const auto & c : postconditions)
predicateOk &= checkCondition(_eventAttr[c.param[0]], _eventAttr[c.param[1]] + c.constant, c.op);
if (predicateOk)
{
(this->*executeMatchOrg)(_from, _to, _top->_timeslice, _top->_cluster, _top->_idx, _eventAttr);
counter++;
}
for (runs_t::const_iterator it = _top + 1; it <= _topend; ++it)
func(it, _topend);
for (auto& a : _from.aggregation)
a.function->pop( _from.buffers[_top->_timeslice][_top->_cluster][a.srcAttr][_top->_idx]);
};
if (!runs.empty())
{
if(run_range.back().second != runs.size()-1)
run_range.push_back(make_pair(run_range.back().second+1, runs.size()-1));
if (runs.size() > 20)
fprintf(stderr, "warning: aggregation over %u runs...", (unsigned)runs.size());
for (auto& a : _from.aggregation)
a.function->clear();
for(auto &&it : run_range)
{
if(it.second-it.first > 20)
fprintf(stderr,"warning: real aggregation is over %u runs..", (unsigned)(it.second-it.first));
func(runs.begin()+it.first, runs.begin()+it.second);
if(it.second-it.first > 20)
fprintf(stderr,"done\n");
}
if (runs.size() > 20)
fprintf(stderr, "done\n");
runs.clear();
run_range.clear();
}
return counter;
}
void PatternMatcher::Transition::executeKleene(State & _from, State & _to, int _timeslice, int _cluster, uint32_t _idx, const attr_t * _attributes)
{
if(_from.Kleene_lastTimeStamp != _from.buffers[_timeslice][_cluster][_from.Kleene_LastStateTimeStampIdx][_idx])
{
run_range.push_back(make_pair(run_lastPos, runs.size()-1));
run_lastPos = runs.size();
_from.Kleene_lastTimeStamp = _from.buffers[_timeslice][_cluster][_from.Kleene_LastStateTimeStampIdx][_idx];
}
runs.push_back(runs_element(_timeslice, _cluster, _idx, _from.buffers[_timeslice][_cluster][_from.kleenePlusAttrIdx][_idx]));
}
| [
"[email protected]"
] | |
895541c1df1de79d69d079f7d7739563c0bfd4cf | 3054ded5d75ec90aac29ca5d601e726cf835f76c | /Training/URI/Mathematics/1989 - Doing Nothing.cpp | 3ff9bd9b1ad18f12f8d1f2aa6561e6ffbf1ad535 | [] | no_license | Yefri97/Competitive-Programming | ef8c5806881bee797deeb2ef12416eee83c03add | 2b267ded55d94c819e720281805fb75696bed311 | refs/heads/master | 2022-11-09T20:19:00.983516 | 2022-04-29T21:29:45 | 2022-04-29T21:29:45 | 60,136,956 | 10 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 389 | cpp | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX_N = 1e5;
int main() {
ll arr[MAX_N + 10]; arr[0] = 0;
ll n, m;
while (cin >> n >> m && n != -1 & m != -1) {
for (int i = 1; i <= n; i++) {
ll x; cin >> x;
arr[i] = x * m + arr[i - 1];
}
ll ans = accumulate(arr, arr + n + 1, arr[0]);
cout << ans << endl;
}
return 0;
} | [
"[email protected]"
] | |
accf97048275c41d1ce4476bfe9592a9fb928245 | b991b3822572e13c1a0e17f037564326d4932ff6 | /find-the-index-of-the-first-occurrence-in-a-string/Wrong Answer/3-1-2020, 8_21_00 PM/Solution.cpp | 8b80c7b3fb9423b5ccdce1e031f1ecfca5ddcd5a | [] | no_license | isaigm/leetcode | 8f1188a824e78f11b8223302fe625e9a8bf9262a | e53b04a9f627ff95aaae9f8e5315f5f688c6b9e2 | refs/heads/master | 2023-01-06T02:07:41.118942 | 2022-12-31T23:13:20 | 2022-12-31T23:13:20 | 248,679,884 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 518 | cpp | // https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string
class Solution {
public:
int strStr(std::string haystack, std::string needle) {
if(!haystack.compare(needle)) return 0;
if (haystack.length() >= needle.length())
{
int len = needle.length();
for (int i = 0; i < haystack.length() - len; i++)
{
auto substr = haystack.substr(i, len);
if(!substr.compare(needle)) return i;
}
}
return -1;
}
}; | [
"[email protected]"
] |
Subsets and Splits